update in basic_2

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / rt_computation / rsx_csx.ma

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 24ff0f82a6a3e4160d8197ed9729cca020aa499e..e9e5f5a374de5b36daed08b417095b8b26e694ea 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/rsx_csx.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/rsx_csx.ma
@@ -21,8 +21,8 @@ include "basic_2/rt_computation/jsx_rsx.ma".
 (* 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❫.
+     ∀L. G ⊢ ⬈*𝐒[h,#0] L →
+     ∀I,K,V. L = K.ⓑ[I]V → ❪G,K❫ ⊢ ⬈*𝐒[h] V.
 #h #G #L #H
 @(rsx_ind … H) -L #L #_ #IH #I #K #V1 #H destruct
 @csx_intro #V2 #HV12 #HnV12
@@ -34,11 +34,11 @@ 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❫.
+      ∀I,K,V. G ⊢ ⬈*𝐒[h,#0] K.ⓑ[I]V → ❪G,K❫ ⊢ ⬈*𝐒[h] 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❫.
+      ∀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
 [ #L #H >(drops_fwd_isid … H) -H
   /2 width=2 by rsx_fwd_lref_pair_csx/
@@ -52,20 +52,20 @@ 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❫.
+      ∀I,K,V. G ⊢ ⬈*𝐒[h,#0] K.ⓑ[I]V →
+      ∧∧ ❪G,K❫ ⊢ ⬈*𝐒[h] V & G ⊢ ⬈*𝐒[h,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❫.
+      ∀I,K,V,i,L. ⇩[i] L ≘ K.ⓑ[I]V → G ⊢ ⬈*𝐒[h,#i] L →
+      ∧∧ ❪G,K❫ ⊢ ⬈*𝐒[h] V & G ⊢ ⬈*𝐒[h,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❫ →
+      ∀L,i. G ⊢ ⬈*𝐒[h,#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❫.
+       | ∃∃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)
 [ /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/
@@ -77,9 +77,9 @@ 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❫.
+      ∀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
 @(csx_ind_cpxs … H) -V #V0 #_ #IHV0 #K2 #H
 @(rsx_ind … H) -K2 #K0 #HK0 #IHK0 #HK10 #I
@@ -96,13 +96,13 @@ 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❫.
+      ∀K,V. ❪G,K❫ ⊢ ⬈*𝐒[h] V → G ⊢ ⬈*𝐒[h,V] K → ∀I. G ⊢ ⬈*𝐒[h,#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❫.
+      ∀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
 [ #L #H >(drops_fwd_isid … H) -H /2 width=1 by rsx_lref_pair/
 | #i #IH #L #H
@@ -114,7 +114,8 @@ 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❫.
+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
 #Z #Y #X #IH #G #L * *
 [ //