X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Frt_computation%2Frsx_csx.ma;h=c56d1c6ccfbe4462b087a349a35ca98a191b8c8f;hp=e9e5f5a374de5b36daed08b417095b8b26e694ea;hb=3c7b4071a9ac096b02334c1d47468776b948e2de;hpb=2f6f2b7c01d47d23f61dd48d767bcb37aecdcfea diff --git a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/rsx_csx.ma b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/rsx_csx.ma index e9e5f5a37..c56d1c6cc 100644 --- a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/rsx_csx.ma +++ b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/rsx_csx.ma @@ -16,14 +16,14 @@ include "basic_2/rt_computation/csx_lsubr.ma". include "basic_2/rt_computation/csx_cpxs.ma". include "basic_2/rt_computation/jsx_rsx.ma". -(* STRONGLY NORMALIZING REFERRED LOCAL ENV.S FOR UNBOUND RT-TRANSITION ******) +(* STRONGLY NORMALIZING REFERRED LOCAL ENVS FOR EXTENDED RT-TRANSITION ******) (* Forward lemmas with strongly rt-normalizing terms ************************) -fact rsx_fwd_lref_pair_csx_aux (h) (G): - ∀L. G ⊢ ⬈*𝐒[h,#0] L → - ∀I,K,V. L = K.ⓑ[I]V → ❪G,K❫ ⊢ ⬈*𝐒[h] V. -#h #G #L #H +fact rsx_fwd_lref_pair_csx_aux (G): + ∀L. G ⊢ ⬈*𝐒[#0] L → + ∀I,K,V. L = K.ⓑ[I]V → ❪G,K❫ ⊢ ⬈*𝐒 V. +#G #L #H @(rsx_ind … H) -L #L #_ #IH #I #K #V1 #H destruct @csx_intro #V2 #HV12 #HnV12 @(IH … I) -IH [1,4: // | -HnV12 | -G #H ] @@ -33,13 +33,13 @@ fact rsx_fwd_lref_pair_csx_aux (h) (G): ] qed-. -lemma rsx_fwd_lref_pair_csx (h) (G): - ∀I,K,V. G ⊢ ⬈*𝐒[h,#0] K.ⓑ[I]V → ❪G,K❫ ⊢ ⬈*𝐒[h] V. +lemma rsx_fwd_lref_pair_csx (G): + ∀I,K,V. G ⊢ ⬈*𝐒[#0] K.ⓑ[I]V → ❪G,K❫ ⊢ ⬈*𝐒 V. /2 width=4 by rsx_fwd_lref_pair_csx_aux/ qed-. -lemma rsx_fwd_lref_pair_csx_drops (h) (G): - ∀I,K,V,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[h,#i] L → ❪G,K❫ ⊢ ⬈*𝐒[h] V. -#h #G #I #K #V #i elim i -i +lemma rsx_fwd_lref_pair_csx_drops (G): + ∀I,K,V,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[#i] L → ❪G,K❫ ⊢ ⬈*𝐒 V. +#G #I #K #V #i elim i -i [ #L #H >(drops_fwd_isid … H) -H /2 width=2 by rsx_fwd_lref_pair_csx/ | #i #IH #L #H1 #H2 @@ -51,22 +51,22 @@ qed-. (* Inversion lemmas with strongly rt-normalizing terms **********************) -lemma rsx_inv_lref_pair (h) (G): - ∀I,K,V. G ⊢ ⬈*𝐒[h,#0] K.ⓑ[I]V → - ∧∧ ❪G,K❫ ⊢ ⬈*𝐒[h] V & G ⊢ ⬈*𝐒[h,V] K. +lemma rsx_inv_lref_pair (G): + ∀I,K,V. G ⊢ ⬈*𝐒[#0] K.ⓑ[I]V → + ∧∧ ❪G,K❫ ⊢ ⬈*𝐒 V & G ⊢ ⬈*𝐒[V] K. /3 width=2 by rsx_fwd_lref_pair_csx, rsx_fwd_pair, conj/ qed-. -lemma rsx_inv_lref_pair_drops (h) (G): - ∀I,K,V,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[h,#i] L → - ∧∧ ❪G,K❫ ⊢ ⬈*𝐒[h] V & G ⊢ ⬈*𝐒[h,V] K. +lemma rsx_inv_lref_pair_drops (G): + ∀I,K,V,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[#i] L → + ∧∧ ❪G,K❫ ⊢ ⬈*𝐒 V & G ⊢ ⬈*𝐒[V] K. /3 width=5 by rsx_fwd_lref_pair_csx_drops, rsx_fwd_lref_pair_drops, conj/ qed-. -lemma rsx_inv_lref_drops (h) (G): - ∀L,i. G ⊢ ⬈*𝐒[h,#i] L → +lemma rsx_inv_lref_drops (G): + ∀L,i. G ⊢ ⬈*𝐒[#i] L → ∨∨ ⇩*[Ⓕ,𝐔❨i❩] L ≘ ⋆ | ∃∃I,K. ⇩[i] L ≘ K.ⓤ[I] - | ∃∃I,K,V. ⇩[i] L ≘ K.ⓑ[I]V & ❪G,K❫ ⊢ ⬈*𝐒[h] V & G ⊢ ⬈*𝐒[h,V] K. -#h #G #L #i #H elim (drops_F_uni L i) + | ∃∃I,K,V. ⇩[i] L ≘ K.ⓑ[I]V & ❪G,K❫ ⊢ ⬈*𝐒 V & G ⊢ ⬈*𝐒[V] K. +#G #L #i #H elim (drops_F_uni L i) [ /2 width=1 by or3_intro0/ | * * /4 width=10 by rsx_fwd_lref_pair_csx_drops, rsx_fwd_lref_pair_drops, ex3_3_intro, ex1_2_intro, or3_intro2, or3_intro1/ ] @@ -76,11 +76,11 @@ qed-. (* Note: swapping the eliminations to avoid rsx_cpx_trans: no solution found *) (* Basic_2A1: uses: lsx_lref_be_lpxs *) -lemma rsx_lref_pair_lpxs (h) (G): - ∀K1,V. ❪G,K1❫ ⊢ ⬈*𝐒[h] V → - ∀K2. G ⊢ ⬈*𝐒[h,V] K2 → ❪G,K1❫ ⊢ ⬈*[h] K2 → - ∀I. G ⊢ ⬈*𝐒[h,#0] K2.ⓑ[I]V. -#h #G #K1 #V #H +lemma rsx_lref_pair_lpxs (G): + ∀K1,V. ❪G,K1❫ ⊢ ⬈*𝐒 V → + ∀K2. G ⊢ ⬈*𝐒[V] K2 → ❪G,K1❫ ⊢ ⬈* K2 → + ∀I. G ⊢ ⬈*𝐒[#0] K2.ⓑ[I]V. +#G #K1 #V #H @(csx_ind_cpxs … H) -V #V0 #_ #IHV0 #K2 #H @(rsx_ind … H) -K2 #K0 #HK0 #IHK0 #HK10 #I @rsx_intro #Y #HY #HnY @@ -95,15 +95,15 @@ elim (teqx_dec V0 V2) #HnV02 destruct [ -IHV0 -HV02 -HK0 | -IHK0 -HnY ] ] qed. -lemma rsx_lref_pair (h) (G): - ∀K,V. ❪G,K❫ ⊢ ⬈*𝐒[h] V → G ⊢ ⬈*𝐒[h,V] K → ∀I. G ⊢ ⬈*𝐒[h,#0] K.ⓑ[I]V. +lemma rsx_lref_pair (G): + ∀K,V. ❪G,K❫ ⊢ ⬈*𝐒 V → G ⊢ ⬈*𝐒[V] K → ∀I. G ⊢ ⬈*𝐒[#0] K.ⓑ[I]V. /2 width=3 by rsx_lref_pair_lpxs/ qed. (* Basic_2A1: uses: lsx_lref_be *) -lemma rsx_lref_pair_drops (h) (G): - ∀K,V. ❪G,K❫ ⊢ ⬈*𝐒[h] V → G ⊢ ⬈*𝐒[h,V] K → - ∀I,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[h,#i] L. -#h #G #K #V #HV #HK #I #i elim i -i +lemma rsx_lref_pair_drops (G): + ∀K,V. ❪G,K❫ ⊢ ⬈*𝐒 V → G ⊢ ⬈*𝐒[V] K → + ∀I,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[#i] L. +#G #K #V #HV #HK #I #i elim i -i [ #L #H >(drops_fwd_isid … H) -H /2 width=1 by rsx_lref_pair/ | #i #IH #L #H elim (drops_inv_bind2_isuni_next … H) -H // #J #Y #HY #H destruct @@ -114,9 +114,9 @@ qed. (* Main properties with strongly rt-normalizing terms ***********************) (* Basic_2A1: uses: csx_lsx *) -theorem csx_rsx (h) (G): - ∀L,T. ❪G,L❫ ⊢ ⬈*𝐒[h] T → G ⊢ ⬈*𝐒[h,T] L. -#h #G #L #T @(fqup_wf_ind_eq (Ⓣ) … G L T) -G -L -T +theorem csx_rsx (G): + ∀L,T. ❪G,L❫ ⊢ ⬈*𝐒 T → G ⊢ ⬈*𝐒[T] L. +#G #L #T @(fqup_wf_ind_eq (Ⓣ) … G L T) -G -L -T #Z #Y #X #IH #G #L * * [ // | #i #HG #HL #HT #H destruct