- fpbg can be reflexive (example given)

[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 454eaa167d7402a5ef70f78db43c174603f3ef36..58ecd1200a6a788ebbb64d653aeebcea531c7d22 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,17 +12,13 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "basic_2/computation/fpbu_lift.ma".
+include "basic_2/reduction/fpbu_lift.ma".
 include "basic_2/computation/fpbg.ma".
 
-(* GENERAL "BIG TREE" PARALLEL COMPUTATION FOR CLOSURES *********************)
+(* "QRST" PARALLEL COMPUTATION FOR CLOSURES *********************************)
 
 (* Advanced properties ******************************************************)
 
-lemma lstas_fpbg: ∀h,g,G,L,T1,T2,l2. ⦃G, L⦄ ⊢ T1 •*[h, l2] T2 → (T1 = T2 → ⊥) →
-                  ∀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, lstas_fpbu/ qed.
-
 lemma sta_fpbg: ∀h,g,G,L,T1,T2,l. ⦃G, L⦄ ⊢ T1 ▪[h, g] l+1 →
                 ⦃G, L⦄ ⊢ T1 •*[h, 1] T2 → ⦃G, L, T1⦄ >≡[h, g] ⦃G, L, T2⦄.
-/4 width=2 by fpbc_fpbg, fpbu_fpbc, sta_fpbu/ qed.
+/4 width=2 by fpbu_fpbg, sta_fpbu/ qed.