author | paulson |
Thu, 01 Jun 2000 13:28:00 +0200 | |
changeset 9014 | 4382883421ec |
parent 9003 | 3747ec2aeb86 |
child 9108 | 9fff97d29837 |
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 |
||
4935 | 9 |
Goal "!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); |
5316 | 11 |
by Auto_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 |
|
4935 | 16 |
Goal "(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); |
5316 | 18 |
by Auto_tac; |
923 | 19 |
qed "neq_Nil_conv"; |
20 |
||
4830 | 21 |
(* Induction over the length of a list: *) |
4935 | 22 |
val [prem] = Goal |
4911 | 23 |
"(!!xs. (!ys. length ys < length xs --> P ys) ==> P xs) ==> P(xs)"; |
5132 | 24 |
by (rtac measure_induct 1 THEN etac prem 1); |
4911 | 25 |
qed "length_induct"; |
26 |
||
923 | 27 |
|
3468 | 28 |
(** "lists": the list-forming operator over sets **) |
3342
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
29 |
|
5043 | 30 |
Goalw lists.defs "A<=B ==> lists A <= lists B"; |
3342
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
31 |
by (rtac lfp_mono 1); |
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
32 |
by (REPEAT (ares_tac basic_monos 1)); |
ec3b55fcb165
New operator "lists" for formalizing sets of lists
paulson
parents:
3292
diff
changeset
|
33 |
qed "lists_mono"; |
3196 | 34 |
|
6141 | 35 |
val listsE = lists.mk_cases "x#l : lists A"; |
3468 | 36 |
AddSEs [listsE]; |
37 |
AddSIs lists.intrs; |
|
38 |
||
5043 | 39 |
Goal "l: lists A ==> l: lists B --> l: lists (A Int B)"; |
3468 | 40 |
by (etac lists.induct 1); |
41 |
by (ALLGOALS Blast_tac); |
|
42 |
qed_spec_mp "lists_IntI"; |
|
43 |
||
4935 | 44 |
Goal "lists (A Int B) = lists A Int lists B"; |
4423 | 45 |
by (rtac (mono_Int RS equalityI) 1); |
4089 | 46 |
by (simp_tac (simpset() addsimps [mono_def, lists_mono]) 1); |
47 |
by (blast_tac (claset() addSIs [lists_IntI]) 1); |
|
3468 | 48 |
qed "lists_Int_eq"; |
49 |
Addsimps [lists_Int_eq]; |
|
50 |
||
3196 | 51 |
|
4643 | 52 |
(** Case analysis **) |
53 |
section "Case analysis"; |
|
2608 | 54 |
|
4935 | 55 |
val prems = Goal "[| P([]); !!x xs. P(x#xs) |] ==> P(xs)"; |
3457 | 56 |
by (induct_tac "xs" 1); |
57 |
by (REPEAT(resolve_tac prems 1)); |
|
2608 | 58 |
qed "list_cases"; |
59 |
||
4935 | 60 |
Goal "(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
|
61 |
by (induct_tac "xs" 1); |
2891 | 62 |
by (Blast_tac 1); |
63 |
by (Blast_tac 1); |
|
2608 | 64 |
bind_thm("list_eq_cases", |
65 |
impI RSN (2,allI RSN (2,allI RSN (2,impI RS (conjI RS (result() RS mp)))))); |
|
66 |
||
3860 | 67 |
(** length **) |
68 |
(* needs to come before "@" because of thm append_eq_append_conv *) |
|
69 |
||
70 |
section "length"; |
|
71 |
||
4935 | 72 |
Goal "length(xs@ys) = length(xs)+length(ys)"; |
3860 | 73 |
by (induct_tac "xs" 1); |
5316 | 74 |
by Auto_tac; |
3860 | 75 |
qed"length_append"; |
76 |
Addsimps [length_append]; |
|
77 |
||
5129 | 78 |
Goal "length (map f xs) = length xs"; |
79 |
by (induct_tac "xs" 1); |
|
5316 | 80 |
by Auto_tac; |
3860 | 81 |
qed "length_map"; |
82 |
Addsimps [length_map]; |
|
83 |
||
4935 | 84 |
Goal "length(rev xs) = length(xs)"; |
3860 | 85 |
by (induct_tac "xs" 1); |
5316 | 86 |
by Auto_tac; |
3860 | 87 |
qed "length_rev"; |
88 |
Addsimps [length_rev]; |
|
89 |
||
7028 | 90 |
Goal "length(tl xs) = (length xs) - 1"; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
91 |
by (case_tac "xs" 1); |
5316 | 92 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
93 |
qed "length_tl"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
94 |
Addsimps [length_tl]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
95 |
|
4935 | 96 |
Goal "(length xs = 0) = (xs = [])"; |
3860 | 97 |
by (induct_tac "xs" 1); |
5316 | 98 |
by Auto_tac; |
3860 | 99 |
qed "length_0_conv"; |
100 |
AddIffs [length_0_conv]; |
|
101 |
||
4935 | 102 |
Goal "(0 = length xs) = (xs = [])"; |
3860 | 103 |
by (induct_tac "xs" 1); |
5316 | 104 |
by Auto_tac; |
3860 | 105 |
qed "zero_length_conv"; |
106 |
AddIffs [zero_length_conv]; |
|
107 |
||
4935 | 108 |
Goal "(0 < length xs) = (xs ~= [])"; |
3860 | 109 |
by (induct_tac "xs" 1); |
5316 | 110 |
by Auto_tac; |
3860 | 111 |
qed "length_greater_0_conv"; |
112 |
AddIffs [length_greater_0_conv]; |
|
113 |
||
5296 | 114 |
Goal "(length xs = Suc n) = (? y ys. xs = y#ys & length ys = n)"; |
115 |
by (induct_tac "xs" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
116 |
by Auto_tac; |
5296 | 117 |
qed "length_Suc_conv"; |
118 |
||
923 | 119 |
(** @ - append **) |
120 |
||
3467 | 121 |
section "@ - append"; |
122 |
||
4935 | 123 |
Goal "(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
|
124 |
by (induct_tac "xs" 1); |
5316 | 125 |
by Auto_tac; |
923 | 126 |
qed "append_assoc"; |
2512 | 127 |
Addsimps [append_assoc]; |
923 | 128 |
|
4935 | 129 |
Goal "xs @ [] = xs"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
130 |
by (induct_tac "xs" 1); |
5316 | 131 |
by Auto_tac; |
923 | 132 |
qed "append_Nil2"; |
2512 | 133 |
Addsimps [append_Nil2]; |
923 | 134 |
|
4935 | 135 |
Goal "(xs@ys = []) = (xs=[] & ys=[])"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
136 |
by (induct_tac "xs" 1); |
5316 | 137 |
by Auto_tac; |
2608 | 138 |
qed "append_is_Nil_conv"; |
139 |
AddIffs [append_is_Nil_conv]; |
|
140 |
||
4935 | 141 |
Goal "([] = xs@ys) = (xs=[] & ys=[])"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
142 |
by (induct_tac "xs" 1); |
5316 | 143 |
by Auto_tac; |
2608 | 144 |
qed "Nil_is_append_conv"; |
145 |
AddIffs [Nil_is_append_conv]; |
|
923 | 146 |
|
4935 | 147 |
Goal "(xs @ ys = xs) = (ys=[])"; |
3574 | 148 |
by (induct_tac "xs" 1); |
5316 | 149 |
by Auto_tac; |
3574 | 150 |
qed "append_self_conv"; |
151 |
||
4935 | 152 |
Goal "(xs = xs @ ys) = (ys=[])"; |
3574 | 153 |
by (induct_tac "xs" 1); |
5316 | 154 |
by Auto_tac; |
3574 | 155 |
qed "self_append_conv"; |
156 |
AddIffs [append_self_conv,self_append_conv]; |
|
157 |
||
4935 | 158 |
Goal "!ys. length xs = length ys | length us = length vs \ |
3860 | 159 |
\ --> (xs@us = ys@vs) = (xs=ys & us=vs)"; |
4423 | 160 |
by (induct_tac "xs" 1); |
161 |
by (rtac allI 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
162 |
by (case_tac "ys" 1); |
4423 | 163 |
by (Asm_simp_tac 1); |
5641 | 164 |
by (Force_tac 1); |
4423 | 165 |
by (rtac allI 1); |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
166 |
by (case_tac "ys" 1); |
5641 | 167 |
by (Force_tac 1); |
4423 | 168 |
by (Asm_simp_tac 1); |
3860 | 169 |
qed_spec_mp "append_eq_append_conv"; |
170 |
Addsimps [append_eq_append_conv]; |
|
171 |
||
4935 | 172 |
Goal "(xs @ ys = xs @ zs) = (ys=zs)"; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
173 |
by (Simp_tac 1); |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
174 |
qed "same_append_eq"; |
3860 | 175 |
|
4935 | 176 |
Goal "(xs @ [x] = ys @ [y]) = (xs = ys & x = y)"; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
177 |
by (Simp_tac 1); |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
178 |
qed "append1_eq_conv"; |
2608 | 179 |
|
4935 | 180 |
Goal "(ys @ xs = zs @ xs) = (ys=zs)"; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
181 |
by (Simp_tac 1); |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
182 |
qed "append_same_eq"; |
2608 | 183 |
|
9003 | 184 |
AddIffs [same_append_eq, append1_eq_conv, append_same_eq]; |
3571 | 185 |
|
4935 | 186 |
Goal "(xs @ ys = ys) = (xs=[])"; |
5132 | 187 |
by (cut_inst_tac [("zs","[]")] append_same_eq 1); |
5316 | 188 |
by Auto_tac; |
4647 | 189 |
qed "append_self_conv2"; |
190 |
||
4935 | 191 |
Goal "(ys = xs @ ys) = (xs=[])"; |
5132 | 192 |
by (simp_tac (simpset() addsimps |
4647 | 193 |
[simplify (simpset()) (read_instantiate[("ys","[]")]append_same_eq)]) 1); |
5132 | 194 |
by (Blast_tac 1); |
4647 | 195 |
qed "self_append_conv2"; |
196 |
AddIffs [append_self_conv2,self_append_conv2]; |
|
197 |
||
4935 | 198 |
Goal "xs ~= [] --> hd xs # tl xs = xs"; |
3457 | 199 |
by (induct_tac "xs" 1); |
5316 | 200 |
by Auto_tac; |
2608 | 201 |
qed_spec_mp "hd_Cons_tl"; |
202 |
Addsimps [hd_Cons_tl]; |
|
923 | 203 |
|
4935 | 204 |
Goal "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
|
205 |
by (induct_tac "xs" 1); |
5316 | 206 |
by Auto_tac; |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
207 |
qed "hd_append"; |
923 | 208 |
|
5043 | 209 |
Goal "xs ~= [] ==> hd(xs @ ys) = hd xs"; |
4089 | 210 |
by (asm_simp_tac (simpset() addsimps [hd_append] |
5183 | 211 |
addsplits [list.split]) 1); |
3571 | 212 |
qed "hd_append2"; |
213 |
Addsimps [hd_append2]; |
|
214 |
||
4935 | 215 |
Goal "tl(xs@ys) = (case xs of [] => tl(ys) | z#zs => zs@ys)"; |
5183 | 216 |
by (simp_tac (simpset() addsplits [list.split]) 1); |
2608 | 217 |
qed "tl_append"; |
218 |
||
5043 | 219 |
Goal "xs ~= [] ==> tl(xs @ ys) = (tl xs) @ ys"; |
4089 | 220 |
by (asm_simp_tac (simpset() addsimps [tl_append] |
5183 | 221 |
addsplits [list.split]) 1); |
3571 | 222 |
qed "tl_append2"; |
223 |
Addsimps [tl_append2]; |
|
224 |
||
5272 | 225 |
(* trivial rules for solving @-equations automatically *) |
226 |
||
227 |
Goal "xs = ys ==> xs = [] @ ys"; |
|
5318 | 228 |
by (Asm_simp_tac 1); |
5272 | 229 |
qed "eq_Nil_appendI"; |
230 |
||
231 |
Goal "[| x#xs1 = ys; xs = xs1 @ zs |] ==> x#xs = ys@zs"; |
|
5318 | 232 |
by (dtac sym 1); |
233 |
by (Asm_simp_tac 1); |
|
5272 | 234 |
qed "Cons_eq_appendI"; |
235 |
||
236 |
Goal "[| xs@xs1 = zs; ys = xs1 @ us |] ==> xs@ys = zs@us"; |
|
5318 | 237 |
by (dtac sym 1); |
238 |
by (Asm_simp_tac 1); |
|
5272 | 239 |
qed "append_eq_appendI"; |
240 |
||
4830 | 241 |
|
5427 | 242 |
(*** |
243 |
Simplification procedure for all list equalities. |
|
244 |
Currently only tries to rearranges @ to see if |
|
245 |
- both lists end in a singleton list, |
|
246 |
- or both lists end in the same list. |
|
247 |
***) |
|
248 |
local |
|
249 |
||
250 |
val list_eq_pattern = |
|
6394 | 251 |
Thm.read_cterm (Theory.sign_of List.thy) ("(xs::'a list) = ys",HOLogic.boolT); |
5427 | 252 |
|
7224 | 253 |
fun last (cons as Const("List.list.Cons",_) $ _ $ xs) = |
254 |
(case xs of Const("List.list.Nil",_) => cons | _ => last xs) |
|
5427 | 255 |
| last (Const("List.op @",_) $ _ $ ys) = last ys |
256 |
| last t = t; |
|
257 |
||
7224 | 258 |
fun list1 (Const("List.list.Cons",_) $ _ $ Const("List.list.Nil",_)) = true |
5427 | 259 |
| list1 _ = false; |
260 |
||
7224 | 261 |
fun butlast ((cons as Const("List.list.Cons",_) $ x) $ xs) = |
262 |
(case xs of Const("List.list.Nil",_) => xs | _ => cons $ butlast xs) |
|
5427 | 263 |
| butlast ((app as Const("List.op @",_) $ xs) $ ys) = app $ butlast ys |
7224 | 264 |
| butlast xs = Const("List.list.Nil",fastype_of xs); |
5427 | 265 |
|
266 |
val rearr_tac = |
|
267 |
simp_tac (HOL_basic_ss addsimps [append_assoc,append_Nil,append_Cons]); |
|
268 |
||
269 |
fun list_eq sg _ (F as (eq as Const(_,eqT)) $ lhs $ rhs) = |
|
270 |
let |
|
271 |
val lastl = last lhs and lastr = last rhs |
|
272 |
fun rearr conv = |
|
273 |
let val lhs1 = butlast lhs and rhs1 = butlast rhs |
|
274 |
val Type(_,listT::_) = eqT |
|
275 |
val appT = [listT,listT] ---> listT |
|
276 |
val app = Const("List.op @",appT) |
|
277 |
val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr) |
|
278 |
val ct = cterm_of sg (HOLogic.mk_Trueprop(HOLogic.mk_eq(F,F2))) |
|
279 |
val thm = prove_goalw_cterm [] ct (K [rearr_tac 1]) |
|
280 |
handle ERROR => |
|
281 |
error("The error(s) above occurred while trying to prove " ^ |
|
282 |
string_of_cterm ct) |
|
283 |
in Some((conv RS (thm RS trans)) RS eq_reflection) end |
|
284 |
||
285 |
in if list1 lastl andalso list1 lastr |
|
286 |
then rearr append1_eq_conv |
|
287 |
else |
|
288 |
if lastl aconv lastr |
|
289 |
then rearr append_same_eq |
|
290 |
else None |
|
291 |
end; |
|
292 |
in |
|
293 |
val list_eq_simproc = mk_simproc "list_eq" [list_eq_pattern] list_eq; |
|
294 |
end; |
|
295 |
||
296 |
Addsimprocs [list_eq_simproc]; |
|
297 |
||
298 |
||
2608 | 299 |
(** map **) |
300 |
||
3467 | 301 |
section "map"; |
302 |
||
5278 | 303 |
Goal "(!x. x : set xs --> f x = g x) --> map f xs = map g xs"; |
3457 | 304 |
by (induct_tac "xs" 1); |
5316 | 305 |
by Auto_tac; |
2608 | 306 |
bind_thm("map_ext", impI RS (allI RS (result() RS mp))); |
307 |
||
4935 | 308 |
Goal "map (%x. x) = (%xs. xs)"; |
2608 | 309 |
by (rtac ext 1); |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
310 |
by (induct_tac "xs" 1); |
5316 | 311 |
by Auto_tac; |
2608 | 312 |
qed "map_ident"; |
313 |
Addsimps[map_ident]; |
|
314 |
||
4935 | 315 |
Goal "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
|
316 |
by (induct_tac "xs" 1); |
5316 | 317 |
by Auto_tac; |
2608 | 318 |
qed "map_append"; |
319 |
Addsimps[map_append]; |
|
320 |
||
4935 | 321 |
Goalw [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
|
322 |
by (induct_tac "xs" 1); |
5316 | 323 |
by Auto_tac; |
2608 | 324 |
qed "map_compose"; |
325 |
Addsimps[map_compose]; |
|
326 |
||
4935 | 327 |
Goal "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
|
328 |
by (induct_tac "xs" 1); |
5316 | 329 |
by Auto_tac; |
2608 | 330 |
qed "rev_map"; |
331 |
||
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
332 |
(* a congruence rule for map: *) |
6451 | 333 |
Goal "xs=ys ==> (!x. x : set ys --> f x = g x) --> map f xs = map g ys"; |
4423 | 334 |
by (hyp_subst_tac 1); |
335 |
by (induct_tac "ys" 1); |
|
5316 | 336 |
by Auto_tac; |
6451 | 337 |
bind_thm("map_cong", impI RSN (2,allI RSN (2, result() RS mp))); |
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
338 |
|
4935 | 339 |
Goal "(map f xs = []) = (xs = [])"; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
340 |
by (case_tac "xs" 1); |
5316 | 341 |
by Auto_tac; |
3860 | 342 |
qed "map_is_Nil_conv"; |
343 |
AddIffs [map_is_Nil_conv]; |
|
344 |
||
4935 | 345 |
Goal "([] = map f xs) = (xs = [])"; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
346 |
by (case_tac "xs" 1); |
5316 | 347 |
by Auto_tac; |
3860 | 348 |
qed "Nil_is_map_conv"; |
349 |
AddIffs [Nil_is_map_conv]; |
|
350 |
||
8009 | 351 |
Goal "(map f xs = y#ys) = (? x xs'. xs = x#xs' & f x = y & map f xs' = ys)"; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
352 |
by (case_tac "xs" 1); |
8009 | 353 |
by (ALLGOALS Asm_simp_tac); |
354 |
qed "map_eq_Cons"; |
|
355 |
||
356 |
Goal "!xs. map f xs = map f ys --> (!x y. f x = f y --> x=y) --> xs=ys"; |
|
357 |
by (induct_tac "ys" 1); |
|
358 |
by (Asm_simp_tac 1); |
|
359 |
by (fast_tac (claset() addss (simpset() addsimps [map_eq_Cons])) 1); |
|
360 |
qed_spec_mp "map_injective"; |
|
361 |
||
362 |
Goal "inj f ==> inj (map f)"; |
|
8064 | 363 |
by (blast_tac (claset() addDs [map_injective,injD] addIs [injI]) 1); |
8009 | 364 |
qed "inj_mapI"; |
365 |
||
366 |
Goalw [inj_on_def] "inj (map f) ==> inj f"; |
|
8064 | 367 |
by (Clarify_tac 1); |
368 |
by (eres_inst_tac [("x","[x]")] ballE 1); |
|
369 |
by (eres_inst_tac [("x","[y]")] ballE 1); |
|
370 |
by (Asm_full_simp_tac 1); |
|
371 |
by (Blast_tac 1); |
|
372 |
by (Blast_tac 1); |
|
8009 | 373 |
qed "inj_mapD"; |
374 |
||
375 |
Goal "inj (map f) = inj f"; |
|
8064 | 376 |
by (blast_tac (claset() addDs [inj_mapD] addIs [inj_mapI]) 1); |
8009 | 377 |
qed "inj_map"; |
3860 | 378 |
|
1169 | 379 |
(** rev **) |
380 |
||
3467 | 381 |
section "rev"; |
382 |
||
4935 | 383 |
Goal "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
|
384 |
by (induct_tac "xs" 1); |
5316 | 385 |
by Auto_tac; |
1169 | 386 |
qed "rev_append"; |
2512 | 387 |
Addsimps[rev_append]; |
1169 | 388 |
|
4935 | 389 |
Goal "rev(rev l) = l"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
390 |
by (induct_tac "l" 1); |
5316 | 391 |
by Auto_tac; |
1169 | 392 |
qed "rev_rev_ident"; |
2512 | 393 |
Addsimps[rev_rev_ident]; |
1169 | 394 |
|
4935 | 395 |
Goal "(rev xs = []) = (xs = [])"; |
4423 | 396 |
by (induct_tac "xs" 1); |
5316 | 397 |
by Auto_tac; |
3860 | 398 |
qed "rev_is_Nil_conv"; |
399 |
AddIffs [rev_is_Nil_conv]; |
|
400 |
||
4935 | 401 |
Goal "([] = rev xs) = (xs = [])"; |
4423 | 402 |
by (induct_tac "xs" 1); |
5316 | 403 |
by Auto_tac; |
3860 | 404 |
qed "Nil_is_rev_conv"; |
405 |
AddIffs [Nil_is_rev_conv]; |
|
406 |
||
6820 | 407 |
Goal "!ys. (rev xs = rev ys) = (xs = ys)"; |
6831 | 408 |
by (induct_tac "xs" 1); |
6820 | 409 |
by (Force_tac 1); |
6831 | 410 |
by (rtac allI 1); |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
411 |
by (case_tac "ys" 1); |
6820 | 412 |
by (Asm_simp_tac 1); |
413 |
by (Force_tac 1); |
|
414 |
qed_spec_mp "rev_is_rev_conv"; |
|
415 |
AddIffs [rev_is_rev_conv]; |
|
416 |
||
4935 | 417 |
val prems = Goal "[| P []; !!x xs. P xs ==> P(xs@[x]) |] ==> P xs"; |
5132 | 418 |
by (stac (rev_rev_ident RS sym) 1); |
6162 | 419 |
by (res_inst_tac [("list", "rev xs")] list.induct 1); |
5132 | 420 |
by (ALLGOALS Simp_tac); |
421 |
by (resolve_tac prems 1); |
|
422 |
by (eresolve_tac prems 1); |
|
4935 | 423 |
qed "rev_induct"; |
424 |
||
5272 | 425 |
fun rev_induct_tac xs = res_inst_tac [("xs",xs)] rev_induct; |
426 |
||
4935 | 427 |
Goal "(xs = [] --> P) --> (!ys y. xs = ys@[y] --> P) --> P"; |
5132 | 428 |
by (res_inst_tac [("xs","xs")] rev_induct 1); |
5316 | 429 |
by Auto_tac; |
4935 | 430 |
bind_thm ("rev_exhaust", |
431 |
impI RSN (2,allI RSN (2,allI RSN (2,impI RS (result() RS mp RS mp))))); |
|
432 |
||
2608 | 433 |
|
3465 | 434 |
(** set **) |
1812 | 435 |
|
3467 | 436 |
section "set"; |
437 |
||
7032 | 438 |
Goal "finite (set xs)"; |
439 |
by (induct_tac "xs" 1); |
|
440 |
by Auto_tac; |
|
441 |
qed "finite_set"; |
|
442 |
AddIffs [finite_set]; |
|
5296 | 443 |
|
4935 | 444 |
Goal "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
|
445 |
by (induct_tac "xs" 1); |
5316 | 446 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
447 |
qed "set_append"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
448 |
Addsimps[set_append]; |
1812 | 449 |
|
4935 | 450 |
Goal "set l <= set (x#l)"; |
5316 | 451 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
452 |
qed "set_subset_Cons"; |
1936 | 453 |
|
4935 | 454 |
Goal "(set xs = {}) = (xs = [])"; |
3457 | 455 |
by (induct_tac "xs" 1); |
5316 | 456 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
457 |
qed "set_empty"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
458 |
Addsimps [set_empty]; |
2608 | 459 |
|
4935 | 460 |
Goal "set(rev xs) = set(xs)"; |
3457 | 461 |
by (induct_tac "xs" 1); |
5316 | 462 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
463 |
qed "set_rev"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
464 |
Addsimps [set_rev]; |
2608 | 465 |
|
4935 | 466 |
Goal "set(map f xs) = f``(set xs)"; |
3457 | 467 |
by (induct_tac "xs" 1); |
5316 | 468 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
469 |
qed "set_map"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
470 |
Addsimps [set_map]; |
2608 | 471 |
|
6433 | 472 |
Goal "set(filter P xs) = {x. x : set xs & P x}"; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
473 |
by (induct_tac "xs" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
474 |
by Auto_tac; |
6433 | 475 |
qed "set_filter"; |
476 |
Addsimps [set_filter]; |
|
8009 | 477 |
|
6433 | 478 |
Goal "set[i..j(] = {k. i <= k & k < j}"; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
479 |
by (induct_tac "j" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
480 |
by Auto_tac; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
481 |
by (arith_tac 1); |
6433 | 482 |
qed "set_upt"; |
483 |
Addsimps [set_upt]; |
|
484 |
||
5272 | 485 |
Goal "(x : set xs) = (? ys zs. xs = ys@x#zs)"; |
5318 | 486 |
by (induct_tac "xs" 1); |
487 |
by (Simp_tac 1); |
|
488 |
by (Asm_simp_tac 1); |
|
489 |
by (rtac iffI 1); |
|
490 |
by (blast_tac (claset() addIs [eq_Nil_appendI,Cons_eq_appendI]) 1); |
|
491 |
by (REPEAT(etac exE 1)); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
492 |
by (case_tac "ys" 1); |
5316 | 493 |
by Auto_tac; |
5272 | 494 |
qed "in_set_conv_decomp"; |
495 |
||
8009 | 496 |
|
5272 | 497 |
(* eliminate `lists' in favour of `set' *) |
498 |
||
499 |
Goal "(xs : lists A) = (!x : set xs. x : A)"; |
|
5318 | 500 |
by (induct_tac "xs" 1); |
5316 | 501 |
by Auto_tac; |
5272 | 502 |
qed "in_lists_conv_set"; |
503 |
||
504 |
bind_thm("in_listsD",in_lists_conv_set RS iffD1); |
|
505 |
AddSDs [in_listsD]; |
|
506 |
bind_thm("in_listsI",in_lists_conv_set RS iffD2); |
|
507 |
AddSIs [in_listsI]; |
|
1812 | 508 |
|
5518 | 509 |
(** mem **) |
510 |
||
511 |
section "mem"; |
|
512 |
||
513 |
Goal "(x mem xs) = (x: set xs)"; |
|
514 |
by (induct_tac "xs" 1); |
|
515 |
by Auto_tac; |
|
516 |
qed "set_mem_eq"; |
|
517 |
||
518 |
||
923 | 519 |
(** list_all **) |
520 |
||
3467 | 521 |
section "list_all"; |
522 |
||
5518 | 523 |
Goal "list_all P xs = (!x:set xs. P x)"; |
524 |
by (induct_tac "xs" 1); |
|
525 |
by Auto_tac; |
|
526 |
qed "list_all_conv"; |
|
527 |
||
5443
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
528 |
Goal "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
|
529 |
by (induct_tac "xs" 1); |
5316 | 530 |
by Auto_tac; |
2512 | 531 |
qed "list_all_append"; |
532 |
Addsimps [list_all_append]; |
|
923 | 533 |
|
534 |
||
2608 | 535 |
(** filter **) |
923 | 536 |
|
3467 | 537 |
section "filter"; |
538 |
||
4935 | 539 |
Goal "filter P (xs@ys) = filter P xs @ filter P ys"; |
3457 | 540 |
by (induct_tac "xs" 1); |
5316 | 541 |
by Auto_tac; |
2608 | 542 |
qed "filter_append"; |
543 |
Addsimps [filter_append]; |
|
544 |
||
4935 | 545 |
Goal "filter (%x. True) xs = xs"; |
4605 | 546 |
by (induct_tac "xs" 1); |
5316 | 547 |
by Auto_tac; |
4605 | 548 |
qed "filter_True"; |
549 |
Addsimps [filter_True]; |
|
550 |
||
4935 | 551 |
Goal "filter (%x. False) xs = []"; |
4605 | 552 |
by (induct_tac "xs" 1); |
5316 | 553 |
by Auto_tac; |
4605 | 554 |
qed "filter_False"; |
555 |
Addsimps [filter_False]; |
|
556 |
||
4935 | 557 |
Goal "length (filter P xs) <= length xs"; |
3457 | 558 |
by (induct_tac "xs" 1); |
5316 | 559 |
by Auto_tac; |
8741
61bc5ed22b62
removal of less_SucI, le_SucI from default simpset
paulson
parents:
8442
diff
changeset
|
560 |
by (asm_simp_tac (simpset() addsimps [le_SucI]) 1); |
4605 | 561 |
qed "length_filter"; |
5443
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
562 |
Addsimps[length_filter]; |
2608 | 563 |
|
5443
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
564 |
Goal "set (filter P xs) <= set xs"; |
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
565 |
by Auto_tac; |
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
566 |
qed "filter_is_subset"; |
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
567 |
Addsimps [filter_is_subset]; |
e2459d18ff47
changed constants mem and list_all to mere translations
oheimb
parents:
5427
diff
changeset
|
568 |
|
2608 | 569 |
|
3467 | 570 |
section "concat"; |
571 |
||
4935 | 572 |
Goal "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
|
573 |
by (induct_tac "xs" 1); |
5316 | 574 |
by Auto_tac; |
2608 | 575 |
qed"concat_append"; |
576 |
Addsimps [concat_append]; |
|
2512 | 577 |
|
4935 | 578 |
Goal "(concat xss = []) = (!xs:set xss. xs=[])"; |
4423 | 579 |
by (induct_tac "xss" 1); |
5316 | 580 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
581 |
qed "concat_eq_Nil_conv"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
582 |
AddIffs [concat_eq_Nil_conv]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
583 |
|
4935 | 584 |
Goal "([] = concat xss) = (!xs:set xss. xs=[])"; |
4423 | 585 |
by (induct_tac "xss" 1); |
5316 | 586 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
587 |
qed "Nil_eq_concat_conv"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
588 |
AddIffs [Nil_eq_concat_conv]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
589 |
|
4935 | 590 |
Goal "set(concat xs) = Union(set `` set xs)"; |
3467 | 591 |
by (induct_tac "xs" 1); |
5316 | 592 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
593 |
qed"set_concat"; |
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
594 |
Addsimps [set_concat]; |
3467 | 595 |
|
4935 | 596 |
Goal "map f (concat xs) = concat (map (map f) xs)"; |
3467 | 597 |
by (induct_tac "xs" 1); |
5316 | 598 |
by Auto_tac; |
3467 | 599 |
qed "map_concat"; |
600 |
||
4935 | 601 |
Goal "filter p (concat xs) = concat (map (filter p) xs)"; |
3467 | 602 |
by (induct_tac "xs" 1); |
5316 | 603 |
by Auto_tac; |
3467 | 604 |
qed"filter_concat"; |
605 |
||
4935 | 606 |
Goal "rev(concat xs) = concat (map rev (rev xs))"; |
3467 | 607 |
by (induct_tac "xs" 1); |
5316 | 608 |
by Auto_tac; |
2608 | 609 |
qed "rev_concat"; |
923 | 610 |
|
611 |
(** nth **) |
|
612 |
||
3467 | 613 |
section "nth"; |
614 |
||
6408 | 615 |
Goal "(x#xs)!0 = x"; |
616 |
by Auto_tac; |
|
617 |
qed "nth_Cons_0"; |
|
618 |
Addsimps [nth_Cons_0]; |
|
5644 | 619 |
|
6408 | 620 |
Goal "(x#xs)!(Suc n) = xs!n"; |
621 |
by Auto_tac; |
|
622 |
qed "nth_Cons_Suc"; |
|
623 |
Addsimps [nth_Cons_Suc]; |
|
624 |
||
625 |
Delsimps (thms "nth.simps"); |
|
626 |
||
627 |
Goal "!n. (xs@ys)!n = (if n < length xs then xs!n else ys!(n - length xs))"; |
|
628 |
by (induct_tac "xs" 1); |
|
3457 | 629 |
by (Asm_simp_tac 1); |
630 |
by (rtac allI 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
631 |
by (case_tac "n" 1); |
5316 | 632 |
by Auto_tac; |
2608 | 633 |
qed_spec_mp "nth_append"; |
634 |
||
4935 | 635 |
Goal "!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
|
636 |
by (induct_tac "xs" 1); |
8118 | 637 |
by (Asm_full_simp_tac 1); |
1301 | 638 |
by (rtac allI 1); |
5183 | 639 |
by (induct_tac "n" 1); |
5316 | 640 |
by Auto_tac; |
1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset
|
641 |
qed_spec_mp "nth_map"; |
1301 | 642 |
Addsimps [nth_map]; |
643 |
||
8118 | 644 |
Goal "set xs = {xs!i |i. i < length xs}"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
645 |
by (induct_tac "xs" 1); |
8118 | 646 |
by (Simp_tac 1); |
8254 | 647 |
by (Asm_simp_tac 1); |
648 |
by Safe_tac; |
|
649 |
by (res_inst_tac [("x","0")] exI 1); |
|
8118 | 650 |
by (Simp_tac 1); |
8254 | 651 |
by (res_inst_tac [("x","Suc i")] exI 1); |
652 |
by (Asm_simp_tac 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
653 |
by (case_tac "i" 1); |
8254 | 654 |
by (Asm_full_simp_tac 1); |
655 |
by (rename_tac "j" 1); |
|
656 |
by (res_inst_tac [("x","j")] exI 1); |
|
657 |
by (Asm_simp_tac 1); |
|
8118 | 658 |
qed "set_conv_nth"; |
659 |
||
660 |
Goal "n < length xs ==> Ball (set xs) P --> P(xs!n)"; |
|
661 |
by (simp_tac (simpset() addsimps [set_conv_nth]) 1); |
|
8254 | 662 |
by (Blast_tac 1); |
5518 | 663 |
qed_spec_mp "list_ball_nth"; |
1301 | 664 |
|
8118 | 665 |
Goal "n < length xs ==> xs!n : set xs"; |
666 |
by (simp_tac (simpset() addsimps [set_conv_nth]) 1); |
|
8254 | 667 |
by (Blast_tac 1); |
1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset
|
668 |
qed_spec_mp "nth_mem"; |
1301 | 669 |
Addsimps [nth_mem]; |
670 |
||
8009 | 671 |
Goal "(!i. i < length xs --> P(xs!i)) --> (!x : set xs. P x)"; |
8118 | 672 |
by (simp_tac (simpset() addsimps [set_conv_nth]) 1); |
8254 | 673 |
by (Blast_tac 1); |
8009 | 674 |
qed_spec_mp "all_nth_imp_all_set"; |
675 |
||
676 |
Goal "(!x : set xs. P x) = (!i. i<length xs --> P (xs ! i))"; |
|
8118 | 677 |
by (simp_tac (simpset() addsimps [set_conv_nth]) 1); |
8254 | 678 |
by (Blast_tac 1); |
8009 | 679 |
qed_spec_mp "all_set_conv_all_nth"; |
680 |
||
681 |
||
5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
682 |
(** list update **) |
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
683 |
|
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
684 |
section "list update"; |
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
685 |
|
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
686 |
Goal "!i. length(xs[i:=x]) = length xs"; |
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
687 |
by (induct_tac "xs" 1); |
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
688 |
by (Simp_tac 1); |
5183 | 689 |
by (asm_full_simp_tac (simpset() addsplits [nat.split]) 1); |
5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
690 |
qed_spec_mp "length_list_update"; |
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
691 |
Addsimps [length_list_update]; |
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
692 |
|
5644 | 693 |
Goal "!i j. i < length xs --> (xs[i:=x])!j = (if i=j then x else xs!j)"; |
6162 | 694 |
by (induct_tac "xs" 1); |
695 |
by (Simp_tac 1); |
|
696 |
by (auto_tac (claset(), simpset() addsimps [nth_Cons] addsplits [nat.split])); |
|
5644 | 697 |
qed_spec_mp "nth_list_update"; |
698 |
||
8144 | 699 |
Goal "i < length xs ==> (xs[i:=x])!i = x"; |
700 |
by (asm_simp_tac (simpset() addsimps [nth_list_update]) 1); |
|
701 |
qed "nth_list_update_eq"; |
|
702 |
Addsimps [nth_list_update_eq]; |
|
703 |
||
704 |
Goal "!i j. i ~= j --> xs[i:=x]!j = xs!j"; |
|
705 |
by (induct_tac "xs" 1); |
|
706 |
by (Simp_tac 1); |
|
707 |
by (auto_tac (claset(), simpset() addsimps [nth_Cons] addsplits [nat.split])); |
|
708 |
qed_spec_mp "nth_list_update_neq"; |
|
709 |
Addsimps [nth_list_update_neq]; |
|
710 |
||
6433 | 711 |
Goal "!i. i < size xs --> xs[i:=x, i:=y] = xs[i:=y]"; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
712 |
by (induct_tac "xs" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
713 |
by (Simp_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
714 |
by (asm_simp_tac (simpset() addsplits [nat.split]) 1); |
6433 | 715 |
qed_spec_mp "list_update_overwrite"; |
716 |
Addsimps [list_update_overwrite]; |
|
717 |
||
718 |
Goal "!i < length xs. (xs[i := x] = xs) = (xs!i = x)"; |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
719 |
by (induct_tac "xs" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
720 |
by (Simp_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
721 |
by (simp_tac (simpset() addsplits [nat.split]) 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
722 |
by (Blast_tac 1); |
6433 | 723 |
qed_spec_mp "list_update_same_conv"; |
724 |
||
8009 | 725 |
Goal "!i xy xs. length xs = length ys --> \ |
726 |
\ (zip xs ys)[i:=xy] = zip (xs[i:=fst xy]) (ys[i:=snd xy])"; |
|
727 |
by (induct_tac "ys" 1); |
|
728 |
by Auto_tac; |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
729 |
by (case_tac "xs" 1); |
8009 | 730 |
by (auto_tac (claset(), simpset() addsplits [nat.split])); |
731 |
qed_spec_mp "update_zip"; |
|
732 |
||
733 |
Goal "!i. set(xs[i:=x]) <= insert x (set xs)"; |
|
734 |
by (induct_tac "xs" 1); |
|
735 |
by (asm_full_simp_tac (simpset() addsimps []) 1); |
|
736 |
by (asm_full_simp_tac (simpset() addsplits [nat.split]) 1); |
|
737 |
by (Fast_tac 1); |
|
8287 | 738 |
qed_spec_mp "set_update_subset_insert"; |
8009 | 739 |
|
8287 | 740 |
Goal "[| set xs <= A; x:A |] ==> set(xs[i := x]) <= A"; |
741 |
by(fast_tac (claset() addSDs [set_update_subset_insert RS subsetD]) 1); |
|
742 |
qed "set_update_subsetI"; |
|
5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5043
diff
changeset
|
743 |
|
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
744 |
(** last & butlast **) |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
745 |
|
5644 | 746 |
section "last / butlast"; |
747 |
||
4935 | 748 |
Goal "last(xs@[x]) = x"; |
4423 | 749 |
by (induct_tac "xs" 1); |
5316 | 750 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
751 |
qed "last_snoc"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
752 |
Addsimps [last_snoc]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
753 |
|
4935 | 754 |
Goal "butlast(xs@[x]) = xs"; |
4423 | 755 |
by (induct_tac "xs" 1); |
5316 | 756 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
757 |
qed "butlast_snoc"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
758 |
Addsimps [butlast_snoc]; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
759 |
|
4935 | 760 |
Goal "length(butlast xs) = length xs - 1"; |
761 |
by (res_inst_tac [("xs","xs")] rev_induct 1); |
|
5316 | 762 |
by Auto_tac; |
4643 | 763 |
qed "length_butlast"; |
764 |
Addsimps [length_butlast]; |
|
765 |
||
5278 | 766 |
Goal "!ys. butlast (xs@ys) = (if ys=[] then butlast xs else xs@butlast ys)"; |
4423 | 767 |
by (induct_tac "xs" 1); |
5316 | 768 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
769 |
qed_spec_mp "butlast_append"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
770 |
|
8118 | 771 |
Goal "xs ~= [] --> butlast xs @ [last xs] = xs"; |
8254 | 772 |
by (induct_tac "xs" 1); |
773 |
by (ALLGOALS Asm_simp_tac); |
|
8118 | 774 |
qed_spec_mp "append_butlast_last_id"; |
775 |
Addsimps [append_butlast_last_id]; |
|
776 |
||
4935 | 777 |
Goal "x:set(butlast xs) --> x:set xs"; |
4423 | 778 |
by (induct_tac "xs" 1); |
5316 | 779 |
by Auto_tac; |
3896
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
780 |
qed_spec_mp "in_set_butlastD"; |
ee8ebb74ec00
Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents:
3860
diff
changeset
|
781 |
|
5448
40a09282ba14
in_set_butlast_appendI supersedes in_set_butlast_appendI1,2
paulson
parents:
5443
diff
changeset
|
782 |
Goal "x:set(butlast xs) | x:set(butlast ys) ==> x:set(butlast(xs@ys))"; |
40a09282ba14
in_set_butlast_appendI supersedes in_set_butlast_appendI1,2
paulson
parents:
5443
diff
changeset
|
783 |
by (auto_tac (claset() addDs [in_set_butlastD], |
40a09282ba14
in_set_butlast_appendI supersedes in_set_butlast_appendI1,2
paulson
parents:
5443
diff
changeset
|
784 |
simpset() addsimps [butlast_append])); |
40a09282ba14
in_set_butlast_appendI supersedes in_set_butlast_appendI1,2
paulson
parents:
5443
diff
changeset
|
785 |
qed "in_set_butlast_appendI"; |
3902 | 786 |
|
2608 | 787 |
(** take & drop **) |
788 |
section "take & drop"; |
|
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
789 |
|
4935 | 790 |
Goal "take 0 xs = []"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
791 |
by (induct_tac "xs" 1); |
5316 | 792 |
by Auto_tac; |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
793 |
qed "take_0"; |
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
794 |
|
4935 | 795 |
Goal "drop 0 xs = xs"; |
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
3011
diff
changeset
|
796 |
by (induct_tac "xs" 1); |
5316 | 797 |
by Auto_tac; |
2608 | 798 |
qed "drop_0"; |
799 |
||
4935 | 800 |
Goal "take (Suc n) (x#xs) = x # take n xs"; |
1552 | 801 |
by (Simp_tac 1); |
1419
a6a034a47a71
defined take/drop by induction over list rather than nat.
nipkow
parents:
1327
diff
changeset
|
802 |
qed "take_Suc_Cons"; |
1327
6c29cfab679c
added new arithmetic lemmas and the functions take and drop.
nipkow
parents:
1301
diff
changeset
|
803 |
|
4935 | 804 |
Goal "drop (Suc n) (x#xs) = drop n xs"; |
2608 | 805 |
by (Simp_tac 1); |
806 |
qed "drop_Suc_Cons"; |
|
807 |
||
808 |
Delsimps [take_Cons,drop_Cons]; |
|
809 |
Addsimps [take_0,take_Suc_Cons,drop_0,drop_Suc_Cons]; |
|
810 |
||
4935 | 811 |
Goal "!xs. length(take n xs) = min (length xs) n"; |
5183 | 812 |
by (induct_tac "n" 1); |
5316 | 813 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
814 |
by (case_tac "xs" 1); |
5316 | 815 |
by Auto_tac; |
2608 | 816 |
qed_spec_mp "length_take"; |
817 |
Addsimps [length_take]; |
|
923 | 818 |
|
4935 | 819 |
Goal "!xs. length(drop n xs) = (length xs - n)"; |
5183 | 820 |
by (induct_tac "n" 1); |
5316 | 821 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
822 |
by (case_tac "xs" 1); |
5316 | 823 |
by Auto_tac; |
2608 | 824 |
qed_spec_mp "length_drop"; |
825 |
Addsimps [length_drop]; |
|
826 |
||
4935 | 827 |
Goal "!xs. length xs <= n --> take n xs = xs"; |
5183 | 828 |
by (induct_tac "n" 1); |
5316 | 829 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
830 |
by (case_tac "xs" 1); |
5316 | 831 |
by Auto_tac; |
2608 | 832 |
qed_spec_mp "take_all"; |
7246 | 833 |
Addsimps [take_all]; |
923 | 834 |
|
4935 | 835 |
Goal "!xs. length xs <= n --> drop n xs = []"; |
5183 | 836 |
by (induct_tac "n" 1); |
5316 | 837 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
838 |
by (case_tac "xs" 1); |
5316 | 839 |
by Auto_tac; |
2608 | 840 |
qed_spec_mp "drop_all"; |
7246 | 841 |
Addsimps [drop_all]; |
2608 | 842 |
|
5278 | 843 |
Goal "!xs. take n (xs @ ys) = (take n xs @ take (n - length xs) ys)"; |
5183 | 844 |
by (induct_tac "n" 1); |
5316 | 845 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
846 |
by (case_tac "xs" 1); |
5316 | 847 |
by Auto_tac; |
2608 | 848 |
qed_spec_mp "take_append"; |
849 |
Addsimps [take_append]; |
|
850 |
||
4935 | 851 |
Goal "!xs. drop n (xs@ys) = drop n xs @ drop (n - length xs) ys"; |
5183 | 852 |
by (induct_tac "n" 1); |
5316 | 853 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
854 |
by (case_tac "xs" 1); |
5316 | 855 |
by Auto_tac; |
2608 | 856 |
qed_spec_mp "drop_append"; |
857 |
Addsimps [drop_append]; |
|
858 |
||
4935 | 859 |
Goal "!xs n. take n (take m xs) = take (min n m) xs"; |
5183 | 860 |
by (induct_tac "m" 1); |
5316 | 861 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
862 |
by (case_tac "xs" 1); |
5316 | 863 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
864 |
by (case_tac "na" 1); |
5316 | 865 |
by Auto_tac; |
2608 | 866 |
qed_spec_mp "take_take"; |
7570 | 867 |
Addsimps [take_take]; |
2608 | 868 |
|
4935 | 869 |
Goal "!xs. drop n (drop m xs) = drop (n + m) xs"; |
5183 | 870 |
by (induct_tac "m" 1); |
5316 | 871 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
872 |
by (case_tac "xs" 1); |
5316 | 873 |
by Auto_tac; |
2608 | 874 |
qed_spec_mp "drop_drop"; |
7570 | 875 |
Addsimps [drop_drop]; |
923 | 876 |
|
4935 | 877 |
Goal "!xs n. take n (drop m xs) = drop m (take (n + m) xs)"; |
5183 | 878 |
by (induct_tac "m" 1); |
5316 | 879 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
880 |
by (case_tac "xs" 1); |
5316 | 881 |
by Auto_tac; |
2608 | 882 |
qed_spec_mp "take_drop"; |
883 |
||
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
884 |
Goal "!xs. take n xs @ drop n xs = xs"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
885 |
by (induct_tac "n" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
886 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
887 |
by (case_tac "xs" 1); |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
888 |
by Auto_tac; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
889 |
qed_spec_mp "append_take_drop_id"; |
8118 | 890 |
Addsimps [append_take_drop_id]; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
891 |
|
4935 | 892 |
Goal "!xs. take n (map f xs) = map f (take n xs)"; |
5183 | 893 |
by (induct_tac "n" 1); |
5316 | 894 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
895 |
by (case_tac "xs" 1); |
5316 | 896 |
by Auto_tac; |
2608 | 897 |
qed_spec_mp "take_map"; |
898 |
||
4935 | 899 |
Goal "!xs. drop n (map f xs) = map f (drop n xs)"; |
5183 | 900 |
by (induct_tac "n" 1); |
5316 | 901 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
902 |
by (case_tac "xs" 1); |
5316 | 903 |
by Auto_tac; |
2608 | 904 |
qed_spec_mp "drop_map"; |
905 |
||
4935 | 906 |
Goal "!n i. i < n --> (take n xs)!i = xs!i"; |
3457 | 907 |
by (induct_tac "xs" 1); |
5316 | 908 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
909 |
by (case_tac "n" 1); |
3457 | 910 |
by (Blast_tac 1); |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
911 |
by (case_tac "i" 1); |
5316 | 912 |
by Auto_tac; |
2608 | 913 |
qed_spec_mp "nth_take"; |
914 |
Addsimps [nth_take]; |
|
923 | 915 |
|
4935 | 916 |
Goal "!xs i. n + i <= length xs --> (drop n xs)!i = xs!(n+i)"; |
5183 | 917 |
by (induct_tac "n" 1); |
5316 | 918 |
by Auto_tac; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
919 |
by (case_tac "xs" 1); |
5316 | 920 |
by Auto_tac; |
2608 | 921 |
qed_spec_mp "nth_drop"; |
922 |
Addsimps [nth_drop]; |
|
923 |
||
8118 | 924 |
|
925 |
Goal |
|
926 |
"!zs. (xs@ys = zs) = (xs = take (length xs) zs & ys = drop (length xs) zs)"; |
|
8254 | 927 |
by (induct_tac "xs" 1); |
928 |
by (Simp_tac 1); |
|
929 |
by (Asm_full_simp_tac 1); |
|
930 |
by (Clarify_tac 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
931 |
by (case_tac "zs" 1); |
8254 | 932 |
by (Auto_tac); |
8118 | 933 |
qed_spec_mp "append_eq_conv_conj"; |
934 |
||
2608 | 935 |
(** takeWhile & dropWhile **) |
936 |
||
3467 | 937 |
section "takeWhile & dropWhile"; |
938 |
||
4935 | 939 |
Goal "takeWhile P xs @ dropWhile P xs = xs"; |
3586 | 940 |
by (induct_tac "xs" 1); |
5316 | 941 |
by Auto_tac; |
3586 | 942 |
qed "takeWhile_dropWhile_id"; |
943 |
Addsimps [takeWhile_dropWhile_id]; |
|
944 |
||
4935 | 945 |
Goal "x:set xs & ~P(x) --> takeWhile P (xs @ ys) = takeWhile P xs"; |
3457 | 946 |
by (induct_tac "xs" 1); |
5316 | 947 |
by Auto_tac; |
2608 | 948 |
bind_thm("takeWhile_append1", conjI RS (result() RS mp)); |
949 |
Addsimps [takeWhile_append1]; |
|
923 | 950 |
|
4935 | 951 |
Goal "(!x:set xs. P(x)) --> takeWhile P (xs @ ys) = xs @ takeWhile P ys"; |
3457 | 952 |
by (induct_tac "xs" 1); |
5316 | 953 |
by Auto_tac; |
2608 | 954 |
bind_thm("takeWhile_append2", ballI RS (result() RS mp)); |
955 |
Addsimps [takeWhile_append2]; |
|
1169 | 956 |
|
4935 | 957 |
Goal "x:set xs & ~P(x) --> dropWhile P (xs @ ys) = (dropWhile P xs)@ys"; |
3457 | 958 |
by (induct_tac "xs" 1); |
5316 | 959 |
by Auto_tac; |
2608 | 960 |
bind_thm("dropWhile_append1", conjI RS (result() RS mp)); |
961 |
Addsimps [dropWhile_append1]; |
|
962 |
||
4935 | 963 |
Goal "(!x:set xs. P(x)) --> dropWhile P (xs @ ys) = dropWhile P ys"; |
3457 | 964 |
by (induct_tac "xs" 1); |
5316 | 965 |
by Auto_tac; |
2608 | 966 |
bind_thm("dropWhile_append2", ballI RS (result() RS mp)); |
967 |
Addsimps [dropWhile_append2]; |
|
968 |
||
4935 | 969 |
Goal "x:set(takeWhile P xs) --> x:set xs & P x"; |
3457 | 970 |
by (induct_tac "xs" 1); |
5316 | 971 |
by Auto_tac; |
3647
a64c8fbcd98f
Renamed theorems of the form set_of_list_XXX to set_XXX
paulson
parents:
3589
diff
changeset
|
972 |
qed_spec_mp"set_take_whileD"; |
2608 | 973 |
|
6306 | 974 |
(** zip **) |
975 |
section "zip"; |
|
976 |
||
977 |
Goal "zip [] ys = []"; |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
978 |
by (induct_tac "ys" 1); |
6306 | 979 |
by Auto_tac; |
980 |
qed "zip_Nil"; |
|
981 |
Addsimps [zip_Nil]; |
|
982 |
||
983 |
Goal "zip (x#xs) (y#ys) = (x,y)#zip xs ys"; |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
984 |
by (Simp_tac 1); |
6306 | 985 |
qed "zip_Cons_Cons"; |
986 |
Addsimps [zip_Cons_Cons]; |
|
987 |
||
988 |
Delsimps(tl (thms"zip.simps")); |
|
4605 | 989 |
|
8118 | 990 |
Goal "!xs. length (zip xs ys) = min (length xs) (length ys)"; |
8009 | 991 |
by (induct_tac "ys" 1); |
992 |
by (Simp_tac 1); |
|
993 |
by (Clarify_tac 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
994 |
by (case_tac "xs" 1); |
8064 | 995 |
by (Auto_tac); |
8009 | 996 |
qed_spec_mp "length_zip"; |
997 |
Addsimps [length_zip]; |
|
998 |
||
999 |
Goal |
|
8118 | 1000 |
"!xs. zip (xs@ys) zs = \ |
1001 |
\ zip xs (take (length xs) zs) @ zip ys (drop (length xs) zs)"; |
|
8254 | 1002 |
by (induct_tac "zs" 1); |
1003 |
by (Simp_tac 1); |
|
8064 | 1004 |
by (Clarify_tac 1); |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1005 |
by (case_tac "xs" 1); |
8254 | 1006 |
by (Asm_simp_tac 1); |
1007 |
by (Asm_simp_tac 1); |
|
8118 | 1008 |
qed_spec_mp "zip_append1"; |
1009 |
||
1010 |
Goal |
|
1011 |
"!ys. zip xs (ys@zs) = \ |
|
1012 |
\ zip (take (length ys) xs) ys @ zip (drop (length ys) xs) zs"; |
|
8254 | 1013 |
by (induct_tac "xs" 1); |
1014 |
by (Simp_tac 1); |
|
8118 | 1015 |
by (Clarify_tac 1); |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1016 |
by (case_tac "ys" 1); |
8254 | 1017 |
by (Asm_simp_tac 1); |
1018 |
by (Asm_simp_tac 1); |
|
8118 | 1019 |
qed_spec_mp "zip_append2"; |
1020 |
||
1021 |
Goal |
|
1022 |
"[| length xs = length us; length ys = length vs |] ==> \ |
|
1023 |
\ zip (xs@ys) (us@vs) = zip xs us @ zip ys vs"; |
|
8254 | 1024 |
by (asm_simp_tac (simpset() addsimps [zip_append1]) 1); |
8009 | 1025 |
qed_spec_mp "zip_append"; |
8118 | 1026 |
Addsimps [zip_append]; |
8009 | 1027 |
|
1028 |
Goal "!xs. length xs = length ys --> zip (rev xs) (rev ys) = rev (zip xs ys)"; |
|
8064 | 1029 |
by (induct_tac "ys" 1); |
1030 |
by (Asm_full_simp_tac 1); |
|
1031 |
by (Asm_full_simp_tac 1); |
|
1032 |
by (Clarify_tac 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1033 |
by (case_tac "xs" 1); |
8064 | 1034 |
by (Auto_tac); |
8009 | 1035 |
qed_spec_mp "zip_rev"; |
1036 |
||
8115 | 1037 |
|
1038 |
Goal |
|
8009 | 1039 |
"!i xs. i < length xs --> i < length ys --> (zip xs ys)!i = (xs!i, ys!i)"; |
1040 |
by (induct_tac "ys" 1); |
|
1041 |
by (Simp_tac 1); |
|
1042 |
by (Clarify_tac 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1043 |
by (case_tac "xs" 1); |
8064 | 1044 |
by (Auto_tac); |
8009 | 1045 |
by (asm_full_simp_tac (simpset() addsimps (thms"nth.simps") addsplits [nat.split]) 1); |
1046 |
qed_spec_mp "nth_zip"; |
|
1047 |
Addsimps [nth_zip]; |
|
1048 |
||
8118 | 1049 |
Goal "set(zip xs ys) = {(xs!i,ys!i) |i. i < min (length xs) (length ys)}"; |
1050 |
by (simp_tac (simpset() addsimps [set_conv_nth]addcongs [rev_conj_cong]) 1); |
|
1051 |
qed_spec_mp "set_zip"; |
|
1052 |
||
8009 | 1053 |
Goal |
1054 |
"length xs = length ys ==> zip (xs[i:=x]) (ys[i:=y]) = (zip xs ys)[i:=(x,y)]"; |
|
8064 | 1055 |
by (rtac sym 1); |
1056 |
by (asm_simp_tac (simpset() addsimps [update_zip]) 1); |
|
8009 | 1057 |
qed_spec_mp "zip_update"; |
1058 |
||
1059 |
Goal "!j. zip (replicate i x) (replicate j y) = replicate (min i j) (x,y)"; |
|
1060 |
by (induct_tac "i" 1); |
|
8064 | 1061 |
by (Auto_tac); |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1062 |
by (case_tac "j" 1); |
8064 | 1063 |
by (Auto_tac); |
8009 | 1064 |
qed "zip_replicate"; |
1065 |
Addsimps [zip_replicate]; |
|
1066 |
||
8115 | 1067 |
(** list_all2 **) |
1068 |
section "list_all2"; |
|
1069 |
||
1070 |
Goalw [list_all2_def] "list_all2 P xs ys ==> length xs = length ys"; |
|
8254 | 1071 |
by (Asm_simp_tac 1); |
8115 | 1072 |
qed "list_all2_lengthD"; |
1073 |
||
1074 |
Goalw [list_all2_def] "list_all2 P [] ys = (ys=[])"; |
|
1075 |
by (Simp_tac 1); |
|
1076 |
qed "list_all2_Nil"; |
|
1077 |
AddIffs [list_all2_Nil]; |
|
1078 |
||
1079 |
Goalw [list_all2_def] "list_all2 P xs [] = (xs=[])"; |
|
1080 |
by (Simp_tac 1); |
|
1081 |
qed "list_all2_Nil2"; |
|
1082 |
AddIffs [list_all2_Nil2]; |
|
1083 |
||
1084 |
Goalw [list_all2_def] |
|
1085 |
"list_all2 P (x#xs) (y#ys) = (P x y & list_all2 P xs ys)"; |
|
1086 |
by (Auto_tac); |
|
1087 |
qed "list_all2_Cons"; |
|
1088 |
AddIffs[list_all2_Cons]; |
|
1089 |
||
1090 |
Goalw [list_all2_def] |
|
8118 | 1091 |
"list_all2 P (x#xs) ys = (? z zs. ys = z#zs & P x z & list_all2 P xs zs)"; |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1092 |
by (case_tac "ys" 1); |
8254 | 1093 |
by (Auto_tac); |
8118 | 1094 |
qed "list_all2_Cons1"; |
1095 |
||
1096 |
Goalw [list_all2_def] |
|
1097 |
"list_all2 P xs (y#ys) = (? z zs. xs = z#zs & P z y & list_all2 P zs ys)"; |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1098 |
by (case_tac "xs" 1); |
8254 | 1099 |
by (Auto_tac); |
8118 | 1100 |
qed "list_all2_Cons2"; |
1101 |
||
1102 |
Goalw [list_all2_def] |
|
1103 |
"list_all2 P (xs@ys) zs = \ |
|
1104 |
\ (EX us vs. zs = us@vs & length us = length xs & length vs = length ys & \ |
|
1105 |
\ list_all2 P xs us & list_all2 P ys vs)"; |
|
8254 | 1106 |
by (simp_tac (simpset() addsimps [zip_append1]) 1); |
1107 |
by (rtac iffI 1); |
|
1108 |
by (res_inst_tac [("x","take (length xs) zs")] exI 1); |
|
1109 |
by (res_inst_tac [("x","drop (length xs) zs")] exI 1); |
|
1110 |
by (asm_full_simp_tac (simpset() addsimps [min_def,eq_sym_conv]) 1); |
|
8118 | 1111 |
by (Clarify_tac 1); |
8254 | 1112 |
by (asm_full_simp_tac (simpset() addsimps [ball_Un]) 1); |
8118 | 1113 |
qed "list_all2_append1"; |
1114 |
||
1115 |
Goalw [list_all2_def] |
|
1116 |
"list_all2 P xs (ys@zs) = \ |
|
1117 |
\ (EX us vs. xs = us@vs & length us = length ys & length vs = length zs & \ |
|
1118 |
\ list_all2 P us ys & list_all2 P vs zs)"; |
|
8254 | 1119 |
by (simp_tac (simpset() addsimps [zip_append2]) 1); |
1120 |
by (rtac iffI 1); |
|
1121 |
by (res_inst_tac [("x","take (length ys) xs")] exI 1); |
|
1122 |
by (res_inst_tac [("x","drop (length ys) xs")] exI 1); |
|
1123 |
by (asm_full_simp_tac (simpset() addsimps [min_def,eq_sym_conv]) 1); |
|
8118 | 1124 |
by (Clarify_tac 1); |
8254 | 1125 |
by (asm_full_simp_tac (simpset() addsimps [ball_Un]) 1); |
8118 | 1126 |
qed "list_all2_append2"; |
1127 |
||
1128 |
Goalw [list_all2_def] |
|
8115 | 1129 |
"list_all2 P xs ys = \ |
1130 |
\ (length xs = length ys & (!i<length xs. P (xs!i) (ys!i)))"; |
|
8254 | 1131 |
by (force_tac (claset(), simpset() addsimps [set_zip]) 1); |
8115 | 1132 |
qed "list_all2_conv_all_nth"; |
5272 | 1133 |
|
1134 |
(** foldl **) |
|
1135 |
section "foldl"; |
|
1136 |
||
1137 |
Goal "!a. foldl f a (xs @ ys) = foldl f (foldl f a xs) ys"; |
|
5318 | 1138 |
by (induct_tac "xs" 1); |
5316 | 1139 |
by Auto_tac; |
5272 | 1140 |
qed_spec_mp "foldl_append"; |
1141 |
Addsimps [foldl_append]; |
|
1142 |
||
1143 |
(* Note: `n <= foldl op+ n ns' looks simpler, but is more difficult to use |
|
1144 |
because it requires an additional transitivity step |
|
1145 |
*) |
|
1146 |
Goal "!n::nat. m <= n --> m <= foldl op+ n ns"; |
|
5318 | 1147 |
by (induct_tac "ns" 1); |
6058 | 1148 |
by Auto_tac; |
5272 | 1149 |
qed_spec_mp "start_le_sum"; |
1150 |
||
8935
548901d05a0e
added type constraint ::nat because 0 is now overloaded
paulson
parents:
8741
diff
changeset
|
1151 |
Goal "!!n::nat. n : set ns ==> n <= foldl op+ 0 ns"; |
5758
27a2b36efd95
corrected auto_tac (applications of unsafe wrappers)
oheimb
parents:
5644
diff
changeset
|
1152 |
by (force_tac (claset() addIs [start_le_sum], |
27a2b36efd95
corrected auto_tac (applications of unsafe wrappers)
oheimb
parents:
5644
diff
changeset
|
1153 |
simpset() addsimps [in_set_conv_decomp]) 1); |
5272 | 1154 |
qed "elem_le_sum"; |
1155 |
||
8935
548901d05a0e
added type constraint ::nat because 0 is now overloaded
paulson
parents:
8741
diff
changeset
|
1156 |
Goal "!m::nat. (foldl op+ m ns = 0) = (m=0 & (!n : set ns. n=0))"; |
5318 | 1157 |
by (induct_tac "ns" 1); |
5316 | 1158 |
by Auto_tac; |
5272 | 1159 |
qed_spec_mp "sum_eq_0_conv"; |
1160 |
AddIffs [sum_eq_0_conv]; |
|
1161 |
||
5425 | 1162 |
(** upto **) |
1163 |
||
5427 | 1164 |
(* Does not terminate! *) |
1165 |
Goal "[i..j(] = (if i<j then i#[Suc i..j(] else [])"; |
|
6162 | 1166 |
by (induct_tac "j" 1); |
5427 | 1167 |
by Auto_tac; |
1168 |
qed "upt_rec"; |
|
5425 | 1169 |
|
5427 | 1170 |
Goal "j<=i ==> [i..j(] = []"; |
6162 | 1171 |
by (stac upt_rec 1); |
1172 |
by (Asm_simp_tac 1); |
|
5427 | 1173 |
qed "upt_conv_Nil"; |
1174 |
Addsimps [upt_conv_Nil]; |
|
1175 |
||
8982
4cb682fc083d
renamed upt_Suc, since that name is needed for its primrec rule
paulson
parents:
8935
diff
changeset
|
1176 |
(*Only needed if upt_Suc is deleted from the simpset*) |
5427 | 1177 |
Goal "i<=j ==> [i..(Suc j)(] = [i..j(]@[j]"; |
1178 |
by (Asm_simp_tac 1); |
|
8982
4cb682fc083d
renamed upt_Suc, since that name is needed for its primrec rule
paulson
parents:
8935
diff
changeset
|
1179 |
qed "upt_Suc_append"; |
5427 | 1180 |
|
1181 |
Goal "i<j ==> [i..j(] = i#[Suc i..j(]"; |
|
6162 | 1182 |
by (rtac trans 1); |
1183 |
by (stac upt_rec 1); |
|
1184 |
by (rtac refl 2); |
|
5427 | 1185 |
by (Asm_simp_tac 1); |
1186 |
qed "upt_conv_Cons"; |
|
1187 |
||
9003 | 1188 |
(*LOOPS as a simprule, since j<=j*) |
1189 |
Goal "i<=j ==> [i..j+k(] = [i..j(]@[j..j+k(]"; |
|
1190 |
by (induct_tac "k" 1); |
|
1191 |
by Auto_tac; |
|
1192 |
qed "upt_add_eq_append"; |
|
1193 |
||
5427 | 1194 |
Goal "length [i..j(] = j-i"; |
6162 | 1195 |
by (induct_tac "j" 1); |
5427 | 1196 |
by (Simp_tac 1); |
6162 | 1197 |
by (asm_simp_tac (simpset() addsimps [Suc_diff_le]) 1); |
5427 | 1198 |
qed "length_upt"; |
1199 |
Addsimps [length_upt]; |
|
5425 | 1200 |
|
5427 | 1201 |
Goal "i+k < j --> [i..j(] ! k = i+k"; |
6162 | 1202 |
by (induct_tac "j" 1); |
9014 | 1203 |
by (asm_simp_tac (simpset() addsimps [less_Suc_eq, nth_append] |
1204 |
addsplits [nat_diff_split]) 2); |
|
1205 |
by (Simp_tac 1); |
|
5427 | 1206 |
qed_spec_mp "nth_upt"; |
1207 |
Addsimps [nth_upt]; |
|
5425 | 1208 |
|
6433 | 1209 |
Goal "!i. i+m <= n --> take m [i..n(] = [i..i+m(]"; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1210 |
by (induct_tac "m" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1211 |
by (Simp_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1212 |
by (Clarify_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1213 |
by (stac upt_rec 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1214 |
by (rtac sym 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1215 |
by (stac upt_rec 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1216 |
by (asm_simp_tac (simpset() delsimps (thms"upt.simps")) 1); |
6433 | 1217 |
qed_spec_mp "take_upt"; |
1218 |
Addsimps [take_upt]; |
|
1219 |
||
9003 | 1220 |
Goal "map Suc [m..n(] = [Suc m..n]"; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1221 |
by (induct_tac "n" 1); |
9003 | 1222 |
by Auto_tac; |
1223 |
qed "map_Suc_upt"; |
|
1224 |
||
1225 |
Goal "ALL i. i < n-m --> (map f [m..n(]) ! i = f(m+i)"; |
|
1226 |
by (res_inst_tac [("m","n"),("n","m")] diff_induct 1); |
|
1227 |
by (stac (map_Suc_upt RS sym) 3); |
|
1228 |
by (auto_tac (claset(), simpset() addsimps [less_diff_conv, nth_upt])); |
|
6433 | 1229 |
qed_spec_mp "nth_map_upt"; |
1230 |
||
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1231 |
Goal "ALL xs ys. k <= length xs --> k <= length ys --> \ |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1232 |
\ (ALL i. i < k --> xs!i = ys!i) \ |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1233 |
\ --> take k xs = take k ys"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1234 |
by (induct_tac "k" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1235 |
by (ALLGOALS (asm_simp_tac (simpset() addsimps [less_Suc_eq_0_disj, |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1236 |
all_conj_distrib]))); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1237 |
by (Clarify_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1238 |
(*Both lists must be non-empty*) |
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1239 |
by (case_tac "xs" 1); |
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1240 |
by (case_tac "ys" 2); |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1241 |
by (ALLGOALS Clarify_tac); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1242 |
(*prenexing's needed, not miniscoping*) |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1243 |
by (ALLGOALS (full_simp_tac (simpset() addsimps (all_simps RL [sym]) |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1244 |
delsimps (all_simps)))); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1245 |
by (Blast_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1246 |
qed_spec_mp "nth_take_lemma"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1247 |
|
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1248 |
Goal "[| length xs = length ys; \ |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1249 |
\ ALL i. i < length xs --> xs!i = ys!i |] \ |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1250 |
\ ==> xs = ys"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1251 |
by (forward_tac [[le_refl, eq_imp_le] MRS nth_take_lemma] 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1252 |
by (ALLGOALS (asm_full_simp_tac (simpset() addsimps [take_all]))); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1253 |
qed_spec_mp "nth_equalityI"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1254 |
|
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1255 |
(*The famous take-lemma*) |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1256 |
Goal "(ALL i. take i xs = take i ys) ==> xs = ys"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1257 |
by (dres_inst_tac [("x", "max (length xs) (length ys)")] spec 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1258 |
by (full_simp_tac (simpset() addsimps [le_max_iff_disj, take_all]) 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1259 |
qed_spec_mp "take_equalityI"; |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1260 |
|
5272 | 1261 |
|
4605 | 1262 |
(** nodups & remdups **) |
1263 |
section "nodups & remdups"; |
|
1264 |
||
4935 | 1265 |
Goal "set(remdups xs) = set xs"; |
4605 | 1266 |
by (induct_tac "xs" 1); |
1267 |
by (Simp_tac 1); |
|
4686 | 1268 |
by (asm_full_simp_tac (simpset() addsimps [insert_absorb]) 1); |
4605 | 1269 |
qed "set_remdups"; |
1270 |
Addsimps [set_remdups]; |
|
1271 |
||
4935 | 1272 |
Goal "nodups(remdups xs)"; |
4605 | 1273 |
by (induct_tac "xs" 1); |
5316 | 1274 |
by Auto_tac; |
4605 | 1275 |
qed "nodups_remdups"; |
1276 |
||
4935 | 1277 |
Goal "nodups xs --> nodups (filter P xs)"; |
4605 | 1278 |
by (induct_tac "xs" 1); |
5316 | 1279 |
by Auto_tac; |
4605 | 1280 |
qed_spec_mp "nodups_filter"; |
1281 |
||
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
1282 |
(** replicate **) |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
1283 |
section "replicate"; |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
1284 |
|
6794 | 1285 |
Goal "length(replicate n x) = n"; |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1286 |
by (induct_tac "n" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1287 |
by Auto_tac; |
6794 | 1288 |
qed "length_replicate"; |
1289 |
Addsimps [length_replicate]; |
|
1290 |
||
1291 |
Goal "map f (replicate n x) = replicate n (f x)"; |
|
1292 |
by (induct_tac "n" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1293 |
by Auto_tac; |
6794 | 1294 |
qed "map_replicate"; |
1295 |
Addsimps [map_replicate]; |
|
1296 |
||
1297 |
Goal "(replicate n x) @ (x#xs) = x # replicate n x @ xs"; |
|
1298 |
by (induct_tac "n" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1299 |
by Auto_tac; |
6794 | 1300 |
qed "replicate_app_Cons_same"; |
1301 |
||
1302 |
Goal "rev(replicate n x) = replicate n x"; |
|
1303 |
by (induct_tac "n" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1304 |
by (Simp_tac 1); |
6794 | 1305 |
by (asm_simp_tac (simpset() addsimps [replicate_app_Cons_same]) 1); |
1306 |
qed "rev_replicate"; |
|
1307 |
Addsimps [rev_replicate]; |
|
1308 |
||
8009 | 1309 |
Goal "replicate (n+m) x = replicate n x @ replicate m x"; |
1310 |
by (induct_tac "n" 1); |
|
1311 |
by Auto_tac; |
|
1312 |
qed "replicate_add"; |
|
1313 |
||
6794 | 1314 |
Goal"n ~= 0 --> hd(replicate n x) = x"; |
1315 |
by (induct_tac "n" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1316 |
by Auto_tac; |
6794 | 1317 |
qed_spec_mp "hd_replicate"; |
1318 |
Addsimps [hd_replicate]; |
|
1319 |
||
1320 |
Goal "n ~= 0 --> tl(replicate n x) = replicate (n-1) x"; |
|
1321 |
by (induct_tac "n" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1322 |
by Auto_tac; |
6794 | 1323 |
qed_spec_mp "tl_replicate"; |
1324 |
Addsimps [tl_replicate]; |
|
1325 |
||
1326 |
Goal "n ~= 0 --> last(replicate n x) = x"; |
|
1327 |
by (induct_tac "n" 1); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1328 |
by Auto_tac; |
6794 | 1329 |
qed_spec_mp "last_replicate"; |
1330 |
Addsimps [last_replicate]; |
|
1331 |
||
1332 |
Goal "!i. i<n --> (replicate n x)!i = x"; |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1333 |
by (induct_tac "n" 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1334 |
by (Simp_tac 1); |
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1335 |
by (asm_simp_tac (simpset() addsimps [nth_Cons] addsplits [nat.split]) 1); |
6794 | 1336 |
qed_spec_mp "nth_replicate"; |
1337 |
Addsimps [nth_replicate]; |
|
1338 |
||
4935 | 1339 |
Goal "set(replicate (Suc n) x) = {x}"; |
4423 | 1340 |
by (induct_tac "n" 1); |
5316 | 1341 |
by Auto_tac; |
3589
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
1342 |
val lemma = result(); |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
1343 |
|
5043 | 1344 |
Goal "n ~= 0 ==> set(replicate n x) = {x}"; |
4423 | 1345 |
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
|
1346 |
qed "set_replicate"; |
244daa75f890
Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents:
3586
diff
changeset
|
1347 |
Addsimps [set_replicate]; |
5162 | 1348 |
|
8009 | 1349 |
Goal "set(replicate n x) = (if n=0 then {} else {x})"; |
8064 | 1350 |
by (Auto_tac); |
8009 | 1351 |
qed "set_replicate_conv_if"; |
1352 |
||
1353 |
Goal "x : set(replicate n y) --> x=y"; |
|
8064 | 1354 |
by (asm_simp_tac (simpset() addsimps [set_replicate_conv_if]) 1); |
8009 | 1355 |
qed_spec_mp "in_set_replicateD"; |
1356 |
||
5162 | 1357 |
|
5281 | 1358 |
(*** Lexcicographic orderings on lists ***) |
1359 |
section"Lexcicographic orderings on lists"; |
|
1360 |
||
1361 |
Goal "wf r ==> wf(lexn r n)"; |
|
5318 | 1362 |
by (induct_tac "n" 1); |
1363 |
by (Simp_tac 1); |
|
1364 |
by (Simp_tac 1); |
|
1365 |
by (rtac wf_subset 1); |
|
1366 |
by (rtac Int_lower1 2); |
|
1367 |
by (rtac wf_prod_fun_image 1); |
|
1368 |
by (rtac injI 2); |
|
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1369 |
by Auto_tac; |
5281 | 1370 |
qed "wf_lexn"; |
1371 |
||
1372 |
Goal "!xs ys. (xs,ys) : lexn r n --> length xs = n & length ys = n"; |
|
5318 | 1373 |
by (induct_tac "n" 1); |
6813
bf90f86502b2
many new lemmas about take & drop, incl the famous take-lemma
paulson
parents:
6794
diff
changeset
|
1374 |
by Auto_tac; |
5281 | 1375 |
qed_spec_mp "lexn_length"; |
1376 |
||
1377 |
Goalw [lex_def] "wf r ==> wf(lex r)"; |
|
5318 | 1378 |
by (rtac wf_UN 1); |
1379 |
by (blast_tac (claset() addIs [wf_lexn]) 1); |
|
1380 |
by (Clarify_tac 1); |
|
1381 |
by (rename_tac "m n" 1); |
|
1382 |
by (subgoal_tac "m ~= n" 1); |
|
1383 |
by (Blast_tac 2); |
|
1384 |
by (blast_tac (claset() addDs [lexn_length,not_sym]) 1); |
|
5281 | 1385 |
qed "wf_lex"; |
1386 |
AddSIs [wf_lex]; |
|
1387 |
||
1388 |
Goal |
|
1389 |
"lexn r n = \ |
|
1390 |
\ {(xs,ys). length xs = n & length ys = n & \ |
|
1391 |
\ (? xys x y xs' ys'. xs= xys @ x#xs' & ys= xys @ y#ys' & (x,y):r)}"; |
|
5318 | 1392 |
by (induct_tac "n" 1); |
1393 |
by (Simp_tac 1); |
|
1394 |
by (Blast_tac 1); |
|
5641 | 1395 |
by (asm_full_simp_tac (simpset() |
5296 | 1396 |
addsimps [lex_prod_def]) 1); |
5641 | 1397 |
by (auto_tac (claset(), simpset())); |
5318 | 1398 |
by (Blast_tac 1); |
1399 |
by (rename_tac "a xys x xs' y ys'" 1); |
|
1400 |
by (res_inst_tac [("x","a#xys")] exI 1); |
|
1401 |
by (Simp_tac 1); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1402 |
by (case_tac "xys" 1); |
5641 | 1403 |
by (ALLGOALS (asm_full_simp_tac (simpset()))); |
5318 | 1404 |
by (Blast_tac 1); |
5281 | 1405 |
qed "lexn_conv"; |
1406 |
||
1407 |
Goalw [lex_def] |
|
1408 |
"lex r = \ |
|
1409 |
\ {(xs,ys). length xs = length ys & \ |
|
1410 |
\ (? xys x y xs' ys'. xs= xys @ x#xs' & ys= xys @ y#ys' & (x,y):r)}"; |
|
5641 | 1411 |
by (force_tac (claset(), simpset() addsimps [lexn_conv]) 1); |
5281 | 1412 |
qed "lex_conv"; |
1413 |
||
1414 |
Goalw [lexico_def] "wf r ==> wf(lexico r)"; |
|
5318 | 1415 |
by (Blast_tac 1); |
5281 | 1416 |
qed "wf_lexico"; |
1417 |
AddSIs [wf_lexico]; |
|
1418 |
||
1419 |
Goalw |
|
1420 |
[lexico_def,diag_def,lex_prod_def,measure_def,inv_image_def] |
|
1421 |
"lexico r = {(xs,ys). length xs < length ys | \ |
|
1422 |
\ length xs = length ys & (xs,ys) : lex r}"; |
|
5318 | 1423 |
by (Simp_tac 1); |
5281 | 1424 |
qed "lexico_conv"; |
1425 |
||
5283 | 1426 |
Goal "([],ys) ~: lex r"; |
5318 | 1427 |
by (simp_tac (simpset() addsimps [lex_conv]) 1); |
5283 | 1428 |
qed "Nil_notin_lex"; |
1429 |
||
1430 |
Goal "(xs,[]) ~: lex r"; |
|
5318 | 1431 |
by (simp_tac (simpset() addsimps [lex_conv]) 1); |
5283 | 1432 |
qed "Nil2_notin_lex"; |
1433 |
||
1434 |
AddIffs [Nil_notin_lex,Nil2_notin_lex]; |
|
1435 |
||
1436 |
Goal "((x#xs,y#ys) : lex r) = \ |
|
1437 |
\ ((x,y) : r & length xs = length ys | x=y & (xs,ys) : lex r)"; |
|
5318 | 1438 |
by (simp_tac (simpset() addsimps [lex_conv]) 1); |
1439 |
by (rtac iffI 1); |
|
1440 |
by (blast_tac (claset() addIs [Cons_eq_appendI]) 2); |
|
1441 |
by (REPEAT(eresolve_tac [conjE, exE] 1)); |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1442 |
by (case_tac "xys" 1); |
5318 | 1443 |
by (Asm_full_simp_tac 1); |
1444 |
by (Asm_full_simp_tac 1); |
|
1445 |
by (Blast_tac 1); |
|
5283 | 1446 |
qed "Cons_in_lex"; |
1447 |
AddIffs [Cons_in_lex]; |
|
7032 | 1448 |
|
1449 |
||
1450 |
(*** Versions of some theorems above using binary numerals ***) |
|
1451 |
||
1452 |
AddIffs (map (rename_numerals thy) |
|
1453 |
[length_0_conv, zero_length_conv, length_greater_0_conv, |
|
1454 |
sum_eq_0_conv]); |
|
1455 |
||
1456 |
Goal "take n (x#xs) = (if n = #0 then [] else x # take (n-#1) xs)"; |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1457 |
by (case_tac "n" 1); |
7032 | 1458 |
by (ALLGOALS |
1459 |
(asm_simp_tac (simpset() addsimps [numeral_0_eq_0, numeral_1_eq_1]))); |
|
1460 |
qed "take_Cons'"; |
|
1461 |
||
1462 |
Goal "drop n (x#xs) = (if n = #0 then x#xs else drop (n-#1) xs)"; |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1463 |
by (case_tac "n" 1); |
7032 | 1464 |
by (ALLGOALS |
1465 |
(asm_simp_tac (simpset() addsimps [numeral_0_eq_0, numeral_1_eq_1]))); |
|
1466 |
qed "drop_Cons'"; |
|
1467 |
||
1468 |
Goal "(x#xs)!n = (if n = #0 then x else xs!(n-#1))"; |
|
8442
96023903c2df
case_tac now subsumes both boolean and datatype cases;
wenzelm
parents:
8423
diff
changeset
|
1469 |
by (case_tac "n" 1); |
7032 | 1470 |
by (ALLGOALS |
1471 |
(asm_simp_tac (simpset() addsimps [numeral_0_eq_0, numeral_1_eq_1]))); |
|
1472 |
qed "nth_Cons'"; |
|
1473 |
||
1474 |
Addsimps (map (inst "n" "number_of ?v") [take_Cons', drop_Cons', nth_Cons']); |
|
1475 |