From: Ferruccio Guidi <fguidi@maelstrom.helm.cs.unibo.it>
Date: Wed, 28 Mar 2018 16:27:11 +0000 (+0200)
Subject: milestone update in basic_2
X-Git-Tag: make_still_working~345
X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=commitdiff_plain;h=38b251338be469c7bcd75cb9f243fad9ba8f0907;p=helm.git

milestone update in basic_2

+ big tree theorem proved!
---

diff --git a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb_aaa.ma b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb_aaa.ma
index e40fbc1d3..5b27cd1a9 100644
--- a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb_aaa.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/fsb_aaa.ma
@@ -12,37 +12,34 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "basic_2/computation/fpbs_aaa.ma".
-include "basic_2/computation/csx_aaa.ma".
-include "basic_2/computation/fsb_csx.ma".
+include "basic_2/rt_computation/csx_aaa.ma".
+include "basic_2/rt_computation/fpbs_aaa.ma".
+include "basic_2/rt_computation/fpbs_fpb.ma".
+include "basic_2/rt_computation/fsb_csx.ma".
 
-(* "QRST" STRONGLY NORMALIZING CLOSURES *************************************)
+(* STRONGLY NORMALIZING CLOSURES FOR PARALLEL RST-TRANSITION ****************)
 
-(* Main properties **********************************************************)
+(* Main properties with atomic arity assignment for terms *******************)
 
-(* Note: this is the "big tree" theorem ("RST" version) *)
-theorem aaa_fsb: ∀h,o,G,L,T,A. ⦃G, L⦄ ⊢ T ⁝ A → ⦥[h, o] ⦃G, L, T⦄.
+(* Note: this is the "big tree" theorem *)
+theorem aaa_fsb: ∀h,o,G,L,T,A. ⦃G, L⦄ ⊢ T ⁝ A → ≥[h, o] 𝐒⦃G, L, T⦄.
 /3 width=2 by aaa_csx, csx_fsb/ qed.
 
-(* Note: this is the "big tree" theorem ("QRST" version) *)
-theorem aaa_fsba: ∀h,o,G,L,T,A. ⦃G, L⦄ ⊢ T ⁝ A → ⦥⦥[h, o] ⦃G, L, T⦄.
-/3 width=2 by fsb_fsba, aaa_fsb/ qed.
+(* Advanced eliminators with atomic arity assignment for terms **************)
 
-(* Advanced eliminators on atomica arity assignment for terms ***************)
-
-fact aaa_ind_fpb_aux: ∀h,o. ∀R:relation3 genv lenv term.
+fact aaa_ind_fpb_aux: ∀h,o. ∀R:relation3 ….
                       (∀G1,L1,T1,A. ⦃G1, L1⦄ ⊢ T1 ⁝ A →
                                     (∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2) →
                                     R G1 L1 T1
                       ) →
-                      ∀G,L,T. ⦃G, L⦄ ⊢ ⬊*[h, o] T → ∀A. ⦃G, L⦄ ⊢ T ⁝ A → R G L T.
+                      ∀G,L,T. ⦃G, L⦄ ⊢ ⬈*[h, o] 𝐒⦃T⦄ → ∀A. ⦃G, L⦄ ⊢ T ⁝ A → R G L T.
 #h #o #R #IH #G #L #T #H @(csx_ind_fpb … H) -G -L -T
 #G1 #L1 #T1 #H1 #IH1 #A1 #HTA1 @IH -IH //
 #G2 #L2 #T2 #H12 elim (fpbs_aaa_conf h o … G2 … L2 … T2 … HTA1) -A1
 /2 width=2 by fpb_fpbs/
 qed-.
 
-lemma aaa_ind_fpb: ∀h,o. ∀R:relation3 genv lenv term.
+lemma aaa_ind_fpb: ∀h,o. ∀R:relation3 ….
                    (∀G1,L1,T1,A. ⦃G1, L1⦄ ⊢ T1 ⁝ A →
                                  (∀G2,L2,T2. ⦃G1, L1, T1⦄ ≻[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2) →
                                  R G1 L1 T1
@@ -50,21 +47,21 @@ lemma aaa_ind_fpb: ∀h,o. ∀R:relation3 genv lenv term.
                    ∀G,L,T,A. ⦃G, L⦄ ⊢ T ⁝ A → R G L T.
 /4 width=4 by aaa_ind_fpb_aux, aaa_csx/ qed-.
 
-fact aaa_ind_fpbg_aux: ∀h,o. ∀R:relation3 genv lenv term.
+fact aaa_ind_fpbg_aux: ∀h,o. ∀R:relation3 ….
                        (∀G1,L1,T1,A. ⦃G1, L1⦄ ⊢ T1 ⁝ A →
-                                     (∀G2,L2,T2. ⦃G1, L1, T1⦄ >≛[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2) →
+                                     (∀G2,L2,T2. ⦃G1, L1, T1⦄ >[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2) →
                                      R G1 L1 T1
                        ) →
-                       ∀G,L,T. ⦃G, L⦄ ⊢ ⬊*[h, o] T → ∀A. ⦃G, L⦄ ⊢ T ⁝ A → R G L T.
+                       ∀G,L,T. ⦃G, L⦄ ⊢ ⬈*[h, o] 𝐒⦃T⦄ → ∀A. ⦃G, L⦄ ⊢ T ⁝ A → R G L T.
 #h #o #R #IH #G #L #T #H @(csx_ind_fpbg … H) -G -L -T
 #G1 #L1 #T1 #H1 #IH1 #A1 #HTA1 @IH -IH //
 #G2 #L2 #T2 #H12 elim (fpbs_aaa_conf h o … G2 … L2 … T2 … HTA1) -A1
 /2 width=2 by fpbg_fwd_fpbs/
 qed-.
 
-lemma aaa_ind_fpbg: ∀h,o. ∀R:relation3 genv lenv term.
+lemma aaa_ind_fpbg: ∀h,o. ∀R:relation3 ….
                     (∀G1,L1,T1,A. ⦃G1, L1⦄ ⊢ T1 ⁝ A →
-                                  (∀G2,L2,T2. ⦃G1, L1, T1⦄ >≛[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2) →
+                                  (∀G2,L2,T2. ⦃G1, L1, T1⦄ >[h, o] ⦃G2, L2, T2⦄ → R G2 L2 T2) →
                                   R G1 L1 T1
                     ) →
                     ∀G,L,T,A. ⦃G, L⦄ ⊢ T ⁝ A → R G L T.
diff --git a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/partial.txt b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/partial.txt
index 2c46eff5d..f5778c98f 100644
--- a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/partial.txt
+++ b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/partial.txt
@@ -8,4 +8,4 @@ lfsx.ma lfsx_drops.ma lfsx_fqup.ma lfsx_lpx.ma lfsx_lpxs.ma lfsx_lfpxs.ma lfsx_c
 lsubsx.ma lsubsx_lfsx.ma lsubsx_lsubsx.ma
 fpbs.ma fpbs_fqup.ma fpbs_fqus.ma fpbs_aaa.ma fpbs_cpx.ma fpbs_fpb.ma fpbs_cpxs.ma fpbs_lpxs.ma fpbs_lfpxs.ma fpbs_csx.ma fpbs_fpbs.ma
 fpbg.ma fpbg_fqup.ma fpbg_cpxs.ma fpbg_lfpxs.ma fpbg_fpbs.ma fpbg_fpbg.ma
-fsb.ma fsb_ffdeq.ma fsb_csx.ma fsb_fpbg.ma
+fsb.ma fsb_ffdeq.ma fsb_aaa.ma fsb_csx.ma fsb_fpbg.ma
diff --git a/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml b/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
index f1f4b8415..8bfc16d8e 100644
--- a/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
+++ b/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
@@ -34,6 +34,10 @@
 
    <subsection name="A2">Stage "A2": "Extending the Applicability Condition"</subsection>
 
+   <news class="alpha" date="2018 April 16.">
+         "Big tree" theorem
+         (anniversary milestone).
+   </news>
    <news class="alpha" date="2018 March 9.">
          Support for rt-computation completed.
    </news>