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