author | paulson |
Tue, 03 Mar 1998 15:12:25 +0100 | |
changeset 4673 | 59d80bacee62 |
parent 4647 | 42af8ae6e2c1 |
child 4681 | a331c1f5a23e |
permissions | -rw-r--r-- |
1465 | 1 |
(* Title: HOL/List |
923 | 2 |
ID: $Id$ |
1465 | 3 |
Author: Tobias Nipkow |
923 | 4 |
Copyright 1994 TU Muenchen |
5 |
||
6 |
List lemmas |
|
7 |
*) |
|
8 |
||
3011 | 9 |
goal thy "!x. xs ~= x#xs"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
10 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
11 |
by (ALLGOALS Asm_simp_tac); |
2608 | 12 |
qed_spec_mp "not_Cons_self"; |
3574 | 13 |
bind_thm("not_Cons_self2",not_Cons_self RS not_sym); |
14 |
Addsimps [not_Cons_self,not_Cons_self2]; |
|
923 | 15 |
|
3011 | 16 |
goal thy "(xs ~= []) = (? y ys. xs = y#ys)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
17 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
18 |
by (Simp_tac 1); |
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
19 |
by (Asm_simp_tac 1); |
923 | 20 |
qed "neq_Nil_conv"; |
21 |
||
22 |
||
3468 | 23 |
(** "lists": the list-forming operator over sets **) |
3342
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
24 |
|
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
25 |
goalw thy lists.defs "!!A B. A<=B ==> lists A <= lists B"; |
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
26 |
by (rtac lfp_mono 1); |
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
27 |
by (REPEAT (ares_tac basic_monos 1)); |
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
28 |
qed "lists_mono"; |
3196 | 29 |
|
3468 | 30 |
val listsE = lists.mk_cases list.simps "x#l : lists A"; |
31 |
AddSEs [listsE]; |
|
32 |
AddSIs lists.intrs; |
|
33 |
||
34 |
goal thy "!!l. l: lists A ==> l: lists B --> l: lists (A Int B)"; |
|
35 |
by (etac lists.induct 1); |
|
36 |
by (ALLGOALS Blast_tac); |
|
37 |
qed_spec_mp "lists_IntI"; |
|
38 |
||
39 |
goal thy "lists (A Int B) = lists A Int lists B"; |
|
4423 | 40 |
by (rtac (mono_Int RS equalityI) 1); |
4089 | 41 |
by (simp_tac (simpset() addsimps [mono_def, lists_mono]) 1); |
42 |
by (blast_tac (claset() addSIs [lists_IntI]) 1); |
|
3468 | 43 |
qed "lists_Int_eq"; |
44 |
Addsimps [lists_Int_eq]; |
|
45 |
||
3196 | 46 |
|
4643 | 47 |
(** Case analysis **) |
48 |
section "Case analysis"; |
|
2608 | 49 |
|
3011 | 50 |
val prems = goal thy "[| P([]); !!x xs. P(x#xs) |] ==> P(xs)"; |
3457 | 51 |
by (induct_tac "xs" 1); |
52 |
by (REPEAT(resolve_tac prems 1)); |
|
2608 | 53 |
qed "list_cases"; |
54 |
||
3011 | 55 |
goal thy "(xs=[] --> P([])) & (!y ys. xs=y#ys --> P(y#ys)) --> P(xs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
56 |
by (induct_tac "xs" 1); |
2891 | 57 |
by (Blast_tac 1); |
58 |
by (Blast_tac 1); |
|
2608 | 59 |
bind_thm("list_eq_cases", |
60 |
impI RSN (2,allI RSN (2,allI RSN (2,impI RS (conjI RS (result() RS mp)))))); |
|
61 |
||
3860 | 62 |
(** length **) |
63 |
(* needs to come before "@" because of thm append_eq_append_conv *) |
|
64 |
||
65 |
section "length"; |
|
66 |
||
67 |
goal thy "length(xs@ys) = length(xs)+length(ys)"; |
|
68 |
by (induct_tac "xs" 1); |
|
69 |
by (ALLGOALS Asm_simp_tac); |
|
70 |
qed"length_append"; |
|
71 |
Addsimps [length_append]; |
|
72 |
||
73 |
goal thy "length (map f l) = length l"; |
|
74 |
by (induct_tac "l" 1); |
|
75 |
by (ALLGOALS Simp_tac); |
|
76 |
qed "length_map"; |
|
77 |
Addsimps [length_map]; |
|
78 |
||
79 |
goal thy "length(rev xs) = length(xs)"; |
|
80 |
by (induct_tac "xs" 1); |
|
81 |
by (ALLGOALS Asm_simp_tac); |
|
82 |
qed "length_rev"; |
|
83 |
Addsimps [length_rev]; |
|
84 |
||
4628 | 85 |
goal List.thy "!!xs. xs ~= [] ==> length(tl xs) = (length xs) - 1"; |
4423 | 86 |
by (exhaust_tac "xs" 1); |
87 |
by (ALLGOALS Asm_full_simp_tac); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
88 |
qed "length_tl"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
89 |
Addsimps [length_tl]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
90 |
|
3860 | 91 |
goal thy "(length xs = 0) = (xs = [])"; |
92 |
by (induct_tac "xs" 1); |
|
93 |
by (ALLGOALS Asm_simp_tac); |
|
94 |
qed "length_0_conv"; |
|
95 |
AddIffs [length_0_conv]; |
|
96 |
||
97 |
goal thy "(0 = length xs) = (xs = [])"; |
|
98 |
by (induct_tac "xs" 1); |
|
99 |
by (ALLGOALS Asm_simp_tac); |
|
100 |
qed "zero_length_conv"; |
|
101 |
AddIffs [zero_length_conv]; |
|
102 |
||
103 |
goal thy "(0 < length xs) = (xs ~= [])"; |
|
104 |
by (induct_tac "xs" 1); |
|
105 |
by (ALLGOALS Asm_simp_tac); |
|
106 |
qed "length_greater_0_conv"; |
|
107 |
AddIffs [length_greater_0_conv]; |
|
108 |
||
923 | 109 |
(** @ - append **) |
110 |
||
3467 | 111 |
section "@ - append"; |
112 |
||
3011 | 113 |
goal thy "(xs@ys)@zs = xs@(ys@zs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
114 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
115 |
by (ALLGOALS Asm_simp_tac); |
923 | 116 |
qed "append_assoc"; |
2512 | 117 |
Addsimps [append_assoc]; |
923 | 118 |
|
3011 | 119 |
goal thy "xs @ [] = xs"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
120 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
121 |
by (ALLGOALS Asm_simp_tac); |
923 | 122 |
qed "append_Nil2"; |
2512 | 123 |
Addsimps [append_Nil2]; |
923 | 124 |
|
3011 | 125 |
goal thy "(xs@ys = []) = (xs=[] & ys=[])"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
126 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
127 |
by (ALLGOALS Asm_simp_tac); |
2608 | 128 |
qed "append_is_Nil_conv"; |
129 |
AddIffs [append_is_Nil_conv]; |
|
130 |
||
3011 | 131 |
goal thy "([] = xs@ys) = (xs=[] & ys=[])"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
132 |
by (induct_tac "xs" 1); |
2608 | 133 |
by (ALLGOALS Asm_simp_tac); |
3457 | 134 |
by (Blast_tac 1); |
2608 | 135 |
qed "Nil_is_append_conv"; |
136 |
AddIffs [Nil_is_append_conv]; |
|
923 | 137 |
|
3574 | 138 |
goal thy "(xs @ ys = xs) = (ys=[])"; |
139 |
by (induct_tac "xs" 1); |
|
140 |
by (ALLGOALS Asm_simp_tac); |
|
141 |
qed "append_self_conv"; |
|
142 |
||
143 |
goal thy "(xs = xs @ ys) = (ys=[])"; |
|
144 |
by (induct_tac "xs" 1); |
|
145 |
by (ALLGOALS Asm_simp_tac); |
|
146 |
by (Blast_tac 1); |
|
147 |
qed "self_append_conv"; |
|
148 |
AddIffs [append_self_conv,self_append_conv]; |
|
149 |
||
3860 | 150 |
goal thy "!ys. length xs = length ys | length us = length vs \ |
151 |
\ --> (xs@us = ys@vs) = (xs=ys & us=vs)"; |
|
4423 | 152 |
by (induct_tac "xs" 1); |
153 |
by (rtac allI 1); |
|
154 |
by (exhaust_tac "ys" 1); |
|
155 |
by (Asm_simp_tac 1); |
|
156 |
by (fast_tac (claset() addIs [less_add_Suc2] addss simpset() |
|
3860 | 157 |
addEs [less_not_refl2 RSN (2,rev_notE)]) 1); |
4423 | 158 |
by (rtac allI 1); |
159 |
by (exhaust_tac "ys" 1); |
|
160 |
by (fast_tac (claset() addIs [less_add_Suc2] addss simpset() |
|
3860 | 161 |
addEs [(less_not_refl2 RS not_sym) RSN (2,rev_notE)]) 1); |
4423 | 162 |
by (Asm_simp_tac 1); |
3860 | 163 |
qed_spec_mp "append_eq_append_conv"; |
164 |
Addsimps [append_eq_append_conv]; |
|
165 |
||
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
166 |
goal thy "(xs @ ys = xs @ zs) = (ys=zs)"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
167 |
by (Simp_tac 1); |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
168 |
qed "same_append_eq"; |
3860 | 169 |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
170 |
goal thy "(xs @ [x] = ys @ [y]) = (xs = ys & x = y)"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
171 |
by (Simp_tac 1); |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
172 |
qed "append1_eq_conv"; |
2608 | 173 |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
174 |
goal thy "(ys @ xs = zs @ xs) = (ys=zs)"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
175 |
by (Simp_tac 1); |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
176 |
qed "append_same_eq"; |
2608 | 177 |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
178 |
AddSIs |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
179 |
[same_append_eq RS iffD2, append1_eq_conv RS iffD2, append_same_eq RS iffD2]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
180 |
AddSDs |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
181 |
[same_append_eq RS iffD1, append1_eq_conv RS iffD1, append_same_eq RS iffD1]; |
3571 | 182 |
|
4647 | 183 |
goal thy "(xs @ ys = ys) = (xs=[])"; |
184 |
by(cut_inst_tac [("zs","[]")] append_same_eq 1); |
|
185 |
by(Asm_full_simp_tac 1); |
|
186 |
qed "append_self_conv2"; |
|
187 |
||
188 |
goal thy "(ys = xs @ ys) = (xs=[])"; |
|
189 |
by(simp_tac (simpset() addsimps |
|
190 |
[simplify (simpset()) (read_instantiate[("ys","[]")]append_same_eq)]) 1); |
|
191 |
by(Blast_tac 1); |
|
192 |
qed "self_append_conv2"; |
|
193 |
AddIffs [append_self_conv2,self_append_conv2]; |
|
194 |
||
3011 | 195 |
goal thy "xs ~= [] --> hd xs # tl xs = xs"; |
3457 | 196 |
by (induct_tac "xs" 1); |
197 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 198 |
qed_spec_mp "hd_Cons_tl"; |
199 |
Addsimps [hd_Cons_tl]; |
|
923 | 200 |
|
3011 | 201 |
goal thy "hd(xs@ys) = (if xs=[] then hd ys else hd xs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
202 |
by (induct_tac "xs" 1); |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
203 |
by (ALLGOALS Asm_simp_tac); |
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
204 |
qed "hd_append"; |
923 | 205 |
|
3571 | 206 |
goal thy "!!xs. xs ~= [] ==> hd(xs @ ys) = hd xs"; |
4089 | 207 |
by (asm_simp_tac (simpset() addsimps [hd_append] |
4069 | 208 |
addsplits [split_list_case]) 1); |
3571 | 209 |
qed "hd_append2"; |
210 |
Addsimps [hd_append2]; |
|
211 |
||
3011 | 212 |
goal thy "tl(xs@ys) = (case xs of [] => tl(ys) | z#zs => zs@ys)"; |
4089 | 213 |
by (simp_tac (simpset() addsplits [split_list_case]) 1); |
2608 | 214 |
qed "tl_append"; |
215 |
||
3571 | 216 |
goal thy "!!xs. xs ~= [] ==> tl(xs @ ys) = (tl xs) @ ys"; |
4089 | 217 |
by (asm_simp_tac (simpset() addsimps [tl_append] |
4069 | 218 |
addsplits [split_list_case]) 1); |
3571 | 219 |
qed "tl_append2"; |
220 |
Addsimps [tl_append2]; |
|
221 |
||
2608 | 222 |
(** map **) |
223 |
||
3467 | 224 |
section "map"; |
225 |
||
3011 | 226 |
goal thy |
3465 | 227 |
"(!x. x : set xs --> f x = g x) --> map f xs = map g xs"; |
3457 | 228 |
by (induct_tac "xs" 1); |
229 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 230 |
bind_thm("map_ext", impI RS (allI RS (result() RS mp))); |
231 |
||
3842 | 232 |
goal thy "map (%x. x) = (%xs. xs)"; |
2608 | 233 |
by (rtac ext 1); |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
234 |
by (induct_tac "xs" 1); |
2608 | 235 |
by (ALLGOALS Asm_simp_tac); |
236 |
qed "map_ident"; |
|
237 |
Addsimps[map_ident]; |
|
238 |
||
3011 | 239 |
goal thy "map f (xs@ys) = map f xs @ map f ys"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
240 |
by (induct_tac "xs" 1); |
2608 | 241 |
by (ALLGOALS Asm_simp_tac); |
242 |
qed "map_append"; |
|
243 |
Addsimps[map_append]; |
|
244 |
||
3011 | 245 |
goalw thy [o_def] "map (f o g) xs = map f (map g xs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
246 |
by (induct_tac "xs" 1); |
2608 | 247 |
by (ALLGOALS Asm_simp_tac); |
248 |
qed "map_compose"; |
|
249 |
Addsimps[map_compose]; |
|
250 |
||
3011 | 251 |
goal thy "rev(map f xs) = map f (rev xs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
252 |
by (induct_tac "xs" 1); |
2608 | 253 |
by (ALLGOALS Asm_simp_tac); |
254 |
qed "rev_map"; |
|
255 |
||
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
256 |
(* a congruence rule for map: *) |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
257 |
goal thy |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
258 |
"(xs=ys) --> (!x. x : set ys --> f x = g x) --> map f xs = map g ys"; |
4423 | 259 |
by (rtac impI 1); |
260 |
by (hyp_subst_tac 1); |
|
261 |
by (induct_tac "ys" 1); |
|
262 |
by (ALLGOALS Asm_simp_tac); |
|
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
263 |
val lemma = result(); |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
264 |
bind_thm("map_cong",impI RSN (2,allI RSN (2,lemma RS mp RS mp))); |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
265 |
|
3860 | 266 |
goal List.thy "(map f xs = []) = (xs = [])"; |
4423 | 267 |
by (induct_tac "xs" 1); |
268 |
by (ALLGOALS Asm_simp_tac); |
|
3860 | 269 |
qed "map_is_Nil_conv"; |
270 |
AddIffs [map_is_Nil_conv]; |
|
271 |
||
272 |
goal List.thy "([] = map f xs) = (xs = [])"; |
|
4423 | 273 |
by (induct_tac "xs" 1); |
274 |
by (ALLGOALS Asm_simp_tac); |
|
3860 | 275 |
qed "Nil_is_map_conv"; |
276 |
AddIffs [Nil_is_map_conv]; |
|
277 |
||
278 |
||
1169 | 279 |
(** rev **) |
280 |
||
3467 | 281 |
section "rev"; |
282 |
||
3011 | 283 |
goal thy "rev(xs@ys) = rev(ys) @ rev(xs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
284 |
by (induct_tac "xs" 1); |
2512 | 285 |
by (ALLGOALS Asm_simp_tac); |
1169 | 286 |
qed "rev_append"; |
2512 | 287 |
Addsimps[rev_append]; |
1169 | 288 |
|
3011 | 289 |
goal thy "rev(rev l) = l"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
290 |
by (induct_tac "l" 1); |
2512 | 291 |
by (ALLGOALS Asm_simp_tac); |
1169 | 292 |
qed "rev_rev_ident"; |
2512 | 293 |
Addsimps[rev_rev_ident]; |
1169 | 294 |
|
3860 | 295 |
goal thy "(rev xs = []) = (xs = [])"; |
4423 | 296 |
by (induct_tac "xs" 1); |
297 |
by (ALLGOALS Asm_simp_tac); |
|
3860 | 298 |
qed "rev_is_Nil_conv"; |
299 |
AddIffs [rev_is_Nil_conv]; |
|
300 |
||
301 |
goal thy "([] = rev xs) = (xs = [])"; |
|
4423 | 302 |
by (induct_tac "xs" 1); |
303 |
by (ALLGOALS Asm_simp_tac); |
|
3860 | 304 |
qed "Nil_is_rev_conv"; |
305 |
AddIffs [Nil_is_rev_conv]; |
|
306 |
||
2608 | 307 |
|
923 | 308 |
(** mem **) |
309 |
||
3467 | 310 |
section "mem"; |
311 |
||
3011 | 312 |
goal thy "x mem (xs@ys) = (x mem xs | x mem ys)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
313 |
by (induct_tac "xs" 1); |
4089 | 314 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
923 | 315 |
qed "mem_append"; |
2512 | 316 |
Addsimps[mem_append]; |
923 | 317 |
|
3842 | 318 |
goal thy "x mem [x:xs. P(x)] = (x mem xs & P(x))"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
319 |
by (induct_tac "xs" 1); |
4089 | 320 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
923 | 321 |
qed "mem_filter"; |
2512 | 322 |
Addsimps[mem_filter]; |
923 | 323 |
|
3465 | 324 |
(** set **) |
1812 | 325 |
|
3467 | 326 |
section "set"; |
327 |
||
3465 | 328 |
goal thy "set (xs@ys) = (set xs Un set ys)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
329 |
by (induct_tac "xs" 1); |
1812 | 330 |
by (ALLGOALS Asm_simp_tac); |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
331 |
qed "set_append"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
332 |
Addsimps[set_append]; |
1812 | 333 |
|
3465 | 334 |
goal thy "(x mem xs) = (x: set xs)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
335 |
by (induct_tac "xs" 1); |
4089 | 336 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
2891 | 337 |
by (Blast_tac 1); |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
338 |
qed "set_mem_eq"; |
1812 | 339 |
|
3465 | 340 |
goal thy "set l <= set (x#l)"; |
1936 | 341 |
by (Simp_tac 1); |
2891 | 342 |
by (Blast_tac 1); |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
343 |
qed "set_subset_Cons"; |
1936 | 344 |
|
3465 | 345 |
goal thy "(set xs = {}) = (xs = [])"; |
3457 | 346 |
by (induct_tac "xs" 1); |
347 |
by (ALLGOALS Asm_simp_tac); |
|
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
348 |
qed "set_empty"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
349 |
Addsimps [set_empty]; |
2608 | 350 |
|
3465 | 351 |
goal thy "set(rev xs) = set(xs)"; |
3457 | 352 |
by (induct_tac "xs" 1); |
353 |
by (ALLGOALS Asm_simp_tac); |
|
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
354 |
qed "set_rev"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
355 |
Addsimps [set_rev]; |
2608 | 356 |
|
3465 | 357 |
goal thy "set(map f xs) = f``(set xs)"; |
3457 | 358 |
by (induct_tac "xs" 1); |
359 |
by (ALLGOALS Asm_simp_tac); |
|
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
360 |
qed "set_map"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
361 |
Addsimps [set_map]; |
2608 | 362 |
|
4605 | 363 |
goal thy "set(map f xs) = f``(set xs)"; |
364 |
by (induct_tac "xs" 1); |
|
365 |
by (ALLGOALS Asm_simp_tac); |
|
366 |
qed "set_map"; |
|
367 |
Addsimps [set_map]; |
|
368 |
||
369 |
goal thy "(x : set(filter P xs)) = (x : set xs & P x)"; |
|
370 |
by (induct_tac "xs" 1); |
|
371 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
|
372 |
by(Blast_tac 1); |
|
373 |
qed "in_set_filter"; |
|
374 |
Addsimps [in_set_filter]; |
|
375 |
||
1812 | 376 |
|
923 | 377 |
(** list_all **) |
378 |
||
3467 | 379 |
section "list_all"; |
380 |
||
3842 | 381 |
goal thy "list_all (%x. True) xs = True"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
382 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
383 |
by (ALLGOALS Asm_simp_tac); |
923 | 384 |
qed "list_all_True"; |
2512 | 385 |
Addsimps [list_all_True]; |
923 | 386 |
|
3011 | 387 |
goal thy "list_all p (xs@ys) = (list_all p xs & list_all p ys)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
388 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
389 |
by (ALLGOALS Asm_simp_tac); |
2512 | 390 |
qed "list_all_append"; |
391 |
Addsimps [list_all_append]; |
|
923 | 392 |
|
3011 | 393 |
goal thy "list_all P xs = (!x. x mem xs --> P(x))"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
394 |
by (induct_tac "xs" 1); |
4089 | 395 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
2891 | 396 |
by (Blast_tac 1); |
923 | 397 |
qed "list_all_mem_conv"; |
398 |
||
399 |
||
2608 | 400 |
(** filter **) |
923 | 401 |
|
3467 | 402 |
section "filter"; |
403 |
||
3383
7707cb7a5054
Corrected statement of filter_append; added filter_size
paulson
parents:
3342
diff
changeset
|
404 |
goal thy "filter P (xs@ys) = filter P xs @ filter P ys"; |
3457 | 405 |
by (induct_tac "xs" 1); |
4089 | 406 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
2608 | 407 |
qed "filter_append"; |
408 |
Addsimps [filter_append]; |
|
409 |
||
4605 | 410 |
goal thy "filter (%x. True) xs = xs"; |
411 |
by (induct_tac "xs" 1); |
|
412 |
by (ALLGOALS Asm_simp_tac); |
|
413 |
qed "filter_True"; |
|
414 |
Addsimps [filter_True]; |
|
415 |
||
416 |
goal thy "filter (%x. False) xs = []"; |
|
417 |
by (induct_tac "xs" 1); |
|
418 |
by (ALLGOALS Asm_simp_tac); |
|
419 |
qed "filter_False"; |
|
420 |
Addsimps [filter_False]; |
|
421 |
||
422 |
goal thy "length (filter P xs) <= length xs"; |
|
3457 | 423 |
by (induct_tac "xs" 1); |
4089 | 424 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
4605 | 425 |
qed "length_filter"; |
3383
7707cb7a5054
Corrected statement of filter_append; added filter_size
paulson
parents:
3342
diff
changeset
|
426 |
|
2608 | 427 |
|
428 |
(** concat **) |
|
429 |
||
3467 | 430 |
section "concat"; |
431 |
||
3011 | 432 |
goal thy "concat(xs@ys) = concat(xs)@concat(ys)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
433 |
by (induct_tac "xs" 1); |
1264
3eb91524b938
added local simpsets; removed IOA from 'make test'
clasohm
parents:
1202
diff
changeset
|
434 |
by (ALLGOALS Asm_simp_tac); |
2608 | 435 |
qed"concat_append"; |
436 |
Addsimps [concat_append]; |
|
2512 | 437 |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
438 |
goal thy "(concat xss = []) = (!xs:set xss. xs=[])"; |
4423 | 439 |
by (induct_tac "xss" 1); |
440 |
by (ALLGOALS Asm_simp_tac); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
441 |
qed "concat_eq_Nil_conv"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
442 |
AddIffs [concat_eq_Nil_conv]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
443 |
|
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
444 |
goal thy "([] = concat xss) = (!xs:set xss. xs=[])"; |
4423 | 445 |
by (induct_tac "xss" 1); |
446 |
by (ALLGOALS Asm_simp_tac); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
447 |
qed "Nil_eq_concat_conv"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
448 |
AddIffs [Nil_eq_concat_conv]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
449 |
|
3467 | 450 |
goal thy "set(concat xs) = Union(set `` set xs)"; |
451 |
by (induct_tac "xs" 1); |
|
452 |
by (ALLGOALS Asm_simp_tac); |
|
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
453 |
qed"set_concat"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
454 |
Addsimps [set_concat]; |
3467 | 455 |
|
456 |
goal thy "map f (concat xs) = concat (map (map f) xs)"; |
|
457 |
by (induct_tac "xs" 1); |
|
458 |
by (ALLGOALS Asm_simp_tac); |
|
459 |
qed "map_concat"; |
|
460 |
||
461 |
goal thy "filter p (concat xs) = concat (map (filter p) xs)"; |
|
462 |
by (induct_tac "xs" 1); |
|
463 |
by (ALLGOALS Asm_simp_tac); |
|
464 |
qed"filter_concat"; |
|
465 |
||
466 |
goal thy "rev(concat xs) = concat (map rev (rev xs))"; |
|
467 |
by (induct_tac "xs" 1); |
|
2512 | 468 |
by (ALLGOALS Asm_simp_tac); |
2608 | 469 |
qed "rev_concat"; |
923 | 470 |
|
471 |
(** nth **) |
|
472 |
||
3467 | 473 |
section "nth"; |
474 |
||
3011 | 475 |
goal thy |
4502 | 476 |
"!xs. (xs@ys)!n = (if n < length xs then xs!n else ys!(n - length xs))"; |
3457 | 477 |
by (nat_ind_tac "n" 1); |
478 |
by (Asm_simp_tac 1); |
|
479 |
by (rtac allI 1); |
|
480 |
by (exhaust_tac "xs" 1); |
|
481 |
by (ALLGOALS Asm_simp_tac); |
|
482 |
by (rtac allI 1); |
|
483 |
by (exhaust_tac "xs" 1); |
|
484 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 485 |
qed_spec_mp "nth_append"; |
486 |
||
4502 | 487 |
goal thy "!n. n < length xs --> (map f xs)!n = f(xs!n)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
488 |
by (induct_tac "xs" 1); |
1301 | 489 |
(* case [] *) |
490 |
by (Asm_full_simp_tac 1); |
|
491 |
(* case x#xl *) |
|
492 |
by (rtac allI 1); |
|
493 |
by (nat_ind_tac "n" 1); |
|
494 |
by (ALLGOALS Asm_full_simp_tac); |
|
1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset
|
495 |
qed_spec_mp "nth_map"; |
1301 | 496 |
Addsimps [nth_map]; |
497 |
||
4502 | 498 |
goal thy "!n. n < length xs --> list_all P xs --> P(xs!n)"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
499 |
by (induct_tac "xs" 1); |
1301 | 500 |
(* case [] *) |
501 |
by (Simp_tac 1); |
|
502 |
(* case x#xl *) |
|
503 |
by (rtac allI 1); |
|
504 |
by (nat_ind_tac "n" 1); |
|
505 |
by (ALLGOALS Asm_full_simp_tac); |
|
1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset
|
506 |
qed_spec_mp "list_all_nth"; |
1301 | 507 |
|
4502 | 508 |
goal thy "!n. n < length xs --> xs!n mem xs"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
509 |
by (induct_tac "xs" 1); |
1301 | 510 |
(* case [] *) |
511 |
by (Simp_tac 1); |
|
512 |
(* case x#xl *) |
|
513 |
by (rtac allI 1); |
|
514 |
by (nat_ind_tac "n" 1); |
|
515 |
(* case 0 *) |
|
516 |
by (Asm_full_simp_tac 1); |
|
517 |
(* case Suc x *) |
|
4089 | 518 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset
|
519 |
qed_spec_mp "nth_mem"; |
1301 | 520 |
Addsimps [nth_mem]; |
521 |
||
4643 | 522 |
(** More case analysis and induction **) |
523 |
section "More case analysis and induction"; |
|
524 |
||
525 |
val [prem] = goal thy |
|
526 |
"(!!xs. (!ys. length ys < length xs --> P ys) ==> P xs) ==> P(xs)"; |
|
527 |
by(rtac measure_induct 1 THEN etac prem 1); |
|
528 |
qed "length_induct"; |
|
529 |
||
530 |
goal thy "xs ~= [] --> (? ys y. xs = ys@[y])"; |
|
531 |
by(res_inst_tac [("xs","xs")] length_induct 1); |
|
532 |
by(Clarify_tac 1); |
|
533 |
bd (neq_Nil_conv RS iffD1) 1; |
|
534 |
by(Clarify_tac 1); |
|
535 |
by(rename_tac "ys" 1); |
|
536 |
by(case_tac "ys = []" 1); |
|
537 |
by(res_inst_tac [("x","[]")] exI 1); |
|
538 |
by(Asm_full_simp_tac 1); |
|
539 |
by(eres_inst_tac [("x","ys")] allE 1); |
|
540 |
by(Asm_full_simp_tac 1); |
|
541 |
by(REPEAT(etac exE 1)); |
|
542 |
by(rename_tac "zs z" 1); |
|
543 |
by(hyp_subst_tac 1); |
|
544 |
by(res_inst_tac [("x","y#zs")] exI 1); |
|
545 |
by(Simp_tac 1); |
|
546 |
qed_spec_mp "neq_Nil_snocD"; |
|
547 |
||
548 |
val prems = goal thy |
|
549 |
"[| xs=[] ==> P []; !!ys y. xs=ys@[y] ==> P(ys@[y]) |] ==> P xs"; |
|
550 |
by(case_tac "xs = []" 1); |
|
551 |
by(Asm_simp_tac 1); |
|
552 |
bes prems 1; |
|
553 |
bd neq_Nil_snocD 1; |
|
554 |
by(REPEAT(etac exE 1)); |
|
555 |
by(Asm_simp_tac 1); |
|
556 |
bes prems 1; |
|
557 |
qed "snoc_eq_cases"; |
|
558 |
||
559 |
val prems = goal thy |
|
560 |
"[| P []; !!x xs. P xs ==> P(xs@[x]) |] ==> P(xs)"; |
|
561 |
by(res_inst_tac [("xs","xs")] length_induct 1); |
|
562 |
by(res_inst_tac [("xs","xs")] snoc_eq_cases 1); |
|
563 |
brs prems 1; |
|
564 |
by(fast_tac (claset() addIs prems addss simpset()) 1); |
|
565 |
qed "snoc_induct"; |
|
566 |
||
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
567 |
(** last & butlast **) |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
568 |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
569 |
goal thy "last(xs@[x]) = x"; |
4423 | 570 |
by (induct_tac "xs" 1); |
571 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
572 |
qed "last_snoc"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
573 |
Addsimps [last_snoc]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
574 |
|
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
575 |
goal thy "butlast(xs@[x]) = xs"; |
4423 | 576 |
by (induct_tac "xs" 1); |
577 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
578 |
qed "butlast_snoc"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
579 |
Addsimps [butlast_snoc]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
580 |
|
4643 | 581 |
goal thy "length(butlast xs) = length xs - 1"; |
582 |
by(res_inst_tac [("xs","xs")] snoc_induct 1); |
|
583 |
by(ALLGOALS Asm_simp_tac); |
|
584 |
qed "length_butlast"; |
|
585 |
Addsimps [length_butlast]; |
|
586 |
||
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
587 |
goal thy |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
588 |
"!ys. butlast (xs@ys) = (if ys=[] then butlast xs else xs@butlast ys)"; |
4423 | 589 |
by (induct_tac "xs" 1); |
590 |
by (ALLGOALS(asm_simp_tac (simpset() addsplits [expand_if]))); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
591 |
qed_spec_mp "butlast_append"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
592 |
|
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
593 |
goal thy "x:set(butlast xs) --> x:set xs"; |
4423 | 594 |
by (induct_tac "xs" 1); |
595 |
by (ALLGOALS (asm_simp_tac (simpset() addsplits [expand_if]))); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
596 |
qed_spec_mp "in_set_butlastD"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
597 |
|
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
598 |
goal thy "!!xs. x:set(butlast xs) ==> x:set(butlast(xs@ys))"; |
4423 | 599 |
by (asm_simp_tac (simpset() addsimps [butlast_append] |
3919 | 600 |
addsplits [expand_if]) 1); |
4423 | 601 |
by (blast_tac (claset() addDs [in_set_butlastD]) 1); |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
602 |
qed "in_set_butlast_appendI1"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
603 |
|
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
604 |
goal thy "!!xs. x:set(butlast ys) ==> x:set(butlast(xs@ys))"; |
4423 | 605 |
by (asm_simp_tac (simpset() addsimps [butlast_append] |
3919 | 606 |
addsplits [expand_if]) 1); |
4423 | 607 |
by (Clarify_tac 1); |
608 |
by (Full_simp_tac 1); |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
609 |
qed "in_set_butlast_appendI2"; |
3902 | 610 |
|
2608 | 611 |
(** take & drop **) |
612 |
section "take & drop"; |
|
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
613 |
|
1419
a6a034a47a71
defined take/drop by induction over list rather than nat.
nipkow
parents:
1327
diff
changeset
|
614 |
goal thy "take 0 xs = []"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
615 |
by (induct_tac "xs" 1); |
1419
a6a034a47a71
defined take/drop by induction over list rather than nat.
nipkow
parents:
1327
diff
changeset
|
616 |
by (ALLGOALS Asm_simp_tac); |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
617 |
qed "take_0"; |
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
618 |
|
2608 | 619 |
goal thy "drop 0 xs = xs"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
620 |
by (induct_tac "xs" 1); |
2608 | 621 |
by (ALLGOALS Asm_simp_tac); |
622 |
qed "drop_0"; |
|
623 |
||
1419
a6a034a47a71
defined take/drop by induction over list rather than nat.
nipkow
parents:
1327
diff
changeset
|
624 |
goal thy "take (Suc n) (x#xs) = x # take n xs"; |
1552 | 625 |
by (Simp_tac 1); |
1419
a6a034a47a71
defined take/drop by induction over list rather than nat.
nipkow
parents:
1327
diff
changeset
|
626 |
qed "take_Suc_Cons"; |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
627 |
|
2608 | 628 |
goal thy "drop (Suc n) (x#xs) = drop n xs"; |
629 |
by (Simp_tac 1); |
|
630 |
qed "drop_Suc_Cons"; |
|
631 |
||
632 |
Delsimps [take_Cons,drop_Cons]; |
|
633 |
Addsimps [take_0,take_Suc_Cons,drop_0,drop_Suc_Cons]; |
|
634 |
||
3011 | 635 |
goal thy "!xs. length(take n xs) = min (length xs) n"; |
3457 | 636 |
by (nat_ind_tac "n" 1); |
637 |
by (ALLGOALS Asm_simp_tac); |
|
638 |
by (rtac allI 1); |
|
639 |
by (exhaust_tac "xs" 1); |
|
640 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 641 |
qed_spec_mp "length_take"; |
642 |
Addsimps [length_take]; |
|
923 | 643 |
|
3011 | 644 |
goal thy "!xs. length(drop n xs) = (length xs - n)"; |
3457 | 645 |
by (nat_ind_tac "n" 1); |
646 |
by (ALLGOALS Asm_simp_tac); |
|
647 |
by (rtac allI 1); |
|
648 |
by (exhaust_tac "xs" 1); |
|
649 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 650 |
qed_spec_mp "length_drop"; |
651 |
Addsimps [length_drop]; |
|
652 |
||
3011 | 653 |
goal thy "!xs. length xs <= n --> take n xs = xs"; |
3457 | 654 |
by (nat_ind_tac "n" 1); |
655 |
by (ALLGOALS Asm_simp_tac); |
|
656 |
by (rtac allI 1); |
|
657 |
by (exhaust_tac "xs" 1); |
|
658 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 659 |
qed_spec_mp "take_all"; |
923 | 660 |
|
3011 | 661 |
goal thy "!xs. length xs <= n --> drop n xs = []"; |
3457 | 662 |
by (nat_ind_tac "n" 1); |
663 |
by (ALLGOALS Asm_simp_tac); |
|
664 |
by (rtac allI 1); |
|
665 |
by (exhaust_tac "xs" 1); |
|
666 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 667 |
qed_spec_mp "drop_all"; |
668 |
||
3011 | 669 |
goal thy |
2608 | 670 |
"!xs. take n (xs @ ys) = (take n xs @ take (n - length xs) ys)"; |
3457 | 671 |
by (nat_ind_tac "n" 1); |
672 |
by (ALLGOALS Asm_simp_tac); |
|
673 |
by (rtac allI 1); |
|
674 |
by (exhaust_tac "xs" 1); |
|
675 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 676 |
qed_spec_mp "take_append"; |
677 |
Addsimps [take_append]; |
|
678 |
||
3011 | 679 |
goal thy "!xs. drop n (xs@ys) = drop n xs @ drop (n - length xs) ys"; |
3457 | 680 |
by (nat_ind_tac "n" 1); |
681 |
by (ALLGOALS Asm_simp_tac); |
|
682 |
by (rtac allI 1); |
|
683 |
by (exhaust_tac "xs" 1); |
|
684 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 685 |
qed_spec_mp "drop_append"; |
686 |
Addsimps [drop_append]; |
|
687 |
||
3011 | 688 |
goal thy "!xs n. take n (take m xs) = take (min n m) xs"; |
3457 | 689 |
by (nat_ind_tac "m" 1); |
690 |
by (ALLGOALS Asm_simp_tac); |
|
691 |
by (rtac allI 1); |
|
692 |
by (exhaust_tac "xs" 1); |
|
693 |
by (ALLGOALS Asm_simp_tac); |
|
694 |
by (rtac allI 1); |
|
695 |
by (exhaust_tac "n" 1); |
|
696 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 697 |
qed_spec_mp "take_take"; |
698 |
||
3011 | 699 |
goal thy "!xs. drop n (drop m xs) = drop (n + m) xs"; |
3457 | 700 |
by (nat_ind_tac "m" 1); |
701 |
by (ALLGOALS Asm_simp_tac); |
|
702 |
by (rtac allI 1); |
|
703 |
by (exhaust_tac "xs" 1); |
|
704 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 705 |
qed_spec_mp "drop_drop"; |
923 | 706 |
|
3011 | 707 |
goal thy "!xs n. take n (drop m xs) = drop m (take (n + m) xs)"; |
3457 | 708 |
by (nat_ind_tac "m" 1); |
709 |
by (ALLGOALS Asm_simp_tac); |
|
710 |
by (rtac allI 1); |
|
711 |
by (exhaust_tac "xs" 1); |
|
712 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 713 |
qed_spec_mp "take_drop"; |
714 |
||
3011 | 715 |
goal thy "!xs. take n (map f xs) = map f (take n xs)"; |
3457 | 716 |
by (nat_ind_tac "n" 1); |
717 |
by (ALLGOALS Asm_simp_tac); |
|
718 |
by (rtac allI 1); |
|
719 |
by (exhaust_tac "xs" 1); |
|
720 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 721 |
qed_spec_mp "take_map"; |
722 |
||
3011 | 723 |
goal thy "!xs. drop n (map f xs) = map f (drop n xs)"; |
3457 | 724 |
by (nat_ind_tac "n" 1); |
725 |
by (ALLGOALS Asm_simp_tac); |
|
726 |
by (rtac allI 1); |
|
727 |
by (exhaust_tac "xs" 1); |
|
728 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 729 |
qed_spec_mp "drop_map"; |
730 |
||
4502 | 731 |
goal thy "!n i. i < n --> (take n xs)!i = xs!i"; |
3457 | 732 |
by (induct_tac "xs" 1); |
733 |
by (ALLGOALS Asm_simp_tac); |
|
3708 | 734 |
by (Clarify_tac 1); |
3457 | 735 |
by (exhaust_tac "n" 1); |
736 |
by (Blast_tac 1); |
|
737 |
by (exhaust_tac "i" 1); |
|
738 |
by (ALLGOALS Asm_full_simp_tac); |
|
2608 | 739 |
qed_spec_mp "nth_take"; |
740 |
Addsimps [nth_take]; |
|
923 | 741 |
|
4502 | 742 |
goal thy "!xs i. n + i <= length xs --> (drop n xs)!i = xs!(n+i)"; |
3457 | 743 |
by (nat_ind_tac "n" 1); |
744 |
by (ALLGOALS Asm_simp_tac); |
|
745 |
by (rtac allI 1); |
|
746 |
by (exhaust_tac "xs" 1); |
|
747 |
by (ALLGOALS Asm_simp_tac); |
|
2608 | 748 |
qed_spec_mp "nth_drop"; |
749 |
Addsimps [nth_drop]; |
|
750 |
||
751 |
(** takeWhile & dropWhile **) |
|
752 |
||
3467 | 753 |
section "takeWhile & dropWhile"; |
754 |
||
3586 | 755 |
goal thy "takeWhile P xs @ dropWhile P xs = xs"; |
756 |
by (induct_tac "xs" 1); |
|
757 |
by (Simp_tac 1); |
|
4089 | 758 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
3586 | 759 |
qed "takeWhile_dropWhile_id"; |
760 |
Addsimps [takeWhile_dropWhile_id]; |
|
761 |
||
762 |
goal thy "x:set xs & ~P(x) --> takeWhile P (xs @ ys) = takeWhile P xs"; |
|
3457 | 763 |
by (induct_tac "xs" 1); |
764 |
by (Simp_tac 1); |
|
4089 | 765 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
3457 | 766 |
by (Blast_tac 1); |
2608 | 767 |
bind_thm("takeWhile_append1", conjI RS (result() RS mp)); |
768 |
Addsimps [takeWhile_append1]; |
|
923 | 769 |
|
3011 | 770 |
goal thy |
3842 | 771 |
"(!x:set xs. P(x)) --> takeWhile P (xs @ ys) = xs @ takeWhile P ys"; |
3457 | 772 |
by (induct_tac "xs" 1); |
773 |
by (Simp_tac 1); |
|
4089 | 774 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
2608 | 775 |
bind_thm("takeWhile_append2", ballI RS (result() RS mp)); |
776 |
Addsimps [takeWhile_append2]; |
|
1169 | 777 |
|
3011 | 778 |
goal thy |
3465 | 779 |
"x:set xs & ~P(x) --> dropWhile P (xs @ ys) = (dropWhile P xs)@ys"; |
3457 | 780 |
by (induct_tac "xs" 1); |
781 |
by (Simp_tac 1); |
|
4089 | 782 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
3457 | 783 |
by (Blast_tac 1); |
2608 | 784 |
bind_thm("dropWhile_append1", conjI RS (result() RS mp)); |
785 |
Addsimps [dropWhile_append1]; |
|
786 |
||
3011 | 787 |
goal thy |
3842 | 788 |
"(!x:set xs. P(x)) --> dropWhile P (xs @ ys) = dropWhile P ys"; |
3457 | 789 |
by (induct_tac "xs" 1); |
790 |
by (Simp_tac 1); |
|
4089 | 791 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
2608 | 792 |
bind_thm("dropWhile_append2", ballI RS (result() RS mp)); |
793 |
Addsimps [dropWhile_append2]; |
|
794 |
||
3465 | 795 |
goal thy "x:set(takeWhile P xs) --> x:set xs & P x"; |
3457 | 796 |
by (induct_tac "xs" 1); |
797 |
by (Simp_tac 1); |
|
4089 | 798 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
799 |
qed_spec_mp"set_take_whileD"; |
2608 | 800 |
|
4132 | 801 |
qed_goal "zip_Nil_Nil" thy "zip [] [] = []" (K [Simp_tac 1]); |
802 |
qed_goal "zip_Cons_Cons" thy "zip (x#xs) (y#ys) = (x,y)#zip xs ys" |
|
803 |
(K [Simp_tac 1]); |
|
4605 | 804 |
|
805 |
(** nodups & remdups **) |
|
806 |
section "nodups & remdups"; |
|
807 |
||
808 |
goal thy "set(remdups xs) = set xs"; |
|
809 |
by (induct_tac "xs" 1); |
|
810 |
by (Simp_tac 1); |
|
811 |
by (asm_full_simp_tac (simpset() addsimps [insert_absorb] |
|
812 |
addsplits [expand_if]) 1); |
|
813 |
qed "set_remdups"; |
|
814 |
Addsimps [set_remdups]; |
|
815 |
||
816 |
goal thy "nodups(remdups xs)"; |
|
817 |
by (induct_tac "xs" 1); |
|
818 |
by (Simp_tac 1); |
|
819 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
|
820 |
qed "nodups_remdups"; |
|
821 |
||
822 |
goal thy "nodups xs --> nodups (filter P xs)"; |
|
823 |
by (induct_tac "xs" 1); |
|
824 |
by (Simp_tac 1); |
|
825 |
by (asm_full_simp_tac (simpset() addsplits [expand_if]) 1); |
|
826 |
qed_spec_mp "nodups_filter"; |
|
827 |
||
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
828 |
(** replicate **) |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
829 |
section "replicate"; |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
830 |
|
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
831 |
goal thy "set(replicate (Suc n) x) = {x}"; |
4423 | 832 |
by (induct_tac "n" 1); |
833 |
by (ALLGOALS Asm_full_simp_tac); |
|
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
834 |
val lemma = result(); |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
835 |
|
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
836 |
goal thy "!!n. n ~= 0 ==> set(replicate n x) = {x}"; |
4423 | 837 |
by (fast_tac (claset() addSDs [not0_implies_Suc] addSIs [lemma]) 1); |
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
838 |
qed "set_replicate"; |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
839 |
Addsimps [set_replicate]; |