author | paulson |
Fri, 03 May 1996 17:35:13 +0200 | |
changeset 1717 | 8d46452739d7 |
parent 1673 | d22110ddd0af |
child 1820 | e381e1c51689 |
permissions | -rw-r--r-- |
1465 | 1 |
(* Title: HOL/llist |
969 | 2 |
ID: $Id$ |
1465 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
969 | 4 |
Copyright 1993 University of Cambridge |
5 |
||
6 |
SHOULD LListD_Fun_CONS_I, etc., be equations (for rewriting)? |
|
7 |
*) |
|
8 |
||
9 |
open LList; |
|
10 |
||
11 |
(** Simplification **) |
|
12 |
||
1266 | 13 |
simpset := !simpset setloop split_tac [expand_split, expand_sum_case]; |
969 | 14 |
|
15 |
(*For adding _eqI rules to a simpset; we must remove Pair_eq because |
|
16 |
it may turn an instance of reflexivity into a conjunction!*) |
|
17 |
fun add_eqI ss = ss addsimps [range_eqI, image_eqI] |
|
18 |
delsimps [Pair_eq]; |
|
19 |
||
20 |
||
21 |
(*This justifies using llist in other recursive type definitions*) |
|
22 |
goalw LList.thy llist.defs "!!A B. A<=B ==> llist(A) <= llist(B)"; |
|
23 |
by (rtac gfp_mono 1); |
|
24 |
by (REPEAT (ares_tac basic_monos 1)); |
|
25 |
qed "llist_mono"; |
|
26 |
||
27 |
||
28 |
goal LList.thy "llist(A) = {Numb(0)} <+> (A <*> llist(A))"; |
|
29 |
let val rew = rewrite_rule [NIL_def, CONS_def] in |
|
30 |
by (fast_tac (univ_cs addSIs (equalityI :: map rew llist.intrs) |
|
31 |
addEs [rew llist.elim]) 1) |
|
32 |
end; |
|
33 |
qed "llist_unfold"; |
|
34 |
||
35 |
||
36 |
(*** Type checking by coinduction, using list_Fun |
|
37 |
THE COINDUCTIVE DEFINITION PACKAGE COULD DO THIS! |
|
38 |
***) |
|
39 |
||
40 |
goalw LList.thy [list_Fun_def] |
|
41 |
"!!M. [| M : X; X <= list_Fun A (X Un llist(A)) |] ==> M : llist(A)"; |
|
1046 | 42 |
by (etac llist.coinduct 1); |
43 |
by (etac (subsetD RS CollectD) 1); |
|
44 |
by (assume_tac 1); |
|
969 | 45 |
qed "llist_coinduct"; |
46 |
||
47 |
goalw LList.thy [list_Fun_def, NIL_def] "NIL: list_Fun A X"; |
|
48 |
by (fast_tac set_cs 1); |
|
49 |
qed "list_Fun_NIL_I"; |
|
50 |
||
51 |
goalw LList.thy [list_Fun_def,CONS_def] |
|
52 |
"!!M N. [| M: A; N: X |] ==> CONS M N : list_Fun A X"; |
|
53 |
by (fast_tac set_cs 1); |
|
54 |
qed "list_Fun_CONS_I"; |
|
55 |
||
56 |
(*Utilise the "strong" part, i.e. gfp(f)*) |
|
57 |
goalw LList.thy (llist.defs @ [list_Fun_def]) |
|
58 |
"!!M N. M: llist(A) ==> M : list_Fun A (X Un llist(A))"; |
|
59 |
by (etac (llist.mono RS gfp_fun_UnI2) 1); |
|
60 |
qed "list_Fun_llist_I"; |
|
61 |
||
62 |
(*** LList_corec satisfies the desired recurion equation ***) |
|
63 |
||
64 |
(*A continuity result?*) |
|
65 |
goalw LList.thy [CONS_def] "CONS M (UN x.f(x)) = (UN x. CONS M (f x))"; |
|
1266 | 66 |
by (simp_tac (!simpset addsimps [In1_UN1, Scons_UN1_y]) 1); |
969 | 67 |
qed "CONS_UN1"; |
68 |
||
69 |
(*UNUSED; obsolete? |
|
70 |
goal Prod.thy "split p (%x y.UN z.f x y z) = (UN z. split p (%x y.f x y z))"; |
|
1266 | 71 |
by (simp_tac (!simpset setloop (split_tac [expand_split])) 1); |
969 | 72 |
qed "split_UN1"; |
73 |
||
74 |
goal Sum.thy "sum_case s f (%y.UN z.g y z) = (UN z.sum_case s f (%y.g y z))"; |
|
1266 | 75 |
by (simp_tac (!simpset setloop (split_tac [expand_sum_case])) 1); |
969 | 76 |
qed "sum_case2_UN1"; |
77 |
*) |
|
78 |
||
79 |
val prems = goalw LList.thy [CONS_def] |
|
80 |
"[| M<=M'; N<=N' |] ==> CONS M N <= CONS M' N'"; |
|
81 |
by (REPEAT (resolve_tac ([In1_mono,Scons_mono]@prems) 1)); |
|
82 |
qed "CONS_mono"; |
|
83 |
||
1266 | 84 |
Addsimps [LList_corec_fun_def RS def_nat_rec_0, |
1465 | 85 |
LList_corec_fun_def RS def_nat_rec_Suc]; |
969 | 86 |
|
87 |
(** The directions of the equality are proved separately **) |
|
88 |
||
89 |
goalw LList.thy [LList_corec_def] |
|
90 |
"LList_corec a f <= sum_case (%u.NIL) \ |
|
1465 | 91 |
\ (split(%z w. CONS z (LList_corec w f))) (f a)"; |
969 | 92 |
by (rtac UN1_least 1); |
93 |
by (res_inst_tac [("n","k")] natE 1); |
|
1266 | 94 |
by (ALLGOALS (Asm_simp_tac)); |
969 | 95 |
by (REPEAT (resolve_tac [allI, impI, subset_refl RS CONS_mono, UN1_upper] 1)); |
96 |
qed "LList_corec_subset1"; |
|
97 |
||
98 |
goalw LList.thy [LList_corec_def] |
|
99 |
"sum_case (%u.NIL) (split(%z w. CONS z (LList_corec w f))) (f a) <= \ |
|
100 |
\ LList_corec a f"; |
|
1266 | 101 |
by (simp_tac (!simpset addsimps [CONS_UN1]) 1); |
969 | 102 |
by (safe_tac set_cs); |
1266 | 103 |
by (ALLGOALS (res_inst_tac [("x","Suc(?k)")] UN1_I THEN' Asm_simp_tac)); |
969 | 104 |
qed "LList_corec_subset2"; |
105 |
||
106 |
(*the recursion equation for LList_corec -- NOT SUITABLE FOR REWRITING!*) |
|
107 |
goal LList.thy |
|
108 |
"LList_corec a f = sum_case (%u. NIL) \ |
|
1465 | 109 |
\ (split(%z w. CONS z (LList_corec w f))) (f a)"; |
969 | 110 |
by (REPEAT (resolve_tac [equalityI, LList_corec_subset1, |
1465 | 111 |
LList_corec_subset2] 1)); |
969 | 112 |
qed "LList_corec"; |
113 |
||
114 |
(*definitional version of same*) |
|
115 |
val [rew] = goal LList.thy |
|
1465 | 116 |
"[| !!x. h(x) == LList_corec x f |] ==> \ |
969 | 117 |
\ h(a) = sum_case (%u.NIL) (split(%z w. CONS z (h w))) (f a)"; |
118 |
by (rewtac rew); |
|
119 |
by (rtac LList_corec 1); |
|
120 |
qed "def_LList_corec"; |
|
121 |
||
122 |
(*A typical use of co-induction to show membership in the gfp. |
|
123 |
Bisimulation is range(%x. LList_corec x f) *) |
|
124 |
goal LList.thy "LList_corec a f : llist({u.True})"; |
|
125 |
by (res_inst_tac [("X", "range(%x.LList_corec x ?g)")] llist_coinduct 1); |
|
126 |
by (rtac rangeI 1); |
|
127 |
by (safe_tac set_cs); |
|
128 |
by (stac LList_corec 1); |
|
1266 | 129 |
by (simp_tac (!simpset addsimps [list_Fun_NIL_I, list_Fun_CONS_I, CollectI] |
969 | 130 |
|> add_eqI) 1); |
131 |
qed "LList_corec_type"; |
|
132 |
||
133 |
(*Lemma for the proof of llist_corec*) |
|
134 |
goal LList.thy |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
135 |
"LList_corec a (%z.sum_case Inl (split(%v w.Inr((Leaf(v),w)))) (f z)) : \ |
1642 | 136 |
\ llist(range Leaf)"; |
969 | 137 |
by (res_inst_tac [("X", "range(%x.LList_corec x ?g)")] llist_coinduct 1); |
138 |
by (rtac rangeI 1); |
|
139 |
by (safe_tac set_cs); |
|
140 |
by (stac LList_corec 1); |
|
1266 | 141 |
by (asm_simp_tac (!simpset addsimps [list_Fun_NIL_I]) 1); |
969 | 142 |
by (fast_tac (set_cs addSIs [list_Fun_CONS_I]) 1); |
143 |
qed "LList_corec_type2"; |
|
144 |
||
145 |
||
146 |
(**** llist equality as a gfp; the bisimulation principle ****) |
|
147 |
||
148 |
(*This theorem is actually used, unlike the many similar ones in ZF*) |
|
149 |
goal LList.thy "LListD(r) = diag({Numb(0)}) <++> (r <**> LListD(r))"; |
|
150 |
let val rew = rewrite_rule [NIL_def, CONS_def] in |
|
151 |
by (fast_tac (univ_cs addSIs (equalityI :: map rew LListD.intrs) |
|
152 |
addEs [rew LListD.elim]) 1) |
|
153 |
end; |
|
154 |
qed "LListD_unfold"; |
|
155 |
||
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
156 |
goal LList.thy "!M N. (M,N) : LListD(diag(A)) --> ntrunc k M = ntrunc k N"; |
969 | 157 |
by (res_inst_tac [("n", "k")] less_induct 1); |
158 |
by (safe_tac set_cs); |
|
159 |
by (etac LListD.elim 1); |
|
160 |
by (safe_tac (prod_cs addSEs [diagE])); |
|
161 |
by (res_inst_tac [("n", "n")] natE 1); |
|
1266 | 162 |
by (asm_simp_tac (!simpset addsimps [ntrunc_0]) 1); |
969 | 163 |
by (rename_tac "n'" 1); |
164 |
by (res_inst_tac [("n", "n'")] natE 1); |
|
1266 | 165 |
by (asm_simp_tac (!simpset addsimps [CONS_def, ntrunc_one_In1]) 1); |
1673
d22110ddd0af
repaired critical proofs depending on the order inside non-confluent SimpSets
oheimb
parents:
1642
diff
changeset
|
166 |
by (asm_simp_tac (!simpset addsimps [CONS_def, ntrunc_In1, ntrunc_Scons, less_Suc_eq]) 1); |
969 | 167 |
qed "LListD_implies_ntrunc_equality"; |
168 |
||
169 |
(*The domain of the LListD relation*) |
|
170 |
goalw LList.thy (llist.defs @ [NIL_def, CONS_def]) |
|
171 |
"fst``LListD(diag(A)) <= llist(A)"; |
|
172 |
by (rtac gfp_upperbound 1); |
|
173 |
(*avoids unfolding LListD on the rhs*) |
|
174 |
by (res_inst_tac [("P", "%x. fst``x <= ?B")] (LListD_unfold RS ssubst) 1); |
|
1266 | 175 |
by (Simp_tac 1); |
969 | 176 |
by (fast_tac univ_cs 1); |
177 |
qed "fst_image_LListD"; |
|
178 |
||
179 |
(*This inclusion justifies the use of coinduction to show M=N*) |
|
180 |
goal LList.thy "LListD(diag(A)) <= diag(llist(A))"; |
|
181 |
by (rtac subsetI 1); |
|
182 |
by (res_inst_tac [("p","x")] PairE 1); |
|
183 |
by (safe_tac HOL_cs); |
|
184 |
by (rtac diag_eqI 1); |
|
185 |
by (rtac (LListD_implies_ntrunc_equality RS spec RS spec RS mp RS |
|
1465 | 186 |
ntrunc_equality) 1); |
969 | 187 |
by (assume_tac 1); |
188 |
by (etac (fst_imageI RS (fst_image_LListD RS subsetD)) 1); |
|
189 |
qed "LListD_subset_diag"; |
|
190 |
||
191 |
(** Coinduction, using LListD_Fun |
|
192 |
THE COINDUCTIVE DEFINITION PACKAGE COULD DO THIS! |
|
193 |
**) |
|
194 |
||
195 |
goalw LList.thy [LListD_Fun_def] |
|
196 |
"!!M. [| M : X; X <= LListD_Fun r (X Un LListD(r)) |] ==> M : LListD(r)"; |
|
1046 | 197 |
by (etac LListD.coinduct 1); |
198 |
by (etac (subsetD RS CollectD) 1); |
|
199 |
by (assume_tac 1); |
|
969 | 200 |
qed "LListD_coinduct"; |
201 |
||
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
202 |
goalw LList.thy [LListD_Fun_def,NIL_def] "(NIL,NIL) : LListD_Fun r s"; |
969 | 203 |
by (fast_tac set_cs 1); |
204 |
qed "LListD_Fun_NIL_I"; |
|
205 |
||
206 |
goalw LList.thy [LListD_Fun_def,CONS_def] |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
207 |
"!!x. [| x:A; (M,N):s |] ==> (CONS x M, CONS x N) : LListD_Fun (diag A) s"; |
969 | 208 |
by (fast_tac univ_cs 1); |
209 |
qed "LListD_Fun_CONS_I"; |
|
210 |
||
211 |
(*Utilise the "strong" part, i.e. gfp(f)*) |
|
212 |
goalw LList.thy (LListD.defs @ [LListD_Fun_def]) |
|
213 |
"!!M N. M: LListD(r) ==> M : LListD_Fun r (X Un LListD(r))"; |
|
214 |
by (etac (LListD.mono RS gfp_fun_UnI2) 1); |
|
215 |
qed "LListD_Fun_LListD_I"; |
|
216 |
||
217 |
||
218 |
(*This converse inclusion helps to strengthen LList_equalityI*) |
|
219 |
goal LList.thy "diag(llist(A)) <= LListD(diag(A))"; |
|
220 |
by (rtac subsetI 1); |
|
221 |
by (etac LListD_coinduct 1); |
|
222 |
by (rtac subsetI 1); |
|
1046 | 223 |
by (etac diagE 1); |
224 |
by (etac ssubst 1); |
|
969 | 225 |
by (eresolve_tac [llist.elim] 1); |
226 |
by (ALLGOALS |
|
1266 | 227 |
(asm_simp_tac (!simpset addsimps [diagI, LListD_Fun_NIL_I, |
1465 | 228 |
LListD_Fun_CONS_I]))); |
969 | 229 |
qed "diag_subset_LListD"; |
230 |
||
231 |
goal LList.thy "LListD(diag(A)) = diag(llist(A))"; |
|
232 |
by (REPEAT (resolve_tac [equalityI, LListD_subset_diag, |
|
1465 | 233 |
diag_subset_LListD] 1)); |
969 | 234 |
qed "LListD_eq_diag"; |
235 |
||
236 |
goal LList.thy |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
237 |
"!!M N. M: llist(A) ==> (M,M) : LListD_Fun (diag A) (X Un diag(llist(A)))"; |
969 | 238 |
by (rtac (LListD_eq_diag RS subst) 1); |
1046 | 239 |
by (rtac LListD_Fun_LListD_I 1); |
1266 | 240 |
by (asm_simp_tac (!simpset addsimps [LListD_eq_diag, diagI]) 1); |
969 | 241 |
qed "LListD_Fun_diag_I"; |
242 |
||
243 |
||
244 |
(** To show two LLists are equal, exhibit a bisimulation! |
|
245 |
[also admits true equality] |
|
246 |
Replace "A" by some particular set, like {x.True}??? *) |
|
247 |
goal LList.thy |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
248 |
"!!r. [| (M,N) : r; r <= LListD_Fun (diag A) (r Un diag(llist(A))) \ |
969 | 249 |
\ |] ==> M=N"; |
250 |
by (rtac (LListD_subset_diag RS subsetD RS diagE) 1); |
|
251 |
by (etac LListD_coinduct 1); |
|
1266 | 252 |
by (asm_simp_tac (!simpset addsimps [LListD_eq_diag]) 1); |
969 | 253 |
by (safe_tac prod_cs); |
254 |
qed "LList_equalityI"; |
|
255 |
||
256 |
||
257 |
(*** Finality of llist(A): Uniqueness of functions defined by corecursion ***) |
|
258 |
||
259 |
(*abstract proof using a bisimulation*) |
|
260 |
val [prem1,prem2] = goal LList.thy |
|
261 |
"[| !!x. h1(x) = sum_case (%u.NIL) (split(%z w. CONS z (h1 w))) (f x); \ |
|
262 |
\ !!x. h2(x) = sum_case (%u.NIL) (split(%z w. CONS z (h2 w))) (f x) |]\ |
|
263 |
\ ==> h1=h2"; |
|
264 |
by (rtac ext 1); |
|
265 |
(*next step avoids an unknown (and flexflex pair) in simplification*) |
|
266 |
by (res_inst_tac [("A", "{u.True}"), |
|
1465 | 267 |
("r", "range(%u. (h1(u),h2(u)))")] LList_equalityI 1); |
969 | 268 |
by (rtac rangeI 1); |
269 |
by (safe_tac set_cs); |
|
270 |
by (stac prem1 1); |
|
271 |
by (stac prem2 1); |
|
1266 | 272 |
by (simp_tac (!simpset addsimps [LListD_Fun_NIL_I, |
1465 | 273 |
CollectI RS LListD_Fun_CONS_I] |
274 |
|> add_eqI) 1); |
|
969 | 275 |
qed "LList_corec_unique"; |
276 |
||
277 |
val [prem] = goal LList.thy |
|
278 |
"[| !!x. h(x) = sum_case (%u.NIL) (split(%z w. CONS z (h w))) (f x) |] \ |
|
279 |
\ ==> h = (%x.LList_corec x f)"; |
|
280 |
by (rtac (LList_corec RS (prem RS LList_corec_unique)) 1); |
|
281 |
qed "equals_LList_corec"; |
|
282 |
||
283 |
||
284 |
(** Obsolete LList_corec_unique proof: complete induction, not coinduction **) |
|
285 |
||
286 |
goalw LList.thy [CONS_def] "ntrunc (Suc 0) (CONS M N) = {}"; |
|
287 |
by (rtac ntrunc_one_In1 1); |
|
288 |
qed "ntrunc_one_CONS"; |
|
289 |
||
290 |
goalw LList.thy [CONS_def] |
|
291 |
"ntrunc (Suc(Suc(k))) (CONS M N) = CONS (ntrunc k M) (ntrunc k N)"; |
|
1266 | 292 |
by (simp_tac (!simpset addsimps [ntrunc_Scons,ntrunc_In1]) 1); |
969 | 293 |
qed "ntrunc_CONS"; |
294 |
||
295 |
val [prem1,prem2] = goal LList.thy |
|
296 |
"[| !!x. h1(x) = sum_case (%u.NIL) (split(%z w. CONS z (h1 w))) (f x); \ |
|
297 |
\ !!x. h2(x) = sum_case (%u.NIL) (split(%z w. CONS z (h2 w))) (f x) |]\ |
|
298 |
\ ==> h1=h2"; |
|
299 |
by (rtac (ntrunc_equality RS ext) 1); |
|
300 |
by (res_inst_tac [("x", "x")] spec 1); |
|
301 |
by (res_inst_tac [("n", "k")] less_induct 1); |
|
302 |
by (rtac allI 1); |
|
303 |
by (stac prem1 1); |
|
304 |
by (stac prem2 1); |
|
1303
010be89a7541
Hat to modify a proof because of chaned simpset for Prod.
nipkow
parents:
1266
diff
changeset
|
305 |
by (simp_tac (!simpset setloop (split_tac [expand_sum_case])) 1); |
969 | 306 |
by (strip_tac 1); |
307 |
by (res_inst_tac [("n", "n")] natE 1); |
|
1303
010be89a7541
Hat to modify a proof because of chaned simpset for Prod.
nipkow
parents:
1266
diff
changeset
|
308 |
by (res_inst_tac [("n", "xb")] natE 2); |
1266 | 309 |
by (ALLGOALS(asm_simp_tac(!simpset addsimps |
1673
d22110ddd0af
repaired critical proofs depending on the order inside non-confluent SimpSets
oheimb
parents:
1642
diff
changeset
|
310 |
[ntrunc_0,ntrunc_one_CONS,ntrunc_CONS, less_Suc_eq]))); |
969 | 311 |
result(); |
312 |
||
313 |
||
314 |
(*** Lconst -- defined directly using lfp, but equivalent to a LList_corec ***) |
|
315 |
||
316 |
goal LList.thy "mono(CONS(M))"; |
|
317 |
by (REPEAT (ares_tac [monoI, subset_refl, CONS_mono] 1)); |
|
318 |
qed "Lconst_fun_mono"; |
|
319 |
||
320 |
(* Lconst(M) = CONS M (Lconst M) *) |
|
321 |
bind_thm ("Lconst", (Lconst_fun_mono RS (Lconst_def RS def_lfp_Tarski))); |
|
322 |
||
323 |
(*A typical use of co-induction to show membership in the gfp. |
|
324 |
The containing set is simply the singleton {Lconst(M)}. *) |
|
325 |
goal LList.thy "!!M A. M:A ==> Lconst(M): llist(A)"; |
|
326 |
by (rtac (singletonI RS llist_coinduct) 1); |
|
327 |
by (safe_tac set_cs); |
|
328 |
by (res_inst_tac [("P", "%u. u: ?A")] (Lconst RS ssubst) 1); |
|
329 |
by (REPEAT (ares_tac [list_Fun_CONS_I, singletonI, UnI1] 1)); |
|
330 |
qed "Lconst_type"; |
|
331 |
||
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
332 |
goal LList.thy "Lconst(M) = LList_corec M (%x.Inr((x,x)))"; |
969 | 333 |
by (rtac (equals_LList_corec RS fun_cong) 1); |
1266 | 334 |
by (Simp_tac 1); |
969 | 335 |
by (rtac Lconst 1); |
336 |
qed "Lconst_eq_LList_corec"; |
|
337 |
||
338 |
(*Thus we could have used gfp in the definition of Lconst*) |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
339 |
goal LList.thy "gfp(%N. CONS M N) = LList_corec M (%x.Inr((x,x)))"; |
969 | 340 |
by (rtac (equals_LList_corec RS fun_cong) 1); |
1266 | 341 |
by (Simp_tac 1); |
969 | 342 |
by (rtac (Lconst_fun_mono RS gfp_Tarski) 1); |
343 |
qed "gfp_Lconst_eq_LList_corec"; |
|
344 |
||
345 |
||
346 |
(*** Isomorphisms ***) |
|
347 |
||
348 |
goal LList.thy "inj(Rep_llist)"; |
|
349 |
by (rtac inj_inverseI 1); |
|
350 |
by (rtac Rep_llist_inverse 1); |
|
351 |
qed "inj_Rep_llist"; |
|
352 |
||
1642 | 353 |
goal LList.thy "inj_onto Abs_llist (llist(range Leaf))"; |
969 | 354 |
by (rtac inj_onto_inverseI 1); |
355 |
by (etac Abs_llist_inverse 1); |
|
356 |
qed "inj_onto_Abs_llist"; |
|
357 |
||
358 |
(** Distinctness of constructors **) |
|
359 |
||
360 |
goalw LList.thy [LNil_def,LCons_def] "~ LCons x xs = LNil"; |
|
361 |
by (rtac (CONS_not_NIL RS (inj_onto_Abs_llist RS inj_onto_contraD)) 1); |
|
362 |
by (REPEAT (resolve_tac (llist.intrs @ [rangeI, Rep_llist]) 1)); |
|
363 |
qed "LCons_not_LNil"; |
|
364 |
||
365 |
bind_thm ("LNil_not_LCons", (LCons_not_LNil RS not_sym)); |
|
366 |
||
367 |
bind_thm ("LCons_neq_LNil", (LCons_not_LNil RS notE)); |
|
368 |
val LNil_neq_LCons = sym RS LCons_neq_LNil; |
|
369 |
||
370 |
(** llist constructors **) |
|
371 |
||
372 |
goalw LList.thy [LNil_def] |
|
373 |
"Rep_llist(LNil) = NIL"; |
|
374 |
by (rtac (llist.NIL_I RS Abs_llist_inverse) 1); |
|
375 |
qed "Rep_llist_LNil"; |
|
376 |
||
377 |
goalw LList.thy [LCons_def] |
|
378 |
"Rep_llist(LCons x l) = CONS (Leaf x) (Rep_llist l)"; |
|
379 |
by (REPEAT (resolve_tac [llist.CONS_I RS Abs_llist_inverse, |
|
1465 | 380 |
rangeI, Rep_llist] 1)); |
969 | 381 |
qed "Rep_llist_LCons"; |
382 |
||
383 |
(** Injectiveness of CONS and LCons **) |
|
384 |
||
385 |
goalw LList.thy [CONS_def] "(CONS M N=CONS M' N') = (M=M' & N=N')"; |
|
386 |
by (fast_tac (HOL_cs addSEs [Scons_inject, make_elim In1_inject]) 1); |
|
1266 | 387 |
qed "CONS_CONS_eq2"; |
969 | 388 |
|
389 |
bind_thm ("CONS_inject", (CONS_CONS_eq RS iffD1 RS conjE)); |
|
390 |
||
391 |
||
392 |
(*For reasoning about abstract llist constructors*) |
|
393 |
val llist_cs = set_cs addIs [Rep_llist]@llist.intrs |
|
1465 | 394 |
addSEs [CONS_neq_NIL,NIL_neq_CONS,CONS_inject] |
395 |
addSDs [inj_onto_Abs_llist RS inj_ontoD, |
|
396 |
inj_Rep_llist RS injD, Leaf_inject]; |
|
969 | 397 |
|
398 |
goalw LList.thy [LCons_def] "(LCons x xs=LCons y ys) = (x=y & xs=ys)"; |
|
399 |
by (fast_tac llist_cs 1); |
|
400 |
qed "LCons_LCons_eq"; |
|
401 |
bind_thm ("LCons_inject", (LCons_LCons_eq RS iffD1 RS conjE)); |
|
402 |
||
403 |
val [major] = goal LList.thy "CONS M N: llist(A) ==> M: A & N: llist(A)"; |
|
404 |
by (rtac (major RS llist.elim) 1); |
|
405 |
by (etac CONS_neq_NIL 1); |
|
406 |
by (fast_tac llist_cs 1); |
|
1266 | 407 |
qed "CONS_D2"; |
969 | 408 |
|
409 |
||
410 |
(****** Reasoning about llist(A) ******) |
|
411 |
||
1266 | 412 |
Addsimps [List_case_NIL, List_case_CONS]; |
969 | 413 |
|
414 |
(*A special case of list_equality for functions over lazy lists*) |
|
415 |
val [Mlist,gMlist,NILcase,CONScase] = goal LList.thy |
|
1465 | 416 |
"[| M: llist(A); g(NIL): llist(A); \ |
417 |
\ f(NIL)=g(NIL); \ |
|
418 |
\ !!x l. [| x:A; l: llist(A) |] ==> \ |
|
419 |
\ (f(CONS x l),g(CONS x l)) : \ |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
420 |
\ LListD_Fun (diag A) ((%u.(f(u),g(u)))``llist(A) Un \ |
1465 | 421 |
\ diag(llist(A))) \ |
969 | 422 |
\ |] ==> f(M) = g(M)"; |
423 |
by (rtac LList_equalityI 1); |
|
1046 | 424 |
by (rtac (Mlist RS imageI) 1); |
969 | 425 |
by (rtac subsetI 1); |
426 |
by (etac imageE 1); |
|
427 |
by (etac ssubst 1); |
|
428 |
by (etac llist.elim 1); |
|
429 |
by (etac ssubst 1); |
|
430 |
by (stac NILcase 1); |
|
1046 | 431 |
by (rtac (gMlist RS LListD_Fun_diag_I) 1); |
969 | 432 |
by (etac ssubst 1); |
433 |
by (REPEAT (ares_tac [CONScase] 1)); |
|
434 |
qed "LList_fun_equalityI"; |
|
435 |
||
436 |
||
437 |
(*** The functional "Lmap" ***) |
|
438 |
||
439 |
goal LList.thy "Lmap f NIL = NIL"; |
|
440 |
by (rtac (Lmap_def RS def_LList_corec RS trans) 1); |
|
1266 | 441 |
by (Simp_tac 1); |
969 | 442 |
qed "Lmap_NIL"; |
443 |
||
444 |
goal LList.thy "Lmap f (CONS M N) = CONS (f M) (Lmap f N)"; |
|
445 |
by (rtac (Lmap_def RS def_LList_corec RS trans) 1); |
|
1266 | 446 |
by (Simp_tac 1); |
969 | 447 |
qed "Lmap_CONS"; |
448 |
||
449 |
(*Another type-checking proof by coinduction*) |
|
450 |
val [major,minor] = goal LList.thy |
|
451 |
"[| M: llist(A); !!x. x:A ==> f(x):B |] ==> Lmap f M: llist(B)"; |
|
452 |
by (rtac (major RS imageI RS llist_coinduct) 1); |
|
453 |
by (safe_tac set_cs); |
|
454 |
by (etac llist.elim 1); |
|
1266 | 455 |
by (ALLGOALS (asm_simp_tac (!simpset addsimps [Lmap_NIL,Lmap_CONS]))); |
969 | 456 |
by (REPEAT (ares_tac [list_Fun_NIL_I, list_Fun_CONS_I, |
1465 | 457 |
minor, imageI, UnI1] 1)); |
969 | 458 |
qed "Lmap_type"; |
459 |
||
460 |
(*This type checking rule synthesises a sufficiently large set for f*) |
|
461 |
val [major] = goal LList.thy "M: llist(A) ==> Lmap f M: llist(f``A)"; |
|
462 |
by (rtac (major RS Lmap_type) 1); |
|
463 |
by (etac imageI 1); |
|
464 |
qed "Lmap_type2"; |
|
465 |
||
466 |
(** Two easy results about Lmap **) |
|
467 |
||
468 |
val [prem] = goalw LList.thy [o_def] |
|
469 |
"M: llist(A) ==> Lmap (f o g) M = Lmap f (Lmap g M)"; |
|
470 |
by (rtac (prem RS imageI RS LList_equalityI) 1); |
|
471 |
by (safe_tac set_cs); |
|
472 |
by (etac llist.elim 1); |
|
1266 | 473 |
by (ALLGOALS (asm_simp_tac (!simpset addsimps [Lmap_NIL,Lmap_CONS]))); |
969 | 474 |
by (REPEAT (ares_tac [LListD_Fun_NIL_I, imageI, UnI1, |
1465 | 475 |
rangeI RS LListD_Fun_CONS_I] 1)); |
969 | 476 |
qed "Lmap_compose"; |
477 |
||
478 |
val [prem] = goal LList.thy "M: llist(A) ==> Lmap (%x.x) M = M"; |
|
479 |
by (rtac (prem RS imageI RS LList_equalityI) 1); |
|
480 |
by (safe_tac set_cs); |
|
481 |
by (etac llist.elim 1); |
|
1266 | 482 |
by (ALLGOALS (asm_simp_tac (!simpset addsimps [Lmap_NIL,Lmap_CONS]))); |
969 | 483 |
by (REPEAT (ares_tac [LListD_Fun_NIL_I, imageI RS UnI1, |
1465 | 484 |
rangeI RS LListD_Fun_CONS_I] 1)); |
969 | 485 |
qed "Lmap_ident"; |
486 |
||
487 |
||
488 |
(*** Lappend -- its two arguments cause some complications! ***) |
|
489 |
||
490 |
goalw LList.thy [Lappend_def] "Lappend NIL NIL = NIL"; |
|
491 |
by (rtac (LList_corec RS trans) 1); |
|
1266 | 492 |
by (Simp_tac 1); |
969 | 493 |
qed "Lappend_NIL_NIL"; |
494 |
||
495 |
goalw LList.thy [Lappend_def] |
|
496 |
"Lappend NIL (CONS N N') = CONS N (Lappend NIL N')"; |
|
497 |
by (rtac (LList_corec RS trans) 1); |
|
1266 | 498 |
by (Simp_tac 1); |
969 | 499 |
qed "Lappend_NIL_CONS"; |
500 |
||
501 |
goalw LList.thy [Lappend_def] |
|
502 |
"Lappend (CONS M M') N = CONS M (Lappend M' N)"; |
|
503 |
by (rtac (LList_corec RS trans) 1); |
|
1266 | 504 |
by (Simp_tac 1); |
969 | 505 |
qed "Lappend_CONS"; |
506 |
||
1266 | 507 |
Addsimps [llist.NIL_I, Lappend_NIL_NIL, Lappend_NIL_CONS, |
1465 | 508 |
Lappend_CONS, LListD_Fun_CONS_I, range_eqI, image_eqI]; |
1266 | 509 |
Delsimps [Pair_eq]; |
969 | 510 |
|
511 |
goal LList.thy "!!M. M: llist(A) ==> Lappend NIL M = M"; |
|
512 |
by (etac LList_fun_equalityI 1); |
|
1266 | 513 |
by (ALLGOALS Asm_simp_tac); |
969 | 514 |
qed "Lappend_NIL"; |
515 |
||
516 |
goal LList.thy "!!M. M: llist(A) ==> Lappend M NIL = M"; |
|
517 |
by (etac LList_fun_equalityI 1); |
|
1266 | 518 |
by (ALLGOALS Asm_simp_tac); |
969 | 519 |
qed "Lappend_NIL2"; |
520 |
||
521 |
(** Alternative type-checking proofs for Lappend **) |
|
522 |
||
523 |
(*weak co-induction: bisimulation and case analysis on both variables*) |
|
524 |
goal LList.thy |
|
525 |
"!!M N. [| M: llist(A); N: llist(A) |] ==> Lappend M N: llist(A)"; |
|
526 |
by (res_inst_tac |
|
527 |
[("X", "UN u:llist(A). UN v: llist(A). {Lappend u v}")] llist_coinduct 1); |
|
528 |
by (fast_tac set_cs 1); |
|
529 |
by (safe_tac set_cs); |
|
530 |
by (eres_inst_tac [("a", "u")] llist.elim 1); |
|
531 |
by (eres_inst_tac [("a", "v")] llist.elim 1); |
|
532 |
by (ALLGOALS |
|
1266 | 533 |
(Asm_simp_tac THEN' |
969 | 534 |
fast_tac (set_cs addSIs [llist.NIL_I, list_Fun_NIL_I, list_Fun_CONS_I]))); |
535 |
qed "Lappend_type"; |
|
536 |
||
537 |
(*strong co-induction: bisimulation and case analysis on one variable*) |
|
538 |
goal LList.thy |
|
539 |
"!!M N. [| M: llist(A); N: llist(A) |] ==> Lappend M N: llist(A)"; |
|
540 |
by (res_inst_tac [("X", "(%u.Lappend u N)``llist(A)")] llist_coinduct 1); |
|
1046 | 541 |
by (etac imageI 1); |
542 |
by (rtac subsetI 1); |
|
543 |
by (etac imageE 1); |
|
969 | 544 |
by (eres_inst_tac [("a", "u")] llist.elim 1); |
1266 | 545 |
by (asm_simp_tac (!simpset addsimps [Lappend_NIL, list_Fun_llist_I]) 1); |
546 |
by (Asm_simp_tac 1); |
|
969 | 547 |
by (fast_tac (set_cs addSIs [list_Fun_CONS_I]) 1); |
548 |
qed "Lappend_type"; |
|
549 |
||
550 |
(**** Lazy lists as the type 'a llist -- strongly typed versions of above ****) |
|
551 |
||
552 |
(** llist_case: case analysis for 'a llist **) |
|
553 |
||
1266 | 554 |
Addsimps ([Abs_llist_inverse, Rep_llist_inverse, |
555 |
Rep_llist, rangeI, inj_Leaf, Inv_f_f] @ llist.intrs); |
|
969 | 556 |
|
557 |
goalw LList.thy [llist_case_def,LNil_def] "llist_case c d LNil = c"; |
|
1266 | 558 |
by (Simp_tac 1); |
969 | 559 |
qed "llist_case_LNil"; |
560 |
||
561 |
goalw LList.thy [llist_case_def,LCons_def] |
|
562 |
"llist_case c d (LCons M N) = d M N"; |
|
1266 | 563 |
by (Simp_tac 1); |
969 | 564 |
qed "llist_case_LCons"; |
565 |
||
566 |
(*Elimination is case analysis, not induction.*) |
|
567 |
val [prem1,prem2] = goalw LList.thy [NIL_def,CONS_def] |
|
568 |
"[| l=LNil ==> P; !!x l'. l=LCons x l' ==> P \ |
|
569 |
\ |] ==> P"; |
|
570 |
by (rtac (Rep_llist RS llist.elim) 1); |
|
571 |
by (rtac (inj_Rep_llist RS injD RS prem1) 1); |
|
572 |
by (stac Rep_llist_LNil 1); |
|
573 |
by (assume_tac 1); |
|
574 |
by (etac rangeE 1); |
|
575 |
by (rtac (inj_Rep_llist RS injD RS prem2) 1); |
|
1266 | 576 |
by (asm_simp_tac (!simpset delsimps [CONS_CONS_eq] addsimps [Rep_llist_LCons]) 1); |
969 | 577 |
by (etac (Abs_llist_inverse RS ssubst) 1); |
578 |
by (rtac refl 1); |
|
579 |
qed "llistE"; |
|
580 |
||
581 |
(** llist_corec: corecursion for 'a llist **) |
|
582 |
||
583 |
goalw LList.thy [llist_corec_def,LNil_def,LCons_def] |
|
584 |
"llist_corec a f = sum_case (%u. LNil) \ |
|
1465 | 585 |
\ (split(%z w. LCons z (llist_corec w f))) (f a)"; |
969 | 586 |
by (stac LList_corec 1); |
587 |
by (res_inst_tac [("s","f(a)")] sumE 1); |
|
1266 | 588 |
by (asm_simp_tac (!simpset addsimps [LList_corec_type2]) 1); |
969 | 589 |
by (res_inst_tac [("p","y")] PairE 1); |
1266 | 590 |
by (asm_simp_tac (!simpset addsimps [LList_corec_type2]) 1); |
969 | 591 |
(*FIXME: correct case splits usd to be found automatically: |
1266 | 592 |
by (ASM_SIMP_TAC(!simpset addsimps [LList_corec_type2]) 1);*) |
969 | 593 |
qed "llist_corec"; |
594 |
||
595 |
(*definitional version of same*) |
|
596 |
val [rew] = goal LList.thy |
|
1465 | 597 |
"[| !!x. h(x) == llist_corec x f |] ==> \ |
969 | 598 |
\ h(a) = sum_case (%u.LNil) (split(%z w. LCons z (h w))) (f a)"; |
599 |
by (rewtac rew); |
|
600 |
by (rtac llist_corec 1); |
|
601 |
qed "def_llist_corec"; |
|
602 |
||
603 |
(**** Proofs about type 'a llist functions ****) |
|
604 |
||
605 |
(*** Deriving llist_equalityI -- llist equality is a bisimulation ***) |
|
606 |
||
607 |
goalw LList.thy [LListD_Fun_def] |
|
1642 | 608 |
"!!r A. r <= (llist A) Times (llist A) ==> \ |
609 |
\ LListD_Fun (diag A) r <= (llist A) Times (llist A)"; |
|
969 | 610 |
by (stac llist_unfold 1); |
1266 | 611 |
by (simp_tac (!simpset addsimps [NIL_def, CONS_def]) 1); |
969 | 612 |
by (fast_tac univ_cs 1); |
613 |
qed "LListD_Fun_subset_Sigma_llist"; |
|
614 |
||
615 |
goal LList.thy |
|
616 |
"prod_fun Rep_llist Rep_llist `` r <= \ |
|
1642 | 617 |
\ (llist(range Leaf)) Times (llist(range Leaf))"; |
969 | 618 |
by (fast_tac (prod_cs addIs [Rep_llist]) 1); |
619 |
qed "subset_Sigma_llist"; |
|
620 |
||
621 |
val [prem] = goal LList.thy |
|
1642 | 622 |
"r <= (llist(range Leaf)) Times (llist(range Leaf)) ==> \ |
969 | 623 |
\ prod_fun (Rep_llist o Abs_llist) (Rep_llist o Abs_llist) `` r <= r"; |
624 |
by (safe_tac prod_cs); |
|
625 |
by (rtac (prem RS subsetD RS SigmaE2) 1); |
|
626 |
by (assume_tac 1); |
|
1266 | 627 |
by (asm_simp_tac (!simpset addsimps [o_def,prod_fun,Abs_llist_inverse]) 1); |
969 | 628 |
qed "prod_fun_lemma"; |
629 |
||
630 |
goal LList.thy |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
631 |
"prod_fun Rep_llist Rep_llist `` range(%x. (x, x)) = \ |
1642 | 632 |
\ diag(llist(range Leaf))"; |
1046 | 633 |
by (rtac equalityI 1); |
969 | 634 |
by (fast_tac (univ_cs addIs [Rep_llist]) 1); |
635 |
by (fast_tac (univ_cs addSEs [Abs_llist_inverse RS subst]) 1); |
|
636 |
qed "prod_fun_range_eq_diag"; |
|
637 |
||
638 |
(** To show two llists are equal, exhibit a bisimulation! |
|
639 |
[also admits true equality] **) |
|
640 |
val [prem1,prem2] = goalw LList.thy [llistD_Fun_def] |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
641 |
"[| (l1,l2) : r; r <= llistD_Fun(r Un range(%x.(x,x))) |] ==> l1=l2"; |
969 | 642 |
by (rtac (inj_Rep_llist RS injD) 1); |
643 |
by (res_inst_tac [("r", "prod_fun Rep_llist Rep_llist ``r"), |
|
1465 | 644 |
("A", "range(Leaf)")] |
645 |
LList_equalityI 1); |
|
969 | 646 |
by (rtac (prem1 RS prod_fun_imageI) 1); |
647 |
by (rtac (prem2 RS image_mono RS subset_trans) 1); |
|
648 |
by (rtac (image_compose RS subst) 1); |
|
649 |
by (rtac (prod_fun_compose RS subst) 1); |
|
650 |
by (rtac (image_Un RS ssubst) 1); |
|
651 |
by (stac prod_fun_range_eq_diag 1); |
|
652 |
by (rtac (LListD_Fun_subset_Sigma_llist RS prod_fun_lemma) 1); |
|
653 |
by (rtac (subset_Sigma_llist RS Un_least) 1); |
|
654 |
by (rtac diag_subset_Sigma 1); |
|
655 |
qed "llist_equalityI"; |
|
656 |
||
657 |
(** Rules to prove the 2nd premise of llist_equalityI **) |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
658 |
goalw LList.thy [llistD_Fun_def,LNil_def] "(LNil,LNil) : llistD_Fun(r)"; |
969 | 659 |
by (rtac (LListD_Fun_NIL_I RS prod_fun_imageI) 1); |
660 |
qed "llistD_Fun_LNil_I"; |
|
661 |
||
662 |
val [prem] = goalw LList.thy [llistD_Fun_def,LCons_def] |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
663 |
"(l1,l2):r ==> (LCons x l1, LCons x l2) : llistD_Fun(r)"; |
969 | 664 |
by (rtac (rangeI RS LListD_Fun_CONS_I RS prod_fun_imageI) 1); |
665 |
by (rtac (prem RS prod_fun_imageI) 1); |
|
666 |
qed "llistD_Fun_LCons_I"; |
|
667 |
||
668 |
(*Utilise the "strong" part, i.e. gfp(f)*) |
|
669 |
goalw LList.thy [llistD_Fun_def] |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
670 |
"!!l. (l,l) : llistD_Fun(r Un range(%x.(x,x)))"; |
1046 | 671 |
by (rtac (Rep_llist_inverse RS subst) 1); |
672 |
by (rtac prod_fun_imageI 1); |
|
969 | 673 |
by (rtac (image_Un RS ssubst) 1); |
674 |
by (stac prod_fun_range_eq_diag 1); |
|
1046 | 675 |
by (rtac (Rep_llist RS LListD_Fun_diag_I) 1); |
969 | 676 |
qed "llistD_Fun_range_I"; |
677 |
||
678 |
(*A special case of list_equality for functions over lazy lists*) |
|
679 |
val [prem1,prem2] = goal LList.thy |
|
1465 | 680 |
"[| f(LNil)=g(LNil); \ |
681 |
\ !!x l. (f(LCons x l),g(LCons x l)) : \ |
|
682 |
\ llistD_Fun(range(%u. (f(u),g(u))) Un range(%v. (v,v))) \ |
|
683 |
\ |] ==> f(l) = (g(l :: 'a llist) :: 'b llist)"; |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
684 |
by (res_inst_tac [("r", "range(%u. (f(u),g(u)))")] llist_equalityI 1); |
969 | 685 |
by (rtac rangeI 1); |
686 |
by (rtac subsetI 1); |
|
687 |
by (etac rangeE 1); |
|
688 |
by (etac ssubst 1); |
|
689 |
by (res_inst_tac [("l", "u")] llistE 1); |
|
690 |
by (etac ssubst 1); |
|
691 |
by (stac prem1 1); |
|
692 |
by (rtac llistD_Fun_range_I 1); |
|
693 |
by (etac ssubst 1); |
|
694 |
by (rtac prem2 1); |
|
695 |
qed "llist_fun_equalityI"; |
|
696 |
||
697 |
(*simpset for llist bisimulations*) |
|
1266 | 698 |
Addsimps [llist_case_LNil, llist_case_LCons, |
1465 | 699 |
llistD_Fun_LNil_I, llistD_Fun_LCons_I]; |
969 | 700 |
|
701 |
||
702 |
(*** The functional "lmap" ***) |
|
703 |
||
704 |
goal LList.thy "lmap f LNil = LNil"; |
|
705 |
by (rtac (lmap_def RS def_llist_corec RS trans) 1); |
|
1266 | 706 |
by (Simp_tac 1); |
969 | 707 |
qed "lmap_LNil"; |
708 |
||
709 |
goal LList.thy "lmap f (LCons M N) = LCons (f M) (lmap f N)"; |
|
710 |
by (rtac (lmap_def RS def_llist_corec RS trans) 1); |
|
1266 | 711 |
by (Simp_tac 1); |
969 | 712 |
qed "lmap_LCons"; |
713 |
||
714 |
||
715 |
(** Two easy results about lmap **) |
|
716 |
||
717 |
goal LList.thy "lmap (f o g) l = lmap f (lmap g l)"; |
|
718 |
by (res_inst_tac [("l","l")] llist_fun_equalityI 1); |
|
1266 | 719 |
by (ALLGOALS (simp_tac (!simpset addsimps [lmap_LNil, lmap_LCons]))); |
969 | 720 |
qed "lmap_compose"; |
721 |
||
722 |
goal LList.thy "lmap (%x.x) l = l"; |
|
723 |
by (res_inst_tac [("l","l")] llist_fun_equalityI 1); |
|
1266 | 724 |
by (ALLGOALS (simp_tac (!simpset addsimps [lmap_LNil, lmap_LCons]))); |
969 | 725 |
qed "lmap_ident"; |
726 |
||
727 |
||
728 |
(*** iterates -- llist_fun_equalityI cannot be used! ***) |
|
729 |
||
730 |
goal LList.thy "iterates f x = LCons x (iterates f (f x))"; |
|
731 |
by (rtac (iterates_def RS def_llist_corec RS trans) 1); |
|
1266 | 732 |
by (Simp_tac 1); |
969 | 733 |
qed "iterates"; |
734 |
||
735 |
goal LList.thy "lmap f (iterates f x) = iterates f (f x)"; |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
736 |
by (res_inst_tac [("r", "range(%u.(lmap f (iterates f u),iterates f (f u)))")] |
969 | 737 |
llist_equalityI 1); |
738 |
by (rtac rangeI 1); |
|
739 |
by (safe_tac set_cs); |
|
740 |
by (res_inst_tac [("x1", "f(u)")] (iterates RS ssubst) 1); |
|
741 |
by (res_inst_tac [("x1", "u")] (iterates RS ssubst) 1); |
|
1266 | 742 |
by (simp_tac (!simpset addsimps [lmap_LCons]) 1); |
969 | 743 |
qed "lmap_iterates"; |
744 |
||
745 |
goal LList.thy "iterates f x = LCons x (lmap f (iterates f x))"; |
|
1046 | 746 |
by (rtac (lmap_iterates RS ssubst) 1); |
747 |
by (rtac iterates 1); |
|
969 | 748 |
qed "iterates_lmap"; |
749 |
||
750 |
(*** A rather complex proof about iterates -- cf Andy Pitts ***) |
|
751 |
||
752 |
(** Two lemmas about natrec n x (%m.g), which is essentially (g^n)(x) **) |
|
753 |
||
754 |
goal LList.thy |
|
1465 | 755 |
"nat_rec n (LCons b l) (%m. lmap(f)) = \ |
969 | 756 |
\ LCons (nat_rec n b (%m. f)) (nat_rec n l (%m. lmap(f)))"; |
757 |
by (nat_ind_tac "n" 1); |
|
1266 | 758 |
by (ALLGOALS (asm_simp_tac (!simpset addsimps [lmap_LCons]))); |
969 | 759 |
qed "fun_power_lmap"; |
760 |
||
761 |
goal Nat.thy "nat_rec n (g x) (%m. g) = nat_rec (Suc n) x (%m. g)"; |
|
762 |
by (nat_ind_tac "n" 1); |
|
1266 | 763 |
by (ALLGOALS Asm_simp_tac); |
969 | 764 |
qed "fun_power_Suc"; |
765 |
||
766 |
val Pair_cong = read_instantiate_sg (sign_of Prod.thy) |
|
767 |
[("f","Pair")] (standard(refl RS cong RS cong)); |
|
768 |
||
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
769 |
(*The bisimulation consists of {(lmap(f)^n (h(u)), lmap(f)^n (iterates(f,u)))} |
969 | 770 |
for all u and all n::nat.*) |
771 |
val [prem] = goal LList.thy |
|
772 |
"(!!x. h(x) = LCons x (lmap f (h x))) ==> h = iterates(f)"; |
|
1046 | 773 |
by (rtac ext 1); |
969 | 774 |
by (res_inst_tac [("r", |
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
775 |
"UN u. range(%n. (nat_rec n (h u) (%m y.lmap f y), \ |
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
776 |
\ nat_rec n (iterates f u) (%m y.lmap f y)))")] |
969 | 777 |
llist_equalityI 1); |
778 |
by (REPEAT (resolve_tac [UN1_I, range_eqI, Pair_cong, nat_rec_0 RS sym] 1)); |
|
779 |
by (safe_tac set_cs); |
|
780 |
by (stac iterates 1); |
|
781 |
by (stac prem 1); |
|
782 |
by (stac fun_power_lmap 1); |
|
783 |
by (stac fun_power_lmap 1); |
|
1046 | 784 |
by (rtac llistD_Fun_LCons_I 1); |
969 | 785 |
by (rtac (lmap_iterates RS subst) 1); |
786 |
by (stac fun_power_Suc 1); |
|
787 |
by (stac fun_power_Suc 1); |
|
1046 | 788 |
by (rtac (UN1_I RS UnI1) 1); |
789 |
by (rtac rangeI 1); |
|
969 | 790 |
qed "iterates_equality"; |
791 |
||
792 |
||
793 |
(*** lappend -- its two arguments cause some complications! ***) |
|
794 |
||
795 |
goalw LList.thy [lappend_def] "lappend LNil LNil = LNil"; |
|
796 |
by (rtac (llist_corec RS trans) 1); |
|
1266 | 797 |
by (Simp_tac 1); |
969 | 798 |
qed "lappend_LNil_LNil"; |
799 |
||
800 |
goalw LList.thy [lappend_def] |
|
801 |
"lappend LNil (LCons l l') = LCons l (lappend LNil l')"; |
|
802 |
by (rtac (llist_corec RS trans) 1); |
|
1266 | 803 |
by (Simp_tac 1); |
969 | 804 |
qed "lappend_LNil_LCons"; |
805 |
||
806 |
goalw LList.thy [lappend_def] |
|
807 |
"lappend (LCons l l') N = LCons l (lappend l' N)"; |
|
808 |
by (rtac (llist_corec RS trans) 1); |
|
1266 | 809 |
by (Simp_tac 1); |
969 | 810 |
qed "lappend_LCons"; |
811 |
||
812 |
goal LList.thy "lappend LNil l = l"; |
|
813 |
by (res_inst_tac [("l","l")] llist_fun_equalityI 1); |
|
814 |
by (ALLGOALS |
|
1266 | 815 |
(simp_tac (!simpset addsimps [lappend_LNil_LNil, lappend_LNil_LCons]))); |
969 | 816 |
qed "lappend_LNil"; |
817 |
||
818 |
goal LList.thy "lappend l LNil = l"; |
|
819 |
by (res_inst_tac [("l","l")] llist_fun_equalityI 1); |
|
820 |
by (ALLGOALS |
|
1266 | 821 |
(simp_tac (!simpset addsimps [lappend_LNil_LNil, lappend_LCons]))); |
969 | 822 |
qed "lappend_LNil2"; |
823 |
||
824 |
(*The infinite first argument blocks the second*) |
|
825 |
goal LList.thy "lappend (iterates f x) N = iterates f x"; |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
826 |
by (res_inst_tac [("r", "range(%u.(lappend (iterates f u) N,iterates f u))")] |
969 | 827 |
llist_equalityI 1); |
828 |
by (rtac rangeI 1); |
|
829 |
by (safe_tac set_cs); |
|
830 |
by (stac iterates 1); |
|
1266 | 831 |
by (simp_tac (!simpset addsimps [lappend_LCons]) 1); |
969 | 832 |
qed "lappend_iterates"; |
833 |
||
834 |
(** Two proofs that lmap distributes over lappend **) |
|
835 |
||
836 |
(*Long proof requiring case analysis on both both arguments*) |
|
837 |
goal LList.thy "lmap f (lappend l n) = lappend (lmap f l) (lmap f n)"; |
|
838 |
by (res_inst_tac |
|
839 |
[("r", |
|
972
e61b058d58d2
changed syntax of tuples from <..., ...> to (..., ...)
clasohm
parents:
969
diff
changeset
|
840 |
"UN n. range(%l.(lmap f (lappend l n),lappend (lmap f l) (lmap f n)))")] |
969 | 841 |
llist_equalityI 1); |
842 |
by (rtac UN1_I 1); |
|
843 |
by (rtac rangeI 1); |
|
844 |
by (safe_tac set_cs); |
|
845 |
by (res_inst_tac [("l", "l")] llistE 1); |
|
846 |
by (res_inst_tac [("l", "n")] llistE 1); |
|
1266 | 847 |
by (ALLGOALS (asm_simp_tac (!simpset addsimps |
969 | 848 |
[lappend_LNil_LNil,lappend_LCons,lappend_LNil_LCons, |
849 |
lmap_LNil,lmap_LCons]))); |
|
850 |
by (REPEAT_SOME (ares_tac [llistD_Fun_LCons_I, UN1_I RS UnI1, rangeI])); |
|
851 |
by (rtac range_eqI 1); |
|
852 |
by (rtac (refl RS Pair_cong) 1); |
|
853 |
by (stac lmap_LNil 1); |
|
854 |
by (rtac refl 1); |
|
855 |
qed "lmap_lappend_distrib"; |
|
856 |
||
857 |
(*Shorter proof of theorem above using llist_equalityI as strong coinduction*) |
|
858 |
goal LList.thy "lmap f (lappend l n) = lappend (lmap f l) (lmap f n)"; |
|
859 |
by (res_inst_tac [("l","l")] llist_fun_equalityI 1); |
|
1266 | 860 |
by (simp_tac (!simpset addsimps [lappend_LNil, lmap_LNil])1); |
861 |
by (simp_tac (!simpset addsimps [lappend_LCons, lmap_LCons]) 1); |
|
969 | 862 |
qed "lmap_lappend_distrib"; |
863 |
||
864 |
(*Without strong coinduction, three case analyses might be needed*) |
|
865 |
goal LList.thy "lappend (lappend l1 l2) l3 = lappend l1 (lappend l2 l3)"; |
|
866 |
by (res_inst_tac [("l","l1")] llist_fun_equalityI 1); |
|
1266 | 867 |
by (simp_tac (!simpset addsimps [lappend_LNil])1); |
868 |
by (simp_tac (!simpset addsimps [lappend_LCons]) 1); |
|
969 | 869 |
qed "lappend_assoc"; |