universary milestone in basic_2

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

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/fsb.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/fsb.ma
index 6aef8f2bdea1e03fd1aa6f8a4869dc8a86f05df2..c27ffaba51ed72e39b7c6c81e978131eaa6685e4 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/fsb.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/fsb.ma
@@ -13,35 +13,35 @@
 (**************************************************************************)
 
 include "basic_2/notation/relations/btsn_5.ma".
-include "basic_2/computation/fpbu.ma".
-include "basic_2/computation/csx_alt.ma".
+include "basic_2/reduction/fpb.ma".
+include "basic_2/computation/csx.ma".
 
-(* "BIG TREE" STRONGLY NORMALIZING TERMS ************************************)
+(* "QRST" STRONGLY NORMALIZING CLOSURES *************************************)
 
-inductive fsb (h) (g): relation3 genv lenv term ≝
+inductive fsb (h) (o): relation3 genv lenv term ≝
 | fsb_intro: ∀G1,L1,T1. (
-                ∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ → fsb h g G2 L2 T2
-             ) → fsb h g G1 L1 T1
+                ∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, o] ⦃G2, L2, T2⦄ → fsb h o G2 L2 T2
+             ) → fsb h o G1 L1 T1
 .
 
 interpretation
-   "'big tree' strong normalization (closure)"
-   'BTSN h g G L T = (fsb h g G L T).
+   "'qrst' strong normalization (closure)"
+   'BTSN h o G L T = (fsb h o G L T).
 
 (* Basic eliminators ********************************************************)
 
-lemma fsb_ind_alt: ∀h,g. ∀R: relation3 …. (
-                      â\88\80G1,L1,T1. â¦\83G1, L1â¦\84 â\8a¢ ⦥[h,g] T1 → (
-                         ∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ → R G2 L2 T2
+lemma fsb_ind_alt: ∀h,o. ∀R: relation3 …. (
+                      â\88\80G1,L1,T1. ⦥[h,o] â¦\83G1, L1, T1â¦\84 → (
+                         ∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2
                       ) → R G1 L1 T1
                    ) →
-                   â\88\80G,L,T. â¦\83G, Lâ¦\84 â\8a¢ ⦥[h, g] T → R G L T.
-#h #g #R #IH #G #L #T #H elim H -G -L -T
+                   â\88\80G,L,T. ⦥[h, o] â¦\83G, L, Tâ¦\84 → R G L T.
+#h #o #R #IH #G #L #T #H elim H -G -L -T
 /4 width=1 by fsb_intro/
 qed-.
 
 (* Basic inversion lemmas ***************************************************)
 
-lemma fsb_inv_csx: ∀h,g,G,L,T. ⦃G, L⦄ ⊢ ⦥[h, g] T → ⦃G, L⦄ ⊢ ⬊*[h, g] T.
-#h #g #G #L #T #H elim H -G -L -T /5 width=1 by csx_intro_cpxs, fpbu_cpxs/
+lemma fsb_inv_csx: ∀h,o,G,L,T. ⦥[h, o] ⦃G, L, T⦄ → ⦃G, L⦄ ⊢ ⬊*[h, o] T.
+#h #o #G #L #T #H elim H -G -L -T /5 width=1 by csx_intro, fpb_cpx/
 qed-.