author | nipkow |
Mon, 11 Apr 2005 12:14:23 +0200 | |
changeset 15693 | 3a67e61c6e96 |
parent 15691 | 900cf45ff0a6 |
child 15695 | f072119afa4e |
permissions | -rw-r--r-- |
3981 | 1 |
(* Title: HOL/Map.thy |
2 |
ID: $Id$ |
|
3 |
Author: Tobias Nipkow, based on a theory by David von Oheimb |
|
13908 | 4 |
Copyright 1997-2003 TU Muenchen |
3981 | 5 |
|
6 |
The datatype of `maps' (written ~=>); strongly resembles maps in VDM. |
|
7 |
*) |
|
8 |
||
13914 | 9 |
header {* Maps *} |
10 |
||
15131 | 11 |
theory Map |
15140 | 12 |
imports List |
15131 | 13 |
begin |
3981 | 14 |
|
13908 | 15 |
types ('a,'b) "~=>" = "'a => 'b option" (infixr 0) |
14100 | 16 |
translations (type) "a ~=> b " <= (type) "a => b option" |
3981 | 17 |
|
18 |
consts |
|
5300 | 19 |
chg_map :: "('b => 'b) => 'a => ('a ~=> 'b) => ('a ~=> 'b)" |
14100 | 20 |
map_add :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" (infixl "++" 100) |
15693 | 21 |
restrict_map :: "('a ~=> 'b) => 'a set => ('a ~=> 'b)" (infixl "|`" 110) |
5300 | 22 |
dom :: "('a ~=> 'b) => 'a set" |
23 |
ran :: "('a ~=> 'b) => 'b set" |
|
24 |
map_of :: "('a * 'b)list => 'a ~=> 'b" |
|
25 |
map_upds:: "('a ~=> 'b) => 'a list => 'b list => |
|
14180 | 26 |
('a ~=> 'b)" |
14100 | 27 |
map_upd_s::"('a ~=> 'b) => 'a set => 'b => |
28 |
('a ~=> 'b)" ("_/'(_{|->}_/')" [900,0,0]900) |
|
29 |
map_subst::"('a ~=> 'b) => 'b => 'b => |
|
30 |
('a ~=> 'b)" ("_/'(_~>_/')" [900,0,0]900) |
|
13910 | 31 |
map_le :: "('a ~=> 'b) => ('a ~=> 'b) => bool" (infix "\<subseteq>\<^sub>m" 50) |
32 |
||
14739 | 33 |
syntax |
34 |
fun_map_comp :: "('b => 'c) => ('a ~=> 'b) => ('a ~=> 'c)" (infixl "o'_m" 55) |
|
35 |
translations |
|
36 |
"f o_m m" == "option_map f o m" |
|
37 |
||
14180 | 38 |
nonterminals |
39 |
maplets maplet |
|
40 |
||
5300 | 41 |
syntax |
14180 | 42 |
empty :: "'a ~=> 'b" |
43 |
"_maplet" :: "['a, 'a] => maplet" ("_ /|->/ _") |
|
44 |
"_maplets" :: "['a, 'a] => maplet" ("_ /[|->]/ _") |
|
45 |
"" :: "maplet => maplets" ("_") |
|
46 |
"_Maplets" :: "[maplet, maplets] => maplets" ("_,/ _") |
|
47 |
"_MapUpd" :: "['a ~=> 'b, maplets] => 'a ~=> 'b" ("_/'(_')" [900,0]900) |
|
48 |
"_Map" :: "maplets => 'a ~=> 'b" ("(1[_])") |
|
3981 | 49 |
|
12114
a8e860c86252
eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents:
10137
diff
changeset
|
50 |
syntax (xsymbols) |
14739 | 51 |
"~=>" :: "[type, type] => type" (infixr "\<rightharpoonup>" 0) |
52 |
||
53 |
fun_map_comp :: "('b => 'c) => ('a ~=> 'b) => ('a ~=> 'c)" (infixl "\<circ>\<^sub>m" 55) |
|
54 |
||
14180 | 55 |
"_maplet" :: "['a, 'a] => maplet" ("_ /\<mapsto>/ _") |
56 |
"_maplets" :: "['a, 'a] => maplet" ("_ /[\<mapsto>]/ _") |
|
57 |
||
14100 | 58 |
map_upd_s :: "('a ~=> 'b) => 'a set => 'b => ('a ~=> 'b)" |
59 |
("_/'(_/{\<mapsto>}/_')" [900,0,0]900) |
|
60 |
map_subst :: "('a ~=> 'b) => 'b => 'b => |
|
61 |
('a ~=> 'b)" ("_/'(_\<leadsto>_/')" [900,0,0]900) |
|
62 |
"@chg_map" :: "('a ~=> 'b) => 'a => ('b => 'b) => ('a ~=> 'b)" |
|
63 |
("_/'(_/\<mapsto>\<lambda>_. _')" [900,0,0,0] 900) |
|
5300 | 64 |
|
15693 | 65 |
syntax (latex output) |
66 |
restrict_map :: "('a ~=> 'b) => 'a set => ('a ~=> 'b)" ("_\<restriction>\<^bsub>_\<^esub>" [111,110] 110) --"requires amssymb!" |
|
67 |
||
5300 | 68 |
translations |
13890 | 69 |
"empty" => "_K None" |
70 |
"empty" <= "%x. None" |
|
5300 | 71 |
|
14100 | 72 |
"m(x\<mapsto>\<lambda>y. f)" == "chg_map (\<lambda>y. f) x m" |
3981 | 73 |
|
14180 | 74 |
"_MapUpd m (_Maplets xy ms)" == "_MapUpd (_MapUpd m xy) ms" |
75 |
"_MapUpd m (_maplet x y)" == "m(x:=Some y)" |
|
76 |
"_MapUpd m (_maplets x y)" == "map_upds m x y" |
|
77 |
"_Map ms" == "_MapUpd empty ms" |
|
78 |
"_Map (_Maplets ms1 ms2)" <= "_MapUpd (_Map ms1) ms2" |
|
79 |
"_Maplets ms1 (_Maplets ms2 ms3)" <= "_Maplets (_Maplets ms1 ms2) ms3" |
|
80 |
||
3981 | 81 |
defs |
13908 | 82 |
chg_map_def: "chg_map f a m == case m a of None => m | Some b => m(a|->f b)" |
3981 | 83 |
|
14100 | 84 |
map_add_def: "m1++m2 == %x. case m2 x of None => m1 x | Some y => Some y" |
15693 | 85 |
restrict_map_def: "m|`A == %x. if x : A then m x else None" |
14025 | 86 |
|
87 |
map_upds_def: "m(xs [|->] ys) == m ++ map_of (rev(zip xs ys))" |
|
14100 | 88 |
map_upd_s_def: "m(as{|->}b) == %x. if x : as then Some b else m x" |
89 |
map_subst_def: "m(a~>b) == %x. if m x = Some a then Some b else m x" |
|
3981 | 90 |
|
13908 | 91 |
dom_def: "dom(m) == {a. m a ~= None}" |
14025 | 92 |
ran_def: "ran(m) == {b. EX a. m a = Some b}" |
3981 | 93 |
|
14376 | 94 |
map_le_def: "m\<^isub>1 \<subseteq>\<^sub>m m\<^isub>2 == ALL a : dom m\<^isub>1. m\<^isub>1 a = m\<^isub>2 a" |
13910 | 95 |
|
5183 | 96 |
primrec |
97 |
"map_of [] = empty" |
|
5300 | 98 |
"map_of (p#ps) = (map_of ps)(fst p |-> snd p)" |
99 |
||
13908 | 100 |
|
14100 | 101 |
subsection {* @{term empty} *} |
13908 | 102 |
|
13910 | 103 |
lemma empty_upd_none[simp]: "empty(x := None) = empty" |
13908 | 104 |
apply (rule ext) |
105 |
apply (simp (no_asm)) |
|
106 |
done |
|
13910 | 107 |
|
13908 | 108 |
|
109 |
(* FIXME: what is this sum_case nonsense?? *) |
|
13910 | 110 |
lemma sum_case_empty_empty[simp]: "sum_case empty empty = empty" |
13908 | 111 |
apply (rule ext) |
112 |
apply (simp (no_asm) split add: sum.split) |
|
113 |
done |
|
114 |
||
14100 | 115 |
subsection {* @{term map_upd} *} |
13908 | 116 |
|
117 |
lemma map_upd_triv: "t k = Some x ==> t(k|->x) = t" |
|
118 |
apply (rule ext) |
|
119 |
apply (simp (no_asm_simp)) |
|
120 |
done |
|
121 |
||
13910 | 122 |
lemma map_upd_nonempty[simp]: "t(k|->x) ~= empty" |
13908 | 123 |
apply safe |
14208 | 124 |
apply (drule_tac x = k in fun_cong) |
13908 | 125 |
apply (simp (no_asm_use)) |
126 |
done |
|
127 |
||
14100 | 128 |
lemma map_upd_eqD1: "m(a\<mapsto>x) = n(a\<mapsto>y) \<Longrightarrow> x = y" |
129 |
by (drule fun_cong [of _ _ a], auto) |
|
130 |
||
131 |
lemma map_upd_Some_unfold: |
|
132 |
"((m(a|->b)) x = Some y) = (x = a \<and> b = y \<or> x \<noteq> a \<and> m x = Some y)" |
|
133 |
by auto |
|
134 |
||
15303 | 135 |
lemma image_map_upd[simp]: "x \<notin> A \<Longrightarrow> m(x \<mapsto> y) ` A = m ` A" |
136 |
by fastsimp |
|
137 |
||
13908 | 138 |
lemma finite_range_updI: "finite (range f) ==> finite (range (f(a|->b)))" |
139 |
apply (unfold image_def) |
|
140 |
apply (simp (no_asm_use) add: full_SetCompr_eq) |
|
141 |
apply (rule finite_subset) |
|
14208 | 142 |
prefer 2 apply assumption |
13908 | 143 |
apply auto |
144 |
done |
|
145 |
||
146 |
||
147 |
(* FIXME: what is this sum_case nonsense?? *) |
|
14100 | 148 |
subsection {* @{term sum_case} and @{term empty}/@{term map_upd} *} |
13908 | 149 |
|
13910 | 150 |
lemma sum_case_map_upd_empty[simp]: |
151 |
"sum_case (m(k|->y)) empty = (sum_case m empty)(Inl k|->y)" |
|
13908 | 152 |
apply (rule ext) |
153 |
apply (simp (no_asm) split add: sum.split) |
|
154 |
done |
|
155 |
||
13910 | 156 |
lemma sum_case_empty_map_upd[simp]: |
157 |
"sum_case empty (m(k|->y)) = (sum_case empty m)(Inr k|->y)" |
|
13908 | 158 |
apply (rule ext) |
159 |
apply (simp (no_asm) split add: sum.split) |
|
160 |
done |
|
161 |
||
13910 | 162 |
lemma sum_case_map_upd_map_upd[simp]: |
163 |
"sum_case (m1(k1|->y1)) (m2(k2|->y2)) = (sum_case (m1(k1|->y1)) m2)(Inr k2|->y2)" |
|
13908 | 164 |
apply (rule ext) |
165 |
apply (simp (no_asm) split add: sum.split) |
|
166 |
done |
|
167 |
||
168 |
||
14100 | 169 |
subsection {* @{term chg_map} *} |
13908 | 170 |
|
13910 | 171 |
lemma chg_map_new[simp]: "m a = None ==> chg_map f a m = m" |
14208 | 172 |
by (unfold chg_map_def, auto) |
13908 | 173 |
|
13910 | 174 |
lemma chg_map_upd[simp]: "m a = Some b ==> chg_map f a m = m(a|->f b)" |
14208 | 175 |
by (unfold chg_map_def, auto) |
13908 | 176 |
|
14537 | 177 |
lemma chg_map_other [simp]: "a \<noteq> b \<Longrightarrow> chg_map f a m b = m b" |
178 |
by (auto simp: chg_map_def split add: option.split) |
|
179 |
||
13908 | 180 |
|
14100 | 181 |
subsection {* @{term map_of} *} |
13908 | 182 |
|
15304 | 183 |
lemma map_of_eq_None_iff: |
184 |
"(map_of xys x = None) = (x \<notin> fst ` (set xys))" |
|
185 |
by (induct xys) simp_all |
|
186 |
||
187 |
lemma map_of_is_SomeD: |
|
188 |
"map_of xys x = Some y \<Longrightarrow> (x,y) \<in> set xys" |
|
189 |
apply(induct xys) |
|
190 |
apply simp |
|
191 |
apply(clarsimp split:if_splits) |
|
192 |
done |
|
193 |
||
194 |
lemma map_of_eq_Some_iff[simp]: |
|
195 |
"distinct(map fst xys) \<Longrightarrow> (map_of xys x = Some y) = ((x,y) \<in> set xys)" |
|
196 |
apply(induct xys) |
|
197 |
apply(simp) |
|
198 |
apply(auto simp:map_of_eq_None_iff[symmetric]) |
|
199 |
done |
|
200 |
||
201 |
lemma Some_eq_map_of_iff[simp]: |
|
202 |
"distinct(map fst xys) \<Longrightarrow> (Some y = map_of xys x) = ((x,y) \<in> set xys)" |
|
203 |
by(auto simp del:map_of_eq_Some_iff simp add:map_of_eq_Some_iff[symmetric]) |
|
204 |
||
205 |
lemma [simp]: "\<lbrakk> distinct(map fst xys); (x,y) \<in> set xys \<rbrakk> |
|
206 |
\<Longrightarrow> map_of xys x = Some y" |
|
207 |
apply (induct xys) |
|
208 |
apply simp |
|
209 |
apply force |
|
210 |
done |
|
211 |
||
15110
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
212 |
lemma map_of_zip_is_None[simp]: |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
213 |
"length xs = length ys \<Longrightarrow> (map_of (zip xs ys) x = None) = (x \<notin> set xs)" |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
214 |
by (induct rule:list_induct2, simp_all) |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
215 |
|
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
216 |
lemma finite_range_map_of: "finite (range (map_of xys))" |
15251 | 217 |
apply (induct xys) |
15110
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
218 |
apply (simp_all (no_asm) add: image_constant) |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
219 |
apply (rule finite_subset) |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
220 |
prefer 2 apply assumption |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
221 |
apply auto |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
222 |
done |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
223 |
|
15369 | 224 |
lemma map_of_SomeD [rule_format]: "map_of xs k = Some y --> (k,y):set xs" |
15251 | 225 |
by (induct "xs", auto) |
13908 | 226 |
|
15369 | 227 |
lemma map_of_mapk_SomeI [rule_format]: |
228 |
"inj f ==> map_of t k = Some x --> |
|
229 |
map_of (map (split (%k. Pair (f k))) t) (f k) = Some x" |
|
15251 | 230 |
apply (induct "t") |
13908 | 231 |
apply (auto simp add: inj_eq) |
232 |
done |
|
233 |
||
15369 | 234 |
lemma weak_map_of_SomeI [rule_format]: |
235 |
"(k, x) : set l --> (\<exists>x. map_of l k = Some x)" |
|
15251 | 236 |
by (induct "l", auto) |
13908 | 237 |
|
238 |
lemma map_of_filter_in: |
|
239 |
"[| map_of xs k = Some z; P k z |] ==> map_of (filter (split P) xs) k = Some z" |
|
240 |
apply (rule mp) |
|
14208 | 241 |
prefer 2 apply assumption |
13908 | 242 |
apply (erule thin_rl) |
15251 | 243 |
apply (induct "xs", auto) |
13908 | 244 |
done |
245 |
||
246 |
lemma map_of_map: "map_of (map (%(a,b). (a,f b)) xs) x = option_map f (map_of xs x)" |
|
15251 | 247 |
by (induct "xs", auto) |
13908 | 248 |
|
249 |
||
14100 | 250 |
subsection {* @{term option_map} related *} |
13908 | 251 |
|
13910 | 252 |
lemma option_map_o_empty[simp]: "option_map f o empty = empty" |
13908 | 253 |
apply (rule ext) |
254 |
apply (simp (no_asm)) |
|
255 |
done |
|
256 |
||
13910 | 257 |
lemma option_map_o_map_upd[simp]: |
258 |
"option_map f o m(a|->b) = (option_map f o m)(a|->f b)" |
|
13908 | 259 |
apply (rule ext) |
260 |
apply (simp (no_asm)) |
|
261 |
done |
|
262 |
||
263 |
||
14100 | 264 |
subsection {* @{text "++"} *} |
13908 | 265 |
|
14025 | 266 |
lemma map_add_empty[simp]: "m ++ empty = m" |
267 |
apply (unfold map_add_def) |
|
13908 | 268 |
apply (simp (no_asm)) |
269 |
done |
|
270 |
||
14025 | 271 |
lemma empty_map_add[simp]: "empty ++ m = m" |
272 |
apply (unfold map_add_def) |
|
13908 | 273 |
apply (rule ext) |
274 |
apply (simp split add: option.split) |
|
275 |
done |
|
276 |
||
14025 | 277 |
lemma map_add_assoc[simp]: "m1 ++ (m2 ++ m3) = (m1 ++ m2) ++ m3" |
278 |
apply(rule ext) |
|
279 |
apply(simp add: map_add_def split:option.split) |
|
280 |
done |
|
281 |
||
282 |
lemma map_add_Some_iff: |
|
13908 | 283 |
"((m ++ n) k = Some x) = (n k = Some x | n k = None & m k = Some x)" |
14025 | 284 |
apply (unfold map_add_def) |
13908 | 285 |
apply (simp (no_asm) split add: option.split) |
286 |
done |
|
287 |
||
14025 | 288 |
lemmas map_add_SomeD = map_add_Some_iff [THEN iffD1, standard] |
289 |
declare map_add_SomeD [dest!] |
|
13908 | 290 |
|
14025 | 291 |
lemma map_add_find_right[simp]: "!!xx. n k = Some xx ==> (m ++ n) k = Some xx" |
14208 | 292 |
by (subst map_add_Some_iff, fast) |
13908 | 293 |
|
14025 | 294 |
lemma map_add_None [iff]: "((m ++ n) k = None) = (n k = None & m k = None)" |
295 |
apply (unfold map_add_def) |
|
13908 | 296 |
apply (simp (no_asm) split add: option.split) |
297 |
done |
|
298 |
||
14025 | 299 |
lemma map_add_upd[simp]: "f ++ g(x|->y) = (f ++ g)(x|->y)" |
300 |
apply (unfold map_add_def) |
|
14208 | 301 |
apply (rule ext, auto) |
13908 | 302 |
done |
303 |
||
14186 | 304 |
lemma map_add_upds[simp]: "m1 ++ (m2(xs[\<mapsto>]ys)) = (m1++m2)(xs[\<mapsto>]ys)" |
305 |
by(simp add:map_upds_def) |
|
306 |
||
14025 | 307 |
lemma map_of_append[simp]: "map_of (xs@ys) = map_of ys ++ map_of xs" |
308 |
apply (unfold map_add_def) |
|
15251 | 309 |
apply (induct "xs") |
13908 | 310 |
apply (simp (no_asm)) |
311 |
apply (rule ext) |
|
312 |
apply (simp (no_asm_simp) split add: option.split) |
|
313 |
done |
|
314 |
||
315 |
declare fun_upd_apply [simp del] |
|
14025 | 316 |
lemma finite_range_map_of_map_add: |
317 |
"finite (range f) ==> finite (range (f ++ map_of l))" |
|
15251 | 318 |
apply (induct "l", auto) |
13908 | 319 |
apply (erule finite_range_updI) |
320 |
done |
|
321 |
declare fun_upd_apply [simp] |
|
322 |
||
15304 | 323 |
lemma inj_on_map_add_dom[iff]: |
324 |
"inj_on (m ++ m') (dom m') = inj_on m' (dom m')" |
|
325 |
by(fastsimp simp add:map_add_def dom_def inj_on_def split:option.splits) |
|
326 |
||
14100 | 327 |
subsection {* @{term restrict_map} *} |
328 |
||
15693 | 329 |
lemma restrict_map_to_empty[simp]: "m|`{} = empty" |
14186 | 330 |
by(simp add: restrict_map_def) |
331 |
||
15693 | 332 |
lemma restrict_map_empty[simp]: "empty|`D = empty" |
14186 | 333 |
by(simp add: restrict_map_def) |
334 |
||
15693 | 335 |
lemma restrict_in [simp]: "x \<in> A \<Longrightarrow> (m|`A) x = m x" |
14100 | 336 |
by (auto simp: restrict_map_def) |
337 |
||
15693 | 338 |
lemma restrict_out [simp]: "x \<notin> A \<Longrightarrow> (m|`A) x = None" |
14100 | 339 |
by (auto simp: restrict_map_def) |
340 |
||
15693 | 341 |
lemma ran_restrictD: "y \<in> ran (m|`A) \<Longrightarrow> \<exists>x\<in>A. m x = Some y" |
14100 | 342 |
by (auto simp: restrict_map_def ran_def split: split_if_asm) |
343 |
||
15693 | 344 |
lemma dom_restrict [simp]: "dom (m|`A) = dom m \<inter> A" |
14100 | 345 |
by (auto simp: restrict_map_def dom_def split: split_if_asm) |
346 |
||
15693 | 347 |
lemma restrict_upd_same [simp]: "m(x\<mapsto>y)|`(-{x}) = m|`(-{x})" |
14100 | 348 |
by (rule ext, auto simp: restrict_map_def) |
349 |
||
15693 | 350 |
lemma restrict_restrict [simp]: "m|`A|`B = m|`(A\<inter>B)" |
14100 | 351 |
by (rule ext, auto simp: restrict_map_def) |
352 |
||
14186 | 353 |
lemma restrict_fun_upd[simp]: |
15693 | 354 |
"m(x := y)|`D = (if x \<in> D then (m|`(D-{x}))(x := y) else m|`D)" |
14186 | 355 |
by(simp add: restrict_map_def expand_fun_eq) |
356 |
||
357 |
lemma fun_upd_None_restrict[simp]: |
|
15693 | 358 |
"(m|`D)(x := None) = (if x:D then m|`(D - {x}) else m|`D)" |
14186 | 359 |
by(simp add: restrict_map_def expand_fun_eq) |
360 |
||
361 |
lemma fun_upd_restrict: |
|
15693 | 362 |
"(m|`D)(x := y) = (m|`(D-{x}))(x := y)" |
14186 | 363 |
by(simp add: restrict_map_def expand_fun_eq) |
364 |
||
365 |
lemma fun_upd_restrict_conv[simp]: |
|
15693 | 366 |
"x \<in> D \<Longrightarrow> (m|`D)(x := y) = (m|`(D-{x}))(x := y)" |
14186 | 367 |
by(simp add: restrict_map_def expand_fun_eq) |
368 |
||
14100 | 369 |
|
370 |
subsection {* @{term map_upds} *} |
|
14025 | 371 |
|
372 |
lemma map_upds_Nil1[simp]: "m([] [|->] bs) = m" |
|
373 |
by(simp add:map_upds_def) |
|
374 |
||
375 |
lemma map_upds_Nil2[simp]: "m(as [|->] []) = m" |
|
376 |
by(simp add:map_upds_def) |
|
377 |
||
378 |
lemma map_upds_Cons[simp]: "m(a#as [|->] b#bs) = (m(a|->b))(as[|->]bs)" |
|
379 |
by(simp add:map_upds_def) |
|
380 |
||
14187 | 381 |
lemma map_upds_append1[simp]: "\<And>ys m. size xs < size ys \<Longrightarrow> |
382 |
m(xs@[x] [\<mapsto>] ys) = m(xs [\<mapsto>] ys)(x \<mapsto> ys!size xs)" |
|
383 |
apply(induct xs) |
|
384 |
apply(clarsimp simp add:neq_Nil_conv) |
|
14208 | 385 |
apply (case_tac ys, simp, simp) |
14187 | 386 |
done |
387 |
||
388 |
lemma map_upds_list_update2_drop[simp]: |
|
389 |
"\<And>m ys i. \<lbrakk>size xs \<le> i; i < size ys\<rbrakk> |
|
390 |
\<Longrightarrow> m(xs[\<mapsto>]ys[i:=y]) = m(xs[\<mapsto>]ys)" |
|
14208 | 391 |
apply (induct xs, simp) |
392 |
apply (case_tac ys, simp) |
|
14187 | 393 |
apply(simp split:nat.split) |
394 |
done |
|
14025 | 395 |
|
396 |
lemma map_upd_upds_conv_if: "!!x y ys f. |
|
397 |
(f(x|->y))(xs [|->] ys) = |
|
398 |
(if x : set(take (length ys) xs) then f(xs [|->] ys) |
|
399 |
else (f(xs [|->] ys))(x|->y))" |
|
14208 | 400 |
apply (induct xs, simp) |
14025 | 401 |
apply(case_tac ys) |
402 |
apply(auto split:split_if simp:fun_upd_twist) |
|
403 |
done |
|
404 |
||
405 |
lemma map_upds_twist [simp]: |
|
406 |
"a ~: set as ==> m(a|->b)(as[|->]bs) = m(as[|->]bs)(a|->b)" |
|
407 |
apply(insert set_take_subset) |
|
408 |
apply (fastsimp simp add: map_upd_upds_conv_if) |
|
409 |
done |
|
410 |
||
411 |
lemma map_upds_apply_nontin[simp]: |
|
412 |
"!!ys. x ~: set xs ==> (f(xs[|->]ys)) x = f x" |
|
14208 | 413 |
apply (induct xs, simp) |
14025 | 414 |
apply(case_tac ys) |
415 |
apply(auto simp: map_upd_upds_conv_if) |
|
416 |
done |
|
417 |
||
14300 | 418 |
lemma fun_upds_append_drop[simp]: |
419 |
"!!m ys. size xs = size ys \<Longrightarrow> m(xs@zs[\<mapsto>]ys) = m(xs[\<mapsto>]ys)" |
|
420 |
apply(induct xs) |
|
421 |
apply (simp) |
|
422 |
apply(case_tac ys) |
|
423 |
apply simp_all |
|
424 |
done |
|
425 |
||
426 |
lemma fun_upds_append2_drop[simp]: |
|
427 |
"!!m ys. size xs = size ys \<Longrightarrow> m(xs[\<mapsto>]ys@zs) = m(xs[\<mapsto>]ys)" |
|
428 |
apply(induct xs) |
|
429 |
apply (simp) |
|
430 |
apply(case_tac ys) |
|
431 |
apply simp_all |
|
432 |
done |
|
433 |
||
434 |
||
14186 | 435 |
lemma restrict_map_upds[simp]: "!!m ys. |
436 |
\<lbrakk> length xs = length ys; set xs \<subseteq> D \<rbrakk> |
|
15693 | 437 |
\<Longrightarrow> m(xs [\<mapsto>] ys)|`D = (m|`(D - set xs))(xs [\<mapsto>] ys)" |
14208 | 438 |
apply (induct xs, simp) |
439 |
apply (case_tac ys, simp) |
|
14186 | 440 |
apply(simp add:Diff_insert[symmetric] insert_absorb) |
441 |
apply(simp add: map_upd_upds_conv_if) |
|
442 |
done |
|
443 |
||
444 |
||
14100 | 445 |
subsection {* @{term map_upd_s} *} |
446 |
||
447 |
lemma map_upd_s_apply [simp]: |
|
448 |
"(m(as{|->}b)) x = (if x : as then Some b else m x)" |
|
449 |
by (simp add: map_upd_s_def) |
|
450 |
||
451 |
lemma map_subst_apply [simp]: |
|
452 |
"(m(a~>b)) x = (if m x = Some a then Some b else m x)" |
|
453 |
by (simp add: map_subst_def) |
|
454 |
||
455 |
subsection {* @{term dom} *} |
|
13908 | 456 |
|
457 |
lemma domI: "m a = Some b ==> a : dom m" |
|
14208 | 458 |
by (unfold dom_def, auto) |
14100 | 459 |
(* declare domI [intro]? *) |
13908 | 460 |
|
15369 | 461 |
lemma domD: "a : dom m ==> \<exists>b. m a = Some b" |
14208 | 462 |
by (unfold dom_def, auto) |
13908 | 463 |
|
13910 | 464 |
lemma domIff[iff]: "(a : dom m) = (m a ~= None)" |
14208 | 465 |
by (unfold dom_def, auto) |
13908 | 466 |
declare domIff [simp del] |
467 |
||
13910 | 468 |
lemma dom_empty[simp]: "dom empty = {}" |
13908 | 469 |
apply (unfold dom_def) |
470 |
apply (simp (no_asm)) |
|
471 |
done |
|
472 |
||
13910 | 473 |
lemma dom_fun_upd[simp]: |
474 |
"dom(f(x := y)) = (if y=None then dom f - {x} else insert x (dom f))" |
|
475 |
by (simp add:dom_def) blast |
|
13908 | 476 |
|
13937 | 477 |
lemma dom_map_of: "dom(map_of xys) = {x. \<exists>y. (x,y) : set xys}" |
478 |
apply(induct xys) |
|
479 |
apply(auto simp del:fun_upd_apply) |
|
480 |
done |
|
481 |
||
15304 | 482 |
lemma dom_map_of_conv_image_fst: |
483 |
"dom(map_of xys) = fst ` (set xys)" |
|
484 |
by(force simp: dom_map_of) |
|
485 |
||
15110
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
486 |
lemma dom_map_of_zip[simp]: "[| length xs = length ys; distinct xs |] ==> |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
487 |
dom(map_of(zip xs ys)) = set xs" |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
488 |
by(induct rule: list_induct2, simp_all) |
78b5636eabc7
Added a number of new thms and the new function remove1
nipkow
parents:
14739
diff
changeset
|
489 |
|
13908 | 490 |
lemma finite_dom_map_of: "finite (dom (map_of l))" |
491 |
apply (unfold dom_def) |
|
15251 | 492 |
apply (induct "l") |
13908 | 493 |
apply (auto simp add: insert_Collect [symmetric]) |
494 |
done |
|
495 |
||
14025 | 496 |
lemma dom_map_upds[simp]: |
497 |
"!!m ys. dom(m(xs[|->]ys)) = set(take (length ys) xs) Un dom m" |
|
14208 | 498 |
apply (induct xs, simp) |
499 |
apply (case_tac ys, auto) |
|
14025 | 500 |
done |
13910 | 501 |
|
14025 | 502 |
lemma dom_map_add[simp]: "dom(m++n) = dom n Un dom m" |
14208 | 503 |
by (unfold dom_def, auto) |
13910 | 504 |
|
15691 | 505 |
lemma dom_override_on[simp]: |
506 |
"dom(override_on f g A) = |
|
507 |
(dom f - {a. a : A - dom g}) Un {a. a : A Int dom g}" |
|
508 |
by(auto simp add: dom_def override_on_def) |
|
13908 | 509 |
|
14027 | 510 |
lemma map_add_comm: "dom m1 \<inter> dom m2 = {} \<Longrightarrow> m1++m2 = m2++m1" |
511 |
apply(rule ext) |
|
512 |
apply(fastsimp simp:map_add_def split:option.split) |
|
513 |
done |
|
514 |
||
14100 | 515 |
subsection {* @{term ran} *} |
516 |
||
517 |
lemma ranI: "m a = Some b ==> b : ran m" |
|
518 |
by (auto simp add: ran_def) |
|
519 |
(* declare ranI [intro]? *) |
|
13908 | 520 |
|
13910 | 521 |
lemma ran_empty[simp]: "ran empty = {}" |
13908 | 522 |
apply (unfold ran_def) |
523 |
apply (simp (no_asm)) |
|
524 |
done |
|
525 |
||
13910 | 526 |
lemma ran_map_upd[simp]: "m a = None ==> ran(m(a|->b)) = insert b (ran m)" |
14208 | 527 |
apply (unfold ran_def, auto) |
13908 | 528 |
apply (subgoal_tac "~ (aa = a) ") |
529 |
apply auto |
|
530 |
done |
|
13910 | 531 |
|
14100 | 532 |
subsection {* @{text "map_le"} *} |
13910 | 533 |
|
13912 | 534 |
lemma map_le_empty [simp]: "empty \<subseteq>\<^sub>m g" |
13910 | 535 |
by(simp add:map_le_def) |
536 |
||
14187 | 537 |
lemma [simp]: "f(x := None) \<subseteq>\<^sub>m f" |
538 |
by(force simp add:map_le_def) |
|
539 |
||
13910 | 540 |
lemma map_le_upd[simp]: "f \<subseteq>\<^sub>m g ==> f(a := b) \<subseteq>\<^sub>m g(a := b)" |
541 |
by(fastsimp simp add:map_le_def) |
|
542 |
||
14187 | 543 |
lemma [simp]: "m1 \<subseteq>\<^sub>m m2 \<Longrightarrow> m1(x := None) \<subseteq>\<^sub>m m2(x \<mapsto> y)" |
544 |
by(force simp add:map_le_def) |
|
545 |
||
13910 | 546 |
lemma map_le_upds[simp]: |
547 |
"!!f g bs. f \<subseteq>\<^sub>m g ==> f(as [|->] bs) \<subseteq>\<^sub>m g(as [|->] bs)" |
|
14208 | 548 |
apply (induct as, simp) |
549 |
apply (case_tac bs, auto) |
|
14025 | 550 |
done |
13908 | 551 |
|
14033 | 552 |
lemma map_le_implies_dom_le: "(f \<subseteq>\<^sub>m g) \<Longrightarrow> (dom f \<subseteq> dom g)" |
553 |
by (fastsimp simp add: map_le_def dom_def) |
|
554 |
||
555 |
lemma map_le_refl [simp]: "f \<subseteq>\<^sub>m f" |
|
556 |
by (simp add: map_le_def) |
|
557 |
||
14187 | 558 |
lemma map_le_trans[trans]: "\<lbrakk> m1 \<subseteq>\<^sub>m m2; m2 \<subseteq>\<^sub>m m3\<rbrakk> \<Longrightarrow> m1 \<subseteq>\<^sub>m m3" |
559 |
by(force simp add:map_le_def) |
|
14033 | 560 |
|
561 |
lemma map_le_antisym: "\<lbrakk> f \<subseteq>\<^sub>m g; g \<subseteq>\<^sub>m f \<rbrakk> \<Longrightarrow> f = g" |
|
562 |
apply (unfold map_le_def) |
|
563 |
apply (rule ext) |
|
14208 | 564 |
apply (case_tac "x \<in> dom f", simp) |
565 |
apply (case_tac "x \<in> dom g", simp, fastsimp) |
|
14033 | 566 |
done |
567 |
||
568 |
lemma map_le_map_add [simp]: "f \<subseteq>\<^sub>m (g ++ f)" |
|
569 |
by (fastsimp simp add: map_le_def) |
|
570 |
||
15304 | 571 |
lemma map_le_iff_map_add_commute: "(f \<subseteq>\<^sub>m f ++ g) = (f++g = g++f)" |
572 |
by(fastsimp simp add:map_add_def map_le_def expand_fun_eq split:option.splits) |
|
573 |
||
15303 | 574 |
lemma map_add_le_mapE: "f++g \<subseteq>\<^sub>m h \<Longrightarrow> g \<subseteq>\<^sub>m h" |
575 |
by (fastsimp simp add: map_le_def map_add_def dom_def) |
|
576 |
||
577 |
lemma map_add_le_mapI: "\<lbrakk> f \<subseteq>\<^sub>m h; g \<subseteq>\<^sub>m h; f \<subseteq>\<^sub>m f++g \<rbrakk> \<Longrightarrow> f++g \<subseteq>\<^sub>m h" |
|
578 |
by (clarsimp simp add: map_le_def map_add_def dom_def split:option.splits) |
|
579 |
||
3981 | 580 |
end |