- big-tree reduction is now based on extended reduction

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / computation / fpbs_lift.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/fpbs_lift.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/fpbs_lift.ma
index 809bd3358cbe14bcf0186ec8f226f105d9ac2da6..19136df6f849e37968224da0f7a5c79ebcbdbb09 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/fpbs_lift.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/fpbs_lift.ma
@@ -13,12 +13,18 @@
 (**************************************************************************)
 
 include "basic_2/unfold/lsstas_lift.ma".
+include "basic_2/reduction/fpb_lift.ma".
 include "basic_2/computation/fpbs.ma".
 
 (* "BIG TREE" PARALLEL COMPUTATION FOR CLOSURES *****************************)
 
 (* Advanced properties ******************************************************)
 
+lemma ssta_fpbs: ∀h,g,G,L,T,U,l.
+                 ⦃G, L⦄ ⊢ T ▪[h, g] l+1 → ⦃G, L⦄ ⊢ T •[h, g] U →
+                 ⦃G, L, T⦄ ≥[h, g] ⦃G, L, U⦄.
+/3 width=2 by fpb_fpbs, ssta_fpb/ qed.
+
 lemma lsstas_fpbs: ∀h,g,G,L,T1,T2,l2. ⦃G, L⦄ ⊢ T1 •*[h, g, l2] T2 →
                    ∀l1. l2 ≤ l1 → ⦃G, L⦄ ⊢ T1 ▪[h, g] l1 → ⦃G, L, T1⦄ ≥[h, g] ⦃G, L, T2⦄.
 #h #g #G #L #T1 #T2 #l2 #H @(lsstas_ind_dx … H) -l2 -T2 //
@@ -26,5 +32,5 @@ lemma lsstas_fpbs: ∀h,g,G,L,T1,T2,l2. ⦃G, L⦄ ⊢ T1 •*[h, g, l2] T2 →
 elim (le_inv_plus_l … Hl21) -Hl21 #Hl12 #Hl21
 lapply (lsstas_da_conf … HT1 … Hl1) -HT1
 >(plus_minus_m_m … Hl12) -Hl12
-/3 width=5 by fpb_ssta, fpbs_strap1/
+/3 width=5 by ssta_fpb, fpbs_strap1/
 qed.