X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2A%2Fmultiple%2Flifts.ma;h=f83cbdf88944adc56ef255f5d278866da4a57aca;hb=2f6f2b7c01d47d23f61dd48d767bcb37aecdcfea;hp=407a8d81019e5d3c034962d4dc8c391fe88de988;hpb=d2545ffd201b1aa49887313791386add78fa8603;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/basic_2A/multiple/lifts.ma b/matita/matita/contribs/lambdadelta/basic_2A/multiple/lifts.ma index 407a8d810..f83cbdf88 100644 --- a/matita/matita/contribs/lambdadelta/basic_2A/multiple/lifts.ma +++ b/matita/matita/contribs/lambdadelta/basic_2A/multiple/lifts.ma @@ -12,16 +12,17 @@ (* *) (**************************************************************************) +include "ground/relocation/mr2_at.ma". +include "ground/relocation/mr2_plus.ma". include "basic_2A/notation/relations/rliftstar_3.ma". include "basic_2A/substitution/lift.ma". -include "basic_2A/multiple/mr2_plus.ma". (* GENERIC TERM RELOCATION **************************************************) -inductive lifts: list2 nat nat → relation term ≝ +inductive lifts: mr2 → relation term ≝ | lifts_nil : ∀T. lifts (◊) T T | lifts_cons: ∀T1,T,T2,cs,l,m. - ⬆[l,m] T1 ≡ T → lifts cs T T2 → lifts ({l, m} @ cs) T1 T2 + ⬆[l,m] T1 ≡ T → lifts cs T T2 → lifts (❨l, m❩; cs) T1 T2 . interpretation "generic relocation (term)" @@ -38,7 +39,7 @@ lemma lifts_inv_nil: ∀T1,T2. ⬆*[◊] T1 ≡ T2 → T1 = T2. /2 width=3 by lifts_inv_nil_aux/ qed-. fact lifts_inv_cons_aux: ∀T1,T2,cs. ⬆*[cs] T1 ≡ T2 → - ∀l,m,tl. cs = {l, m} @ tl → + ∀l,m,tl. cs = ❨l, m❩; tl → ∃∃T. ⬆[l, m] T1 ≡ T & ⬆*[tl] T ≡ T2. #T1 #T2 #cs * -T1 -T2 -cs [ #T #l #m #tl #H destruct @@ -46,11 +47,10 @@ fact lifts_inv_cons_aux: ∀T1,T2,cs. ⬆*[cs] T1 ≡ T2 → /2 width=3 by ex2_intro/ qed-. -lemma lifts_inv_cons: ∀T1,T2,l,m,cs. ⬆*[{l, m} @ cs] T1 ≡ T2 → +lemma lifts_inv_cons: ∀T1,T2,l,m,cs. ⬆*[❨l, m❩; cs] T1 ≡ T2 → ∃∃T. ⬆[l, m] T1 ≡ T & ⬆*[cs] T ≡ T2. /2 width=3 by lifts_inv_cons_aux/ qed-. -(* Basic_1: was: lift1_sort *) lemma lifts_inv_sort1: ∀T2,k,cs. ⬆*[cs] ⋆k ≡ T2 → T2 = ⋆k. #T2 #k #cs elim cs -cs [ #H <(lifts_inv_nil … H) -H // @@ -60,9 +60,8 @@ lemma lifts_inv_sort1: ∀T2,k,cs. ⬆*[cs] ⋆k ≡ T2 → T2 = ⋆k. ] qed-. -(* Basic_1: was: lift1_lref *) lemma lifts_inv_lref1: ∀T2,cs,i1. ⬆*[cs] #i1 ≡ T2 → - ∃∃i2. @⦃i1, cs⦄ ≡ i2 & T2 = #i2. + ∃∃i2. @❪i1, cs❫ ≘ i2 & T2 = #i2. #T2 #cs elim cs -cs [ #i1 #H <(lifts_inv_nil … H) -H /2 width=3 by at_nil, ex2_intro/ | #l #m #cs #IH #i1 #H @@ -81,7 +80,6 @@ lemma lifts_inv_gref1: ∀T2,p,cs. ⬆*[cs] §p ≡ T2 → T2 = §p. ] qed-. -(* Basic_1: was: lift1_bind *) lemma lifts_inv_bind1: ∀a,I,T2,cs,V1,U1. ⬆*[cs] ⓑ{a,I} V1. U1 ≡ T2 → ∃∃V2,U2. ⬆*[cs] V1 ≡ V2 & ⬆*[cs + 1] U1 ≡ U2 & T2 = ⓑ{a,I} V2. U2. @@ -96,7 +94,6 @@ lemma lifts_inv_bind1: ∀a,I,T2,cs,V1,U1. ⬆*[cs] ⓑ{a,I} V1. U1 ≡ T2 → ] qed-. -(* Basic_1: was: lift1_flat *) lemma lifts_inv_flat1: ∀I,T2,cs,V1,U1. ⬆*[cs] ⓕ{I} V1. U1 ≡ T2 → ∃∃V2,U2. ⬆*[cs] V1 ≡ V2 & ⬆*[cs] U1 ≡ U2 & T2 = ⓕ{I} V2. U2.