- some renaming according to the written version of basic_2

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

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/lsx.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/lsx.ma
index 3c2b01edd1a0f5719d95645ca9b876953f2b02bb..1cc24d432bf9a5d0f936ea6e8c03bf12201ab643 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/lsx.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/lsx.ma
@@ -19,91 +19,91 @@ include "basic_2/reduction/lpx.ma".
 (* SN EXTENDED STRONGLY NORMALIZING LOCAL ENVIRONMENTS **********************)
 
 definition lsx: ∀h. sd h → relation4 ynat term genv lenv ≝
-                λh,g,d,T,G. SN … (lpx h g G) (lleq d T).
+                λh,g,l,T,G. SN … (lpx h g G) (lleq l T).
 
 interpretation
    "extended strong normalization (local environment)"
-   'SN h g d T G L = (lsx h g T d G L).
+   'SN h g l T G L = (lsx h g T l G L).
 
 (* Basic eliminators ********************************************************)
 
-lemma lsx_ind: ∀h,g,G,T,d. ∀R:predicate lenv.
-               (∀L1. G ⊢ ⬊*[h, g, T, d] L1 →
-                     (∀L2. ⦃G, L1⦄ ⊢ ➡[h, g] L2 → (L1 ≡[T, d] L2 → ⊥) → R L2) →
+lemma lsx_ind: ∀h,g,G,T,l. ∀R:predicate lenv.
+               (∀L1. G ⊢ ⬊*[h, g, T, l] L1 →
+                     (∀L2. ⦃G, L1⦄ ⊢ ➡[h, g] L2 → (L1 ≡[T, l] L2 → ⊥) → R L2) →
                      R L1
                ) →
-               ∀L. G ⊢ ⬊*[h, g, T, d] L → R L.
-#h #g #G #T #d #R #H0 #L1 #H elim H -L1
+               ∀L. G ⊢ ⬊*[h, g, T, l] L → R L.
+#h #g #G #T #l #R #H0 #L1 #H elim H -L1
 /5 width=1 by lleq_sym, SN_intro/
 qed-.
 
 (* Basic properties *********************************************************)
 
-lemma lsx_intro: ∀h,g,G,L1,T,d.
-                 (∀L2. ⦃G, L1⦄ ⊢ ➡[h, g] L2 → (L1 ≡[T, d] L2 → ⊥) → G ⊢ ⬊*[h, g, T, d] L2) →
-                 G ⊢ ⬊*[h, g, T, d] L1.
+lemma lsx_intro: ∀h,g,G,L1,T,l.
+                 (∀L2. ⦃G, L1⦄ ⊢ ➡[h, g] L2 → (L1 ≡[T, l] L2 → ⊥) → G ⊢ ⬊*[h, g, T, l] L2) →
+                 G ⊢ ⬊*[h, g, T, l] L1.
 /5 width=1 by lleq_sym, SN_intro/ qed.
 
-lemma lsx_atom: ∀h,g,G,T,d. G ⊢ ⬊*[h, g, T, d] ⋆.
-#h #g #G #T #d @lsx_intro
+lemma lsx_atom: ∀h,g,G,T,l. G ⊢ ⬊*[h, g, T, l] ⋆.
+#h #g #G #T #l @lsx_intro
 #X #H #HT lapply (lpx_inv_atom1 … H) -H
 #H destruct elim HT -HT //
 qed.
 
-lemma lsx_sort: ∀h,g,G,L,d,k. G ⊢ ⬊*[h, g, ⋆k, d] L.
-#h #g #G #L1 #d #k @lsx_intro
+lemma lsx_sort: ∀h,g,G,L,l,k. G ⊢ ⬊*[h, g, ⋆k, l] L.
+#h #g #G #L1 #l #k @lsx_intro
 #L2 #HL12 #H elim H -H
 /3 width=4 by lpx_fwd_length, lleq_sort/
 qed.
 
-lemma lsx_gref: ∀h,g,G,L,d,p. G ⊢ ⬊*[h, g, §p, d] L.
-#h #g #G #L1 #d #p @lsx_intro
+lemma lsx_gref: ∀h,g,G,L,l,p. G ⊢ ⬊*[h, g, §p, l] L.
+#h #g #G #L1 #l #p @lsx_intro
 #L2 #HL12 #H elim H -H
 /3 width=4 by lpx_fwd_length, lleq_gref/
 qed.
 
-lemma lsx_ge_up: ∀h,g,G,L,T,U,dt,d,e. dt ≤ yinj d + yinj e →
-                 ⬆[d, e] T ≡ U → G ⊢ ⬊*[h, g, U, dt] L → G ⊢ ⬊*[h, g, U, d] L.
-#h #g #G #L #T #U #dt #d #e #Hdtde #HTU #H @(lsx_ind … H) -L
+lemma lsx_ge_up: ∀h,g,G,L,T,U,lt,l,m. lt ≤ yinj l + yinj m →
+                 ⬆[l, m] T ≡ U → G ⊢ ⬊*[h, g, U, lt] L → G ⊢ ⬊*[h, g, U, l] L.
+#h #g #G #L #T #U #lt #l #m #Hltlm #HTU #H @(lsx_ind … H) -L
 /5 width=7 by lsx_intro, lleq_ge_up/
 qed-.
 
-lemma lsx_ge: ∀h,g,G,L,T,d1,d2. d1 ≤ d2 →
-              G ⊢ ⬊*[h, g, T, d1] L → G ⊢ ⬊*[h, g, T, d2] L.
-#h #g #G #L #T #d1 #d2 #Hd12 #H @(lsx_ind … H) -L
+lemma lsx_ge: ∀h,g,G,L,T,l1,l2. l1 ≤ l2 →
+              G ⊢ ⬊*[h, g, T, l1] L → G ⊢ ⬊*[h, g, T, l2] L.
+#h #g #G #L #T #l1 #l2 #Hl12 #H @(lsx_ind … H) -L
 /5 width=7 by lsx_intro, lleq_ge/
 qed-.
 
 (* Basic forward lemmas *****************************************************)
 
-lemma lsx_fwd_bind_sn: ∀h,g,a,I,G,L,V,T,d. G ⊢ ⬊*[h, g, ⓑ{a,I}V.T, d] L →
-                       G ⊢ ⬊*[h, g, V, d] L.
-#h #g #a #I #G #L #V #T #d #H @(lsx_ind … H) -L
+lemma lsx_fwd_bind_sn: ∀h,g,a,I,G,L,V,T,l. G ⊢ ⬊*[h, g, ⓑ{a,I}V.T, l] L →
+                       G ⊢ ⬊*[h, g, V, l] L.
+#h #g #a #I #G #L #V #T #l #H @(lsx_ind … H) -L
 #L1 #_ #IHL1 @lsx_intro
 #L2 #HL12 #HV @IHL1 /3 width=4 by lleq_fwd_bind_sn/
 qed-.
 
-lemma lsx_fwd_flat_sn: ∀h,g,I,G,L,V,T,d. G ⊢ ⬊*[h, g, ⓕ{I}V.T, d] L →
-                       G ⊢ ⬊*[h, g, V, d] L.
-#h #g #I #G #L #V #T #d #H @(lsx_ind … H) -L
+lemma lsx_fwd_flat_sn: ∀h,g,I,G,L,V,T,l. G ⊢ ⬊*[h, g, ⓕ{I}V.T, l] L →
+                       G ⊢ ⬊*[h, g, V, l] L.
+#h #g #I #G #L #V #T #l #H @(lsx_ind … H) -L
 #L1 #_ #IHL1 @lsx_intro
 #L2 #HL12 #HV @IHL1 /3 width=3 by lleq_fwd_flat_sn/
 qed-.
 
-lemma lsx_fwd_flat_dx: ∀h,g,I,G,L,V,T,d. G ⊢ ⬊*[h, g, ⓕ{I}V.T, d] L →
-                       G ⊢ ⬊*[h, g, T, d] L.
-#h #g #I #G #L #V #T #d #H @(lsx_ind … H) -L
+lemma lsx_fwd_flat_dx: ∀h,g,I,G,L,V,T,l. G ⊢ ⬊*[h, g, ⓕ{I}V.T, l] L →
+                       G ⊢ ⬊*[h, g, T, l] L.
+#h #g #I #G #L #V #T #l #H @(lsx_ind … H) -L
 #L1 #_ #IHL1 @lsx_intro
 #L2 #HL12 #HV @IHL1 /3 width=3 by lleq_fwd_flat_dx/
 qed-.
 
-lemma lsx_fwd_pair_sn: ∀h,g,I,G,L,V,T,d. G ⊢ ⬊*[h, g, ②{I}V.T, d] L →
-                       G ⊢ ⬊*[h, g, V, d] L.
+lemma lsx_fwd_pair_sn: ∀h,g,I,G,L,V,T,l. G ⊢ ⬊*[h, g, ②{I}V.T, l] L →
+                       G ⊢ ⬊*[h, g, V, l] L.
 #h #g * /2 width=4 by lsx_fwd_bind_sn, lsx_fwd_flat_sn/
 qed-.
 
 (* Basic inversion lemmas ***************************************************)
 
-lemma lsx_inv_flat: ∀h,g,I,G,L,V,T,d. G ⊢ ⬊*[h, g, ⓕ{I}V.T, d] L →
-                    G ⊢ ⬊*[h, g, V, d] L ∧ G ⊢ ⬊*[h, g, T, d] L.
+lemma lsx_inv_flat: ∀h,g,I,G,L,V,T,l. G ⊢ ⬊*[h, g, ⓕ{I}V.T, l] L →
+                    G ⊢ ⬊*[h, g, V, l] L ∧ G ⊢ ⬊*[h, g, T, l] L.
 /3 width=3 by lsx_fwd_flat_sn, lsx_fwd_flat_dx, conj/ qed-.