X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Frt_computation%2Ffsb.ma;h=919b91f610ef2cf4279b203f42573518f6560771;hb=bd53c4e895203eb049e75434f638f26b5a161a2b;hp=c27ffaba51ed72e39b7c6c81e978131eaa6685e4;hpb=e9f96fa56226dfd74de214c89d827de0c5018ac7;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb.ma b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb.ma
index c27ffaba5..919b91f61 100644
--- a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb.ma
@@ -12,36 +12,36 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "basic_2/notation/relations/btsn_5.ma".
-include "basic_2/reduction/fpb.ma".
-include "basic_2/computation/csx.ma".
+include "basic_2/notation/relations/predsubtystrong_4.ma".
+include "basic_2/rt_transition/fpb.ma".
 
-(* "QRST" STRONGLY NORMALIZING CLOSURES *************************************)
+(* STRONGLY NORMALIZING CLOSURES FOR PARALLEL RST-TRANSITION ****************)
 
-inductive fsb (h) (o): relation3 genv lenv term ≝
+inductive fsb (h): relation3 genv lenv term ≝
 | fsb_intro: ∀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
+                ∀G2,L2,T2. ❪G1,L1,T1❫ ≻[h] ❪G2,L2,T2❫ → fsb h G2 L2 T2
+             ) → fsb h G1 L1 T1
 .
 
 interpretation
-   "'qrst' strong normalization (closure)"
-   'BTSN h o G L T = (fsb h o G L T).
+   "strong normalization for parallel rst-transition (closure)"
+   'PRedSubTyStrong h G L T = (fsb h G L T).
 
 (* Basic eliminators ********************************************************)
 
-lemma fsb_ind_alt: ∀h,o. ∀R: relation3 …. (
-                      ∀G1,L1,T1. ⦥[h,o] ⦃G1, L1, T1⦄ → (
-                         ∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2
-                      ) → R G1 L1 T1
+(* Note: eliminator with shorter ground hypothesis *)
+(* Note: to be named fsb_ind when fsb becomes a definition like csx, lfsx ***)
+lemma fsb_ind_alt: ∀h. ∀Q: relation3 …. (
+                      ∀G1,L1,T1. ≥[h] 𝐒❪G1,L1,T1❫ → (
+                         ∀G2,L2,T2. ❪G1,L1,T1❫ ≻[h] ❪G2,L2,T2❫ → Q G2 L2 T2
+                      ) → Q G1 L1 T1
                    ) →
-                   ∀G,L,T. ⦥[h, o] ⦃G, L, T⦄ → R G L T.
-#h #o #R #IH #G #L #T #H elim H -G -L -T
+                   ∀G,L,T. ≥[h] 𝐒❪G,L,T❫ →  Q G L T.
+#h #Q #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,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-.
+(* Basic_2A1: removed theorems 6:
+              fsba_intro fsba_ind_alt fsba_fpbs_trans fsb_fsba fsba_inv_fsb
+              aaa_fsba
+*)