X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Fdynamic%2Fsnv.ma;h=a76beb80f7ab2ccdb45f04eb52cef11619697511;hb=58ddc56896384e0a1e8a7d331aae9eded8510c70;hp=2be5715258a1adced3f0d0a67bda6d15e6453a0f;hpb=e8998d29ab83e7b6aa495a079193705b2f6743d3;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/basic_2/dynamic/snv.ma b/matita/matita/contribs/lambdadelta/basic_2/dynamic/snv.ma index 2be571525..a76beb80f 100644 --- a/matita/matita/contribs/lambdadelta/basic_2/dynamic/snv.ma +++ b/matita/matita/contribs/lambdadelta/basic_2/dynamic/snv.ma @@ -12,90 +12,100 @@ (* *) (**************************************************************************) -include "basic_2/computation/cprs.ma". -include "basic_2/computation/xprs.ma". -include "basic_2/equivalence/cpcs.ma". +include "basic_2/notation/relations/nativevalid_5.ma". +include "basic_2/computation/scpds.ma". (* STRATIFIED NATIVE VALIDITY FOR TERMS *************************************) -inductive snv (h:sh) (g:sd h): lenv → predicate term ≝ -| snv_sort: ∀L,k. snv h g L (⋆k) -| snv_lref: ∀I,L,K,V,i. ⇩[0, i] L ≡ K.ⓑ{I}V → snv h g K V → snv h g L (#i) -| snv_bind: ∀a,I,L,V,T. snv h g L V → snv h g (L.ⓑ{I}V) T → snv h g L (ⓑ{a,I}V.T) -| snv_appl: ∀a,L,V,W,W0,T,U,l. snv h g L V → snv h g L T → - ⦃h, L⦄ ⊢ V •[g, l + 1] W → L ⊢ W ➡* W0 → - ⦃h, L⦄ ⊢ T •➡*[g] ⓛ{a}W0.U → snv h g L (ⓐV.T) -| snv_cast: ∀L,W,T,U,l. snv h g L W → snv h g L T → - ⦃h, L⦄ ⊢ T •[g, l + 1] U → L ⊢ U ⬌* W → snv h g L (ⓝW.T) +(* activate genv *) +inductive snv (h) (o): relation3 genv lenv term ≝ +| snv_sort: ∀G,L,s. snv h o G L (⋆s) +| snv_lref: ∀I,G,L,K,V,i. ⬇[i] L ≘ K.ⓑ{I}V → snv h o G K V → snv h o G L (#i) +| snv_bind: ∀a,I,G,L,V,T. snv h o G L V → snv h o G (L.ⓑ{I}V) T → snv h o G L (ⓑ{a,I}V.T) +| snv_appl: ∀a,G,L,V,W0,T,U0,d. snv h o G L V → snv h o G L T → + ⦃G, L⦄ ⊢ V •*➡*[h, o, 1] W0 → ⦃G, L⦄ ⊢ T •*➡*[h, o, d] ⓛ{a}W0.U0 → snv h o G L (ⓐV.T) +| snv_cast: ∀G,L,U,T,U0. snv h o G L U → snv h o G L T → + ⦃G, L⦄ ⊢ U •*➡*[h, o, 0] U0 → ⦃G, L⦄ ⊢ T •*➡*[h, o, 1] U0 → snv h o G L (ⓝU.T) . interpretation "stratified native validity (term)" - 'NativeValid h g L T = (snv h g L T). + 'NativeValid h o G L T = (snv h o G L T). (* Basic inversion lemmas ***************************************************) -fact snv_inv_lref_aux: ∀h,g,L,X. ⦃h, L⦄ ⊩ X :[g] → ∀i. X = #i → - ∃∃I,K,V. ⇩[0, i] L ≡ K.ⓑ{I}V & ⦃h, K⦄ ⊩ V :[g]. -#h #g #L #X * -L -X -[ #L #k #i #H destruct -| #I #L #K #V #i0 #HLK #HV #i #H destruct /2 width=5/ -| #a #I #L #V #T #_ #_ #i #H destruct -| #a #L #V #W #W0 #T #U #l #_ #_ #_ #_ #_ #i #H destruct -| #L #W #T #U #l #_ #_ #_ #_ #i #H destruct +fact snv_inv_lref_aux: ∀h,o,G,L,X. ⦃G, L⦄ ⊢ X ¡[h, o] → ∀i. X = #i → + ∃∃I,K,V. ⬇[i] L ≘ K.ⓑ{I}V & ⦃G, K⦄ ⊢ V ¡[h, o]. +#h #o #G #L #X * -G -L -X +[ #G #L #s #i #H destruct +| #I #G #L #K #V #i0 #HLK #HV #i #H destruct /2 width=5 by ex2_3_intro/ +| #a #I #G #L #V #T #_ #_ #i #H destruct +| #a #G #L #V #W0 #T #U0 #d #_ #_ #_ #_ #i #H destruct +| #G #L #U #T #U0 #_ #_ #_ #_ #i #H destruct ] -qed. +qed-. -lemma snv_inv_lref: ∀h,g,L,i. ⦃h, L⦄ ⊩ #i :[g] → - ∃∃I,K,V. ⇩[0, i] L ≡ K.ⓑ{I}V & ⦃h, K⦄ ⊩ V :[g]. -/2 width=3/ qed-. +lemma snv_inv_lref: ∀h,o,G,L,i. ⦃G, L⦄ ⊢ #i ¡[h, o] → + ∃∃I,K,V. ⬇[i] L ≘ K.ⓑ{I}V & ⦃G, K⦄ ⊢ V ¡[h, o]. +/2 width=3 by snv_inv_lref_aux/ qed-. -fact snv_inv_bind_aux: ∀h,g,L,X. ⦃h, L⦄ ⊩ X :[g] → ∀a,I,V,T. X = ⓑ{a,I}V.T → - ⦃h, L⦄ ⊩ V :[g] ∧ ⦃h, L.ⓑ{I}V⦄ ⊩ T :[g]. -#h #g #L #X * -L -X -[ #L #k #a #I #V #T #H destruct -| #I0 #L #K #V0 #i #_ #_ #a #I #V #T #H destruct -| #b #I0 #L #V0 #T0 #HV0 #HT0 #a #I #V #T #H destruct /2 width=1/ -| #b #L #V0 #W0 #W00 #T0 #U0 #l #_ #_ #_ #_ #_ #a #I #V #T #H destruct -| #L #W0 #T0 #U0 #l #_ #_ #_ #_ #a #I #V #T #H destruct +fact snv_inv_gref_aux: ∀h,o,G,L,X. ⦃G, L⦄ ⊢ X ¡[h, o] → ∀p. X = §p → ⊥. +#h #o #G #L #X * -G -L -X +[ #G #L #s #p #H destruct +| #I #G #L #K #V #i #_ #_ #p #H destruct +| #a #I #G #L #V #T #_ #_ #p #H destruct +| #a #G #L #V #W0 #T #U0 #d #_ #_ #_ #_ #p #H destruct +| #G #L #U #T #U0 #_ #_ #_ #_ #p #H destruct ] -qed. +qed-. -lemma snv_inv_bind: ∀h,g,a,I,L,V,T. ⦃h, L⦄ ⊩ ⓑ{a,I}V.T :[g] → - ⦃h, L⦄ ⊩ V :[g] ∧ ⦃h, L.ⓑ{I}V⦄ ⊩ T :[g]. -/2 width=4/ qed-. +lemma snv_inv_gref: ∀h,o,G,L,p. ⦃G, L⦄ ⊢ §p ¡[h, o] → ⊥. +/2 width=8 by snv_inv_gref_aux/ qed-. -fact snv_inv_appl_aux: ∀h,g,L,X. ⦃h, L⦄ ⊩ X :[g] → ∀V,T. X = ⓐV.T → - ∃∃a,W,W0,U,l. ⦃h, L⦄ ⊩ V :[g] & ⦃h, L⦄ ⊩ T :[g] & - ⦃h, L⦄ ⊢ V •[g, l + 1] W & L ⊢ W ➡* W0 & - ⦃h, L⦄ ⊢ T •➡*[g] ⓛ{a}W0.U. -#h #g #L #X * -L -X -[ #L #k #V #T #H destruct -| #I #L #K #V0 #i #_ #_ #V #T #H destruct -| #a #I #L #V0 #T0 #_ #_ #V #T #H destruct -| #a #L #V0 #W0 #W00 #T0 #U0 #l #HV0 #HT0 #HVW0 #HW00 #HTU0 #V #T #H destruct /2 width=8/ -| #L #W0 #T0 #U0 #l #_ #_ #_ #_ #V #T #H destruct +fact snv_inv_bind_aux: ∀h,o,G,L,X. ⦃G, L⦄ ⊢ X ¡[h, o] → ∀a,I,V,T. X = ⓑ{a,I}V.T → + ⦃G, L⦄ ⊢ V ¡[h, o] ∧ ⦃G, L.ⓑ{I}V⦄ ⊢ T ¡[h, o]. +#h #o #G #L #X * -G -L -X +[ #G #L #s #b #Z #X1 #X2 #H destruct +| #I #G #L #K #V #i #_ #_ #b #Z #X1 #X2 #H destruct +| #a #I #G #L #V #T #HV #HT #b #Z #X1 #X2 #H destruct /2 width=1 by conj/ +| #a #G #L #V #W0 #T #U0 #d #_ #_ #_ #_ #b #Z #X1 #X2 #H destruct +| #G #L #U #T #U0 #_ #_ #_ #_ #b #Z #X1 #X2 #H destruct ] -qed. +qed-. -lemma snv_inv_appl: ∀h,g,L,V,T. ⦃h, L⦄ ⊩ ⓐV.T :[g] → - ∃∃a,W,W0,U,l. ⦃h, L⦄ ⊩ V :[g] & ⦃h, L⦄ ⊩ T :[g] & - ⦃h, L⦄ ⊢ V •[g, l + 1] W & L ⊢ W ➡* W0 & - ⦃h, L⦄ ⊢ T •➡*[g] ⓛ{a}W0.U. -/2 width=3/ qed-. +lemma snv_inv_bind: ∀h,o,a,I,G,L,V,T. ⦃G, L⦄ ⊢ ⓑ{a,I}V.T ¡[h, o] → + ⦃G, L⦄ ⊢ V ¡[h, o] ∧ ⦃G, L.ⓑ{I}V⦄ ⊢ T ¡[h, o]. +/2 width=4 by snv_inv_bind_aux/ qed-. -fact snv_inv_cast_aux: ∀h,g,L,X. ⦃h, L⦄ ⊩ X :[g] → ∀W,T. X = ⓝW.T → - ∃∃U,l. ⦃h, L⦄ ⊩ W :[g] & ⦃h, L⦄ ⊩ T :[g] & - ⦃h, L⦄ ⊢ T •[g, l + 1] U & L ⊢ U ⬌* W. -#h #g #L #X * -L -X -[ #L #k #W #T #H destruct -| #I #L #K #V #i #_ #_ #W #T #H destruct -| #a #I #L #V #T0 #_ #_ #W #T #H destruct -| #a #L #V #W0 #W00 #T0 #U #l #_ #_ #_ #_ #_ #W #T #H destruct -| #L #W0 #T0 #U0 #l #HW0 #HT0 #HTU0 #HUW0 #W #T #H destruct /2 width=4/ +fact snv_inv_appl_aux: ∀h,o,G,L,X. ⦃G, L⦄ ⊢ X ¡[h, o] → ∀V,T. X = ⓐV.T → + ∃∃a,W0,U0,d. ⦃G, L⦄ ⊢ V ¡[h, o] & ⦃G, L⦄ ⊢ T ¡[h, o] & + ⦃G, L⦄ ⊢ V •*➡*[h, o, 1] W0 & ⦃G, L⦄ ⊢ T •*➡*[h, o, d] ⓛ{a}W0.U0. +#h #o #G #L #X * -L -X +[ #G #L #s #X1 #X2 #H destruct +| #I #G #L #K #V #i #_ #_ #X1 #X2 #H destruct +| #a #I #G #L #V #T #_ #_ #X1 #X2 #H destruct +| #a #G #L #V #W0 #T #U0 #d #HV #HT #HVW0 #HTU0 #X1 #X2 #H destruct /2 width=6 by ex4_4_intro/ +| #G #L #U #T #U0 #_ #_ #_ #_ #X1 #X2 #H destruct ] -qed. +qed-. -lemma snv_inv_cast: ∀h,g,L,W,T. ⦃h, L⦄ ⊩ ⓝW.T :[g] → - ∃∃U,l. ⦃h, L⦄ ⊩ W :[g] & ⦃h, L⦄ ⊩ T :[g] & - ⦃h, L⦄ ⊢ T •[g, l + 1] U & L ⊢ U ⬌* W. -/2 width=3/ qed-. +lemma snv_inv_appl: ∀h,o,G,L,V,T. ⦃G, L⦄ ⊢ ⓐV.T ¡[h, o] → + ∃∃a,W0,U0,d. ⦃G, L⦄ ⊢ V ¡[h, o] & ⦃G, L⦄ ⊢ T ¡[h, o] & + ⦃G, L⦄ ⊢ V •*➡*[h, o, 1] W0 & ⦃G, L⦄ ⊢ T •*➡*[h, o, d] ⓛ{a}W0.U0. +/2 width=3 by snv_inv_appl_aux/ qed-. + +fact snv_inv_cast_aux: ∀h,o,G,L,X. ⦃G, L⦄ ⊢ X ¡[h, o] → ∀U,T. X = ⓝU.T → + ∃∃U0. ⦃G, L⦄ ⊢ U ¡[h, o] & ⦃G, L⦄ ⊢ T ¡[h, o] & + ⦃G, L⦄ ⊢ U •*➡*[h, o, 0] U0 & ⦃G, L⦄ ⊢ T •*➡*[h, o, 1] U0. +#h #o #G #L #X * -G -L -X +[ #G #L #s #X1 #X2 #H destruct +| #I #G #L #K #V #i #_ #_ #X1 #X2 #H destruct +| #a #I #G #L #V #T #_ #_ #X1 #X2 #H destruct +| #a #G #L #V #W0 #T #U0 #d #_ #_ #_ #_ #X1 #X2 #H destruct +| #G #L #U #T #U0 #HV #HT #HU0 #HTU0 #X1 #X2 #H destruct /2 width=3 by ex4_intro/ +] +qed-. + +lemma snv_inv_cast: ∀h,o,G,L,U,T. ⦃G, L⦄ ⊢ ⓝU.T ¡[h, o] → + ∃∃U0. ⦃G, L⦄ ⊢ U ¡[h, o] & ⦃G, L⦄ ⊢ T ¡[h, o] & + ⦃G, L⦄ ⊢ U •*➡*[h, o, 0] U0 & ⦃G, L⦄ ⊢ T •*➡*[h, o, 1] U0. +/2 width=3 by snv_inv_cast_aux/ qed-.