src/HOL/Map.thy
author webertj
Fri, 19 Oct 2012 15:12:52 +0200
changeset 49962 a8cc904a6820
parent 46588 4895d7f1be42
child 53015 a1119cf551e8
permissions -rw-r--r--
Renamed {left,right}_distrib to distrib_{right,left}.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
3981
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
     1
(*  Title:      HOL/Map.thy
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
     2
    Author:     Tobias Nipkow, based on a theory by David von Oheimb
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
     3
    Copyright   1997-2003 TU Muenchen
3981
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
     4
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
     5
The datatype of `maps' (written ~=>); strongly resembles maps in VDM.
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
     6
*)
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
     7
13914
nipkow
parents: 13912
diff changeset
     8
header {* Maps *}
nipkow
parents: 13912
diff changeset
     9
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15110
diff changeset
    10
theory Map
15140
322485b816ac import -> imports
nipkow
parents: 15131
diff changeset
    11
imports List
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15110
diff changeset
    12
begin
3981
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
    13
42163
392fd6c4669c renewing specifications in HOL: replacing types by type_synonym
bulwahn
parents: 41550
diff changeset
    14
type_synonym ('a,'b) "map" = "'a => 'b option" (infixr "~=>" 0)
3981
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
    15
35427
ad039d29e01c proper (type_)notation;
wenzelm
parents: 35159
diff changeset
    16
type_notation (xsymbols)
35565
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
    17
  "map" (infixr "\<rightharpoonup>" 0)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19378
diff changeset
    18
19378
6cc9ac729eb5 Made "empty" an abbreviation.
nipkow
parents: 19323
diff changeset
    19
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    20
  empty :: "'a ~=> 'b" where
19378
6cc9ac729eb5 Made "empty" an abbreviation.
nipkow
parents: 19323
diff changeset
    21
  "empty == %x. None"
6cc9ac729eb5 Made "empty" an abbreviation.
nipkow
parents: 19323
diff changeset
    22
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19378
diff changeset
    23
definition
25670
497474b69c86 whitespace typo
haftmann
parents: 25490
diff changeset
    24
  map_comp :: "('b ~=> 'c) => ('a ~=> 'b) => ('a ~=> 'c)"  (infixl "o'_m" 55) where
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    25
  "f o_m g = (\<lambda>k. case g k of None \<Rightarrow> None | Some v \<Rightarrow> f v)"
19378
6cc9ac729eb5 Made "empty" an abbreviation.
nipkow
parents: 19323
diff changeset
    26
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20800
diff changeset
    27
notation (xsymbols)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19378
diff changeset
    28
  map_comp  (infixl "\<circ>\<^sub>m" 55)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19378
diff changeset
    29
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    30
definition
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    31
  map_add :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"  (infixl "++" 100) where
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    32
  "m1 ++ m2 = (\<lambda>x. case m2 x of None => m1 x | Some y => Some y)"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    33
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    34
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    35
  restrict_map :: "('a ~=> 'b) => 'a set => ('a ~=> 'b)"  (infixl "|`"  110) where
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    36
  "m|`A = (\<lambda>x. if x : A then m x else None)"
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
    37
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20800
diff changeset
    38
notation (latex output)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19378
diff changeset
    39
  restrict_map  ("_\<restriction>\<^bsub>_\<^esub>" [111,110] 110)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19378
diff changeset
    40
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    41
definition
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    42
  dom :: "('a ~=> 'b) => 'a set" where
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    43
  "dom m = {a. m a ~= None}"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    44
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    45
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    46
  ran :: "('a ~=> 'b) => 'b set" where
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    47
  "ran m = {b. EX a. m a = Some b}"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    48
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    49
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21210
diff changeset
    50
  map_le :: "('a ~=> 'b) => ('a ~=> 'b) => bool"  (infix "\<subseteq>\<^sub>m" 50) where
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    51
  "(m\<^isub>1 \<subseteq>\<^sub>m m\<^isub>2) = (\<forall>a \<in> dom m\<^isub>1. m\<^isub>1 a = m\<^isub>2 a)"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    52
41229
d797baa3d57c replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents: 39992
diff changeset
    53
nonterminal maplets and maplet
14180
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    54
5300
2b1ca524ace8 defined map_upd by translation via fun_upd
oheimb
parents: 5195
diff changeset
    55
syntax
14180
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    56
  "_maplet"  :: "['a, 'a] => maplet"             ("_ /|->/ _")
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    57
  "_maplets" :: "['a, 'a] => maplet"             ("_ /[|->]/ _")
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    58
  ""         :: "maplet => maplets"             ("_")
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    59
  "_Maplets" :: "[maplet, maplets] => maplets" ("_,/ _")
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    60
  "_MapUpd"  :: "['a ~=> 'b, maplets] => 'a ~=> 'b" ("_/'(_')" [900,0]900)
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    61
  "_Map"     :: "maplets => 'a ~=> 'b"            ("(1[_])")
3981
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
    62
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 10137
diff changeset
    63
syntax (xsymbols)
14180
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    64
  "_maplet"  :: "['a, 'a] => maplet"             ("_ /\<mapsto>/ _")
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    65
  "_maplets" :: "['a, 'a] => maplet"             ("_ /[\<mapsto>]/ _")
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    66
5300
2b1ca524ace8 defined map_upd by translation via fun_upd
oheimb
parents: 5195
diff changeset
    67
translations
14180
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    68
  "_MapUpd m (_Maplets xy ms)"  == "_MapUpd (_MapUpd m xy) ms"
35115
446c5063e4fd modernized translations;
wenzelm
parents: 34979
diff changeset
    69
  "_MapUpd m (_maplet  x y)"    == "m(x := CONST Some y)"
19947
29b376397cd5 fixed translations for _MapUpd: CONST;
wenzelm
parents: 19656
diff changeset
    70
  "_Map ms"                     == "_MapUpd (CONST empty) ms"
14180
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    71
  "_Map (_Maplets ms1 ms2)"     <= "_MapUpd (_Map ms1) ms2"
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    72
  "_Maplets ms1 (_Maplets ms2 ms3)" <= "_Maplets (_Maplets ms1 ms2) ms3"
d2e550609c40 Introduced new syntax for maplets x |-> y
nipkow
parents: 14134
diff changeset
    73
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 3981
diff changeset
    74
primrec
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    75
  map_of :: "('a \<times> 'b) list \<Rightarrow> 'a \<rightharpoonup> 'b" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    76
    "map_of [] = empty"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    77
  | "map_of (p # ps) = (map_of ps)(fst p \<mapsto> snd p)"
5300
2b1ca524ace8 defined map_upd by translation via fun_upd
oheimb
parents: 5195
diff changeset
    78
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    79
definition
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    80
  map_upds :: "('a \<rightharpoonup> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b list \<Rightarrow> 'a \<rightharpoonup> 'b" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    81
  "map_upds m xs ys = m ++ map_of (rev (zip xs ys))"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    82
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    83
translations
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 33635
diff changeset
    84
  "_MapUpd m (_maplets x y)"    == "CONST map_upds m x y"
25965
05df64f786a4 improved code theorem setup
haftmann
parents: 25670
diff changeset
    85
05df64f786a4 improved code theorem setup
haftmann
parents: 25670
diff changeset
    86
lemma map_of_Cons_code [code]: 
05df64f786a4 improved code theorem setup
haftmann
parents: 25670
diff changeset
    87
  "map_of [] k = None"
05df64f786a4 improved code theorem setup
haftmann
parents: 25670
diff changeset
    88
  "map_of ((l, v) # ps) k = (if l = k then Some v else map_of ps k)"
05df64f786a4 improved code theorem setup
haftmann
parents: 25670
diff changeset
    89
  by simp_all
05df64f786a4 improved code theorem setup
haftmann
parents: 25670
diff changeset
    90
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    91
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
    92
subsection {* @{term [source] empty} *}
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
    93
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
    94
lemma empty_upd_none [simp]: "empty(x := None) = empty"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
    95
by (rule ext) simp
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
    96
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
    97
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
    98
subsection {* @{term [source] map_upd} *}
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
    99
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   100
lemma map_upd_triv: "t k = Some x ==> t(k|->x) = t"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   101
by (rule ext) simp
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   102
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   103
lemma map_upd_nonempty [simp]: "t(k|->x) ~= empty"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   104
proof
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   105
  assume "t(k \<mapsto> x) = empty"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   106
  then have "(t(k \<mapsto> x)) k = None" by simp
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   107
  then show False by simp
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   108
qed
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   109
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   110
lemma map_upd_eqD1:
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   111
  assumes "m(a\<mapsto>x) = n(a\<mapsto>y)"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   112
  shows "x = y"
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   113
proof -
41550
efa734d9b221 eliminated global prems;
wenzelm
parents: 41229
diff changeset
   114
  from assms have "(m(a\<mapsto>x)) a = (n(a\<mapsto>y)) a" by simp
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   115
  then show ?thesis by simp
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   116
qed
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   117
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   118
lemma map_upd_Some_unfold:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   119
  "((m(a|->b)) x = Some y) = (x = a \<and> b = y \<or> x \<noteq> a \<and> m x = Some y)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   120
by auto
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   121
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   122
lemma image_map_upd [simp]: "x \<notin> A \<Longrightarrow> m(x \<mapsto> y) ` A = m ` A"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   123
by auto
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15251
diff changeset
   124
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   125
lemma finite_range_updI: "finite (range f) ==> finite (range (f(a|->b)))"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   126
unfolding image_def
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   127
apply (simp (no_asm_use) add:full_SetCompr_eq)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   128
apply (rule finite_subset)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   129
 prefer 2 apply assumption
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   130
apply (auto)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   131
done
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   132
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   133
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
   134
subsection {* @{term [source] map_of} *}
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   135
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   136
lemma map_of_eq_None_iff:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   137
  "(map_of xys x = None) = (x \<notin> fst ` (set xys))"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   138
by (induct xys) simp_all
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   139
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   140
lemma map_of_is_SomeD: "map_of xys x = Some y \<Longrightarrow> (x,y) \<in> set xys"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   141
apply (induct xys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   142
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   143
apply (clarsimp split: if_splits)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   144
done
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   145
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   146
lemma map_of_eq_Some_iff [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   147
  "distinct(map fst xys) \<Longrightarrow> (map_of xys x = Some y) = ((x,y) \<in> set xys)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   148
apply (induct xys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   149
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   150
apply (auto simp: map_of_eq_None_iff [symmetric])
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   151
done
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   152
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   153
lemma Some_eq_map_of_iff [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   154
  "distinct(map fst xys) \<Longrightarrow> (Some y = map_of xys x) = ((x,y) \<in> set xys)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   155
by (auto simp del:map_of_eq_Some_iff simp add: map_of_eq_Some_iff [symmetric])
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   156
17724
e969fc0a4925 simprules need names
paulson
parents: 17399
diff changeset
   157
lemma map_of_is_SomeI [simp]: "\<lbrakk> distinct(map fst xys); (x,y) \<in> set xys \<rbrakk>
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   158
    \<Longrightarrow> map_of xys x = Some y"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   159
apply (induct xys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   160
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   161
apply force
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   162
done
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   163
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   164
lemma map_of_zip_is_None [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   165
  "length xs = length ys \<Longrightarrow> (map_of (zip xs ys) x = None) = (x \<notin> set xs)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   166
by (induct rule: list_induct2) simp_all
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 14739
diff changeset
   167
26443
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   168
lemma map_of_zip_is_Some:
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   169
  assumes "length xs = length ys"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   170
  shows "x \<in> set xs \<longleftrightarrow> (\<exists>y. map_of (zip xs ys) x = Some y)"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   171
using assms by (induct rule: list_induct2) simp_all
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   172
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   173
lemma map_of_zip_upd:
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   174
  fixes x :: 'a and xs :: "'a list" and ys zs :: "'b list"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   175
  assumes "length ys = length xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   176
    and "length zs = length xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   177
    and "x \<notin> set xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   178
    and "map_of (zip xs ys)(x \<mapsto> y) = map_of (zip xs zs)(x \<mapsto> z)"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   179
  shows "map_of (zip xs ys) = map_of (zip xs zs)"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   180
proof
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   181
  fix x' :: 'a
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   182
  show "map_of (zip xs ys) x' = map_of (zip xs zs) x'"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   183
  proof (cases "x = x'")
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   184
    case True
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   185
    from assms True map_of_zip_is_None [of xs ys x']
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   186
      have "map_of (zip xs ys) x' = None" by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   187
    moreover from assms True map_of_zip_is_None [of xs zs x']
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   188
      have "map_of (zip xs zs) x' = None" by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   189
    ultimately show ?thesis by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   190
  next
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   191
    case False from assms
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   192
      have "(map_of (zip xs ys)(x \<mapsto> y)) x' = (map_of (zip xs zs)(x \<mapsto> z)) x'" by auto
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   193
    with False show ?thesis by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   194
  qed
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   195
qed
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   196
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   197
lemma map_of_zip_inject:
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   198
  assumes "length ys = length xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   199
    and "length zs = length xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   200
    and dist: "distinct xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   201
    and map_of: "map_of (zip xs ys) = map_of (zip xs zs)"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   202
  shows "ys = zs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   203
using assms(1) assms(2)[symmetric] using dist map_of proof (induct ys xs zs rule: list_induct3)
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   204
  case Nil show ?case by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   205
next
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   206
  case (Cons y ys x xs z zs)
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   207
  from `map_of (zip (x#xs) (y#ys)) = map_of (zip (x#xs) (z#zs))`
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   208
    have map_of: "map_of (zip xs ys)(x \<mapsto> y) = map_of (zip xs zs)(x \<mapsto> z)" by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   209
  from Cons have "length ys = length xs" and "length zs = length xs"
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   210
    and "x \<notin> set xs" by simp_all
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   211
  then have "map_of (zip xs ys) = map_of (zip xs zs)" using map_of by (rule map_of_zip_upd)
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   212
  with Cons.hyps `distinct (x # xs)` have "ys = zs" by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   213
  moreover from map_of have "y = z" by (rule map_upd_eqD1)
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   214
  ultimately show ?case by simp
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   215
qed
cae9fa186541 lemmas about map_of (zip _ _)
haftmann
parents: 25965
diff changeset
   216
33635
dcaada178c6f moved lemma map_of_zip_map to Map.thy
haftmann
parents: 32236
diff changeset
   217
lemma map_of_zip_map:
dcaada178c6f moved lemma map_of_zip_map to Map.thy
haftmann
parents: 32236
diff changeset
   218
  "map_of (zip xs (map f xs)) = (\<lambda>x. if x \<in> set xs then Some (f x) else None)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   219
  by (induct xs) (simp_all add: fun_eq_iff)
33635
dcaada178c6f moved lemma map_of_zip_map to Map.thy
haftmann
parents: 32236
diff changeset
   220
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 14739
diff changeset
   221
lemma finite_range_map_of: "finite (range (map_of xys))"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   222
apply (induct xys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   223
 apply (simp_all add: image_constant)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   224
apply (rule finite_subset)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   225
 prefer 2 apply assumption
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   226
apply auto
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   227
done
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 14739
diff changeset
   228
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   229
lemma map_of_SomeD: "map_of xs k = Some y \<Longrightarrow> (k, y) \<in> set xs"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   230
by (induct xs) (simp, atomize (full), auto)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   231
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   232
lemma map_of_mapk_SomeI:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   233
  "inj f ==> map_of t k = Some x ==>
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   234
   map_of (map (split (%k. Pair (f k))) t) (f k) = Some x"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   235
by (induct t) (auto simp add: inj_eq)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   236
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   237
lemma weak_map_of_SomeI: "(k, x) : set l ==> \<exists>x. map_of l k = Some x"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   238
by (induct l) auto
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   239
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   240
lemma map_of_filter_in:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   241
  "map_of xs k = Some z \<Longrightarrow> P k z \<Longrightarrow> map_of (filter (split P) xs) k = Some z"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   242
by (induct xs) auto
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   243
35607
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   244
lemma map_of_map:
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   245
  "map_of (map (\<lambda>(k, v). (k, f v)) xs) = Option.map f \<circ> map_of xs"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   246
  by (induct xs) (auto simp add: fun_eq_iff)
35607
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   247
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   248
lemma dom_option_map:
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   249
  "dom (\<lambda>k. Option.map (f k) (m k)) = dom m"
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   250
  by (simp add: dom_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   251
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   252
30235
58d147683393 Made Option a separate theory and renamed option_map to Option.map
nipkow
parents: 29622
diff changeset
   253
subsection {* @{const Option.map} related *}
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   254
30235
58d147683393 Made Option a separate theory and renamed option_map to Option.map
nipkow
parents: 29622
diff changeset
   255
lemma option_map_o_empty [simp]: "Option.map f o empty = empty"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   256
by (rule ext) simp
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   257
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   258
lemma option_map_o_map_upd [simp]:
30235
58d147683393 Made Option a separate theory and renamed option_map to Option.map
nipkow
parents: 29622
diff changeset
   259
  "Option.map f o m(a|->b) = (Option.map f o m)(a|->f b)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   260
by (rule ext) simp
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   261
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   262
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
   263
subsection {* @{term [source] map_comp} related *}
17391
c6338ed6caf8 removed syntax fun_map_comp;
schirmer
parents: 15695
diff changeset
   264
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   265
lemma map_comp_empty [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   266
  "m \<circ>\<^sub>m empty = empty"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   267
  "empty \<circ>\<^sub>m m = empty"
44921
58eef4843641 tuned proofs
huffman
parents: 44890
diff changeset
   268
by (auto simp add: map_comp_def split: option.splits)
17391
c6338ed6caf8 removed syntax fun_map_comp;
schirmer
parents: 15695
diff changeset
   269
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   270
lemma map_comp_simps [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   271
  "m2 k = None \<Longrightarrow> (m1 \<circ>\<^sub>m m2) k = None"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   272
  "m2 k = Some k' \<Longrightarrow> (m1 \<circ>\<^sub>m m2) k = m1 k'"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   273
by (auto simp add: map_comp_def)
17391
c6338ed6caf8 removed syntax fun_map_comp;
schirmer
parents: 15695
diff changeset
   274
c6338ed6caf8 removed syntax fun_map_comp;
schirmer
parents: 15695
diff changeset
   275
lemma map_comp_Some_iff:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   276
  "((m1 \<circ>\<^sub>m m2) k = Some v) = (\<exists>k'. m2 k = Some k' \<and> m1 k' = Some v)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   277
by (auto simp add: map_comp_def split: option.splits)
17391
c6338ed6caf8 removed syntax fun_map_comp;
schirmer
parents: 15695
diff changeset
   278
c6338ed6caf8 removed syntax fun_map_comp;
schirmer
parents: 15695
diff changeset
   279
lemma map_comp_None_iff:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   280
  "((m1 \<circ>\<^sub>m m2) k = None) = (m2 k = None \<or> (\<exists>k'. m2 k = Some k' \<and> m1 k' = None)) "
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   281
by (auto simp add: map_comp_def split: option.splits)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   282
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   283
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   284
subsection {* @{text "++"} *}
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   285
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   286
lemma map_add_empty[simp]: "m ++ empty = m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   287
by(simp add: map_add_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   288
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   289
lemma empty_map_add[simp]: "empty ++ m = m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   290
by (rule ext) (simp add: map_add_def split: option.split)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   291
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   292
lemma map_add_assoc[simp]: "m1 ++ (m2 ++ m3) = (m1 ++ m2) ++ m3"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   293
by (rule ext) (simp add: map_add_def split: option.split)
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   294
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   295
lemma map_add_Some_iff:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   296
  "((m ++ n) k = Some x) = (n k = Some x | n k = None & m k = Some x)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   297
by (simp add: map_add_def split: option.split)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   298
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   299
lemma map_add_SomeD [dest!]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   300
  "(m ++ n) k = Some x \<Longrightarrow> n k = Some x \<or> n k = None \<and> m k = Some x"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   301
by (rule map_add_Some_iff [THEN iffD1])
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   302
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   303
lemma map_add_find_right [simp]: "!!xx. n k = Some xx ==> (m ++ n) k = Some xx"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   304
by (subst map_add_Some_iff) fast
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   305
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   306
lemma map_add_None [iff]: "((m ++ n) k = None) = (n k = None & m k = None)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   307
by (simp add: map_add_def split: option.split)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   308
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   309
lemma map_add_upd[simp]: "f ++ g(x|->y) = (f ++ g)(x|->y)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   310
by (rule ext) (simp add: map_add_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   311
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   312
lemma map_add_upds[simp]: "m1 ++ (m2(xs[\<mapsto>]ys)) = (m1++m2)(xs[\<mapsto>]ys)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   313
by (simp add: map_upds_def)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   314
32236
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   315
lemma map_add_upd_left: "m\<notin>dom e2 \<Longrightarrow> e1(m \<mapsto> u1) ++ e2 = (e1 ++ e2)(m \<mapsto> u1)"
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   316
by (rule ext) (auto simp: map_add_def dom_def split: option.split)
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   317
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   318
lemma map_of_append[simp]: "map_of (xs @ ys) = map_of ys ++ map_of xs"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   319
unfolding map_add_def
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   320
apply (induct xs)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   321
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   322
apply (rule ext)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   323
apply (simp split add: option.split)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   324
done
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   325
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   326
lemma finite_range_map_of_map_add:
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   327
  "finite (range f) ==> finite (range (f ++ map_of l))"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   328
apply (induct l)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   329
 apply (auto simp del: fun_upd_apply)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   330
apply (erule finite_range_updI)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   331
done
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   332
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   333
lemma inj_on_map_add_dom [iff]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   334
  "inj_on (m ++ m') (dom m') = inj_on m' (dom m')"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   335
by (fastforce simp: map_add_def dom_def inj_on_def split: option.splits)
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   336
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   337
lemma map_upds_fold_map_upd:
35552
364cb98a3e4e more uniform naming conventions
haftmann
parents: 35159
diff changeset
   338
  "m(ks[\<mapsto>]vs) = foldl (\<lambda>m (k, v). m(k \<mapsto> v)) m (zip ks vs)"
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   339
unfolding map_upds_def proof (rule sym, rule zip_obtain_same_length)
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   340
  fix ks :: "'a list" and vs :: "'b list"
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   341
  assume "length ks = length vs"
35552
364cb98a3e4e more uniform naming conventions
haftmann
parents: 35159
diff changeset
   342
  then show "foldl (\<lambda>m (k, v). m(k\<mapsto>v)) m (zip ks vs) = m ++ map_of (rev (zip ks vs))"
364cb98a3e4e more uniform naming conventions
haftmann
parents: 35159
diff changeset
   343
    by(induct arbitrary: m rule: list_induct2) simp_all
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   344
qed
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   345
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   346
lemma map_add_map_of_foldr:
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   347
  "m ++ map_of ps = foldr (\<lambda>(k, v) m. m(k \<mapsto> v)) ps m"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   348
  by (induct ps) (auto simp add: fun_eq_iff map_add_def)
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   349
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   350
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
   351
subsection {* @{term [source] restrict_map} *}
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   352
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   353
lemma restrict_map_to_empty [simp]: "m|`{} = empty"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   354
by (simp add: restrict_map_def)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   355
31380
f25536c0bb80 added/moved lemmas by Andreas Lochbihler
haftmann
parents: 31080
diff changeset
   356
lemma restrict_map_insert: "f |` (insert a A) = (f |` A)(a := f a)"
44921
58eef4843641 tuned proofs
huffman
parents: 44890
diff changeset
   357
by (auto simp add: restrict_map_def)
31380
f25536c0bb80 added/moved lemmas by Andreas Lochbihler
haftmann
parents: 31080
diff changeset
   358
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   359
lemma restrict_map_empty [simp]: "empty|`D = empty"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   360
by (simp add: restrict_map_def)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   361
15693
3a67e61c6e96 tuned Map, renamed lex stuff in List.
nipkow
parents: 15691
diff changeset
   362
lemma restrict_in [simp]: "x \<in> A \<Longrightarrow> (m|`A) x = m x"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   363
by (simp add: restrict_map_def)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   364
15693
3a67e61c6e96 tuned Map, renamed lex stuff in List.
nipkow
parents: 15691
diff changeset
   365
lemma restrict_out [simp]: "x \<notin> A \<Longrightarrow> (m|`A) x = None"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   366
by (simp add: restrict_map_def)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   367
15693
3a67e61c6e96 tuned Map, renamed lex stuff in List.
nipkow
parents: 15691
diff changeset
   368
lemma ran_restrictD: "y \<in> ran (m|`A) \<Longrightarrow> \<exists>x\<in>A. m x = Some y"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   369
by (auto simp: restrict_map_def ran_def split: split_if_asm)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   370
15693
3a67e61c6e96 tuned Map, renamed lex stuff in List.
nipkow
parents: 15691
diff changeset
   371
lemma dom_restrict [simp]: "dom (m|`A) = dom m \<inter> A"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   372
by (auto simp: restrict_map_def dom_def split: split_if_asm)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   373
15693
3a67e61c6e96 tuned Map, renamed lex stuff in List.
nipkow
parents: 15691
diff changeset
   374
lemma restrict_upd_same [simp]: "m(x\<mapsto>y)|`(-{x}) = m|`(-{x})"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   375
by (rule ext) (auto simp: restrict_map_def)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   376
15693
3a67e61c6e96 tuned Map, renamed lex stuff in List.
nipkow
parents: 15691
diff changeset
   377
lemma restrict_restrict [simp]: "m|`A|`B = m|`(A\<inter>B)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   378
by (rule ext) (auto simp: restrict_map_def)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   379
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   380
lemma restrict_fun_upd [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   381
  "m(x := y)|`D = (if x \<in> D then (m|`(D-{x}))(x := y) else m|`D)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   382
by (simp add: restrict_map_def fun_eq_iff)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   383
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   384
lemma fun_upd_None_restrict [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   385
  "(m|`D)(x := None) = (if x:D then m|`(D - {x}) else m|`D)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   386
by (simp add: restrict_map_def fun_eq_iff)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   387
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   388
lemma fun_upd_restrict: "(m|`D)(x := y) = (m|`(D-{x}))(x := y)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   389
by (simp add: restrict_map_def fun_eq_iff)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   390
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   391
lemma fun_upd_restrict_conv [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   392
  "x \<in> D \<Longrightarrow> (m|`D)(x := y) = (m|`(D-{x}))(x := y)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   393
by (simp add: restrict_map_def fun_eq_iff)
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   394
35159
df38e92af926 added lemma map_of_map_restrict; generalized lemma dom_const
haftmann
parents: 35115
diff changeset
   395
lemma map_of_map_restrict:
df38e92af926 added lemma map_of_map_restrict; generalized lemma dom_const
haftmann
parents: 35115
diff changeset
   396
  "map_of (map (\<lambda>k. (k, f k)) ks) = (Some \<circ> f) |` set ks"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   397
  by (induct ks) (simp_all add: fun_eq_iff restrict_map_insert)
35159
df38e92af926 added lemma map_of_map_restrict; generalized lemma dom_const
haftmann
parents: 35115
diff changeset
   398
35619
b5f6481772f3 lemma restrict_complement_singleton_eq
haftmann
parents: 35607
diff changeset
   399
lemma restrict_complement_singleton_eq:
b5f6481772f3 lemma restrict_complement_singleton_eq
haftmann
parents: 35607
diff changeset
   400
  "f |` (- {x}) = f(x := None)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   401
  by (simp add: restrict_map_def fun_eq_iff)
35619
b5f6481772f3 lemma restrict_complement_singleton_eq
haftmann
parents: 35607
diff changeset
   402
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   403
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
   404
subsection {* @{term [source] map_upds} *}
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   405
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   406
lemma map_upds_Nil1 [simp]: "m([] [|->] bs) = m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   407
by (simp add: map_upds_def)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   408
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   409
lemma map_upds_Nil2 [simp]: "m(as [|->] []) = m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   410
by (simp add:map_upds_def)
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   411
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   412
lemma map_upds_Cons [simp]: "m(a#as [|->] b#bs) = (m(a|->b))(as[|->]bs)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   413
by (simp add:map_upds_def)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   414
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   415
lemma map_upds_append1 [simp]: "\<And>ys m. size xs < size ys \<Longrightarrow>
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   416
  m(xs@[x] [\<mapsto>] ys) = m(xs [\<mapsto>] ys)(x \<mapsto> ys!size xs)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   417
apply(induct xs)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   418
 apply (clarsimp simp add: neq_Nil_conv)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   419
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   420
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   421
apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   422
done
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14186
diff changeset
   423
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   424
lemma map_upds_list_update2_drop [simp]:
46588
4895d7f1be42 removing some unnecessary premises from Map theory
bulwahn
parents: 44921
diff changeset
   425
  "size xs \<le> i \<Longrightarrow> m(xs[\<mapsto>]ys[i:=y]) = m(xs[\<mapsto>]ys)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   426
apply (induct xs arbitrary: m ys i)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   427
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   428
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   429
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   430
apply (simp split: nat.split)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   431
done
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   432
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   433
lemma map_upd_upds_conv_if:
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   434
  "(f(x|->y))(xs [|->] ys) =
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   435
   (if x : set(take (length ys) xs) then f(xs [|->] ys)
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   436
                                    else (f(xs [|->] ys))(x|->y))"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   437
apply (induct xs arbitrary: x y ys f)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   438
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   439
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   440
 apply (auto split: split_if simp: fun_upd_twist)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   441
done
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   442
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   443
lemma map_upds_twist [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   444
  "a ~: set as ==> m(a|->b)(as[|->]bs) = m(as[|->]bs)(a|->b)"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   445
using set_take_subset by (fastforce simp add: map_upd_upds_conv_if)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   446
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   447
lemma map_upds_apply_nontin [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   448
  "x ~: set xs ==> (f(xs[|->]ys)) x = f x"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   449
apply (induct xs arbitrary: ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   450
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   451
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   452
 apply (auto simp: map_upd_upds_conv_if)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   453
done
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13937
diff changeset
   454
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   455
lemma fun_upds_append_drop [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   456
  "size xs = size ys \<Longrightarrow> m(xs@zs[\<mapsto>]ys) = m(xs[\<mapsto>]ys)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   457
apply (induct xs arbitrary: m ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   458
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   459
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   460
 apply simp_all
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   461
done
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14208
diff changeset
   462
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   463
lemma fun_upds_append2_drop [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   464
  "size xs = size ys \<Longrightarrow> m(xs[\<mapsto>]ys@zs) = m(xs[\<mapsto>]ys)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   465
apply (induct xs arbitrary: m ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   466
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   467
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   468
 apply simp_all
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   469
done
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14208
diff changeset
   470
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14208
diff changeset
   471
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   472
lemma restrict_map_upds[simp]:
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   473
  "\<lbrakk> length xs = length ys; set xs \<subseteq> D \<rbrakk>
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   474
    \<Longrightarrow> m(xs [\<mapsto>] ys)|`D = (m|`(D - set xs))(xs [\<mapsto>] ys)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   475
apply (induct xs arbitrary: m ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   476
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   477
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   478
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   479
apply (simp add: Diff_insert [symmetric] insert_absorb)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   480
apply (simp add: map_upd_upds_conv_if)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   481
done
14186
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   482
6d2a494e33be Added a number of thms about map restriction.
nipkow
parents: 14180
diff changeset
   483
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
   484
subsection {* @{term [source] dom} *}
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   485
31080
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   486
lemma dom_eq_empty_conv [simp]: "dom f = {} \<longleftrightarrow> f = empty"
44921
58eef4843641 tuned proofs
huffman
parents: 44890
diff changeset
   487
  by (auto simp: dom_def)
31080
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   488
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   489
lemma domI: "m a = Some b ==> a : dom m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   490
by(simp add:dom_def)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   491
(* declare domI [intro]? *)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   492
15369
paulson
parents: 15304
diff changeset
   493
lemma domD: "a : dom m ==> \<exists>b. m a = Some b"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   494
by (cases "m a") (auto simp add: dom_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   495
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   496
lemma domIff [iff, simp del]: "(a : dom m) = (m a ~= None)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   497
by(simp add:dom_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   498
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   499
lemma dom_empty [simp]: "dom empty = {}"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   500
by(simp add:dom_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   501
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   502
lemma dom_fun_upd [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   503
  "dom(f(x := y)) = (if y=None then dom f - {x} else insert x (dom f))"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   504
by(auto simp add:dom_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   505
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   506
lemma dom_if:
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   507
  "dom (\<lambda>x. if P x then f x else g x) = dom f \<inter> {x. P x} \<union> dom g \<inter> {x. \<not> P x}"
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   508
  by (auto split: if_splits)
13937
e9d57517c9b1 added a thm
nipkow
parents: 13914
diff changeset
   509
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   510
lemma dom_map_of_conv_image_fst:
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   511
  "dom (map_of xys) = fst ` set xys"
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   512
  by (induct xys) (auto simp add: dom_if)
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   513
46588
4895d7f1be42 removing some unnecessary premises from Map theory
bulwahn
parents: 44921
diff changeset
   514
lemma dom_map_of_zip [simp]: "length xs = length ys ==> dom (map_of (zip xs ys)) = set xs"
4895d7f1be42 removing some unnecessary premises from Map theory
bulwahn
parents: 44921
diff changeset
   515
by (induct rule: list_induct2) (auto simp add: dom_if)
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 14739
diff changeset
   516
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   517
lemma finite_dom_map_of: "finite (dom (map_of l))"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   518
by (induct l) (auto simp add: dom_def insert_Collect [symmetric])
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   519
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   520
lemma dom_map_upds [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   521
  "dom(m(xs[|->]ys)) = set(take (length ys) xs) Un dom m"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   522
apply (induct xs arbitrary: m ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   523
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   524
apply (case_tac ys)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   525
 apply auto
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   526
done
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   527
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   528
lemma dom_map_add [simp]: "dom(m++n) = dom n Un dom m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   529
by(auto simp:dom_def)
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   530
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   531
lemma dom_override_on [simp]:
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   532
  "dom(override_on f g A) =
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   533
    (dom f  - {a. a : A - dom g}) Un {a. a : A Int dom g}"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   534
by(auto simp: dom_def override_on_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   535
14027
68d247b7b14b *** empty log message ***
nipkow
parents: 14026
diff changeset
   536
lemma map_add_comm: "dom m1 \<inter> dom m2 = {} \<Longrightarrow> m1++m2 = m2++m1"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   537
by (rule ext) (force simp: map_add_def dom_def split: option.split)
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   538
32236
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   539
lemma map_add_dom_app_simps:
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   540
  "\<lbrakk> m\<in>dom l2 \<rbrakk> \<Longrightarrow> (l1++l2) m = l2 m"
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   541
  "\<lbrakk> m\<notin>dom l1 \<rbrakk> \<Longrightarrow> (l1++l2) m = l2 m"
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   542
  "\<lbrakk> m\<notin>dom l2 \<rbrakk> \<Longrightarrow> (l1++l2) m = l1 m"
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   543
by (auto simp add: map_add_def split: option.split_asm)
0203e1006f1b some lemmas about maps (contributed by Peter Lammich)
krauss
parents: 31380
diff changeset
   544
29622
2eeb09477ed3 lemmas dom_const, dom_if
haftmann
parents: 28790
diff changeset
   545
lemma dom_const [simp]:
35159
df38e92af926 added lemma map_of_map_restrict; generalized lemma dom_const
haftmann
parents: 35115
diff changeset
   546
  "dom (\<lambda>x. Some (f x)) = UNIV"
29622
2eeb09477ed3 lemmas dom_const, dom_if
haftmann
parents: 28790
diff changeset
   547
  by auto
2eeb09477ed3 lemmas dom_const, dom_if
haftmann
parents: 28790
diff changeset
   548
22230
bdec4a82f385 a few additions and deletions
nipkow
parents: 21404
diff changeset
   549
(* Due to John Matthews - could be rephrased with dom *)
bdec4a82f385 a few additions and deletions
nipkow
parents: 21404
diff changeset
   550
lemma finite_map_freshness:
bdec4a82f385 a few additions and deletions
nipkow
parents: 21404
diff changeset
   551
  "finite (dom (f :: 'a \<rightharpoonup> 'b)) \<Longrightarrow> \<not> finite (UNIV :: 'a set) \<Longrightarrow>
bdec4a82f385 a few additions and deletions
nipkow
parents: 21404
diff changeset
   552
   \<exists>x. f x = None"
bdec4a82f385 a few additions and deletions
nipkow
parents: 21404
diff changeset
   553
by(bestsimp dest:ex_new_if_finite)
14027
68d247b7b14b *** empty log message ***
nipkow
parents: 14026
diff changeset
   554
28790
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   555
lemma dom_minus:
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   556
  "f x = None \<Longrightarrow> dom f - insert x A = dom f - A"
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   557
  unfolding dom_def by simp
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   558
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   559
lemma insert_dom:
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   560
  "f x = Some y \<Longrightarrow> insert x (dom f) = dom f"
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   561
  unfolding dom_def by auto
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   562
35607
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   563
lemma map_of_map_keys:
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   564
  "set xs = dom m \<Longrightarrow> map_of (map (\<lambda>k. (k, the (m k))) xs) = m"
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   565
  by (rule ext) (auto simp add: map_of_map_restrict restrict_map_def)
896f01fe825b added dom_option_map, map_of_map_keys
haftmann
parents: 35565
diff changeset
   566
39379
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   567
lemma map_of_eqI:
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   568
  assumes set_eq: "set (map fst xs) = set (map fst ys)"
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   569
  assumes map_eq: "\<forall>k\<in>set (map fst xs). map_of xs k = map_of ys k"
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   570
  shows "map_of xs = map_of ys"
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   571
proof (rule ext)
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   572
  fix k show "map_of xs k = map_of ys k"
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   573
  proof (cases "map_of xs k")
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   574
    case None then have "k \<notin> set (map fst xs)" by (simp add: map_of_eq_None_iff)
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   575
    with set_eq have "k \<notin> set (map fst ys)" by simp
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   576
    then have "map_of ys k = None" by (simp add: map_of_eq_None_iff)
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   577
    with None show ?thesis by simp
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   578
  next
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   579
    case (Some v) then have "k \<in> set (map fst xs)" by (auto simp add: dom_map_of_conv_image_fst [symmetric])
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   580
    with map_eq show ?thesis by auto
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   581
  qed
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   582
qed
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   583
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   584
lemma map_of_eq_dom:
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   585
  assumes "map_of xs = map_of ys"
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   586
  shows "fst ` set xs = fst ` set ys"
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   587
proof -
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   588
  from assms have "dom (map_of xs) = dom (map_of ys)" by simp
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   589
  then show ?thesis by (simp add: dom_map_of_conv_image_fst)
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   590
qed
ab1b070aa412 moved lemmas map_of_eqI and map_of_eq_dom to Map.thy
haftmann
parents: 39302
diff changeset
   591
28790
2efba7b18c5b lemmas about dom and minus / insert
haftmann
parents: 28562
diff changeset
   592
17399
56a3a4affedc @{term [source] ...} in subsections probably more robust;
wenzelm
parents: 17391
diff changeset
   593
subsection {* @{term [source] ran} *}
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   594
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   595
lemma ranI: "m a = Some b ==> b : ran m"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   596
by(auto simp: ran_def)
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   597
(* declare ranI [intro]? *)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   598
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   599
lemma ran_empty [simp]: "ran empty = {}"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   600
by(auto simp: ran_def)
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   601
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   602
lemma ran_map_upd [simp]: "m a = None ==> ran(m(a|->b)) = insert b (ran m)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   603
unfolding ran_def
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   604
apply auto
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   605
apply (subgoal_tac "aa ~= a")
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   606
 apply auto
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   607
done
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   608
34979
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   609
lemma ran_distinct: 
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   610
  assumes dist: "distinct (map fst al)" 
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   611
  shows "ran (map_of al) = snd ` set al"
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   612
using assms proof (induct al)
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   613
  case Nil then show ?case by simp
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   614
next
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   615
  case (Cons kv al)
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   616
  then have "ran (map_of al) = snd ` set al" by simp
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   617
  moreover from Cons.prems have "map_of al (fst kv) = None"
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   618
    by (simp add: map_of_eq_None_iff)
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   619
  ultimately show ?case by (simp only: map_of.simps ran_map_upd) simp
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   620
qed
8cb6e7a42e9c more correspondence lemmas between related operations
haftmann
parents: 34941
diff changeset
   621
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   622
14100
804be4c4b642 added map_image, restrict_map, some thms
oheimb
parents: 14033
diff changeset
   623
subsection {* @{text "map_le"} *}
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   624
13912
3c0a340be514 fixed document
kleing
parents: 13910
diff changeset
   625
lemma map_le_empty [simp]: "empty \<subseteq>\<^sub>m g"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   626
by (simp add: map_le_def)
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   627
17724
e969fc0a4925 simprules need names
paulson
parents: 17399
diff changeset
   628
lemma upd_None_map_le [simp]: "f(x := None) \<subseteq>\<^sub>m f"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   629
by (force simp add: map_le_def)
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14186
diff changeset
   630
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   631
lemma map_le_upd[simp]: "f \<subseteq>\<^sub>m g ==> f(a := b) \<subseteq>\<^sub>m g(a := b)"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   632
by (fastforce simp add: map_le_def)
13910
f9a9ef16466f Added thms
nipkow
parents: 13909
diff changeset
   633
17724
e969fc0a4925 simprules need names
paulson
parents: 17399
diff changeset
   634
lemma map_le_imp_upd_le [simp]: "m1 \<subseteq>\<^sub>m m2 \<Longrightarrow> m1(x := None) \<subseteq>\<^sub>m m2(x \<mapsto> y)"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   635
by (force simp add: map_le_def)
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14186
diff changeset
   636
20800
69c82605efcf tuned specifications and proofs;
wenzelm
parents: 19947
diff changeset
   637
lemma map_le_upds [simp]:
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   638
  "f \<subseteq>\<^sub>m g ==> f(as [|->] bs) \<subseteq>\<^sub>m g(as [|->] bs)"
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   639
apply (induct as arbitrary: f g bs)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   640
 apply simp
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   641
apply (case_tac bs)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   642
 apply auto
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   643
done
13908
4bdfa9f77254 Map.ML integrated into Map.thy
webertj
parents: 13890
diff changeset
   644
14033
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   645
lemma map_le_implies_dom_le: "(f \<subseteq>\<^sub>m g) \<Longrightarrow> (dom f \<subseteq> dom g)"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   646
by (fastforce simp add: map_le_def dom_def)
14033
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   647
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   648
lemma map_le_refl [simp]: "f \<subseteq>\<^sub>m f"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   649
by (simp add: map_le_def)
14033
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   650
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14186
diff changeset
   651
lemma map_le_trans[trans]: "\<lbrakk> m1 \<subseteq>\<^sub>m m2; m2 \<subseteq>\<^sub>m m3\<rbrakk> \<Longrightarrow> m1 \<subseteq>\<^sub>m m3"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   652
by (auto simp add: map_le_def dom_def)
14033
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   653
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   654
lemma map_le_antisym: "\<lbrakk> f \<subseteq>\<^sub>m g; g \<subseteq>\<^sub>m f \<rbrakk> \<Longrightarrow> f = g"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   655
unfolding map_le_def
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   656
apply (rule ext)
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   657
apply (case_tac "x \<in> dom f", simp)
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   658
apply (case_tac "x \<in> dom g", simp, fastforce)
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   659
done
14033
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   660
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   661
lemma map_le_map_add [simp]: "f \<subseteq>\<^sub>m (g ++ f)"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   662
by (fastforce simp add: map_le_def)
14033
bc723de8ec95 Added a few lemmas about map_le
webertj
parents: 14027
diff changeset
   663
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   664
lemma map_le_iff_map_add_commute: "(f \<subseteq>\<^sub>m f ++ g) = (f++g = g++f)"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   665
by(fastforce simp: map_add_def map_le_def fun_eq_iff split: option.splits)
15304
3514ca74ac54 Added more lemmas
nipkow
parents: 15303
diff changeset
   666
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15251
diff changeset
   667
lemma map_add_le_mapE: "f++g \<subseteq>\<^sub>m h \<Longrightarrow> g \<subseteq>\<^sub>m h"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 42163
diff changeset
   668
by (fastforce simp add: map_le_def map_add_def dom_def)
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15251
diff changeset
   669
46588
4895d7f1be42 removing some unnecessary premises from Map theory
bulwahn
parents: 44921
diff changeset
   670
lemma map_add_le_mapI: "\<lbrakk> f \<subseteq>\<^sub>m h; g \<subseteq>\<^sub>m h \<rbrakk> \<Longrightarrow> f++g \<subseteq>\<^sub>m h"
24331
76f7a8c6e842 Made UN_Un simp
nipkow
parents: 22744
diff changeset
   671
by (clarsimp simp add: map_le_def map_add_def dom_def split: option.splits)
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15251
diff changeset
   672
31080
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   673
lemma dom_eq_singleton_conv: "dom f = {x} \<longleftrightarrow> (\<exists>v. f = [x \<mapsto> v])"
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   674
proof(rule iffI)
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   675
  assume "\<exists>v. f = [x \<mapsto> v]"
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   676
  thus "dom f = {x}" by(auto split: split_if_asm)
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   677
next
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   678
  assume "dom f = {x}"
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   679
  then obtain v where "f x = Some v" by auto
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   680
  hence "[x \<mapsto> v] \<subseteq>\<^sub>m f" by(auto simp add: map_le_def)
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   681
  moreover have "f \<subseteq>\<^sub>m [x \<mapsto> v]" using `dom f = {x}` `f x = Some v`
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   682
    by(auto simp add: map_le_def)
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   683
  ultimately have "f = [x \<mapsto> v]" by-(rule map_le_antisym)
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   684
  thus "\<exists>v. f = [x \<mapsto> v]" by blast
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   685
qed
21ffc770ebc0 lemmas by Andreas Lochbihler
nipkow
parents: 30935
diff changeset
   686
35565
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   687
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   688
subsection {* Various *}
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   689
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   690
lemma set_map_of_compr:
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   691
  assumes distinct: "distinct (map fst xs)"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   692
  shows "set xs = {(k, v). map_of xs k = Some v}"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   693
using assms proof (induct xs)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   694
  case Nil then show ?case by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   695
next
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   696
  case (Cons x xs)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   697
  obtain k v where "x = (k, v)" by (cases x) blast
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   698
  with Cons.prems have "k \<notin> dom (map_of xs)"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   699
    by (simp add: dom_map_of_conv_image_fst)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   700
  then have *: "insert (k, v) {(k, v). map_of xs k = Some v} =
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   701
    {(k', v'). (map_of xs(k \<mapsto> v)) k' = Some v'}"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   702
    by (auto split: if_splits)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   703
  from Cons have "set xs = {(k, v). map_of xs k = Some v}" by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   704
  with * `x = (k, v)` show ?case by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   705
qed
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   706
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   707
lemma map_of_inject_set:
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   708
  assumes distinct: "distinct (map fst xs)" "distinct (map fst ys)"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   709
  shows "map_of xs = map_of ys \<longleftrightarrow> set xs = set ys" (is "?lhs \<longleftrightarrow> ?rhs")
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   710
proof
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   711
  assume ?lhs
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   712
  moreover from `distinct (map fst xs)` have "set xs = {(k, v). map_of xs k = Some v}"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   713
    by (rule set_map_of_compr)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   714
  moreover from `distinct (map fst ys)` have "set ys = {(k, v). map_of ys k = Some v}"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   715
    by (rule set_map_of_compr)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   716
  ultimately show ?rhs by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   717
next
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   718
  assume ?rhs show ?lhs proof
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   719
    fix k
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   720
    show "map_of xs k = map_of ys k" proof (cases "map_of xs k")
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   721
      case None
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   722
      moreover with `?rhs` have "map_of ys k = None"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   723
        by (simp add: map_of_eq_None_iff)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   724
      ultimately show ?thesis by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   725
    next
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   726
      case (Some v)
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   727
      moreover with distinct `?rhs` have "map_of ys k = Some v"
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   728
        by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   729
      ultimately show ?thesis by simp
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   730
    qed
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   731
  qed
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   732
qed
56b070cd7ab3 lemmas set_map_of_compr, map_of_inject_set
haftmann
parents: 35553
diff changeset
   733
3981
b4f93a8da835 Added the new theory Map.
nipkow
parents:
diff changeset
   734
end