1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 include "basic_2A/notation/relations/rliftstar_3.ma".
16 include "basic_2A/substitution/lift.ma".
17 include "basic_2A/multiple/mr2_plus.ma".
19 (* GENERIC TERM RELOCATION **************************************************)
21 inductive lifts: list2 nat nat → relation term ≝
22 | lifts_nil : ∀T. lifts (◊) T T
23 | lifts_cons: ∀T1,T,T2,cs,l,m.
24 ⬆[l,m] T1 ≡ T → lifts cs T T2 → lifts ({l, m} @ cs) T1 T2
27 interpretation "generic relocation (term)"
28 'RLiftStar cs T1 T2 = (lifts cs T1 T2).
30 (* Basic inversion lemmas ***************************************************)
32 fact lifts_inv_nil_aux: ∀T1,T2,cs. ⬆*[cs] T1 ≡ T2 → cs = ◊ → T1 = T2.
33 #T1 #T2 #cs * -T1 -T2 -cs //
34 #T1 #T #T2 #l #m #cs #_ #_ #H destruct
37 lemma lifts_inv_nil: ∀T1,T2. ⬆*[◊] T1 ≡ T2 → T1 = T2.
38 /2 width=3 by lifts_inv_nil_aux/ qed-.
40 fact lifts_inv_cons_aux: ∀T1,T2,cs. ⬆*[cs] T1 ≡ T2 →
41 ∀l,m,tl. cs = {l, m} @ tl →
42 ∃∃T. ⬆[l, m] T1 ≡ T & ⬆*[tl] T ≡ T2.
43 #T1 #T2 #cs * -T1 -T2 -cs
44 [ #T #l #m #tl #H destruct
45 | #T1 #T #T2 #cs #l #m #HT1 #HT2 #l0 #m0 #tl #H destruct
46 /2 width=3 by ex2_intro/
49 lemma lifts_inv_cons: ∀T1,T2,l,m,cs. ⬆*[{l, m} @ cs] T1 ≡ T2 →
50 ∃∃T. ⬆[l, m] T1 ≡ T & ⬆*[cs] T ≡ T2.
51 /2 width=3 by lifts_inv_cons_aux/ qed-.
53 (* Basic_1: was: lift1_sort *)
54 lemma lifts_inv_sort1: ∀T2,k,cs. ⬆*[cs] ⋆k ≡ T2 → T2 = ⋆k.
55 #T2 #k #cs elim cs -cs
56 [ #H <(lifts_inv_nil … H) -H //
58 elim (lifts_inv_cons … H) -H #X #H
59 >(lift_inv_sort1 … H) -H /2 width=1 by/
63 (* Basic_1: was: lift1_lref *)
64 lemma lifts_inv_lref1: ∀T2,cs,i1. ⬆*[cs] #i1 ≡ T2 →
65 ∃∃i2. @⦃i1, cs⦄ ≡ i2 & T2 = #i2.
67 [ #i1 #H <(lifts_inv_nil … H) -H /2 width=3 by at_nil, ex2_intro/
68 | #l #m #cs #IH #i1 #H
69 elim (lifts_inv_cons … H) -H #X #H1 #H2
70 elim (lift_inv_lref1 … H1) -H1 * #Hli1 #H destruct
71 elim (IH … H2) -IH -H2 /3 width=3 by at_lt, at_ge, ex2_intro/
75 lemma lifts_inv_gref1: ∀T2,p,cs. ⬆*[cs] §p ≡ T2 → T2 = §p.
76 #T2 #p #cs elim cs -cs
77 [ #H <(lifts_inv_nil … H) -H //
79 elim (lifts_inv_cons … H) -H #X #H
80 >(lift_inv_gref1 … H) -H /2 width=1 by/
84 (* Basic_1: was: lift1_bind *)
85 lemma lifts_inv_bind1: ∀a,I,T2,cs,V1,U1. ⬆*[cs] ⓑ{a,I} V1. U1 ≡ T2 →
86 ∃∃V2,U2. ⬆*[cs] V1 ≡ V2 & ⬆*[cs + 1] U1 ≡ U2 &
88 #a #I #T2 #cs elim cs -cs
90 <(lifts_inv_nil … H) -H /2 width=5 by ex3_2_intro, lifts_nil/
91 | #l #m #cs #IHcs #V1 #U1 #H
92 elim (lifts_inv_cons … H) -H #X #H #HT2
93 elim (lift_inv_bind1 … H) -H #V #U #HV1 #HU1 #H destruct
94 elim (IHcs … HT2) -IHcs -HT2 #V2 #U2 #HV2 #HU2 #H destruct
95 /3 width=5 by ex3_2_intro, lifts_cons/
99 (* Basic_1: was: lift1_flat *)
100 lemma lifts_inv_flat1: ∀I,T2,cs,V1,U1. ⬆*[cs] ⓕ{I} V1. U1 ≡ T2 →
101 ∃∃V2,U2. ⬆*[cs] V1 ≡ V2 & ⬆*[cs] U1 ≡ U2 &
103 #I #T2 #cs elim cs -cs
105 <(lifts_inv_nil … H) -H /2 width=5 by ex3_2_intro, lifts_nil/
106 | #l #m #cs #IHcs #V1 #U1 #H
107 elim (lifts_inv_cons … H) -H #X #H #HT2
108 elim (lift_inv_flat1 … H) -H #V #U #HV1 #HU1 #H destruct
109 elim (IHcs … HT2) -IHcs -HT2 #V2 #U2 #HV2 #HU2 #H destruct
110 /3 width=5 by ex3_2_intro, lifts_cons/
114 (* Basic forward lemmas *****************************************************)
116 lemma lifts_simple_dx: ∀T1,T2,cs. ⬆*[cs] T1 ≡ T2 → 𝐒⦃T1⦄ → 𝐒⦃T2⦄.
117 #T1 #T2 #cs #H elim H -T1 -T2 -cs /3 width=5 by lift_simple_dx/
120 lemma lifts_simple_sn: ∀T1,T2,cs. ⬆*[cs] T1 ≡ T2 → 𝐒⦃T2⦄ → 𝐒⦃T1⦄.
121 #T1 #T2 #cs #H elim H -T1 -T2 -cs /3 width=5 by lift_simple_sn/
124 (* Basic properties *********************************************************)
126 lemma lifts_bind: ∀a,I,T2,V1,V2,cs. ⬆*[cs] V1 ≡ V2 →
127 ∀T1. ⬆*[cs + 1] T1 ≡ T2 →
128 ⬆*[cs] ⓑ{a,I} V1. T1 ≡ ⓑ{a,I} V2. T2.
129 #a #I #T2 #V1 #V2 #cs #H elim H -V1 -V2 -cs
130 [ #V #T1 #H >(lifts_inv_nil … H) -H //
131 | #V1 #V #V2 #cs #l #m #HV1 #_ #IHV #T1 #H
132 elim (lifts_inv_cons … H) -H /3 width=3 by lift_bind, lifts_cons/
136 lemma lifts_flat: ∀I,T2,V1,V2,cs. ⬆*[cs] V1 ≡ V2 →
137 ∀T1. ⬆*[cs] T1 ≡ T2 →
138 ⬆*[cs] ⓕ{I} V1. T1 ≡ ⓕ{I} V2. T2.
139 #I #T2 #V1 #V2 #cs #H elim H -V1 -V2 -cs
140 [ #V #T1 #H >(lifts_inv_nil … H) -H //
141 | #V1 #V #V2 #cs #l #m #HV1 #_ #IHV #T1 #H
142 elim (lifts_inv_cons … H) -H /3 width=3 by lift_flat, lifts_cons/
146 lemma lifts_total: ∀cs,T1. ∃T2. ⬆*[cs] T1 ≡ T2.
147 #cs elim cs -cs /2 width=2 by lifts_nil, ex_intro/
148 #l #m #cs #IH #T1 elim (lift_total T1 l m)
149 #T #HT1 elim (IH T) -IH /3 width=4 by lifts_cons, ex_intro/