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/lenv_weight.ma".
16 include "Basic_2/grammar/lsubs.ma".
17 include "Basic_2/substitution/lift.ma".
19 (* DROPPING *****************************************************************)
21 (* Basic_1: includes: ldrop_skip_bind *)
22 inductive ldrop: nat → nat → relation lenv ≝
23 | ldrop_atom: ∀d,e. ldrop d e (⋆) (⋆)
24 | ldrop_pair: ∀L,I,V. ldrop 0 0 (L. 𝕓{I} V) (L. 𝕓{I} V)
25 | ldrop_ldrop: ∀L1,L2,I,V,e. ldrop 0 e L1 L2 → ldrop 0 (e + 1) (L1. 𝕓{I} V) L2
26 | ldrop_skip: ∀L1,L2,I,V1,V2,d,e.
27 ldrop d e L1 L2 → ↑[d,e] V2 ≡ V1 →
28 ldrop (d + 1) e (L1. 𝕓{I} V1) (L2. 𝕓{I} V2)
31 interpretation "ldropping" 'RDrop d e L1 L2 = (ldrop d e L1 L2).
33 (* Basic inversion lemmas ***************************************************)
35 fact ldrop_inv_refl_aux: ∀d,e,L1,L2. ↓[d, e] L1 ≡ L2 → d = 0 → e = 0 → L1 = L2.
36 #d #e #L1 #L2 * -d e L1 L2
39 | #L1 #L2 #I #V #e #_ #_ #H
40 elim (plus_S_eq_O_false … H)
41 | #L1 #L2 #I #V1 #V2 #d #e #_ #_ #H
42 elim (plus_S_eq_O_false … H)
46 (* Basic_1: was: ldrop_gen_refl *)
47 lemma ldrop_inv_refl: ∀L1,L2. ↓[0, 0] L1 ≡ L2 → L1 = L2.
50 fact ldrop_inv_atom1_aux: ∀d,e,L1,L2. ↓[d, e] L1 ≡ L2 → L1 = ⋆ →
52 #d #e #L1 #L2 * -d e L1 L2
54 | #L #I #V #H destruct
55 | #L1 #L2 #I #V #e #_ #H destruct
56 | #L1 #L2 #I #V1 #V2 #d #e #_ #_ #H destruct
60 (* Basic_1: was: ldrop_gen_sort *)
61 lemma ldrop_inv_atom1: ∀d,e,L2. ↓[d, e] ⋆ ≡ L2 → L2 = ⋆.
64 fact ldrop_inv_O1_aux: ∀d,e,L1,L2. ↓[d, e] L1 ≡ L2 → d = 0 →
65 ∀K,I,V. L1 = K. 𝕓{I} V →
66 (e = 0 ∧ L2 = K. 𝕓{I} V) ∨
67 (0 < e ∧ ↓[d, e - 1] K ≡ L2).
68 #d #e #L1 #L2 * -d e L1 L2
69 [ #d #e #_ #K #I #V #H destruct
70 | #L #I #V #_ #K #J #W #HX destruct -L I V /3/
71 | #L1 #L2 #I #V #e #HL12 #_ #K #J #W #H destruct -L1 I V /3/
72 | #L1 #L2 #I #V1 #V2 #d #e #_ #_ #H elim (plus_S_eq_O_false … H)
76 lemma ldrop_inv_O1: ∀e,K,I,V,L2. ↓[0, e] K. 𝕓{I} V ≡ L2 →
77 (e = 0 ∧ L2 = K. 𝕓{I} V) ∨
78 (0 < e ∧ ↓[0, e - 1] K ≡ L2).
81 (* Basic_1: was: ldrop_gen_ldrop *)
82 lemma ldrop_inv_ldrop1: ∀e,K,I,V,L2.
83 ↓[0, e] K. 𝕓{I} V ≡ L2 → 0 < e → ↓[0, e - 1] K ≡ L2.
84 #e #K #I #V #L2 #H #He
85 elim (ldrop_inv_O1 … H) -H * // #H destruct -e;
86 elim (lt_refl_false … He)
89 fact ldrop_inv_skip1_aux: ∀d,e,L1,L2. ↓[d, e] L1 ≡ L2 → 0 < d →
90 ∀I,K1,V1. L1 = K1. 𝕓{I} V1 →
91 ∃∃K2,V2. ↓[d - 1, e] K1 ≡ K2 &
94 #d #e #L1 #L2 * -d e L1 L2
95 [ #d #e #_ #I #K #V #H destruct
96 | #L #I #V #H elim (lt_refl_false … H)
97 | #L1 #L2 #I #V #e #_ #H elim (lt_refl_false … H)
98 | #X #L2 #Y #Z #V2 #d #e #HL12 #HV12 #_ #I #L1 #V1 #H destruct -X Y Z
103 (* Basic_1: was: ldrop_gen_skip_l *)
104 lemma ldrop_inv_skip1: ∀d,e,I,K1,V1,L2. ↓[d, e] K1. 𝕓{I} V1 ≡ L2 → 0 < d →
105 ∃∃K2,V2. ↓[d - 1, e] K1 ≡ K2 &
106 ↑[d - 1, e] V2 ≡ V1 &
110 fact ldrop_inv_skip2_aux: ∀d,e,L1,L2. ↓[d, e] L1 ≡ L2 → 0 < d →
111 ∀I,K2,V2. L2 = K2. 𝕓{I} V2 →
112 ∃∃K1,V1. ↓[d - 1, e] K1 ≡ K2 &
113 ↑[d - 1, e] V2 ≡ V1 &
115 #d #e #L1 #L2 * -d e L1 L2
116 [ #d #e #_ #I #K #V #H destruct
117 | #L #I #V #H elim (lt_refl_false … H)
118 | #L1 #L2 #I #V #e #_ #H elim (lt_refl_false … H)
119 | #L1 #X #Y #V1 #Z #d #e #HL12 #HV12 #_ #I #L2 #V2 #H destruct -X Y Z
124 (* Basic_1: was: ldrop_gen_skip_r *)
125 lemma ldrop_inv_skip2: ∀d,e,I,L1,K2,V2. ↓[d, e] L1 ≡ K2. 𝕓{I} V2 → 0 < d →
126 ∃∃K1,V1. ↓[d - 1, e] K1 ≡ K2 & ↑[d - 1, e] V2 ≡ V1 &
130 (* Basic properties *********************************************************)
132 (* Basic_1: was by definition: ldrop_refl *)
133 lemma ldrop_refl: ∀L. ↓[0, 0] L ≡ L.
137 lemma ldrop_ldrop_lt: ∀L1,L2,I,V,e.
138 ↓[0, e - 1] L1 ≡ L2 → 0 < e → ↓[0, e] L1. 𝕓{I} V ≡ L2.
139 #L1 #L2 #I #V #e #HL12 #He >(plus_minus_m_m e 1) /2/
142 lemma ldrop_lsubs_ldrop1_abbr: ∀L1,L2,d,e. L1 [d, e] ≼ L2 →
143 ∀K1,V,i. ↓[0, i] L1 ≡ K1. 𝕓{Abbr} V →
145 ∃∃K2. K1 [0, d + e - i - 1] ≼ K2 &
146 ↓[0, i] L2 ≡ K2. 𝕓{Abbr} V.
147 #L1 #L2 #d #e #H elim H -H L1 L2 d e
149 lapply (ldrop_inv_atom1 … H) -H #H destruct
150 | #L1 #L2 #K1 #V #i #_ #_ #H
151 elim (lt_zero_false … H)
152 | #L1 #L2 #V #e #HL12 #IHL12 #K1 #W #i #H #_ #Hie
153 elim (ldrop_inv_O1 … H) -H * #Hi #HLK1
154 [ -IHL12 Hie; destruct -i K1 W;
155 <minus_n_O <minus_plus_m_m /2/
157 elim (IHL12 … HLK1 ? ?) -IHL12 HLK1 // [2: /2/ ] -Hie >arith_g1 // /3/
159 | #L1 #L2 #I #V1 #V2 #e #_ #IHL12 #K1 #W #i #H #_ #Hie
160 elim (ldrop_inv_O1 … H) -H * #Hi #HLK1
161 [ -IHL12 Hie Hi; destruct
162 | elim (IHL12 … HLK1 ? ?) -IHL12 HLK1 // [2: /2/ ] -Hie >arith_g1 // /3/
164 | #L1 #L2 #I1 #I2 #V1 #V2 #d #e #_ #IHL12 #K1 #V #i #H #Hdi >plus_plus_comm_23 #Hide
165 lapply (plus_S_le_to_pos … Hdi) #Hi
166 lapply (ldrop_inv_ldrop1 … H ?) -H // #HLK1
167 elim (IHL12 … HLK1 ? ?) -IHL12 HLK1 [2: /2/ |3: /2/ ] -Hdi Hide >arith_g1 // /3/
171 (* Basic forvard lemmas *****************************************************)
173 (* Basic_1: was: ldrop_S *)
174 lemma ldrop_fwd_ldrop2: ∀L1,I2,K2,V2,e. ↓[O, e] L1 ≡ K2. 𝕓{I2} V2 →
177 [ #I2 #K2 #V2 #e #H lapply (ldrop_inv_atom1 … H) -H #H destruct
178 | #K1 #I1 #V1 #IHL1 #I2 #K2 #V2 #e #H
179 elim (ldrop_inv_O1 … H) -H * #He #H
180 [ -IHL1; destruct -e K2 I2 V2 /2/
181 | @ldrop_ldrop >(plus_minus_m_m e 1) /2/
186 lemma ldrop_fwd_lw: ∀L1,L2,d,e. ↓[d, e] L1 ≡ L2 → #[L2] ≤ #[L1].
187 #L1 #L2 #d #e #H elim H -H L1 L2 d e // normalize
189 | #L1 #L2 #I #V1 #V2 #d #e #_ #HV21 #IHL12
190 >(tw_lift … HV21) -HV21 /2/
194 lemma ldrop_fwd_ldrop2_length: ∀L1,I2,K2,V2,e.
195 ↓[0, e] L1 ≡ K2. 𝕓{I2} V2 → e < |L1|.
197 [ #I2 #K2 #V2 #e #H lapply (ldrop_inv_atom1 … H) -H #H destruct
198 | #K1 #I1 #V1 #IHL1 #I2 #K2 #V2 #e #H
199 elim (ldrop_inv_O1 … H) -H * #He #H
200 [ -IHL1; destruct -e K2 I2 V2 //
201 | lapply (IHL1 … H) -IHL1 H #HeK1 whd in ⊢ (? ? %) /2/
206 lemma ldrop_fwd_O1_length: ∀L1,L2,e. ↓[0, e] L1 ≡ L2 → |L2| = |L1| - e.
208 [ #L2 #e #H >(ldrop_inv_atom1 … H) -H //
209 | #K1 #I1 #V1 #IHL1 #L2 #e #H
210 elim (ldrop_inv_O1 … H) -H * #He #H
211 [ -IHL1; destruct -e L2 //
212 | lapply (IHL1 … H) -IHL1 H #H >H -H; normalize
213 >minus_le_minus_minus_comm //
218 (* Basic_1: removed theorems 49:
220 cimp_flat_sx cimp_flat_dx cimp_bind cimp_getl_conf
221 ldrop_clear ldrop_clear_O ldrop_clear_S
222 clear_gen_sort clear_gen_bind clear_gen_flat clear_gen_flat_r
223 clear_gen_all clear_clear clear_mono clear_trans clear_ctail clear_cle
224 getl_ctail_clen getl_gen_tail clear_getl_trans getl_clear_trans
225 getl_clear_bind getl_clear_conf getl_dec getl_ldrop getl_ldrop_conf_lt
226 getl_ldrop_conf_ge getl_conf_ge_ldrop getl_ldrop_conf_rev
227 ldrop_getl_trans_lt ldrop_getl_trans_le ldrop_getl_trans_ge
228 getl_ldrop_trans getl_flt getl_gen_all getl_gen_sort getl_gen_O
229 getl_gen_S getl_gen_2 getl_gen_flat getl_gen_bind getl_conf_le
230 getl_trans getl_refl getl_head getl_flat getl_ctail getl_mono