- some renaming according to the written version of basic_2

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / dynamic / shnv.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/dynamic/shnv.ma b/matita/matita/contribs/lambdadelta/basic_2/dynamic/shnv.ma
index 24bbe1e15a90f19279e5130ea596b94c1581a733..deacf88dd30813ef4abac72a851b969299e600fc 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/dynamic/shnv.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/dynamic/shnv.ma
@@ -18,31 +18,31 @@ include "basic_2/dynamic/snv.ma".
 
 (* STRATIFIED HIGHER NATIVE VALIDITY FOR TERMS ******************************)
 
-inductive shnv (h) (g) (l1) (G) (L): predicate term ≝
+inductive shnv (h) (g) (d1) (G) (L): predicate term ≝
 | shnv_cast: ∀U,T. ⦃G, L⦄ ⊢ U ¡[h, g] → ⦃G, L⦄ ⊢ T ¡[h, g] →
-             (∀l2. l2 ≤ l1 → ⦃G, L⦄ ⊢ U •*⬌*[h, g, l2, l2+1] T) →
-             shnv h g l1 G L (ⓝU.T)
+             (∀d2. d2 ≤ d1 → ⦃G, L⦄ ⊢ U •*⬌*[h, g, d2, d2+1] T) →
+             shnv h g d1 G L (ⓝU.T)
 .
 
 interpretation "stratified higher native validity (term)"
-   'NativeValid h g l G L T = (shnv h g l G L T).
+   'NativeValid h g d G L T = (shnv h g d G L T).
 
 (* Basic inversion lemmas ***************************************************)
 
-fact shnv_inv_cast_aux: ∀h,g,G,L,X,l1. ⦃G, L⦄ ⊢ X ¡[h, g, l1] → ∀U,T. X = ⓝU.T →
+fact shnv_inv_cast_aux: ∀h,g,G,L,X,d1. ⦃G, L⦄ ⊢ X ¡[h, g, d1] → ∀U,T. X = ⓝU.T →
                         ∧∧ ⦃G, L⦄ ⊢ U ¡[h, g] & ⦃G, L⦄ ⊢ T ¡[h, g]
-                         & (∀l2. l2 ≤ l1 → ⦃G, L⦄ ⊢ U •*⬌*[h, g, l2, l2+1] T).
-#h #g #G #L #X #l1 * -X
+                         & (∀d2. d2 ≤ d1 → ⦃G, L⦄ ⊢ U •*⬌*[h, g, d2, d2+1] T).
+#h #g #G #L #X #d1 * -X
 #U #T #HU #HT #HUT #U1 #T1 #H destruct /3 width=1 by and3_intro/
 qed-.
 
-lemma shnv_inv_cast: ∀h,g,G,L,U,T,l1. ⦃G, L⦄ ⊢ ⓝU.T ¡[h, g, l1] →
+lemma shnv_inv_cast: ∀h,g,G,L,U,T,d1. ⦃G, L⦄ ⊢ ⓝU.T ¡[h, g, d1] →
                      ∧∧ ⦃G, L⦄ ⊢ U ¡[h, g] & ⦃G, L⦄ ⊢ T ¡[h, g]
-                      & (∀l2. l2 ≤ l1 → ⦃G, L⦄ ⊢ U •*⬌*[h, g, l2, l2+1] T).
+                      & (∀d2. d2 ≤ d1 → ⦃G, L⦄ ⊢ U •*⬌*[h, g, d2, d2+1] T).
 /2 width=3 by shnv_inv_cast_aux/ qed-.
 
-lemma shnv_inv_snv: ∀h,g,G,L,T,l. ⦃G, L⦄ ⊢ T ¡[h, g, l] → ⦃G, L⦄ ⊢ T ¡[h, g].
-#h #g #G #L #T #l * -T
+lemma shnv_inv_snv: ∀h,g,G,L,T,d. ⦃G, L⦄ ⊢ T ¡[h, g, d] → ⦃G, L⦄ ⊢ T ¡[h, g].
+#h #g #G #L #T #d * -T
 #U #T #HU #HT #HUT elim (HUT 0) -HUT /2 width=3 by snv_cast/
 qed-.
 
@@ -51,5 +51,5 @@ qed-.
 lemma snv_shnv_cast: ∀h,g,G,L,U,T. ⦃G, L⦄ ⊢ ⓝU.T ¡[h, g] → ⦃G, L⦄ ⊢ ⓝU.T ¡[h, g, 0].
 #h #g #G #L #U #T #H elim (snv_inv_cast … H) -H
 #U0 #HU #HT #HU0 #HTU0 @shnv_cast // -HU -HT
-#l #H <(le_n_O_to_eq … H) -l /2 width=3 by scpds_div/
+#d #H <(le_n_O_to_eq … H) -d /2 width=3 by scpds_div/
 qed.