1461
|
1 |
(* Title: HOLCF/Dlist.ML
|
|
2 |
Author: Franz Regensburger
|
1274
|
3 |
ID: $ $
|
|
4 |
Copyright 1994 Technische Universitaet Muenchen
|
|
5 |
|
|
6 |
Lemmas for dlist.thy
|
|
7 |
*)
|
|
8 |
|
|
9 |
open Dlist;
|
|
10 |
|
|
11 |
(* ------------------------------------------------------------------------*)
|
|
12 |
(* The isomorphisms dlist_rep_iso and dlist_abs_iso are strict *)
|
|
13 |
(* ------------------------------------------------------------------------*)
|
|
14 |
|
|
15 |
val dlist_iso_strict= dlist_rep_iso RS (dlist_abs_iso RS
|
1461
|
16 |
(allI RSN (2,allI RS iso_strict)));
|
1274
|
17 |
|
|
18 |
val dlist_rews = [dlist_iso_strict RS conjunct1,
|
1461
|
19 |
dlist_iso_strict RS conjunct2];
|
1274
|
20 |
|
|
21 |
(* ------------------------------------------------------------------------*)
|
|
22 |
(* Properties of dlist_copy *)
|
|
23 |
(* ------------------------------------------------------------------------*)
|
|
24 |
|
|
25 |
val temp = prove_goalw Dlist.thy [dlist_copy_def] "dlist_copy`f`UU=UU"
|
|
26 |
(fn prems =>
|
1461
|
27 |
[
|
|
28 |
(asm_simp_tac (!simpset addsimps
|
|
29 |
(dlist_rews @ [dlist_abs_iso,dlist_rep_iso])) 1)
|
|
30 |
]);
|
1274
|
31 |
|
|
32 |
val dlist_copy = [temp];
|
|
33 |
|
|
34 |
|
|
35 |
val temp = prove_goalw Dlist.thy [dlist_copy_def,dnil_def]
|
|
36 |
"dlist_copy`f`dnil=dnil"
|
|
37 |
(fn prems =>
|
1461
|
38 |
[
|
|
39 |
(asm_simp_tac (!simpset addsimps
|
|
40 |
(dlist_rews @ [dlist_abs_iso,dlist_rep_iso])) 1)
|
|
41 |
]);
|
1274
|
42 |
|
|
43 |
val dlist_copy = temp :: dlist_copy;
|
|
44 |
|
|
45 |
|
|
46 |
val temp = prove_goalw Dlist.thy [dlist_copy_def,dcons_def]
|
1461
|
47 |
"xl~=UU ==> dlist_copy`f`(dcons`x`xl)= dcons`x`(f`xl)"
|
1274
|
48 |
(fn prems =>
|
1461
|
49 |
[
|
|
50 |
(cut_facts_tac prems 1),
|
|
51 |
(asm_simp_tac (!simpset addsimps
|
|
52 |
(dlist_rews @ [dlist_abs_iso,dlist_rep_iso])) 1),
|
1675
|
53 |
(case_tac "x=UU" 1),
|
1461
|
54 |
(Asm_simp_tac 1),
|
|
55 |
(asm_simp_tac (!simpset addsimps [defined_spair]) 1)
|
|
56 |
]);
|
1274
|
57 |
|
|
58 |
val dlist_copy = temp :: dlist_copy;
|
|
59 |
|
|
60 |
val dlist_rews = dlist_copy @ dlist_rews;
|
|
61 |
|
|
62 |
(* ------------------------------------------------------------------------*)
|
|
63 |
(* Exhaustion and elimination for dlists *)
|
|
64 |
(* ------------------------------------------------------------------------*)
|
|
65 |
|
|
66 |
qed_goalw "Exh_dlist" Dlist.thy [dcons_def,dnil_def]
|
1461
|
67 |
"l = UU | l = dnil | (? x xl. x~=UU &xl~=UU & l = dcons`x`xl)"
|
1274
|
68 |
(fn prems =>
|
1461
|
69 |
[
|
|
70 |
(Simp_tac 1),
|
|
71 |
(rtac (dlist_rep_iso RS subst) 1),
|
|
72 |
(res_inst_tac [("p","dlist_rep`l")] ssumE 1),
|
|
73 |
(rtac disjI1 1),
|
|
74 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
75 |
(rtac disjI2 1),
|
|
76 |
(rtac disjI1 1),
|
|
77 |
(res_inst_tac [("p","x")] oneE 1),
|
|
78 |
(contr_tac 1),
|
|
79 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
80 |
(rtac disjI2 1),
|
|
81 |
(rtac disjI2 1),
|
|
82 |
(res_inst_tac [("p","y")] sprodE 1),
|
|
83 |
(contr_tac 1),
|
|
84 |
(rtac exI 1),
|
|
85 |
(rtac exI 1),
|
|
86 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
87 |
(fast_tac HOL_cs 1)
|
|
88 |
]);
|
1274
|
89 |
|
|
90 |
|
|
91 |
qed_goal "dlistE" Dlist.thy
|
|
92 |
"[| l=UU ==> Q; l=dnil ==> Q;!!x xl.[|l=dcons`x`xl;x~=UU;xl~=UU|]==>Q|]==>Q"
|
|
93 |
(fn prems =>
|
1461
|
94 |
[
|
|
95 |
(rtac (Exh_dlist RS disjE) 1),
|
|
96 |
(eresolve_tac prems 1),
|
|
97 |
(etac disjE 1),
|
|
98 |
(eresolve_tac prems 1),
|
|
99 |
(etac exE 1),
|
|
100 |
(etac exE 1),
|
|
101 |
(resolve_tac prems 1),
|
|
102 |
(fast_tac HOL_cs 1),
|
|
103 |
(fast_tac HOL_cs 1),
|
|
104 |
(fast_tac HOL_cs 1)
|
|
105 |
]);
|
1274
|
106 |
|
|
107 |
(* ------------------------------------------------------------------------*)
|
|
108 |
(* Properties of dlist_when *)
|
|
109 |
(* ------------------------------------------------------------------------*)
|
|
110 |
|
|
111 |
val temp = prove_goalw Dlist.thy [dlist_when_def] "dlist_when`f1`f2`UU=UU"
|
|
112 |
(fn prems =>
|
1461
|
113 |
[
|
|
114 |
(asm_simp_tac (!simpset addsimps [dlist_iso_strict]) 1)
|
|
115 |
]);
|
1274
|
116 |
|
|
117 |
val dlist_when = [temp];
|
|
118 |
|
|
119 |
val temp = prove_goalw Dlist.thy [dlist_when_def,dnil_def]
|
|
120 |
"dlist_when`f1`f2`dnil= f1"
|
|
121 |
(fn prems =>
|
1461
|
122 |
[
|
|
123 |
(asm_simp_tac (!simpset addsimps [dlist_abs_iso]) 1)
|
|
124 |
]);
|
1274
|
125 |
|
|
126 |
val dlist_when = temp::dlist_when;
|
|
127 |
|
|
128 |
val temp = prove_goalw Dlist.thy [dlist_when_def,dcons_def]
|
|
129 |
"[|x~=UU;xl~=UU|] ==> dlist_when`f1`f2`(dcons`x`xl)= f2`x`xl"
|
|
130 |
(fn prems =>
|
1461
|
131 |
[
|
|
132 |
(cut_facts_tac prems 1),
|
|
133 |
(asm_simp_tac (!simpset addsimps [dlist_abs_iso,defined_spair]) 1)
|
|
134 |
]);
|
1274
|
135 |
|
|
136 |
val dlist_when = temp::dlist_when;
|
|
137 |
|
|
138 |
val dlist_rews = dlist_when @ dlist_rews;
|
|
139 |
|
|
140 |
(* ------------------------------------------------------------------------*)
|
|
141 |
(* Rewrites for discriminators and selectors *)
|
|
142 |
(* ------------------------------------------------------------------------*)
|
|
143 |
|
|
144 |
fun prover defs thm = prove_goalw Dlist.thy defs thm
|
|
145 |
(fn prems =>
|
1461
|
146 |
[
|
|
147 |
(simp_tac (!simpset addsimps dlist_rews) 1)
|
|
148 |
]);
|
1274
|
149 |
|
|
150 |
val dlist_discsel = [
|
1461
|
151 |
prover [is_dnil_def] "is_dnil`UU=UU",
|
|
152 |
prover [is_dcons_def] "is_dcons`UU=UU",
|
|
153 |
prover [dhd_def] "dhd`UU=UU",
|
|
154 |
prover [dtl_def] "dtl`UU=UU"
|
|
155 |
];
|
1274
|
156 |
|
|
157 |
fun prover defs thm = prove_goalw Dlist.thy defs thm
|
|
158 |
(fn prems =>
|
1461
|
159 |
[
|
|
160 |
(cut_facts_tac prems 1),
|
|
161 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
162 |
]);
|
1274
|
163 |
|
|
164 |
val dlist_discsel = [
|
|
165 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
166 |
"is_dnil`dnil=TT",
|
|
167 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
168 |
"[|x~=UU;xl~=UU|] ==> is_dnil`(dcons`x`xl)=FF",
|
|
169 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
170 |
"is_dcons`dnil=FF",
|
|
171 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
172 |
"[|x~=UU;xl~=UU|] ==> is_dcons`(dcons`x`xl)=TT",
|
|
173 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
174 |
"dhd`dnil=UU",
|
|
175 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
176 |
"[|x~=UU;xl~=UU|] ==> dhd`(dcons`x`xl)=x",
|
|
177 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
178 |
"dtl`dnil=UU",
|
|
179 |
prover [is_dnil_def,is_dcons_def,dhd_def,dtl_def]
|
|
180 |
"[|x~=UU;xl~=UU|] ==> dtl`(dcons`x`xl)=xl"] @ dlist_discsel;
|
|
181 |
|
|
182 |
val dlist_rews = dlist_discsel @ dlist_rews;
|
|
183 |
|
|
184 |
(* ------------------------------------------------------------------------*)
|
|
185 |
(* Definedness and strictness *)
|
|
186 |
(* ------------------------------------------------------------------------*)
|
|
187 |
|
|
188 |
fun prover contr thm = prove_goal Dlist.thy thm
|
|
189 |
(fn prems =>
|
1461
|
190 |
[
|
|
191 |
(res_inst_tac [("P1",contr)] classical3 1),
|
|
192 |
(simp_tac (!simpset addsimps dlist_rews) 1),
|
|
193 |
(dtac sym 1),
|
|
194 |
(Asm_simp_tac 1),
|
|
195 |
(simp_tac (!simpset addsimps (prems @ dlist_rews)) 1)
|
|
196 |
]);
|
1274
|
197 |
|
|
198 |
|
|
199 |
val dlist_constrdef = [
|
|
200 |
prover "is_dnil`(UU::'a dlist) ~= UU" "dnil~=(UU::'a dlist)",
|
|
201 |
prover "is_dcons`(UU::'a dlist) ~= UU"
|
1461
|
202 |
"[|x~=UU;xl~=UU|]==>dcons`(x::'a)`xl ~= UU"
|
1274
|
203 |
];
|
|
204 |
|
|
205 |
|
|
206 |
fun prover defs thm = prove_goalw Dlist.thy defs thm
|
|
207 |
(fn prems =>
|
1461
|
208 |
[
|
|
209 |
(simp_tac (!simpset addsimps dlist_rews) 1)
|
|
210 |
]);
|
1274
|
211 |
|
|
212 |
val dlist_constrdef = [
|
1461
|
213 |
prover [dcons_def] "dcons`UU`xl=UU",
|
|
214 |
prover [dcons_def] "dcons`x`UU=UU"
|
|
215 |
] @ dlist_constrdef;
|
1274
|
216 |
|
|
217 |
val dlist_rews = dlist_constrdef @ dlist_rews;
|
|
218 |
|
|
219 |
|
|
220 |
(* ------------------------------------------------------------------------*)
|
|
221 |
(* Distinctness wrt. << and = *)
|
|
222 |
(* ------------------------------------------------------------------------*)
|
|
223 |
|
|
224 |
val temp = prove_goal Dlist.thy "~dnil << dcons`(x::'a)`xl"
|
|
225 |
(fn prems =>
|
1461
|
226 |
[
|
|
227 |
(res_inst_tac [("P1","TT << FF")] classical3 1),
|
|
228 |
(resolve_tac dist_less_tr 1),
|
|
229 |
(dres_inst_tac [("fo5","is_dnil")] monofun_cfun_arg 1),
|
|
230 |
(etac box_less 1),
|
|
231 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
1675
|
232 |
(case_tac "(x::'a)=UU" 1),
|
1461
|
233 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
1675
|
234 |
(case_tac "(xl ::'a dlist)=UU" 1),
|
1461
|
235 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
236 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
237 |
]);
|
1274
|
238 |
|
|
239 |
val dlist_dist_less = [temp];
|
|
240 |
|
|
241 |
val temp = prove_goal Dlist.thy "[|x~=UU;xl~=UU|]==>~ dcons`x`xl << dnil"
|
|
242 |
(fn prems =>
|
1461
|
243 |
[
|
|
244 |
(cut_facts_tac prems 1),
|
|
245 |
(res_inst_tac [("P1","TT << FF")] classical3 1),
|
|
246 |
(resolve_tac dist_less_tr 1),
|
|
247 |
(dres_inst_tac [("fo5","is_dcons")] monofun_cfun_arg 1),
|
|
248 |
(etac box_less 1),
|
|
249 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
250 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
251 |
]);
|
1274
|
252 |
|
|
253 |
val dlist_dist_less = temp::dlist_dist_less;
|
|
254 |
|
|
255 |
val temp = prove_goal Dlist.thy "dnil ~= dcons`x`xl"
|
|
256 |
(fn prems =>
|
1461
|
257 |
[
|
1675
|
258 |
(case_tac "x=UU" 1),
|
1461
|
259 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
1675
|
260 |
(case_tac "xl=UU" 1),
|
1461
|
261 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
262 |
(res_inst_tac [("P1","TT = FF")] classical3 1),
|
|
263 |
(resolve_tac dist_eq_tr 1),
|
|
264 |
(dres_inst_tac [("f","is_dnil")] cfun_arg_cong 1),
|
|
265 |
(etac box_equals 1),
|
|
266 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
267 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
268 |
]);
|
1274
|
269 |
|
|
270 |
val dlist_dist_eq = [temp,temp RS not_sym];
|
|
271 |
|
|
272 |
val dlist_rews = dlist_dist_less @ dlist_dist_eq @ dlist_rews;
|
|
273 |
|
|
274 |
(* ------------------------------------------------------------------------*)
|
|
275 |
(* Invertibility *)
|
|
276 |
(* ------------------------------------------------------------------------*)
|
|
277 |
|
|
278 |
val temp = prove_goal Dlist.thy "[|x1~=UU; y1~=UU;x2~=UU; y2~=UU;\
|
|
279 |
\ dcons`x1`x2 << dcons`y1`y2 |] ==> x1<< y1 & x2 << y2"
|
|
280 |
(fn prems =>
|
1461
|
281 |
[
|
|
282 |
(cut_facts_tac prems 1),
|
|
283 |
(rtac conjI 1),
|
|
284 |
(dres_inst_tac [("fo5","dlist_when`UU`(LAM x l.x)")] monofun_cfun_arg 1),
|
|
285 |
(etac box_less 1),
|
|
286 |
(asm_simp_tac (!simpset addsimps dlist_when) 1),
|
|
287 |
(asm_simp_tac (!simpset addsimps dlist_when) 1),
|
|
288 |
(dres_inst_tac [("fo5","dlist_when`UU`(LAM x l.l)")] monofun_cfun_arg 1),
|
|
289 |
(etac box_less 1),
|
|
290 |
(asm_simp_tac (!simpset addsimps dlist_when) 1),
|
|
291 |
(asm_simp_tac (!simpset addsimps dlist_when) 1)
|
|
292 |
]);
|
1274
|
293 |
|
|
294 |
val dlist_invert =[temp];
|
|
295 |
|
|
296 |
(* ------------------------------------------------------------------------*)
|
|
297 |
(* Injectivity *)
|
|
298 |
(* ------------------------------------------------------------------------*)
|
|
299 |
|
|
300 |
val temp = prove_goal Dlist.thy "[|x1~=UU; y1~=UU;x2~=UU; y2~=UU;\
|
|
301 |
\ dcons`x1`x2 = dcons`y1`y2 |] ==> x1= y1 & x2 = y2"
|
|
302 |
(fn prems =>
|
1461
|
303 |
[
|
|
304 |
(cut_facts_tac prems 1),
|
|
305 |
(rtac conjI 1),
|
|
306 |
(dres_inst_tac [("f","dlist_when`UU`(LAM x l.x)")] cfun_arg_cong 1),
|
|
307 |
(etac box_equals 1),
|
|
308 |
(asm_simp_tac (!simpset addsimps dlist_when) 1),
|
|
309 |
(asm_simp_tac (!simpset addsimps dlist_when) 1),
|
|
310 |
(dres_inst_tac [("f","dlist_when`UU`(LAM x l.l)")] cfun_arg_cong 1),
|
|
311 |
(etac box_equals 1),
|
|
312 |
(asm_simp_tac (!simpset addsimps dlist_when) 1),
|
|
313 |
(asm_simp_tac (!simpset addsimps dlist_when) 1)
|
|
314 |
]);
|
1274
|
315 |
|
|
316 |
val dlist_inject = [temp];
|
|
317 |
|
|
318 |
|
|
319 |
(* ------------------------------------------------------------------------*)
|
|
320 |
(* definedness for discriminators and selectors *)
|
|
321 |
(* ------------------------------------------------------------------------*)
|
|
322 |
|
|
323 |
fun prover thm = prove_goal Dlist.thy thm
|
|
324 |
(fn prems =>
|
1461
|
325 |
[
|
|
326 |
(cut_facts_tac prems 1),
|
|
327 |
(rtac dlistE 1),
|
|
328 |
(contr_tac 1),
|
|
329 |
(REPEAT (asm_simp_tac (!simpset addsimps dlist_discsel) 1))
|
|
330 |
]);
|
1274
|
331 |
|
|
332 |
val dlist_discsel_def =
|
1461
|
333 |
[
|
|
334 |
prover "l~=UU ==> is_dnil`l~=UU",
|
|
335 |
prover "l~=UU ==> is_dcons`l~=UU"
|
|
336 |
];
|
1274
|
337 |
|
|
338 |
val dlist_rews = dlist_discsel_def @ dlist_rews;
|
|
339 |
|
|
340 |
(* ------------------------------------------------------------------------*)
|
|
341 |
(* enhance the simplifier *)
|
|
342 |
(* ------------------------------------------------------------------------*)
|
|
343 |
|
|
344 |
qed_goal "dhd2" Dlist.thy "xl~=UU ==> dhd`(dcons`x`xl)=x"
|
|
345 |
(fn prems =>
|
1461
|
346 |
[
|
|
347 |
(cut_facts_tac prems 1),
|
1675
|
348 |
(case_tac "x=UU" 1),
|
1461
|
349 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
350 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
351 |
]);
|
1274
|
352 |
|
|
353 |
qed_goal "dtl2" Dlist.thy "x~=UU ==> dtl`(dcons`x`xl)=xl"
|
|
354 |
(fn prems =>
|
1461
|
355 |
[
|
|
356 |
(cut_facts_tac prems 1),
|
1675
|
357 |
(case_tac "xl=UU" 1),
|
1461
|
358 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
359 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
360 |
]);
|
1274
|
361 |
|
|
362 |
val dlist_rews = dhd2 :: dtl2 :: dlist_rews;
|
|
363 |
|
|
364 |
(* ------------------------------------------------------------------------*)
|
|
365 |
(* Properties dlist_take *)
|
|
366 |
(* ------------------------------------------------------------------------*)
|
|
367 |
|
|
368 |
val temp = prove_goalw Dlist.thy [dlist_take_def] "dlist_take n`UU=UU"
|
|
369 |
(fn prems =>
|
1461
|
370 |
[
|
|
371 |
(res_inst_tac [("n","n")] natE 1),
|
|
372 |
(Asm_simp_tac 1),
|
|
373 |
(Asm_simp_tac 1),
|
|
374 |
(simp_tac (!simpset addsimps dlist_rews) 1)
|
|
375 |
]);
|
1274
|
376 |
|
|
377 |
val dlist_take = [temp];
|
|
378 |
|
|
379 |
val temp = prove_goalw Dlist.thy [dlist_take_def] "dlist_take 0`xs=UU"
|
|
380 |
(fn prems =>
|
1461
|
381 |
[
|
|
382 |
(Asm_simp_tac 1)
|
|
383 |
]);
|
1274
|
384 |
|
|
385 |
val dlist_take = temp::dlist_take;
|
|
386 |
|
|
387 |
val temp = prove_goalw Dlist.thy [dlist_take_def]
|
1461
|
388 |
"dlist_take (Suc n)`dnil=dnil"
|
1274
|
389 |
(fn prems =>
|
1461
|
390 |
[
|
|
391 |
(Asm_simp_tac 1),
|
|
392 |
(simp_tac (!simpset addsimps dlist_rews) 1)
|
|
393 |
]);
|
1274
|
394 |
|
|
395 |
val dlist_take = temp::dlist_take;
|
|
396 |
|
|
397 |
val temp = prove_goalw Dlist.thy [dlist_take_def]
|
|
398 |
"dlist_take (Suc n)`(dcons`x`xl)= dcons`x`(dlist_take n`xl)"
|
|
399 |
(fn prems =>
|
1461
|
400 |
[
|
1675
|
401 |
(case_tac "x=UU" 1),
|
1461
|
402 |
(Asm_simp_tac 1),
|
|
403 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
1675
|
404 |
(case_tac "xl=UU" 1),
|
1461
|
405 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
406 |
(Asm_simp_tac 1),
|
|
407 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
408 |
(res_inst_tac [("n","n")] natE 1),
|
|
409 |
(Asm_simp_tac 1),
|
|
410 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
411 |
(Asm_simp_tac 1),
|
|
412 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
413 |
(Asm_simp_tac 1),
|
|
414 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
415 |
]);
|
1274
|
416 |
|
|
417 |
val dlist_take = temp::dlist_take;
|
|
418 |
|
|
419 |
val dlist_rews = dlist_take @ dlist_rews;
|
|
420 |
|
|
421 |
(* ------------------------------------------------------------------------*)
|
|
422 |
(* take lemma for dlists *)
|
|
423 |
(* ------------------------------------------------------------------------*)
|
|
424 |
|
|
425 |
fun prover reach defs thm = prove_goalw Dlist.thy defs thm
|
|
426 |
(fn prems =>
|
1461
|
427 |
[
|
|
428 |
(res_inst_tac [("t","l1")] (reach RS subst) 1),
|
|
429 |
(res_inst_tac [("t","l2")] (reach RS subst) 1),
|
2033
|
430 |
(stac fix_def2 1),
|
|
431 |
(stac contlub_cfun_fun 1),
|
1461
|
432 |
(rtac is_chain_iterate 1),
|
2033
|
433 |
(stac contlub_cfun_fun 1),
|
1461
|
434 |
(rtac is_chain_iterate 1),
|
|
435 |
(rtac lub_equal 1),
|
|
436 |
(rtac (is_chain_iterate RS ch2ch_fappL) 1),
|
|
437 |
(rtac (is_chain_iterate RS ch2ch_fappL) 1),
|
|
438 |
(rtac allI 1),
|
|
439 |
(resolve_tac prems 1)
|
|
440 |
]);
|
1274
|
441 |
|
|
442 |
val dlist_take_lemma = prover dlist_reach [dlist_take_def]
|
1461
|
443 |
"(!!n.dlist_take n`l1 = dlist_take n`l2) ==> l1=l2";
|
1274
|
444 |
|
|
445 |
|
|
446 |
(* ------------------------------------------------------------------------*)
|
|
447 |
(* Co -induction for dlists *)
|
|
448 |
(* ------------------------------------------------------------------------*)
|
|
449 |
|
|
450 |
qed_goalw "dlist_coind_lemma" Dlist.thy [dlist_bisim_def]
|
|
451 |
"dlist_bisim R ==> ! p q. R p q --> dlist_take n`p = dlist_take n`q"
|
|
452 |
(fn prems =>
|
1461
|
453 |
[
|
|
454 |
(cut_facts_tac prems 1),
|
|
455 |
(nat_ind_tac "n" 1),
|
|
456 |
(simp_tac (!simpset addsimps dlist_rews) 1),
|
|
457 |
(strip_tac 1),
|
|
458 |
((etac allE 1) THEN (etac allE 1) THEN (etac (mp RS disjE) 1)),
|
|
459 |
(atac 1),
|
|
460 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
461 |
(etac disjE 1),
|
|
462 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
463 |
(etac exE 1),
|
|
464 |
(etac exE 1),
|
|
465 |
(etac exE 1),
|
|
466 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
467 |
(REPEAT (etac conjE 1)),
|
|
468 |
(rtac cfun_arg_cong 1),
|
|
469 |
(fast_tac HOL_cs 1)
|
|
470 |
]);
|
1274
|
471 |
|
|
472 |
qed_goal "dlist_coind" Dlist.thy "[|dlist_bisim R ; R p q |] ==> p = q"
|
|
473 |
(fn prems =>
|
1461
|
474 |
[
|
|
475 |
(rtac dlist_take_lemma 1),
|
|
476 |
(rtac (dlist_coind_lemma RS spec RS spec RS mp) 1),
|
|
477 |
(resolve_tac prems 1),
|
|
478 |
(resolve_tac prems 1)
|
|
479 |
]);
|
1274
|
480 |
|
|
481 |
(* ------------------------------------------------------------------------*)
|
|
482 |
(* structural induction *)
|
|
483 |
(* ------------------------------------------------------------------------*)
|
|
484 |
|
|
485 |
qed_goal "dlist_finite_ind" Dlist.thy
|
|
486 |
"[|P(UU);P(dnil);\
|
|
487 |
\ !! x l1.[|x~=UU;l1~=UU;P(l1)|] ==> P(dcons`x`l1)\
|
|
488 |
\ |] ==> !l.P(dlist_take n`l)"
|
|
489 |
(fn prems =>
|
1461
|
490 |
[
|
|
491 |
(nat_ind_tac "n" 1),
|
|
492 |
(simp_tac (!simpset addsimps dlist_rews) 1),
|
|
493 |
(resolve_tac prems 1),
|
|
494 |
(rtac allI 1),
|
|
495 |
(res_inst_tac [("l","l")] dlistE 1),
|
|
496 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
497 |
(resolve_tac prems 1),
|
|
498 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
499 |
(resolve_tac prems 1),
|
|
500 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
1675
|
501 |
(case_tac "dlist_take n1`xl=UU" 1),
|
1461
|
502 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
503 |
(resolve_tac prems 1),
|
|
504 |
(resolve_tac prems 1),
|
|
505 |
(atac 1),
|
|
506 |
(atac 1),
|
|
507 |
(etac spec 1)
|
|
508 |
]);
|
1274
|
509 |
|
|
510 |
qed_goal "dlist_all_finite_lemma1" Dlist.thy
|
|
511 |
"!l.dlist_take n`l=UU |dlist_take n`l=l"
|
|
512 |
(fn prems =>
|
1461
|
513 |
[
|
|
514 |
(nat_ind_tac "n" 1),
|
|
515 |
(simp_tac (!simpset addsimps dlist_rews) 1),
|
|
516 |
(rtac allI 1),
|
|
517 |
(res_inst_tac [("l","l")] dlistE 1),
|
|
518 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
519 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
520 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
521 |
(eres_inst_tac [("x","xl")] allE 1),
|
|
522 |
(etac disjE 1),
|
|
523 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
524 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1)
|
|
525 |
]);
|
1274
|
526 |
|
|
527 |
qed_goal "dlist_all_finite_lemma2" Dlist.thy "? n.dlist_take n`l=l"
|
|
528 |
(fn prems =>
|
1461
|
529 |
[
|
1675
|
530 |
(case_tac "l=UU" 1),
|
1461
|
531 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
532 |
(subgoal_tac "(!n.dlist_take n`l=UU) |(? n.dlist_take n`l = l)" 1),
|
|
533 |
(etac disjE 1),
|
|
534 |
(eres_inst_tac [("P","l=UU")] notE 1),
|
|
535 |
(rtac dlist_take_lemma 1),
|
|
536 |
(asm_simp_tac (!simpset addsimps dlist_rews) 1),
|
|
537 |
(atac 1),
|
|
538 |
(subgoal_tac "!n.!l.dlist_take n`l=UU |dlist_take n`l=l" 1),
|
|
539 |
(fast_tac HOL_cs 1),
|
|
540 |
(rtac allI 1),
|
|
541 |
(rtac dlist_all_finite_lemma1 1)
|
|
542 |
]);
|
1274
|
543 |
|
|
544 |
qed_goalw "dlist_all_finite" Dlist.thy [dlist_finite_def] "dlist_finite(l)"
|
|
545 |
(fn prems =>
|
1461
|
546 |
[
|
|
547 |
(rtac dlist_all_finite_lemma2 1)
|
|
548 |
]);
|
1274
|
549 |
|
|
550 |
qed_goal "dlist_ind" Dlist.thy
|
|
551 |
"[|P(UU);P(dnil);\
|
|
552 |
\ !! x l1.[|x~=UU;l1~=UU;P(l1)|] ==> P(dcons`x`l1)|] ==> P(l)"
|
|
553 |
(fn prems =>
|
1461
|
554 |
[
|
|
555 |
(rtac (dlist_all_finite_lemma2 RS exE) 1),
|
|
556 |
(etac subst 1),
|
|
557 |
(rtac (dlist_finite_ind RS spec) 1),
|
|
558 |
(REPEAT (resolve_tac prems 1)),
|
|
559 |
(REPEAT (atac 1))
|
|
560 |
]);
|
1274
|
561 |
|
|
562 |
|
|
563 |
|
|
564 |
|