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-2/grammar/term_weight.ma".
17 (* RELOCATION ***************************************************************)
19 inductive lift: term → nat → nat → term → Prop ≝
20 | lift_sort : ∀k,d,e. lift (⋆k) d e (⋆k)
21 | lift_lref_lt: ∀i,d,e. i < d → lift (#i) d e (#i)
22 | lift_lref_ge: ∀i,d,e. d ≤ i → lift (#i) d e (#(i + e))
23 | lift_bind : ∀I,V1,V2,T1,T2,d,e.
24 lift V1 d e V2 → lift T1 (d + 1) e T2 →
25 lift (𝕓{I} V1. T1) d e (𝕓{I} V2. T2)
26 | lift_flat : ∀I,V1,V2,T1,T2,d,e.
27 lift V1 d e V2 → lift T1 d e T2 →
28 lift (𝕗{I} V1. T1) d e (𝕗{I} V2. T2)
31 interpretation "relocation" 'RLift T1 d e T2 = (lift T1 d e T2).
33 (* Basic properties *********************************************************)
35 lemma lift_lref_ge_minus: ∀d,e,i. d + e ≤ i → ↑[d, e] #(i - e) ≡ #i.
36 #d #e #i #H >(plus_minus_m_m i e) in ⊢ (? ? ? ? %) /3/
39 lemma lift_refl: ∀T,d. ↑[d, 0] T ≡ T.
41 [ * #i // #d elim (lt_or_ge i d) /2/
46 lemma lift_total: ∀T1,d,e. ∃T2. ↑[d,e] T1 ≡ T2.
48 [ * #i /2/ #d #e elim (lt_or_ge i d) /3/
49 | * #I #V1 #T1 #IHV1 #IHT1 #d #e
50 elim (IHV1 d e) -IHV1 #V2 #HV12
51 [ elim (IHT1 (d+1) e) -IHT1 /3/
52 | elim (IHT1 d e) -IHT1 /3/
57 lemma lift_split: ∀d1,e2,T1,T2. ↑[d1, e2] T1 ≡ T2 → ∀d2,e1.
58 d1 ≤ d2 → d2 ≤ d1 + e1 → e1 ≤ e2 →
59 ∃∃T. ↑[d1, e1] T1 ≡ T & ↑[d2, e2 - e1] T ≡ T2.
60 #d1 #e2 #T1 #T2 #H elim H -H d1 e2 T1 T2
62 | #i #d1 #e2 #Hid1 #d2 #e1 #Hd12 #_ #_
63 lapply (lt_to_le_to_lt … Hid1 Hd12) -Hd12 #Hid2 /4/
64 | #i #d1 #e2 #Hid1 #d2 #e1 #_ #Hd21 #He12
65 lapply (transitive_le …(i+e1) Hd21 ?) /2/ -Hd21 #Hd21
66 <(arith_d1 i e2 e1) // /3/
67 | #I #V1 #V2 #T1 #T2 #d1 #e2 #_ #_ #IHV #IHT #d2 #e1 #Hd12 #Hd21 #He12
68 elim (IHV … Hd12 Hd21 He12) -IHV #V0 #HV0a #HV0b
69 elim (IHT (d2+1) … ? ? He12) /3 width = 5/
70 | #I #V1 #V2 #T1 #T2 #d1 #e2 #_ #_ #IHV #IHT #d2 #e1 #Hd12 #Hd21 #He12
71 elim (IHV … Hd12 Hd21 He12) -IHV #V0 #HV0a #HV0b
72 elim (IHT d2 … ? ? He12) /3 width = 5/
76 (* Basic forward lemmas *****************************************************)
78 lemma tw_lift: ∀d,e,T1,T2. ↑[d, e] T1 ≡ T2 → #[T1] = #[T2].
79 #d #e #T1 #T2 #H elim H -d e T1 T2; normalize //
82 (* Basic inversion lemmas ***************************************************)
84 fact lift_inv_refl_aux: ∀d,e,T1,T2. ↑[d, e] T1 ≡ T2 → e = 0 → T1 = T2.
85 #d #e #T1 #T2 #H elim H -H d e T1 T2 /3/
88 lemma lift_inv_refl: ∀d,T1,T2. ↑[d, 0] T1 ≡ T2 → T1 = T2.
91 fact lift_inv_sort1_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 → ∀k. T1 = ⋆k → T2 = ⋆k.
92 #d #e #T1 #T2 * -d e T1 T2 //
93 [ #i #d #e #_ #k #H destruct
94 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #k #H destruct
95 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #k #H destruct
99 lemma lift_inv_sort1: ∀d,e,T2,k. ↑[d,e] ⋆k ≡ T2 → T2 = ⋆k.
102 fact lift_inv_lref1_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 → ∀i. T1 = #i →
103 (i < d ∧ T2 = #i) ∨ (d ≤ i ∧ T2 = #(i + e)).
104 #d #e #T1 #T2 * -d e T1 T2
105 [ #k #d #e #i #H destruct
106 | #j #d #e #Hj #i #Hi destruct /3/
107 | #j #d #e #Hj #i #Hi destruct /3/
108 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #i #H destruct
109 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #i #H destruct
113 lemma lift_inv_lref1: ∀d,e,T2,i. ↑[d,e] #i ≡ T2 →
114 (i < d ∧ T2 = #i) ∨ (d ≤ i ∧ T2 = #(i + e)).
117 lemma lift_inv_lref1_lt: ∀d,e,T2,i. ↑[d,e] #i ≡ T2 → i < d → T2 = #i.
118 #d #e #T2 #i #H elim (lift_inv_lref1 … H) -H * //
119 #Hdi #_ #Hid lapply (le_to_lt_to_lt … Hdi Hid) -Hdi Hid #Hdd
120 elim (lt_refl_false … Hdd)
123 lemma lift_inv_lref1_ge: ∀d,e,T2,i. ↑[d,e] #i ≡ T2 → d ≤ i → T2 = #(i + e).
124 #d #e #T2 #i #H elim (lift_inv_lref1 … H) -H * //
125 #Hid #_ #Hdi lapply (le_to_lt_to_lt … Hdi Hid) -Hdi Hid #Hdd
126 elim (lt_refl_false … Hdd)
129 fact lift_inv_bind1_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 →
130 ∀I,V1,U1. T1 = 𝕓{I} V1.U1 →
131 ∃∃V2,U2. ↑[d,e] V1 ≡ V2 & ↑[d+1,e] U1 ≡ U2 &
133 #d #e #T1 #T2 * -d e T1 T2
134 [ #k #d #e #I #V1 #U1 #H destruct
135 | #i #d #e #_ #I #V1 #U1 #H destruct
136 | #i #d #e #_ #I #V1 #U1 #H destruct
137 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V1 #U1 #H destruct /2 width=5/
138 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V1 #U1 #H destruct
142 lemma lift_inv_bind1: ∀d,e,T2,I,V1,U1. ↑[d,e] 𝕓{I} V1. U1 ≡ T2 →
143 ∃∃V2,U2. ↑[d,e] V1 ≡ V2 & ↑[d+1,e] U1 ≡ U2 &
147 fact lift_inv_flat1_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 →
148 ∀I,V1,U1. T1 = 𝕗{I} V1.U1 →
149 ∃∃V2,U2. ↑[d,e] V1 ≡ V2 & ↑[d,e] U1 ≡ U2 &
151 #d #e #T1 #T2 * -d e T1 T2
152 [ #k #d #e #I #V1 #U1 #H destruct
153 | #i #d #e #_ #I #V1 #U1 #H destruct
154 | #i #d #e #_ #I #V1 #U1 #H destruct
155 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V1 #U1 #H destruct
156 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V1 #U1 #H destruct /2 width=5/
160 lemma lift_inv_flat1: ∀d,e,T2,I,V1,U1. ↑[d,e] 𝕗{I} V1. U1 ≡ T2 →
161 ∃∃V2,U2. ↑[d,e] V1 ≡ V2 & ↑[d,e] U1 ≡ U2 &
165 fact lift_inv_sort2_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 → ∀k. T2 = ⋆k → T1 = ⋆k.
166 #d #e #T1 #T2 * -d e T1 T2 //
167 [ #i #d #e #_ #k #H destruct
168 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #k #H destruct
169 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #k #H destruct
173 lemma lift_inv_sort2: ∀d,e,T1,k. ↑[d,e] T1 ≡ ⋆k → T1 = ⋆k.
176 fact lift_inv_lref2_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 → ∀i. T2 = #i →
177 (i < d ∧ T1 = #i) ∨ (d + e ≤ i ∧ T1 = #(i - e)).
178 #d #e #T1 #T2 * -d e T1 T2
179 [ #k #d #e #i #H destruct
180 | #j #d #e #Hj #i #Hi destruct /3/
181 | #j #d #e #Hj #i #Hi destruct <minus_plus_m_m /4/
182 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #i #H destruct
183 | #I #V1 #V2 #T1 #T2 #d #e #_ #_ #i #H destruct
187 lemma lift_inv_lref2: ∀d,e,T1,i. ↑[d,e] T1 ≡ #i →
188 (i < d ∧ T1 = #i) ∨ (d + e ≤ i ∧ T1 = #(i - e)).
191 lemma lift_inv_lref2_lt: ∀d,e,T1,i. ↑[d,e] T1 ≡ #i → i < d → T1 = #i.
192 #d #e #T1 #i #H elim (lift_inv_lref2 … H) -H * //
193 #Hdi #_ #Hid lapply (le_to_lt_to_lt … Hdi Hid) -Hdi Hid #Hdd
194 elim (plus_lt_false … Hdd)
197 lemma lift_inv_lref2_ge: ∀d,e,T1,i. ↑[d,e] T1 ≡ #i → d + e ≤ i → T1 = #(i - e).
198 #d #e #T1 #i #H elim (lift_inv_lref2 … H) -H * //
199 #Hid #_ #Hdi lapply (le_to_lt_to_lt … Hdi Hid) -Hdi Hid #Hdd
200 elim (plus_lt_false … Hdd)
203 fact lift_inv_bind2_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 →
204 ∀I,V2,U2. T2 = 𝕓{I} V2.U2 →
205 ∃∃V1,U1. ↑[d,e] V1 ≡ V2 & ↑[d+1,e] U1 ≡ U2 &
207 #d #e #T1 #T2 * -d e T1 T2
208 [ #k #d #e #I #V2 #U2 #H destruct
209 | #i #d #e #_ #I #V2 #U2 #H destruct
210 | #i #d #e #_ #I #V2 #U2 #H destruct
211 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V2 #U2 #H destruct /2 width=5/
212 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V2 #U2 #H destruct
216 lemma lift_inv_bind2: ∀d,e,T1,I,V2,U2. ↑[d,e] T1 ≡ 𝕓{I} V2. U2 →
217 ∃∃V1,U1. ↑[d,e] V1 ≡ V2 & ↑[d+1,e] U1 ≡ U2 &
221 fact lift_inv_flat2_aux: ∀d,e,T1,T2. ↑[d,e] T1 ≡ T2 →
222 ∀I,V2,U2. T2 = 𝕗{I} V2.U2 →
223 ∃∃V1,U1. ↑[d,e] V1 ≡ V2 & ↑[d,e] U1 ≡ U2 &
225 #d #e #T1 #T2 * -d e T1 T2
226 [ #k #d #e #I #V2 #U2 #H destruct
227 | #i #d #e #_ #I #V2 #U2 #H destruct
228 | #i #d #e #_ #I #V2 #U2 #H destruct
229 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V2 #U2 #H destruct
230 | #J #W1 #W2 #T1 #T2 #d #e #HW #HT #I #V2 #U2 #H destruct /2 width = 5/
234 lemma lift_inv_flat2: ∀d,e,T1,I,V2,U2. ↑[d,e] T1 ≡ 𝕗{I} V2. U2 →
235 ∃∃V1,U1. ↑[d,e] V1 ≡ V2 & ↑[d,e] U1 ≡ U2 &