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 "nat_ordered_set.ma".
16 include "models/q_bars.ma".
18 axiom le_le_eq: ∀x,y:Q. x ≤ y → y ≤ x → x = y.
20 lemma initial_shift_same_values:
21 ∀l1:q_f.∀init.init < start l1 →
23 (mk_q_f init (〈\fst (unpos (start l1 - init) ?),OQ〉:: bars l1)).
24 [apply hide; apply q_lt_minus; rewrite > q_plus_sym; rewrite > q_plus_OQ; assumption]
25 intros; generalize in ⊢ (? ? (? ? (? ? (? ? ? (? ? ? (? ? %)) ?) ?))); intro;
26 cases (unpos (start l1-init) H1); intro input;
27 simplify in ⊢ (? ? ? (? ? ? (? ? ? (? (? ? (? ? (? ? ? % ?) ?)) ?))));
28 cases (value (mk_q_f init (〈w,OQ〉::bars l1)) input);
29 simplify in ⊢ (? ? ? (? ? ? %));
30 cases (q_cmp input (start (mk_q_f init (〈w,OQ〉::bars l1)))) in H3;
31 whd in ⊢ (% → ?); simplify in H3;
32 [1: intro; cases H4; clear H4; rewrite > H3;
33 cases (value l1 init); simplify; cases (q_cmp init (start l1)) in H4;
34 [1: cases (?:False); apply (q_lt_corefl init); rewrite > H4 in ⊢ (?? %); apply H;
35 |3: cases (?:False); apply (q_lt_antisym init (start l1)); assumption;
36 |2: whd in ⊢ (% → ?); intro; rewrite > H8; clear H8 H4;
37 rewrite > H7; clear H7; rewrite > (?:\fst w1 = O); [reflexivity]
38 symmetry; apply le_n_O_to_eq;
39 rewrite > (sum_bases_O (〈w,OQ〉::bars l1) (\fst w1)); [apply le_n]
40 clear H6 w2; simplify in H5:(? ? (? ? %));
41 destruct H3; rewrite > q_d_x_x in H5; assumption;]
42 |2: intros; cases (value l1 input); simplify in ⊢ (? ? (? ? ? %) ?);
43 cases (q_cmp input (start l1)) in H5; whd in ⊢ (% → ?);
44 [1: cases (?:False); clear w2 H4 w1 H2 w H1;
45 apply (q_lt_antisym init (start l1)); [assumption] rewrite < H5; assumption
46 |2: intros; rewrite > H6; clear H6; rewrite > H4; reflexivity;
47 |3: cases (?:False); apply (q_lt_antisym input (start l1)); [2: assumption]
48 apply (q_lt_trans ??? H3 H);]
49 |3: intro; cases H4; clear H4;
50 cases (value l1 input); simplify; cases (q_cmp input (start l1)) in H4; whd in ⊢ (% → ?);
51 [1: intro; cases H8; clear H8; rewrite > H11; rewrite > H7; clear H11 H7;
52 simplify in ⊢ (? ? ? (? ? ? (? ? % ? ?)));
53 cut (\fst w1 = S (\fst w2)) as Key; [rewrite > Key; reflexivity;]
54 cut (\fst w2 = O); [2: clear H10;
55 symmetry; apply le_n_O_to_eq; rewrite > (sum_bases_O (bars l1) (\fst w2)); [apply le_n]
56 apply (q_le_trans ??? H9); rewrite < H4; rewrite > q_d_x_x;
57 apply q_eq_to_le; reflexivity;]
58 rewrite > Hcut; clear Hcut H10 H9; simplify in H5 H6;
59 cut (ⅆ[input,init] = Qpos w) as E; [2:
60 rewrite > H2; rewrite < H4; rewrite > q_d_sym;
61 rewrite > q_d_noabs; [reflexivity] apply q_lt_to_le; assumption;]
62 cases (\fst w1) in H5 H6; intros;
63 [1: cases (?:False); clear H5; simplify in H6;
64 apply (q_lt_corefl ⅆ[input,init]);
65 rewrite > E in ⊢ (??%); rewrite < q_plus_OQ in ⊢ (??%);
66 rewrite > q_plus_sym; assumption;
67 |2: cases n in H5 H6; [intros; reflexivity] intros;
68 cases (?:False); clear H6; cases (bars l1) in H5; simplify; intros;
69 [apply (q_pos_OQ one);|apply (q_pos_OQ (\fst b));]
70 apply (q_le_S ??? (sum_bases_ge_OQ ? n1));[apply []|3:apply l]
71 simplify in ⊢ (? (? (? % ?) ?) ?); rewrite < (q_plus_minus (Qpos w));
72 rewrite > q_elim_minus; apply q_le_minus_r;
73 rewrite > q_elim_opp; rewrite < E in ⊢ (??%); assumption;]
74 |2: intros; rewrite > H8; rewrite > H7; clear H8 H7;
75 simplify in H5 H6 ⊢ %;
76 cases (\fst w1) in H5 H6; [intros; reflexivity]
78 [1: intros; simplify; elim n [reflexivity] simplify; assumption;
79 |2: simplify; intros; cases (?:False); clear H6;
80 apply (q_lt_le_incompat (input - init) (Qpos w) );
81 [1: rewrite > H2; do 2 rewrite > q_elim_minus;
82 apply q_lt_plus; rewrite > q_elim_minus;
83 rewrite < q_plus_assoc; rewrite < q_elim_minus;
84 rewrite > q_plus_minus;rewrite > q_plus_OQ; assumption;
85 |2: rewrite < q_d_noabs; [2: apply q_lt_to_le; assumption]
88 ; apply (q_le_S ???? H5);apply sum_bases_ge_OQ;]]
89 |3: intro; cases H8; clear H8; rewrite > H11; rewrite > H7; clear H11 H7;
90 simplify in H5 H6 ⊢ (? ? ? (? ? ? (? ? % ? ?)));
92 axiom nth_nil: ∀T,n.∀d:T. nth [] d n = d.
98 ⅆ[input,init] < sum_bases l O + (st-init) → False.
99 intros 6; rewrite > q_d_sym; rewrite > q_d_noabs; [2:
100 apply (q_le_trans ? st); apply q_lt_to_le; assumption]
101 do 2 rewrite > q_elim_minus; rewrite > q_plus_assoc;
102 intro X; lapply (q_lt_canc_plus_r ??? X) as Y;
103 simplify in Y; cases (?:False);
104 apply (q_lt_corefl st); apply (q_lt_trans ??? H1);
105 apply (q_lt_le_trans ??? Y); rewrite > q_plus_sym; rewrite > q_plus_OQ;
106 apply q_eq_to_le; reflexivity;
110 ∀a,l1,init,st,input,n.
111 init < st → st < input →
112 sum_bases (a::l1) n + (st-init) ≤ ⅆ[input,init] →
113 ⅆ[input,st] < sum_bases l1 O + Qpos (\fst a) →
115 intros; cut (input - st < Qpos (\fst a)) as H6';[2:
116 rewrite < q_d_noabs;[2:apply q_lt_to_le; assumption]
117 rewrite > q_d_sym; apply (q_lt_le_trans ??? H3);
118 rewrite > q_plus_sym; rewrite > q_plus_OQ;
119 apply q_eq_to_le; reflexivity] clear H3;
120 generalize in match H2; rewrite > q_d_sym; rewrite > q_d_noabs;
121 [2: apply (q_le_trans ? st); apply q_lt_to_le; assumption]
122 do 2 rewrite > q_elim_minus; rewrite > q_plus_assoc; intro X;
123 lapply (q_le_canc_plus_r ??? X) as Y; clear X;
124 lapply (q_le_inj_plus_r ?? (Qopp st) Y) as X; clear Y;
125 cut (input + Qopp st < Qpos (\fst a)) as H6'';
126 [2: rewrite < q_elim_minus; assumption;] clear H6';
127 generalize in match (q_le_lt_trans ??? X H6''); clear X H6'';
128 rewrite < q_plus_assoc; rewrite < q_elim_minus;
129 rewrite > q_plus_minus; rewrite > q_plus_OQ; cases n; intro X; [reflexivity]
131 apply (q_lt_le_incompat (sum_bases l1 n1) OQ);[2: apply sum_bases_ge_OQ;]
132 apply (q_lt_canc_plus_r ?? (Qpos (\fst a)));
133 rewrite >(q_plus_sym OQ); rewrite > q_plus_OQ; apply X;
137 ∀init,st,input,l1,a,n.
139 ⅆ[input,init]<OQ+Qpos a+(st-init) →
140 sum_bases l1 n+Qpos a≤ⅆ[input,st] → False.
142 cut (sum_bases l1 n - ⅆ[input,st] < Qopp ⅆ[input,init] + (st - init)); [2:
143 cut (sum_bases l1 n≤ⅆ[input,st]-Qpos a) as H7';[2:
144 apply (q_le_canc_plus_r ?? (Qpos a));
145 apply (q_le_trans ??? H3); rewrite > q_elim_minus;
146 rewrite < q_plus_assoc; rewrite > (q_plus_sym (Qopp ?));
147 rewrite < q_elim_minus; rewrite > q_plus_minus; rewrite > q_plus_OQ;
148 apply q_eq_to_le; reflexivity;] clear H3;
149 rewrite > q_elim_minus; apply (q_lt_canc_plus_r ?? ⅆ[input,st]);
150 rewrite < q_plus_assoc; rewrite > (q_plus_sym (Qopp ?));
151 rewrite < q_elim_minus; rewrite > q_plus_minus; rewrite > q_plus_OQ;
152 apply (q_le_lt_trans ??? H7'); clear H7'; rewrite > q_elim_minus;
153 rewrite > q_plus_sym; apply q_lt_inj_plus_r;
154 rewrite > q_plus_sym; apply q_lt_plus; rewrite > q_elim_opp;
155 rewrite > q_plus_sym; apply (q_lt_canc_plus_r ?? (Qpos a));
156 rewrite < q_plus_assoc; rewrite > (q_plus_sym (Qopp ?));
157 rewrite < q_elim_minus; rewrite > q_plus_minus; rewrite > q_plus_OQ;
158 apply (q_lt_le_trans ??? H2); rewrite > (q_plus_sym OQ); rewrite > q_plus_OQ;
159 rewrite > q_plus_sym; apply q_eq_to_le; reflexivity;]
160 generalize in match Hcut; clear H2 H3 Hcut;
161 rewrite > q_d_sym; rewrite > q_d_noabs; [2:apply q_lt_to_le; assumption]
162 rewrite > q_d_sym; rewrite > q_d_noabs; [2: apply (q_le_trans ? st); apply q_lt_to_le; assumption]
163 rewrite < q_plus_sym; rewrite < q_elim_minus;
164 rewrite > (q_elim_minus input init);
165 rewrite > q_minus_distrib; rewrite > q_elim_opp;
166 rewrite > (q_elim_minus input st);
167 rewrite > q_minus_distrib; rewrite > q_elim_opp;
168 repeat rewrite > q_elim_minus;
169 rewrite < q_plus_assoc in ⊢ (??% → ?);
170 rewrite > (q_plus_sym (Qopp input) init);
171 rewrite > q_plus_assoc;
172 rewrite < q_plus_assoc in ⊢ (??(?%?) → ?);
173 rewrite > (q_plus_sym (Qopp init) init);
174 rewrite < (q_elim_minus init); rewrite >q_plus_minus;
175 rewrite > q_plus_OQ; rewrite > (q_plus_sym st);
176 rewrite < q_plus_assoc;
177 rewrite < (q_plus_OQ (Qopp input + st)) in ⊢ (??% → ?);
178 rewrite > (q_plus_sym ? OQ); intro X;
179 lapply (q_lt_canc_plus_r ??? X) as Y; clear X;
180 apply (q_lt_le_incompat ?? Y); apply sum_bases_ge_OQ;
184 ∀init,input,l1,w1,w2,w.
185 Qpos w = start l1 - init →
188 sum_bases (〈w,OQ〉::bars l1) w1 ≤ ⅆ[input,init] →
189 ⅆ[input,init] < sum_bases (bars l1) w1 + (start l1-init) →
190 sum_bases (bars l1) w2 ≤ ⅆ[input,start l1] →
191 ⅆ[input,start l1] < sum_bases (bars l1) (S w2) →
192 \snd (nth (bars l1) ▭ w2) = \snd (nth (〈w,OQ〉::bars l1) ▭ w1).
193 intros 3 (init input l); cases l (st l);
194 change in match (start (mk_q_f st l)) with st;
195 change in match (bars (mk_q_f st l)) with l;
197 [1: rewrite > nth_nil; cases w1 in H4;
198 [1: intro X; cases (case1 ?????? X); assumption;
199 |2: intros; simplify; rewrite > nth_nil; reflexivity;]
200 |2: cases w1 in H4 H5; clear w1;
201 [1: intros (Y X); cases (case1 ?????? X); assumption;
202 |2: intros; simplify in H4 H5 H7 ⊢ %;
203 generalize in match H6; generalize in match H7;
204 generalize in match H4; generalize in match H5; clear H4 H5 H6 H7;
205 apply (nat_elim2 ???? w2 n); clear w2 n; intros;
206 [1: rewrite > (case2 a l1 init st input n); [reflexivity]
207 try rewrite < H1; assumption;
208 |2: simplify in H4 H7; cases (case3 ???????? H4 H7); assumption;
209 |3: (* dipende se vanno oltre la lunghezza di l1,
210 forse dovevo gestire il caso prima dell'induzione *)
211 simplify in ⊢ (? ? (? ? ? %) ?);
212 rewrite > (H (S m) ? w); [reflexivity] try assumption;
219 alias symbol "pi2" = "pair pi2".
220 alias symbol "pi1" = "pair pi1".
221 definition rebase_spec ≝
222 ∀l1,l2:q_f.∃p:q_f × q_f.
224 (*len (bars (\fst p)) = len (bars (\snd p))*)
225 (start (\fst p) = start (\snd p))
226 (same_bases (\fst p) (\snd p))
227 (same_values l1 (\fst p))
228 (same_values l2 (\snd p)).
230 definition rebase_spec_simpl ≝
231 λstart.λl1,l2:list bar.λp:(list bar) × (list bar).
233 (same_bases (mk_q_f start (\fst p)) (mk_q_f start (\snd p)))
234 (same_values (mk_q_f start l1) (mk_q_f start (\fst p)))
235 (same_values (mk_q_f start l2) (mk_q_f start (\snd p))).
237 (* a local letin makes russell fail *)
238 definition cb0h : list bar → list bar ≝
239 λl.mk_list (λi.〈\fst (nth l ▭ i),OQ〉) (len l).
242 λP.λp:∃x:(list bar) × (list bar).P x.match p with [ex_introT p _ ⇒ p].
244 definition inject ≝ λP.λp:(list bar) × (list bar).λh:P p. ex_introT ? P p h.
245 coercion inject with 0 1 nocomposites.
247 definition rebase: rebase_spec.
248 intros 2 (f1 f2); cases f1 (s1 l1); cases f2 (s2 l2); clear f1 f2;
250 λs.λl1,l2.λm.λz.len l1 + len l2 < m → rebase_spec_simpl s l1 l2 z);
251 alias symbol "pi1" (instance 34) = "exT \fst".
252 alias symbol "pi1" (instance 21) = "exT \fst".
254 let rec aux (l1,l2:list bar) (n:nat) on n : (list bar) × (list bar) ≝
256 [ O ⇒ 〈 nil ? , nil ? 〉
259 [ nil ⇒ 〈cb0h l2, l2〉
262 [ nil ⇒ 〈l1, cb0h l1〉
264 let base1 ≝ Qpos (\fst he1) in
265 let base2 ≝ Qpos (\fst he2) in
266 let height1 ≝ (\snd he1) in
267 let height2 ≝ (\snd he2) in
268 match q_cmp base1 base2 with
270 let rc ≝ aux tl1 tl2 m in
271 〈he1 :: \fst rc,he2 :: \snd rc〉
273 let rest ≝ base2 - base1 in
274 let rc ≝ aux tl1 (〈\fst (unpos rest ?),height2〉 :: tl2) m in
275 〈〈\fst he1,height1〉 :: \fst rc,〈\fst he1,height2〉 :: \snd rc〉
277 let rest ≝ base1 - base2 in
278 let rc ≝ aux (〈\fst (unpos rest ?),height1〉 :: tl1) tl2 m in
279 〈〈\fst he2,height1〉 :: \fst rc,〈\fst he2,height2〉 :: \snd rc〉
281 in aux : ∀l1,l2,m.∃z.∀s.spec s l1 l2 m z); unfold spec;
282 [9: clearbody aux; unfold spec in aux; clear spec;
284 [1: cases (aux l1 l2 (S (len l1 + len l2)));
285 cases (H1 s1 (le_n ?)); clear H1;
286 exists [apply 〈mk_q_f s1 (\fst w), mk_q_f s2 (\snd w)〉] split;
288 |3: intro; apply (H3 input);
289 |4: intro; rewrite > H in H4;
290 rewrite > (H4 input); reflexivity;]
291 |2: letin l2' ≝ (〈\fst (unpos (s2-s1) ?),OQ〉::l2);[
292 apply q_lt_minus; rewrite > q_plus_sym; rewrite > q_plus_OQ;
294 cases (aux l1 l2' (S (len l1 + len l2')));
295 cases (H1 s1 (le_n ?)); clear H1 aux;
296 exists [apply 〈mk_q_f s1 (\fst w), mk_q_f s1 (\snd w)〉] split;
300 |4: intro; rewrite < (H4 input); clear H3 H4 H2 w;
301 cases (value (mk_q_f s1 l2') input);
302 cases (q_cmp input (start (mk_q_f s1 l2'))) in H1;
304 [1: intros; cases H2; clear H2; whd in ⊢ (??? %);
305 cases (value (mk_q_f s2 l2) input);
306 cases (q_cmp input (start (mk_q_f s2 l2))) in H2;
308 [1: intros; cases H6; clear H6; change with (w1 = w);
311 |1,2: unfold rest; apply q_lt_minus; rewrite > q_plus_sym; rewrite > q_plus_OQ;
318 |8: intros; cases (?:False); apply (not_le_Sn_O ? H1);]