- "big tree" theorem is now proved up to some conjectures involving

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

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/fpbg_lift.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/fpbg_lift.ma
index 26dec0777a7b6976f440c6481a3d4312e00317a9..4dd9afb7384ba582fb2736688991378c67dc4512 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/fpbg_lift.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/fpbg_lift.ma
@@ -12,7 +12,7 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "basic_2/computation/fpbc_lift.ma".
+include "basic_2/computation/fpbu_lift.ma".
 include "basic_2/computation/fpbg.ma".
 
 (* GENERAL "BIG TREE" PARALLEL COMPUTATION FOR CLOSURES *********************)
@@ -20,9 +20,9 @@ include "basic_2/computation/fpbg.ma".
 (* Advanced properties ******************************************************)
 
 lemma lsstas_fpbg: ∀h,g,G,L,T1,T2,l2. ⦃G, L⦄ ⊢ T1 •*[h, g, l2] T2 → (T1 = T2 → ⊥) →
-                   ∀l1. l2 ≤ l1 → ⦃G, L⦄ ⊢ T1 ▪[h, g] l1 → ⦃G, L, T1⦄ >[h, g] ⦃G, L, T2⦄.
-/4 width=5 by fpbc_fpbg, lsstas_fpbc/ qed.
+                   ∀l1. l2 ≤ l1 → ⦃G, L⦄ ⊢ T1 ▪[h, g] l1 → ⦃G, L, T1⦄ >⋕[h, g] ⦃G, L, T2⦄.
+/5 width=5 by fpbc_fpbg, fpbu_fpbc, lsstas_fpbu/ qed.
 
 lemma ssta_fpbg: ∀h,g,G,L,T1,T2,l. ⦃G, L⦄ ⊢ T1 ▪[h, g] l+1 →
-                 ⦃G, L⦄ ⊢ T1 •[h, g] T2 → ⦃G, L, T1⦄ >[h, g] ⦃G, L, T2⦄.
-/3 width=2 by fpbc_fpbg, ssta_fpbc/ qed.
+                 ⦃G, L⦄ ⊢ T1 •[h, g] T2 → ⦃G, L, T1⦄ >⋕[h, g] ⦃G, L, T2⦄.
+/4 width=2 by fpbc_fpbg, fpbu_fpbc, ssta_fpbu/ qed.