src/HOL/Library/FinFun.thy
author Andreas Lochbihler
Wed May 30 08:48:14 2012 +0200 (2012-05-30)
changeset 48034 1c5171abe5cc
parent 48031 bbf95f3595ab
child 48035 2f9584581cf2
permissions -rw-r--r--
removed subscripts from FinFun type syntax
Andreas@48028
     1
(* Author: Andreas Lochbihler, Uni Karlsruhe *)
Andreas@48028
     2
Andreas@48028
     3
header {* Almost everywhere constant functions *}
Andreas@48028
     4
Andreas@48028
     5
theory FinFun
Andreas@48028
     6
imports Card_Univ
Andreas@48028
     7
begin
Andreas@48028
     8
Andreas@48028
     9
text {*
Andreas@48028
    10
  This theory defines functions which are constant except for finitely
Andreas@48028
    11
  many points (FinFun) and introduces a type finfin along with a
Andreas@48028
    12
  number of operators for them. The code generator is set up such that
Andreas@48028
    13
  such functions can be represented as data in the generated code and
Andreas@48028
    14
  all operators are executable.
Andreas@48028
    15
Andreas@48028
    16
  For details, see Formalising FinFuns - Generating Code for Functions as Data by A. Lochbihler in TPHOLs 2009.
Andreas@48028
    17
*}
Andreas@48028
    18
Andreas@48028
    19
Andreas@48028
    20
definition "code_abort" :: "(unit \<Rightarrow> 'a) \<Rightarrow> 'a"
Andreas@48028
    21
where [simp, code del]: "code_abort f = f ()"
Andreas@48028
    22
Andreas@48028
    23
code_abort "code_abort"
Andreas@48028
    24
Andreas@48028
    25
hide_const (open) "code_abort"
Andreas@48028
    26
Andreas@48028
    27
subsection {* The @{text "map_default"} operation *}
Andreas@48028
    28
Andreas@48028
    29
definition map_default :: "'b \<Rightarrow> ('a \<rightharpoonup> 'b) \<Rightarrow> 'a \<Rightarrow> 'b"
Andreas@48028
    30
where "map_default b f a \<equiv> case f a of None \<Rightarrow> b | Some b' \<Rightarrow> b'"
Andreas@48028
    31
Andreas@48028
    32
lemma map_default_delete [simp]:
Andreas@48028
    33
  "map_default b (f(a := None)) = (map_default b f)(a := b)"
Andreas@48028
    34
by(simp add: map_default_def fun_eq_iff)
Andreas@48028
    35
Andreas@48028
    36
lemma map_default_insert:
Andreas@48028
    37
  "map_default b (f(a \<mapsto> b')) = (map_default b f)(a := b')"
Andreas@48028
    38
by(simp add: map_default_def fun_eq_iff)
Andreas@48028
    39
Andreas@48028
    40
lemma map_default_empty [simp]: "map_default b empty = (\<lambda>a. b)"
Andreas@48028
    41
by(simp add: fun_eq_iff map_default_def)
Andreas@48028
    42
Andreas@48028
    43
lemma map_default_inject:
Andreas@48028
    44
  fixes g g' :: "'a \<rightharpoonup> 'b"
Andreas@48028
    45
  assumes infin_eq: "\<not> finite (UNIV :: 'a set) \<or> b = b'"
Andreas@48028
    46
  and fin: "finite (dom g)" and b: "b \<notin> ran g"
Andreas@48028
    47
  and fin': "finite (dom g')" and b': "b' \<notin> ran g'"
Andreas@48028
    48
  and eq': "map_default b g = map_default b' g'"
Andreas@48028
    49
  shows "b = b'" "g = g'"
Andreas@48028
    50
proof -
Andreas@48028
    51
  from infin_eq show bb': "b = b'"
Andreas@48028
    52
  proof
Andreas@48028
    53
    assume infin: "\<not> finite (UNIV :: 'a set)"
Andreas@48028
    54
    from fin fin' have "finite (dom g \<union> dom g')" by auto
Andreas@48028
    55
    with infin have "UNIV - (dom g \<union> dom g') \<noteq> {}" by(auto dest: finite_subset)
Andreas@48028
    56
    then obtain a where a: "a \<notin> dom g \<union> dom g'" by auto
Andreas@48028
    57
    hence "map_default b g a = b" "map_default b' g' a = b'" by(auto simp add: map_default_def)
Andreas@48028
    58
    with eq' show "b = b'" by simp
Andreas@48028
    59
  qed
Andreas@48028
    60
Andreas@48028
    61
  show "g = g'"
Andreas@48028
    62
  proof
Andreas@48028
    63
    fix x
Andreas@48028
    64
    show "g x = g' x"
Andreas@48028
    65
    proof(cases "g x")
Andreas@48028
    66
      case None
Andreas@48028
    67
      hence "map_default b g x = b" by(simp add: map_default_def)
Andreas@48028
    68
      with bb' eq' have "map_default b' g' x = b'" by simp
Andreas@48028
    69
      with b' have "g' x = None" by(simp add: map_default_def ran_def split: option.split_asm)
Andreas@48028
    70
      with None show ?thesis by simp
Andreas@48028
    71
    next
Andreas@48028
    72
      case (Some c)
Andreas@48028
    73
      with b have cb: "c \<noteq> b" by(auto simp add: ran_def)
Andreas@48028
    74
      moreover from Some have "map_default b g x = c" by(simp add: map_default_def)
Andreas@48028
    75
      with eq' have "map_default b' g' x = c" by simp
Andreas@48028
    76
      ultimately have "g' x = Some c" using b' bb' by(auto simp add: map_default_def split: option.splits)
Andreas@48028
    77
      with Some show ?thesis by simp
Andreas@48028
    78
    qed
Andreas@48028
    79
  qed
Andreas@48028
    80
qed
Andreas@48028
    81
Andreas@48028
    82
subsection {* The finfun type *}
Andreas@48028
    83
Andreas@48028
    84
definition "finfun = {f::'a\<Rightarrow>'b. \<exists>b. finite {a. f a \<noteq> b}}"
Andreas@48028
    85
Andreas@48034
    86
typedef (open) ('a,'b) finfun  ("(_ =>f /_)" [22, 21] 21) = "finfun :: ('a => 'b) set"
Andreas@48029
    87
  morphisms finfun_apply Abs_finfun
Andreas@48028
    88
proof -
Andreas@48028
    89
  have "\<exists>f. finite {x. f x \<noteq> undefined}"
Andreas@48028
    90
  proof
Andreas@48028
    91
    show "finite {x. (\<lambda>y. undefined) x \<noteq> undefined}" by auto
Andreas@48028
    92
  qed
Andreas@48028
    93
  then show ?thesis unfolding finfun_def by auto
Andreas@48028
    94
qed
Andreas@48028
    95
Andreas@48034
    96
type_notation finfun ("(_ \<Rightarrow>f /_)" [22, 21] 21)
Andreas@48034
    97
Andreas@48028
    98
setup_lifting type_definition_finfun
Andreas@48028
    99
Andreas@48028
   100
lemma fun_upd_finfun: "y(a := b) \<in> finfun \<longleftrightarrow> y \<in> finfun"
Andreas@48028
   101
proof -
Andreas@48028
   102
  { fix b'
Andreas@48028
   103
    have "finite {a'. (y(a := b)) a' \<noteq> b'} = finite {a'. y a' \<noteq> b'}"
Andreas@48028
   104
    proof(cases "b = b'")
Andreas@48028
   105
      case True
Andreas@48028
   106
      hence "{a'. (y(a := b)) a' \<noteq> b'} = {a'. y a' \<noteq> b'} - {a}" by auto
Andreas@48028
   107
      thus ?thesis by simp
Andreas@48028
   108
    next
Andreas@48028
   109
      case False
Andreas@48028
   110
      hence "{a'. (y(a := b)) a' \<noteq> b'} = insert a {a'. y a' \<noteq> b'}" by auto
Andreas@48028
   111
      thus ?thesis by simp
Andreas@48028
   112
    qed }
Andreas@48028
   113
  thus ?thesis unfolding finfun_def by blast
Andreas@48028
   114
qed
Andreas@48028
   115
Andreas@48028
   116
lemma const_finfun: "(\<lambda>x. a) \<in> finfun"
Andreas@48028
   117
by(auto simp add: finfun_def)
Andreas@48028
   118
Andreas@48028
   119
lemma finfun_left_compose:
Andreas@48028
   120
  assumes "y \<in> finfun"
Andreas@48028
   121
  shows "g \<circ> y \<in> finfun"
Andreas@48028
   122
proof -
Andreas@48028
   123
  from assms obtain b where "finite {a. y a \<noteq> b}"
Andreas@48028
   124
    unfolding finfun_def by blast
Andreas@48028
   125
  hence "finite {c. g (y c) \<noteq> g b}"
Andreas@48028
   126
  proof(induct "{a. y a \<noteq> b}" arbitrary: y)
Andreas@48028
   127
    case empty
Andreas@48028
   128
    hence "y = (\<lambda>a. b)" by(auto intro: ext)
Andreas@48028
   129
    thus ?case by(simp)
Andreas@48028
   130
  next
Andreas@48028
   131
    case (insert x F)
Andreas@48028
   132
    note IH = `\<And>y. F = {a. y a \<noteq> b} \<Longrightarrow> finite {c. g (y c) \<noteq> g b}`
Andreas@48028
   133
    from `insert x F = {a. y a \<noteq> b}` `x \<notin> F`
Andreas@48028
   134
    have F: "F = {a. (y(x := b)) a \<noteq> b}" by(auto)
Andreas@48028
   135
    show ?case
Andreas@48028
   136
    proof(cases "g (y x) = g b")
Andreas@48028
   137
      case True
Andreas@48028
   138
      hence "{c. g ((y(x := b)) c) \<noteq> g b} = {c. g (y c) \<noteq> g b}" by auto
Andreas@48028
   139
      with IH[OF F] show ?thesis by simp
Andreas@48028
   140
    next
Andreas@48028
   141
      case False
Andreas@48028
   142
      hence "{c. g (y c) \<noteq> g b} = insert x {c. g ((y(x := b)) c) \<noteq> g b}" by auto
Andreas@48028
   143
      with IH[OF F] show ?thesis by(simp)
Andreas@48028
   144
    qed
Andreas@48028
   145
  qed
Andreas@48028
   146
  thus ?thesis unfolding finfun_def by auto
Andreas@48028
   147
qed
Andreas@48028
   148
Andreas@48028
   149
lemma assumes "y \<in> finfun"
Andreas@48028
   150
  shows fst_finfun: "fst \<circ> y \<in> finfun"
Andreas@48028
   151
  and snd_finfun: "snd \<circ> y \<in> finfun"
Andreas@48028
   152
proof -
Andreas@48028
   153
  from assms obtain b c where bc: "finite {a. y a \<noteq> (b, c)}"
Andreas@48028
   154
    unfolding finfun_def by auto
Andreas@48028
   155
  have "{a. fst (y a) \<noteq> b} \<subseteq> {a. y a \<noteq> (b, c)}"
Andreas@48028
   156
    and "{a. snd (y a) \<noteq> c} \<subseteq> {a. y a \<noteq> (b, c)}" by auto
Andreas@48028
   157
  hence "finite {a. fst (y a) \<noteq> b}" 
Andreas@48028
   158
    and "finite {a. snd (y a) \<noteq> c}" using bc by(auto intro: finite_subset)
Andreas@48028
   159
  thus "fst \<circ> y \<in> finfun" "snd \<circ> y \<in> finfun"
Andreas@48028
   160
    unfolding finfun_def by auto
Andreas@48028
   161
qed
Andreas@48028
   162
Andreas@48028
   163
lemma map_of_finfun: "map_of xs \<in> finfun"
Andreas@48028
   164
unfolding finfun_def
Andreas@48028
   165
by(induct xs)(auto simp add: Collect_neg_eq Collect_conj_eq Collect_imp_eq intro: finite_subset)
Andreas@48028
   166
Andreas@48028
   167
lemma Diag_finfun: "(\<lambda>x. (f x, g x)) \<in> finfun \<longleftrightarrow> f \<in> finfun \<and> g \<in> finfun"
Andreas@48028
   168
by(auto intro: finite_subset simp add: Collect_neg_eq Collect_imp_eq Collect_conj_eq finfun_def)
Andreas@48028
   169
Andreas@48028
   170
lemma finfun_right_compose:
Andreas@48028
   171
  assumes g: "g \<in> finfun" and inj: "inj f"
Andreas@48028
   172
  shows "g o f \<in> finfun"
Andreas@48028
   173
proof -
Andreas@48028
   174
  from g obtain b where b: "finite {a. g a \<noteq> b}" unfolding finfun_def by blast
Andreas@48028
   175
  moreover have "f ` {a. g (f a) \<noteq> b} \<subseteq> {a. g a \<noteq> b}" by auto
Andreas@48028
   176
  moreover from inj have "inj_on f {a.  g (f a) \<noteq> b}" by(rule subset_inj_on) blast
Andreas@48028
   177
  ultimately have "finite {a. g (f a) \<noteq> b}"
Andreas@48028
   178
    by(blast intro: finite_imageD[where f=f] finite_subset)
Andreas@48028
   179
  thus ?thesis unfolding finfun_def by auto
Andreas@48028
   180
qed
Andreas@48028
   181
Andreas@48028
   182
lemma finfun_curry:
Andreas@48028
   183
  assumes fin: "f \<in> finfun"
Andreas@48028
   184
  shows "curry f \<in> finfun" "curry f a \<in> finfun"
Andreas@48028
   185
proof -
Andreas@48028
   186
  from fin obtain c where c: "finite {ab. f ab \<noteq> c}" unfolding finfun_def by blast
Andreas@48028
   187
  moreover have "{a. \<exists>b. f (a, b) \<noteq> c} = fst ` {ab. f ab \<noteq> c}" by(force)
Andreas@48028
   188
  hence "{a. curry f a \<noteq> (\<lambda>b. c)} = fst ` {ab. f ab \<noteq> c}"
Andreas@48028
   189
    by(auto simp add: curry_def fun_eq_iff)
Andreas@48028
   190
  ultimately have "finite {a. curry f a \<noteq> (\<lambda>b. c)}" by simp
Andreas@48028
   191
  thus "curry f \<in> finfun" unfolding finfun_def by blast
Andreas@48028
   192
  
Andreas@48028
   193
  have "snd ` {ab. f ab \<noteq> c} = {b. \<exists>a. f (a, b) \<noteq> c}" by(force)
Andreas@48028
   194
  hence "{b. f (a, b) \<noteq> c} \<subseteq> snd ` {ab. f ab \<noteq> c}" by auto
Andreas@48028
   195
  hence "finite {b. f (a, b) \<noteq> c}" by(rule finite_subset)(rule finite_imageI[OF c])
Andreas@48028
   196
  thus "curry f a \<in> finfun" unfolding finfun_def by auto
Andreas@48028
   197
qed
Andreas@48028
   198
Andreas@48030
   199
bundle finfun =
Andreas@48030
   200
  fst_finfun[simp] snd_finfun[simp] Abs_finfun_inverse[simp] 
Andreas@48030
   201
  finfun_apply_inverse[simp] Abs_finfun_inject[simp] finfun_apply_inject[simp]
Andreas@48030
   202
  Diag_finfun[simp] finfun_curry[simp]
Andreas@48030
   203
  const_finfun[iff] fun_upd_finfun[iff] finfun_apply[iff] map_of_finfun[iff]
Andreas@48030
   204
  finfun_left_compose[intro] fst_finfun[intro] snd_finfun[intro]
Andreas@48028
   205
Andreas@48028
   206
lemma Abs_finfun_inject_finite:
Andreas@48028
   207
  fixes x y :: "'a \<Rightarrow> 'b"
Andreas@48028
   208
  assumes fin: "finite (UNIV :: 'a set)"
Andreas@48028
   209
  shows "Abs_finfun x = Abs_finfun y \<longleftrightarrow> x = y"
Andreas@48028
   210
proof
Andreas@48028
   211
  assume "Abs_finfun x = Abs_finfun y"
Andreas@48028
   212
  moreover have "x \<in> finfun" "y \<in> finfun" unfolding finfun_def
Andreas@48028
   213
    by(auto intro: finite_subset[OF _ fin])
Andreas@48028
   214
  ultimately show "x = y" by(simp add: Abs_finfun_inject)
Andreas@48028
   215
qed simp
Andreas@48028
   216
Andreas@48028
   217
lemma Abs_finfun_inject_finite_class:
Andreas@48028
   218
  fixes x y :: "('a :: finite) \<Rightarrow> 'b"
Andreas@48028
   219
  shows "Abs_finfun x = Abs_finfun y \<longleftrightarrow> x = y"
Andreas@48028
   220
using finite_UNIV
Andreas@48028
   221
by(simp add: Abs_finfun_inject_finite)
Andreas@48028
   222
Andreas@48028
   223
lemma Abs_finfun_inj_finite:
Andreas@48028
   224
  assumes fin: "finite (UNIV :: 'a set)"
Andreas@48034
   225
  shows "inj (Abs_finfun :: ('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow>f 'b)"
Andreas@48028
   226
proof(rule inj_onI)
Andreas@48028
   227
  fix x y :: "'a \<Rightarrow> 'b"
Andreas@48028
   228
  assume "Abs_finfun x = Abs_finfun y"
Andreas@48028
   229
  moreover have "x \<in> finfun" "y \<in> finfun" unfolding finfun_def
Andreas@48028
   230
    by(auto intro: finite_subset[OF _ fin])
Andreas@48028
   231
  ultimately show "x = y" by(simp add: Abs_finfun_inject)
Andreas@48028
   232
qed
Andreas@48028
   233
Andreas@48028
   234
lemma Abs_finfun_inverse_finite:
Andreas@48028
   235
  fixes x :: "'a \<Rightarrow> 'b"
Andreas@48028
   236
  assumes fin: "finite (UNIV :: 'a set)"
Andreas@48029
   237
  shows "finfun_apply (Abs_finfun x) = x"
Andreas@48030
   238
  including finfun
Andreas@48028
   239
proof -
Andreas@48028
   240
  from fin have "x \<in> finfun"
Andreas@48028
   241
    by(auto simp add: finfun_def intro: finite_subset)
Andreas@48028
   242
  thus ?thesis by simp
Andreas@48028
   243
qed
Andreas@48028
   244
Andreas@48028
   245
lemma Abs_finfun_inverse_finite_class:
Andreas@48028
   246
  fixes x :: "('a :: finite) \<Rightarrow> 'b"
Andreas@48029
   247
  shows "finfun_apply (Abs_finfun x) = x"
Andreas@48028
   248
using finite_UNIV by(simp add: Abs_finfun_inverse_finite)
Andreas@48028
   249
Andreas@48028
   250
lemma finfun_eq_finite_UNIV: "finite (UNIV :: 'a set) \<Longrightarrow> (finfun :: ('a \<Rightarrow> 'b) set) = UNIV"
Andreas@48028
   251
unfolding finfun_def by(auto intro: finite_subset)
Andreas@48028
   252
Andreas@48028
   253
lemma finfun_finite_UNIV_class: "finfun = (UNIV :: ('a :: finite \<Rightarrow> 'b) set)"
Andreas@48028
   254
by(simp add: finfun_eq_finite_UNIV)
Andreas@48028
   255
Andreas@48028
   256
lemma map_default_in_finfun:
Andreas@48028
   257
  assumes fin: "finite (dom f)"
Andreas@48028
   258
  shows "map_default b f \<in> finfun"
Andreas@48028
   259
unfolding finfun_def
Andreas@48028
   260
proof(intro CollectI exI)
Andreas@48028
   261
  from fin show "finite {a. map_default b f a \<noteq> b}"
Andreas@48028
   262
    by(auto simp add: map_default_def dom_def Collect_conj_eq split: option.splits)
Andreas@48028
   263
qed
Andreas@48028
   264
Andreas@48028
   265
lemma finfun_cases_map_default:
Andreas@48028
   266
  obtains b g where "f = Abs_finfun (map_default b g)" "finite (dom g)" "b \<notin> ran g"
Andreas@48028
   267
proof -
Andreas@48028
   268
  obtain y where f: "f = Abs_finfun y" and y: "y \<in> finfun" by(cases f)
Andreas@48028
   269
  from y obtain b where b: "finite {a. y a \<noteq> b}" unfolding finfun_def by auto
Andreas@48028
   270
  let ?g = "(\<lambda>a. if y a = b then None else Some (y a))"
Andreas@48028
   271
  have "map_default b ?g = y" by(simp add: fun_eq_iff map_default_def)
Andreas@48028
   272
  with f have "f = Abs_finfun (map_default b ?g)" by simp
Andreas@48028
   273
  moreover from b have "finite (dom ?g)" by(auto simp add: dom_def)
Andreas@48028
   274
  moreover have "b \<notin> ran ?g" by(auto simp add: ran_def)
Andreas@48028
   275
  ultimately show ?thesis by(rule that)
Andreas@48028
   276
qed
Andreas@48028
   277
Andreas@48028
   278
Andreas@48034
   279
subsection {* Kernel functions for type @{typ "'a \<Rightarrow>f 'b"} *}
Andreas@48028
   280
Andreas@48034
   281
lift_definition finfun_const :: "'b \<Rightarrow> 'a \<Rightarrow>f 'b" ("\<lambda>\<^isup>f/ _" [0] 1)
Andreas@48028
   282
is "\<lambda> b x. b" by (rule const_finfun)
Andreas@48028
   283
Andreas@48034
   284
lift_definition finfun_update :: "'a \<Rightarrow>f 'b \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'a \<Rightarrow>f 'b" ("_'(\<^sup>f/ _ := _')" [1000,0,0] 1000) is "fun_upd"
Andreas@48034
   285
by (simp add: fun_upd_finfun)
Andreas@48028
   286
Andreas@48028
   287
lemma finfun_update_twist: "a \<noteq> a' \<Longrightarrow> f(\<^sup>f a := b)(\<^sup>f a' := b') = f(\<^sup>f a' := b')(\<^sup>f a := b)"
Andreas@48028
   288
by transfer (simp add: fun_upd_twist)
Andreas@48028
   289
Andreas@48028
   290
lemma finfun_update_twice [simp]:
Andreas@48028
   291
  "finfun_update (finfun_update f a b) a b' = finfun_update f a b'"
Andreas@48028
   292
by transfer simp
Andreas@48028
   293
Andreas@48028
   294
lemma finfun_update_const_same: "(\<lambda>\<^isup>f b)(\<^sup>f a := b) = (\<lambda>\<^isup>f b)"
Andreas@48028
   295
by transfer (simp add: fun_eq_iff)
Andreas@48028
   296
Andreas@48028
   297
subsection {* Code generator setup *}
Andreas@48028
   298
Andreas@48034
   299
definition finfun_update_code :: "'a \<Rightarrow>f 'b \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'a \<Rightarrow>f 'b" ("_'(\<^sup>fc/ _ := _')" [1000,0,0] 1000)
Andreas@48028
   300
where [simp, code del]: "finfun_update_code = finfun_update"
Andreas@48028
   301
Andreas@48028
   302
code_datatype finfun_const finfun_update_code
Andreas@48028
   303
Andreas@48028
   304
lemma finfun_update_const_code [code]:
Andreas@48028
   305
  "(\<lambda>\<^isup>f b)(\<^sup>f a := b') = (if b = b' then (\<lambda>\<^isup>f b) else finfun_update_code (\<lambda>\<^isup>f b) a b')"
Andreas@48028
   306
by(simp add: finfun_update_const_same)
Andreas@48028
   307
Andreas@48028
   308
lemma finfun_update_update_code [code]:
Andreas@48028
   309
  "(finfun_update_code f a b)(\<^sup>f a' := b') = (if a = a' then f(\<^sup>f a := b') else finfun_update_code (f(\<^sup>f a' := b')) a b)"
Andreas@48028
   310
by(simp add: finfun_update_twist)
Andreas@48028
   311
Andreas@48028
   312
Andreas@48028
   313
subsection {* Setup for quickcheck *}
Andreas@48028
   314
Andreas@48034
   315
quickcheck_generator finfun constructors: finfun_update_code, "finfun_const :: 'b \<Rightarrow> 'a \<Rightarrow>f 'b"
Andreas@48028
   316
Andreas@48028
   317
subsection {* @{text "finfun_update"} as instance of @{text "comp_fun_commute"} *}
Andreas@48028
   318
Andreas@48028
   319
interpretation finfun_update: comp_fun_commute "\<lambda>a f. f(\<^sup>f a :: 'a := b')"
Andreas@48030
   320
  including finfun
Andreas@48028
   321
proof
Andreas@48028
   322
  fix a a' :: 'a
Andreas@48028
   323
  show "(\<lambda>f. f(\<^sup>f a := b')) \<circ> (\<lambda>f. f(\<^sup>f a' := b')) = (\<lambda>f. f(\<^sup>f a' := b')) \<circ> (\<lambda>f. f(\<^sup>f a := b'))"
Andreas@48028
   324
  proof
Andreas@48028
   325
    fix b
Andreas@48029
   326
    have "(finfun_apply b)(a := b', a' := b') = (finfun_apply b)(a' := b', a := b')"
Andreas@48028
   327
      by(cases "a = a'")(auto simp add: fun_upd_twist)
Andreas@48028
   328
    then have "b(\<^sup>f a := b')(\<^sup>f a' := b') = b(\<^sup>f a' := b')(\<^sup>f a := b')"
Andreas@48028
   329
      by(auto simp add: finfun_update_def fun_upd_twist)
Andreas@48028
   330
    then show "((\<lambda>f. f(\<^sup>f a := b')) \<circ> (\<lambda>f. f(\<^sup>f a' := b'))) b = ((\<lambda>f. f(\<^sup>f a' := b')) \<circ> (\<lambda>f. f(\<^sup>f a := b'))) b"
Andreas@48028
   331
      by (simp add: fun_eq_iff)
Andreas@48028
   332
  qed
Andreas@48028
   333
qed
Andreas@48028
   334
Andreas@48028
   335
lemma fold_finfun_update_finite_univ:
Andreas@48028
   336
  assumes fin: "finite (UNIV :: 'a set)"
Andreas@48028
   337
  shows "Finite_Set.fold (\<lambda>a f. f(\<^sup>f a := b')) (\<lambda>\<^isup>f b) (UNIV :: 'a set) = (\<lambda>\<^isup>f b')"
Andreas@48028
   338
proof -
Andreas@48028
   339
  { fix A :: "'a set"
Andreas@48028
   340
    from fin have "finite A" by(auto intro: finite_subset)
Andreas@48028
   341
    hence "Finite_Set.fold (\<lambda>a f. f(\<^sup>f a := b')) (\<lambda>\<^isup>f b) A = Abs_finfun (\<lambda>a. if a \<in> A then b' else b)"
Andreas@48028
   342
    proof(induct)
Andreas@48028
   343
      case (insert x F)
Andreas@48028
   344
      have "(\<lambda>a. if a = x then b' else (if a \<in> F then b' else b)) = (\<lambda>a. if a = x \<or> a \<in> F then b' else b)"
Andreas@48028
   345
        by(auto intro: ext)
Andreas@48028
   346
      with insert show ?case
Andreas@48028
   347
        by(simp add: finfun_const_def fun_upd_def)(simp add: finfun_update_def Abs_finfun_inverse_finite[OF fin] fun_upd_def)
Andreas@48028
   348
    qed(simp add: finfun_const_def) }
Andreas@48028
   349
  thus ?thesis by(simp add: finfun_const_def)
Andreas@48028
   350
qed
Andreas@48028
   351
Andreas@48028
   352
Andreas@48028
   353
subsection {* Default value for FinFuns *}
Andreas@48028
   354
Andreas@48028
   355
definition finfun_default_aux :: "('a \<Rightarrow> 'b) \<Rightarrow> 'b"
Andreas@48028
   356
where [code del]: "finfun_default_aux f = (if finite (UNIV :: 'a set) then undefined else THE b. finite {a. f a \<noteq> b})"
Andreas@48028
   357
Andreas@48028
   358
lemma finfun_default_aux_infinite:
Andreas@48028
   359
  fixes f :: "'a \<Rightarrow> 'b"
Andreas@48028
   360
  assumes infin: "\<not> finite (UNIV :: 'a set)"
Andreas@48028
   361
  and fin: "finite {a. f a \<noteq> b}"
Andreas@48028
   362
  shows "finfun_default_aux f = b"
Andreas@48028
   363
proof -
Andreas@48028
   364
  let ?B = "{a. f a \<noteq> b}"
Andreas@48028
   365
  from fin have "(THE b. finite {a. f a \<noteq> b}) = b"
Andreas@48028
   366
  proof(rule the_equality)
Andreas@48028
   367
    fix b'
Andreas@48028
   368
    assume "finite {a. f a \<noteq> b'}" (is "finite ?B'")
Andreas@48028
   369
    with infin fin have "UNIV - (?B' \<union> ?B) \<noteq> {}" by(auto dest: finite_subset)
Andreas@48028
   370
    then obtain a where a: "a \<notin> ?B' \<union> ?B" by auto
Andreas@48028
   371
    thus "b' = b" by auto
Andreas@48028
   372
  qed
Andreas@48028
   373
  thus ?thesis using infin by(simp add: finfun_default_aux_def)
Andreas@48028
   374
qed
Andreas@48028
   375
Andreas@48028
   376
Andreas@48028
   377
lemma finite_finfun_default_aux:
Andreas@48028
   378
  fixes f :: "'a \<Rightarrow> 'b"
Andreas@48028
   379
  assumes fin: "f \<in> finfun"
Andreas@48028
   380
  shows "finite {a. f a \<noteq> finfun_default_aux f}"
Andreas@48028
   381
proof(cases "finite (UNIV :: 'a set)")
Andreas@48028
   382
  case True thus ?thesis using fin
Andreas@48028
   383
    by(auto simp add: finfun_def finfun_default_aux_def intro: finite_subset)
Andreas@48028
   384
next
Andreas@48028
   385
  case False
Andreas@48028
   386
  from fin obtain b where b: "finite {a. f a \<noteq> b}" (is "finite ?B")
Andreas@48028
   387
    unfolding finfun_def by blast
Andreas@48028
   388
  with False show ?thesis by(simp add: finfun_default_aux_infinite)
Andreas@48028
   389
qed
Andreas@48028
   390
Andreas@48028
   391
lemma finfun_default_aux_update_const:
Andreas@48028
   392
  fixes f :: "'a \<Rightarrow> 'b"
Andreas@48028
   393
  assumes fin: "f \<in> finfun"
Andreas@48028
   394
  shows "finfun_default_aux (f(a := b)) = finfun_default_aux f"
Andreas@48028
   395
proof(cases "finite (UNIV :: 'a set)")
Andreas@48028
   396
  case False
Andreas@48028
   397
  from fin obtain b' where b': "finite {a. f a \<noteq> b'}" unfolding finfun_def by blast
Andreas@48028
   398
  hence "finite {a'. (f(a := b)) a' \<noteq> b'}"
Andreas@48028
   399
  proof(cases "b = b' \<and> f a \<noteq> b'") 
Andreas@48028
   400
    case True
Andreas@48028
   401
    hence "{a. f a \<noteq> b'} = insert a {a'. (f(a := b)) a' \<noteq> b'}" by auto
Andreas@48028
   402
    thus ?thesis using b' by simp
Andreas@48028
   403
  next
Andreas@48028
   404
    case False
Andreas@48028
   405
    moreover
Andreas@48028
   406
    { assume "b \<noteq> b'"
Andreas@48028
   407
      hence "{a'. (f(a := b)) a' \<noteq> b'} = insert a {a. f a \<noteq> b'}" by auto
Andreas@48028
   408
      hence ?thesis using b' by simp }
Andreas@48028
   409
    moreover
Andreas@48028
   410
    { assume "b = b'" "f a = b'"
Andreas@48028
   411
      hence "{a'. (f(a := b)) a' \<noteq> b'} = {a. f a \<noteq> b'}" by auto
Andreas@48028
   412
      hence ?thesis using b' by simp }
Andreas@48028
   413
    ultimately show ?thesis by blast
Andreas@48028
   414
  qed
Andreas@48028
   415
  with False b' show ?thesis by(auto simp del: fun_upd_apply simp add: finfun_default_aux_infinite)
Andreas@48028
   416
next
Andreas@48028
   417
  case True thus ?thesis by(simp add: finfun_default_aux_def)
Andreas@48028
   418
qed
Andreas@48028
   419
Andreas@48034
   420
lift_definition finfun_default :: "'a \<Rightarrow>f 'b \<Rightarrow> 'b"
Andreas@48028
   421
is "finfun_default_aux" ..
Andreas@48028
   422
Andreas@48031
   423
lemma finfun_apply_transfer [transfer_rule]: 
Andreas@48031
   424
  "(fun_rel cr_finfun (fun_rel op = op =)) (\<lambda>f. f) finfun_apply"
Andreas@48031
   425
unfolding Rel_def fun_rel_def cr_finfun_def by simp
Andreas@48031
   426
Andreas@48029
   427
lemma finite_finfun_default: "finite {a. finfun_apply f a \<noteq> finfun_default f}"
Andreas@48031
   428
by transfer (erule finite_finfun_default_aux)
Andreas@48028
   429
Andreas@48034
   430
lemma finfun_default_const: "finfun_default ((\<lambda>\<^isup>f b) :: 'a \<Rightarrow>f 'b) = (if finite (UNIV :: 'a set) then undefined else b)"
Andreas@48031
   431
by(transfer)(auto simp add: finfun_default_aux_infinite finfun_default_aux_def)
Andreas@48028
   432
Andreas@48028
   433
lemma finfun_default_update_const:
Andreas@48028
   434
  "finfun_default (f(\<^sup>f a := b)) = finfun_default f"
Andreas@48028
   435
by transfer (simp add: finfun_default_aux_update_const)
Andreas@48028
   436
Andreas@48028
   437
lemma finfun_default_const_code [code]:
Andreas@48034
   438
  "finfun_default ((\<lambda>\<^isup>f c) :: ('a :: card_UNIV) \<Rightarrow>f 'b) = (if card_UNIV (TYPE('a)) = 0 then c else undefined)"
Andreas@48028
   439
by(simp add: finfun_default_const card_UNIV_eq_0_infinite_UNIV)
Andreas@48028
   440
Andreas@48028
   441
lemma finfun_default_update_code [code]:
Andreas@48028
   442
  "finfun_default (finfun_update_code f a b) = finfun_default f"
Andreas@48028
   443
by(simp add: finfun_default_update_const)
Andreas@48028
   444
Andreas@48028
   445
subsection {* Recursion combinator and well-formedness conditions *}
Andreas@48028
   446
Andreas@48034
   447
definition finfun_rec :: "('b \<Rightarrow> 'c) \<Rightarrow> ('a \<Rightarrow> 'b \<Rightarrow> 'c \<Rightarrow> 'c) \<Rightarrow> ('a \<Rightarrow>f 'b) \<Rightarrow> 'c"
Andreas@48028
   448
where [code del]:
Andreas@48028
   449
  "finfun_rec cnst upd f \<equiv>
Andreas@48028
   450
   let b = finfun_default f;
Andreas@48028
   451
       g = THE g. f = Abs_finfun (map_default b g) \<and> finite (dom g) \<and> b \<notin> ran g
Andreas@48028
   452
   in Finite_Set.fold (\<lambda>a. upd a (map_default b g a)) (cnst b) (dom g)"
Andreas@48028
   453
Andreas@48028
   454
locale finfun_rec_wf_aux =
Andreas@48028
   455
  fixes cnst :: "'b \<Rightarrow> 'c"
Andreas@48028
   456
  and upd :: "'a \<Rightarrow> 'b \<Rightarrow> 'c \<Rightarrow> 'c"
Andreas@48028
   457
  assumes upd_const_same: "upd a b (cnst b) = cnst b"
Andreas@48028
   458
  and upd_commute: "a \<noteq> a' \<Longrightarrow> upd a b (upd a' b' c) = upd a' b' (upd a b c)"
Andreas@48028
   459
  and upd_idemp: "b \<noteq> b' \<Longrightarrow> upd a b'' (upd a b' (cnst b)) = upd a b'' (cnst b)"
Andreas@48028
   460
begin
Andreas@48028
   461
Andreas@48028
   462
Andreas@48028
   463
lemma upd_left_comm: "comp_fun_commute (\<lambda>a. upd a (f a))"
Andreas@48028
   464
by(unfold_locales)(auto intro: upd_commute simp add: fun_eq_iff)
Andreas@48028
   465
Andreas@48028
   466
lemma upd_upd_twice: "upd a b'' (upd a b' (cnst b)) = upd a b'' (cnst b)"
Andreas@48028
   467
by(cases "b \<noteq> b'")(auto simp add: fun_upd_def upd_const_same upd_idemp)
Andreas@48028
   468
Andreas@48028
   469
lemma map_default_update_const:
Andreas@48028
   470
  assumes fin: "finite (dom f)"
Andreas@48028
   471
  and anf: "a \<notin> dom f"
Andreas@48028
   472
  and fg: "f \<subseteq>\<^sub>m g"
Andreas@48028
   473
  shows "upd a d  (Finite_Set.fold (\<lambda>a. upd a (map_default d g a)) (cnst d) (dom f)) =
Andreas@48028
   474
         Finite_Set.fold (\<lambda>a. upd a (map_default d g a)) (cnst d) (dom f)"
Andreas@48028
   475
proof -
Andreas@48028
   476
  let ?upd = "\<lambda>a. upd a (map_default d g a)"
Andreas@48028
   477
  let ?fr = "\<lambda>A. Finite_Set.fold ?upd (cnst d) A"
Andreas@48028
   478
  interpret gwf: comp_fun_commute "?upd" by(rule upd_left_comm)
Andreas@48028
   479
  
Andreas@48028
   480
  from fin anf fg show ?thesis
Andreas@48028
   481
  proof(induct "dom f" arbitrary: f)
Andreas@48028
   482
    case empty
Andreas@48028
   483
    from `{} = dom f` have "f = empty" by(auto simp add: dom_def intro: ext)
Andreas@48028
   484
    thus ?case by(simp add: finfun_const_def upd_const_same)
Andreas@48028
   485
  next
Andreas@48028
   486
    case (insert a' A)
Andreas@48028
   487
    note IH = `\<And>f.  \<lbrakk> A = dom f; a \<notin> dom f; f \<subseteq>\<^sub>m g \<rbrakk> \<Longrightarrow> upd a d (?fr (dom f)) = ?fr (dom f)`
Andreas@48028
   488
    note fin = `finite A` note anf = `a \<notin> dom f` note a'nA = `a' \<notin> A`
Andreas@48028
   489
    note domf = `insert a' A = dom f` note fg = `f \<subseteq>\<^sub>m g`
Andreas@48028
   490
    
Andreas@48028
   491
    from domf obtain b where b: "f a' = Some b" by auto
Andreas@48028
   492
    let ?f' = "f(a' := None)"
Andreas@48028
   493
    have "upd a d (?fr (insert a' A)) = upd a d (upd a' (map_default d g a') (?fr A))"
Andreas@48028
   494
      by(subst gwf.fold_insert[OF fin a'nA]) rule
Andreas@48028
   495
    also from b fg have "g a' = f a'" by(auto simp add: map_le_def intro: domI dest: bspec)
Andreas@48028
   496
    hence ga': "map_default d g a' = map_default d f a'" by(simp add: map_default_def)
Andreas@48028
   497
    also from anf domf have "a \<noteq> a'" by auto note upd_commute[OF this]
Andreas@48028
   498
    also from domf a'nA anf fg have "a \<notin> dom ?f'" "?f' \<subseteq>\<^sub>m g" and A: "A = dom ?f'" by(auto simp add: ran_def map_le_def)
Andreas@48028
   499
    note A also note IH[OF A `a \<notin> dom ?f'` `?f' \<subseteq>\<^sub>m g`]
Andreas@48028
   500
    also have "upd a' (map_default d f a') (?fr (dom (f(a' := None)))) = ?fr (dom f)"
Andreas@48028
   501
      unfolding domf[symmetric] gwf.fold_insert[OF fin a'nA] ga' unfolding A ..
Andreas@48028
   502
    also have "insert a' (dom ?f') = dom f" using domf by auto
Andreas@48028
   503
    finally show ?case .
Andreas@48028
   504
  qed
Andreas@48028
   505
qed
Andreas@48028
   506
Andreas@48028
   507
lemma map_default_update_twice:
Andreas@48028
   508
  assumes fin: "finite (dom f)"
Andreas@48028
   509
  and anf: "a \<notin> dom f"
Andreas@48028
   510
  and fg: "f \<subseteq>\<^sub>m g"
Andreas@48028
   511
  shows "upd a d'' (upd a d' (Finite_Set.fold (\<lambda>a. upd a (map_default d g a)) (cnst d) (dom f))) =
Andreas@48028
   512
         upd a d'' (Finite_Set.fold (\<lambda>a. upd a (map_default d g a)) (cnst d) (dom f))"
Andreas@48028
   513
proof -
Andreas@48028
   514
  let ?upd = "\<lambda>a. upd a (map_default d g a)"
Andreas@48028
   515
  let ?fr = "\<lambda>A. Finite_Set.fold ?upd (cnst d) A"
Andreas@48028
   516
  interpret gwf: comp_fun_commute "?upd" by(rule upd_left_comm)
Andreas@48028
   517
  
Andreas@48028
   518
  from fin anf fg show ?thesis
Andreas@48028
   519
  proof(induct "dom f" arbitrary: f)
Andreas@48028
   520
    case empty
Andreas@48028
   521
    from `{} = dom f` have "f = empty" by(auto simp add: dom_def intro: ext)
Andreas@48028
   522
    thus ?case by(auto simp add: finfun_const_def finfun_update_def upd_upd_twice)
Andreas@48028
   523
  next
Andreas@48028
   524
    case (insert a' A)
Andreas@48028
   525
    note IH = `\<And>f. \<lbrakk>A = dom f; a \<notin> dom f; f \<subseteq>\<^sub>m g\<rbrakk> \<Longrightarrow> upd a d'' (upd a d' (?fr (dom f))) = upd a d'' (?fr (dom f))`
Andreas@48028
   526
    note fin = `finite A` note anf = `a \<notin> dom f` note a'nA = `a' \<notin> A`
Andreas@48028
   527
    note domf = `insert a' A = dom f` note fg = `f \<subseteq>\<^sub>m g`
Andreas@48028
   528
    
Andreas@48028
   529
    from domf obtain b where b: "f a' = Some b" by auto
Andreas@48028
   530
    let ?f' = "f(a' := None)"
Andreas@48028
   531
    let ?b' = "case f a' of None \<Rightarrow> d | Some b \<Rightarrow> b"
Andreas@48028
   532
    from domf have "upd a d'' (upd a d' (?fr (dom f))) = upd a d'' (upd a d' (?fr (insert a' A)))" by simp
Andreas@48028
   533
    also note gwf.fold_insert[OF fin a'nA]
Andreas@48028
   534
    also from b fg have "g a' = f a'" by(auto simp add: map_le_def intro: domI dest: bspec)
Andreas@48028
   535
    hence ga': "map_default d g a' = map_default d f a'" by(simp add: map_default_def)
Andreas@48028
   536
    also from anf domf have ana': "a \<noteq> a'" by auto note upd_commute[OF this]
Andreas@48028
   537
    also note upd_commute[OF ana']
Andreas@48028
   538
    also from domf a'nA anf fg have "a \<notin> dom ?f'" "?f' \<subseteq>\<^sub>m g" and A: "A = dom ?f'" by(auto simp add: ran_def map_le_def)
Andreas@48028
   539
    note A also note IH[OF A `a \<notin> dom ?f'` `?f' \<subseteq>\<^sub>m g`]
Andreas@48028
   540
    also note upd_commute[OF ana'[symmetric]] also note ga'[symmetric] also note A[symmetric]
Andreas@48028
   541
    also note gwf.fold_insert[symmetric, OF fin a'nA] also note domf
Andreas@48028
   542
    finally show ?case .
Andreas@48028
   543
  qed
Andreas@48028
   544
qed
Andreas@48028
   545
Andreas@48028
   546
lemma map_default_eq_id [simp]: "map_default d ((\<lambda>a. Some (f a)) |` {a. f a \<noteq> d}) = f"
Andreas@48028
   547
by(auto simp add: map_default_def restrict_map_def intro: ext)
Andreas@48028
   548
Andreas@48028
   549
lemma finite_rec_cong1:
Andreas@48028
   550
  assumes f: "comp_fun_commute f" and g: "comp_fun_commute g"
Andreas@48028
   551
  and fin: "finite A"
Andreas@48028
   552
  and eq: "\<And>a. a \<in> A \<Longrightarrow> f a = g a"
Andreas@48028
   553
  shows "Finite_Set.fold f z A = Finite_Set.fold g z A"
Andreas@48028
   554
proof -
Andreas@48028
   555
  interpret f: comp_fun_commute f by(rule f)
Andreas@48028
   556
  interpret g: comp_fun_commute g by(rule g)
Andreas@48028
   557
  { fix B
Andreas@48028
   558
    assume BsubA: "B \<subseteq> A"
Andreas@48028
   559
    with fin have "finite B" by(blast intro: finite_subset)
Andreas@48028
   560
    hence "B \<subseteq> A \<Longrightarrow> Finite_Set.fold f z B = Finite_Set.fold g z B"
Andreas@48028
   561
    proof(induct)
Andreas@48028
   562
      case empty thus ?case by simp
Andreas@48028
   563
    next
Andreas@48028
   564
      case (insert a B)
Andreas@48028
   565
      note finB = `finite B` note anB = `a \<notin> B` note sub = `insert a B \<subseteq> A`
Andreas@48028
   566
      note IH = `B \<subseteq> A \<Longrightarrow> Finite_Set.fold f z B = Finite_Set.fold g z B`
Andreas@48028
   567
      from sub anB have BpsubA: "B \<subset> A" and BsubA: "B \<subseteq> A" and aA: "a \<in> A" by auto
Andreas@48028
   568
      from IH[OF BsubA] eq[OF aA] finB anB
Andreas@48028
   569
      show ?case by(auto)
Andreas@48028
   570
    qed
Andreas@48028
   571
    with BsubA have "Finite_Set.fold f z B = Finite_Set.fold g z B" by blast }
Andreas@48028
   572
  thus ?thesis by blast
Andreas@48028
   573
qed
Andreas@48028
   574
Andreas@48028
   575
lemma finfun_rec_upd [simp]:
Andreas@48028
   576
  "finfun_rec cnst upd (f(\<^sup>f a' := b')) = upd a' b' (finfun_rec cnst upd f)"
Andreas@48030
   577
  including finfun
Andreas@48028
   578
proof -
Andreas@48028
   579
  obtain b where b: "b = finfun_default f" by auto
Andreas@48028
   580
  let ?the = "\<lambda>f g. f = Abs_finfun (map_default b g) \<and> finite (dom g) \<and> b \<notin> ran g"
Andreas@48028
   581
  obtain g where g: "g = The (?the f)" by blast
Andreas@48028
   582
  obtain y where f: "f = Abs_finfun y" and y: "y \<in> finfun" by (cases f)
Andreas@48028
   583
  from f y b have bfin: "finite {a. y a \<noteq> b}" by(simp add: finfun_default_def finite_finfun_default_aux)
Andreas@48028
   584
Andreas@48028
   585
  let ?g = "(\<lambda>a. Some (y a)) |` {a. y a \<noteq> b}"
Andreas@48028
   586
  from bfin have fing: "finite (dom ?g)" by auto
Andreas@48028
   587
  have bran: "b \<notin> ran ?g" by(auto simp add: ran_def restrict_map_def)
Andreas@48028
   588
  have yg: "y = map_default b ?g" by simp
Andreas@48028
   589
  have gg: "g = ?g" unfolding g
Andreas@48028
   590
  proof(rule the_equality)
Andreas@48028
   591
    from f y bfin show "?the f ?g"
Andreas@48028
   592
      by(auto)(simp add: restrict_map_def ran_def split: split_if_asm)
Andreas@48028
   593
  next
Andreas@48028
   594
    fix g'
Andreas@48028
   595
    assume "?the f g'"
Andreas@48028
   596
    hence fin': "finite (dom g')" and ran': "b \<notin> ran g'"
Andreas@48028
   597
      and eq: "Abs_finfun (map_default b ?g) = Abs_finfun (map_default b g')" using f yg by auto
Andreas@48028
   598
    from fin' fing have "map_default b ?g \<in> finfun" "map_default b g' \<in> finfun" by(blast intro: map_default_in_finfun)+
Andreas@48028
   599
    with eq have "map_default b ?g = map_default b g'" by simp
Andreas@48028
   600
    with fing bran fin' ran' show "g' = ?g" by(rule map_default_inject[OF disjI2[OF refl], THEN sym])
Andreas@48028
   601
  qed
Andreas@48028
   602
Andreas@48028
   603
  show ?thesis
Andreas@48028
   604
  proof(cases "b' = b")
Andreas@48028
   605
    case True
Andreas@48028
   606
    note b'b = True
Andreas@48028
   607
Andreas@48028
   608
    let ?g' = "(\<lambda>a. Some ((y(a' := b)) a)) |` {a. (y(a' := b)) a \<noteq> b}"
Andreas@48028
   609
    from bfin b'b have fing': "finite (dom ?g')"
Andreas@48028
   610
      by(auto simp add: Collect_conj_eq Collect_imp_eq intro: finite_subset)
Andreas@48028
   611
    have brang': "b \<notin> ran ?g'" by(auto simp add: ran_def restrict_map_def)
Andreas@48028
   612
Andreas@48028
   613
    let ?b' = "\<lambda>a. case ?g' a of None \<Rightarrow> b | Some b \<Rightarrow> b"
Andreas@48028
   614
    let ?b = "map_default b ?g"
Andreas@48028
   615
    from upd_left_comm upd_left_comm fing'
Andreas@48028
   616
    have "Finite_Set.fold (\<lambda>a. upd a (?b' a)) (cnst b) (dom ?g') = Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g')"
Andreas@48028
   617
      by(rule finite_rec_cong1)(auto simp add: restrict_map_def b'b b map_default_def)
Andreas@48028
   618
    also interpret gwf: comp_fun_commute "\<lambda>a. upd a (?b a)" by(rule upd_left_comm)
Andreas@48028
   619
    have "Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g') = upd a' b' (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g))"
Andreas@48028
   620
    proof(cases "y a' = b")
Andreas@48028
   621
      case True
Andreas@48028
   622
      with b'b have g': "?g' = ?g" by(auto simp add: restrict_map_def intro: ext)
Andreas@48028
   623
      from True have a'ndomg: "a' \<notin> dom ?g" by auto
Andreas@48028
   624
      from f b'b b show ?thesis unfolding g'
Andreas@48028
   625
        by(subst map_default_update_const[OF fing a'ndomg map_le_refl, symmetric]) simp
Andreas@48028
   626
    next
Andreas@48028
   627
      case False
Andreas@48028
   628
      hence domg: "dom ?g = insert a' (dom ?g')" by auto
Andreas@48028
   629
      from False b'b have a'ndomg': "a' \<notin> dom ?g'" by auto
Andreas@48028
   630
      have "Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (insert a' (dom ?g')) = 
Andreas@48028
   631
            upd a' (?b a') (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g'))"
Andreas@48028
   632
        using fing' a'ndomg' unfolding b'b by(rule gwf.fold_insert)
Andreas@48028
   633
      hence "upd a' b (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (insert a' (dom ?g'))) =
Andreas@48028
   634
             upd a' b (upd a' (?b a') (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g')))" by simp
Andreas@48028
   635
      also from b'b have g'leg: "?g' \<subseteq>\<^sub>m ?g" by(auto simp add: restrict_map_def map_le_def)
Andreas@48028
   636
      note map_default_update_twice[OF fing' a'ndomg' this, of b "?b a'" b]
Andreas@48028
   637
      also note map_default_update_const[OF fing' a'ndomg' g'leg, of b]
Andreas@48028
   638
      finally show ?thesis unfolding b'b domg[unfolded b'b] by(rule sym)
Andreas@48028
   639
    qed
Andreas@48028
   640
    also have "The (?the (f(\<^sup>f a' := b'))) = ?g'"
Andreas@48028
   641
    proof(rule the_equality)
Andreas@48028
   642
      from f y b b'b brang' fing' show "?the (f(\<^sup>f a' := b')) ?g'"
Andreas@48028
   643
        by(auto simp del: fun_upd_apply simp add: finfun_update_def)
Andreas@48028
   644
    next
Andreas@48028
   645
      fix g'
Andreas@48028
   646
      assume "?the (f(\<^sup>f a' := b')) g'"
Andreas@48028
   647
      hence fin': "finite (dom g')" and ran': "b \<notin> ran g'"
Andreas@48028
   648
        and eq: "f(\<^sup>f a' := b') = Abs_finfun (map_default b g')" 
Andreas@48028
   649
        by(auto simp del: fun_upd_apply)
Andreas@48028
   650
      from fin' fing' have "map_default b g' \<in> finfun" "map_default b ?g' \<in> finfun"
Andreas@48028
   651
        by(blast intro: map_default_in_finfun)+
Andreas@48028
   652
      with eq f b'b b have "map_default b ?g' = map_default b g'"
Andreas@48028
   653
        by(simp del: fun_upd_apply add: finfun_update_def)
Andreas@48028
   654
      with fing' brang' fin' ran' show "g' = ?g'"
Andreas@48028
   655
        by(rule map_default_inject[OF disjI2[OF refl], THEN sym])
Andreas@48028
   656
    qed
Andreas@48028
   657
    ultimately show ?thesis unfolding finfun_rec_def Let_def b gg[unfolded g b] using bfin b'b b
Andreas@48028
   658
      by(simp only: finfun_default_update_const map_default_def)
Andreas@48028
   659
  next
Andreas@48028
   660
    case False
Andreas@48028
   661
    note b'b = this
Andreas@48028
   662
    let ?g' = "?g(a' \<mapsto> b')"
Andreas@48028
   663
    let ?b' = "map_default b ?g'"
Andreas@48028
   664
    let ?b = "map_default b ?g"
Andreas@48028
   665
    from fing have fing': "finite (dom ?g')" by auto
Andreas@48028
   666
    from bran b'b have bnrang': "b \<notin> ran ?g'" by(auto simp add: ran_def)
Andreas@48028
   667
    have ffmg': "map_default b ?g' = y(a' := b')" by(auto intro: ext simp add: map_default_def restrict_map_def)
Andreas@48028
   668
    with f y have f_Abs: "f(\<^sup>f a' := b') = Abs_finfun (map_default b ?g')" by(auto simp add: finfun_update_def)
Andreas@48028
   669
    have g': "The (?the (f(\<^sup>f a' := b'))) = ?g'"
Andreas@48028
   670
    proof (rule the_equality)
Andreas@48028
   671
      from fing' bnrang' f_Abs show "?the (f(\<^sup>f a' := b')) ?g'" by(auto simp add: finfun_update_def restrict_map_def)
Andreas@48028
   672
    next
Andreas@48028
   673
      fix g' assume "?the (f(\<^sup>f a' := b')) g'"
Andreas@48028
   674
      hence f': "f(\<^sup>f a' := b') = Abs_finfun (map_default b g')"
Andreas@48028
   675
        and fin': "finite (dom g')" and brang': "b \<notin> ran g'" by auto
Andreas@48028
   676
      from fing' fin' have "map_default b ?g' \<in> finfun" "map_default b g' \<in> finfun"
Andreas@48028
   677
        by(auto intro: map_default_in_finfun)
Andreas@48028
   678
      with f' f_Abs have "map_default b g' = map_default b ?g'" by simp
Andreas@48028
   679
      with fin' brang' fing' bnrang' show "g' = ?g'"
Andreas@48028
   680
        by(rule map_default_inject[OF disjI2[OF refl]])
Andreas@48028
   681
    qed
Andreas@48028
   682
    have dom: "dom (((\<lambda>a. Some (y a)) |` {a. y a \<noteq> b})(a' \<mapsto> b')) = insert a' (dom ((\<lambda>a. Some (y a)) |` {a. y a \<noteq> b}))"
Andreas@48028
   683
      by auto
Andreas@48028
   684
    show ?thesis
Andreas@48028
   685
    proof(cases "y a' = b")
Andreas@48028
   686
      case True
Andreas@48028
   687
      hence a'ndomg: "a' \<notin> dom ?g" by auto
Andreas@48028
   688
      from f y b'b True have yff: "y = map_default b (?g' |` dom ?g)"
Andreas@48028
   689
        by(auto simp add: restrict_map_def map_default_def intro!: ext)
Andreas@48028
   690
      hence f': "f = Abs_finfun (map_default b (?g' |` dom ?g))" using f by simp
Andreas@48028
   691
      interpret g'wf: comp_fun_commute "\<lambda>a. upd a (?b' a)" by(rule upd_left_comm)
Andreas@48028
   692
      from upd_left_comm upd_left_comm fing
Andreas@48028
   693
      have "Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g) = Finite_Set.fold (\<lambda>a. upd a (?b' a)) (cnst b) (dom ?g)"
Andreas@48028
   694
        by(rule finite_rec_cong1)(auto simp add: restrict_map_def b'b True map_default_def)
Andreas@48028
   695
      thus ?thesis unfolding finfun_rec_def Let_def finfun_default_update_const b[symmetric]
Andreas@48028
   696
        unfolding g' g[symmetric] gg g'wf.fold_insert[OF fing a'ndomg, of "cnst b", folded dom]
Andreas@48028
   697
        by -(rule arg_cong2[where f="upd a'"], simp_all add: map_default_def)
Andreas@48028
   698
    next
Andreas@48028
   699
      case False
Andreas@48028
   700
      hence "insert a' (dom ?g) = dom ?g" by auto
Andreas@48028
   701
      moreover {
Andreas@48028
   702
        let ?g'' = "?g(a' := None)"
Andreas@48028
   703
        let ?b'' = "map_default b ?g''"
Andreas@48028
   704
        from False have domg: "dom ?g = insert a' (dom ?g'')" by auto
Andreas@48028
   705
        from False have a'ndomg'': "a' \<notin> dom ?g''" by auto
Andreas@48028
   706
        have fing'': "finite (dom ?g'')" by(rule finite_subset[OF _ fing]) auto
Andreas@48028
   707
        have bnrang'': "b \<notin> ran ?g''" by(auto simp add: ran_def restrict_map_def)
Andreas@48028
   708
        interpret gwf: comp_fun_commute "\<lambda>a. upd a (?b a)" by(rule upd_left_comm)
Andreas@48028
   709
        interpret g'wf: comp_fun_commute "\<lambda>a. upd a (?b' a)" by(rule upd_left_comm)
Andreas@48028
   710
        have "upd a' b' (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (insert a' (dom ?g''))) =
Andreas@48028
   711
              upd a' b' (upd a' (?b a') (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g'')))"
Andreas@48028
   712
          unfolding gwf.fold_insert[OF fing'' a'ndomg''] f ..
Andreas@48028
   713
        also have g''leg: "?g |` dom ?g'' \<subseteq>\<^sub>m ?g" by(auto simp add: map_le_def)
Andreas@48028
   714
        have "dom (?g |` dom ?g'') = dom ?g''" by auto
Andreas@48028
   715
        note map_default_update_twice[where d=b and f = "?g |` dom ?g''" and a=a' and d'="?b a'" and d''=b' and g="?g",
Andreas@48028
   716
                                     unfolded this, OF fing'' a'ndomg'' g''leg]
Andreas@48028
   717
        also have b': "b' = ?b' a'" by(auto simp add: map_default_def)
Andreas@48028
   718
        from upd_left_comm upd_left_comm fing''
Andreas@48028
   719
        have "Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g'') = Finite_Set.fold (\<lambda>a. upd a (?b' a)) (cnst b) (dom ?g'')"
Andreas@48028
   720
          by(rule finite_rec_cong1)(auto simp add: restrict_map_def b'b map_default_def)
Andreas@48028
   721
        with b' have "upd a' b' (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g'')) =
Andreas@48028
   722
                     upd a' (?b' a') (Finite_Set.fold (\<lambda>a. upd a (?b' a)) (cnst b) (dom ?g''))" by simp
Andreas@48028
   723
        also note g'wf.fold_insert[OF fing'' a'ndomg'', symmetric]
Andreas@48028
   724
        finally have "upd a' b' (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g)) =
Andreas@48028
   725
                   Finite_Set.fold (\<lambda>a. upd a (?b' a)) (cnst b) (dom ?g)"
Andreas@48028
   726
          unfolding domg . }
Andreas@48028
   727
      ultimately have "Finite_Set.fold (\<lambda>a. upd a (?b' a)) (cnst b) (insert a' (dom ?g)) =
Andreas@48028
   728
                    upd a' b' (Finite_Set.fold (\<lambda>a. upd a (?b a)) (cnst b) (dom ?g))" by simp
Andreas@48028
   729
      thus ?thesis unfolding finfun_rec_def Let_def finfun_default_update_const b[symmetric] g[symmetric] g' dom[symmetric]
Andreas@48028
   730
        using b'b gg by(simp add: map_default_insert)
Andreas@48028
   731
    qed
Andreas@48028
   732
  qed
Andreas@48028
   733
qed
Andreas@48028
   734
Andreas@48028
   735
end
Andreas@48028
   736
Andreas@48028
   737
locale finfun_rec_wf = finfun_rec_wf_aux + 
Andreas@48028
   738
  assumes const_update_all:
Andreas@48028
   739
  "finite (UNIV :: 'a set) \<Longrightarrow> Finite_Set.fold (\<lambda>a. upd a b') (cnst b) (UNIV :: 'a set) = cnst b'"
Andreas@48028
   740
begin
Andreas@48028
   741
Andreas@48030
   742
lemma finfun_rec_const [simp]: includes finfun shows
Andreas@48028
   743
  "finfun_rec cnst upd (\<lambda>\<^isup>f c) = cnst c"
Andreas@48028
   744
proof(cases "finite (UNIV :: 'a set)")
Andreas@48028
   745
  case False
Andreas@48034
   746
  hence "finfun_default ((\<lambda>\<^isup>f c) :: 'a \<Rightarrow>f 'b) = c" by(simp add: finfun_default_const)
Andreas@48028
   747
  moreover have "(THE g :: 'a \<rightharpoonup> 'b. (\<lambda>\<^isup>f c) = Abs_finfun (map_default c g) \<and> finite (dom g) \<and> c \<notin> ran g) = empty"
Andreas@48028
   748
  proof (rule the_equality)
Andreas@48028
   749
    show "(\<lambda>\<^isup>f c) = Abs_finfun (map_default c empty) \<and> finite (dom empty) \<and> c \<notin> ran empty"
Andreas@48028
   750
      by(auto simp add: finfun_const_def)
Andreas@48028
   751
  next
Andreas@48028
   752
    fix g :: "'a \<rightharpoonup> 'b"
Andreas@48028
   753
    assume "(\<lambda>\<^isup>f c) = Abs_finfun (map_default c g) \<and> finite (dom g) \<and> c \<notin> ran g"
Andreas@48028
   754
    hence g: "(\<lambda>\<^isup>f c) = Abs_finfun (map_default c g)" and fin: "finite (dom g)" and ran: "c \<notin> ran g" by blast+
Andreas@48028
   755
    from g map_default_in_finfun[OF fin, of c] have "map_default c g = (\<lambda>a. c)"
Andreas@48028
   756
      by(simp add: finfun_const_def)
Andreas@48028
   757
    moreover have "map_default c empty = (\<lambda>a. c)" by simp
Andreas@48028
   758
    ultimately show "g = empty" by-(rule map_default_inject[OF disjI2[OF refl] fin ran], auto)
Andreas@48028
   759
  qed
Andreas@48028
   760
  ultimately show ?thesis by(simp add: finfun_rec_def)
Andreas@48028
   761
next
Andreas@48028
   762
  case True
Andreas@48034
   763
  hence default: "finfun_default ((\<lambda>\<^isup>f c) :: 'a \<Rightarrow>f 'b) = undefined" by(simp add: finfun_default_const)
Andreas@48028
   764
  let ?the = "\<lambda>g :: 'a \<rightharpoonup> 'b. (\<lambda>\<^isup>f c) = Abs_finfun (map_default undefined g) \<and> finite (dom g) \<and> undefined \<notin> ran g"
Andreas@48028
   765
  show ?thesis
Andreas@48028
   766
  proof(cases "c = undefined")
Andreas@48028
   767
    case True
Andreas@48028
   768
    have the: "The ?the = empty"
Andreas@48028
   769
    proof (rule the_equality)
Andreas@48028
   770
      from True show "?the empty" by(auto simp add: finfun_const_def)
Andreas@48028
   771
    next
Andreas@48028
   772
      fix g'
Andreas@48028
   773
      assume "?the g'"
Andreas@48028
   774
      hence fg: "(\<lambda>\<^isup>f c) = Abs_finfun (map_default undefined g')"
Andreas@48028
   775
        and fin: "finite (dom g')" and g: "undefined \<notin> ran g'" by simp_all
Andreas@48028
   776
      from fin have "map_default undefined g' \<in> finfun" by(rule map_default_in_finfun)
Andreas@48028
   777
      with fg have "map_default undefined g' = (\<lambda>a. c)"
Andreas@48030
   778
        by(auto simp add: finfun_const_def intro: Abs_finfun_inject[THEN iffD1, symmetric])
Andreas@48028
   779
      with True show "g' = empty"
Andreas@48028
   780
        by -(rule map_default_inject(2)[OF _ fin g], auto)
Andreas@48028
   781
    qed
Andreas@48028
   782
    show ?thesis unfolding finfun_rec_def using `finite UNIV` True
Andreas@48028
   783
      unfolding Let_def the default by(simp)
Andreas@48028
   784
  next
Andreas@48028
   785
    case False
Andreas@48028
   786
    have the: "The ?the = (\<lambda>a :: 'a. Some c)"
Andreas@48028
   787
    proof (rule the_equality)
Andreas@48028
   788
      from False True show "?the (\<lambda>a :: 'a. Some c)"
Andreas@48028
   789
        by(auto simp add: map_default_def [abs_def] finfun_const_def dom_def ran_def)
Andreas@48028
   790
    next
Andreas@48028
   791
      fix g' :: "'a \<rightharpoonup> 'b"
Andreas@48028
   792
      assume "?the g'"
Andreas@48028
   793
      hence fg: "(\<lambda>\<^isup>f c) = Abs_finfun (map_default undefined g')"
Andreas@48028
   794
        and fin: "finite (dom g')" and g: "undefined \<notin> ran g'" by simp_all
Andreas@48028
   795
      from fin have "map_default undefined g' \<in> finfun" by(rule map_default_in_finfun)
Andreas@48028
   796
      with fg have "map_default undefined g' = (\<lambda>a. c)"
Andreas@48028
   797
        by(auto simp add: finfun_const_def intro: Abs_finfun_inject[THEN iffD1])
Andreas@48028
   798
      with True False show "g' = (\<lambda>a::'a. Some c)"
Andreas@48028
   799
        by - (rule map_default_inject(2)[OF _ fin g],
Andreas@48028
   800
          auto simp add: dom_def ran_def map_default_def [abs_def])
Andreas@48028
   801
    qed
Andreas@48028
   802
    show ?thesis unfolding finfun_rec_def using True False
Andreas@48028
   803
      unfolding Let_def the default by(simp add: dom_def map_default_def const_update_all)
Andreas@48028
   804
  qed
Andreas@48028
   805
qed
Andreas@48028
   806
Andreas@48028
   807
end
Andreas@48028
   808
Andreas@48028
   809
subsection {* Weak induction rule and case analysis for FinFuns *}
Andreas@48028
   810
Andreas@48028
   811
lemma finfun_weak_induct [consumes 0, case_names const update]:
Andreas@48028
   812
  assumes const: "\<And>b. P (\<lambda>\<^isup>f b)"
Andreas@48028
   813
  and update: "\<And>f a b. P f \<Longrightarrow> P (f(\<^sup>f a := b))"
Andreas@48028
   814
  shows "P x"
Andreas@48030
   815
  including finfun
Andreas@48028
   816
proof(induct x rule: Abs_finfun_induct)
Andreas@48028
   817
  case (Abs_finfun y)
Andreas@48028
   818
  then obtain b where "finite {a. y a \<noteq> b}" unfolding finfun_def by blast
Andreas@48028
   819
  thus ?case using `y \<in> finfun`
Andreas@48028
   820
  proof(induct "{a. y a \<noteq> b}" arbitrary: y rule: finite_induct)
Andreas@48028
   821
    case empty
Andreas@48028
   822
    hence "\<And>a. y a = b" by blast
Andreas@48028
   823
    hence "y = (\<lambda>a. b)" by(auto intro: ext)
Andreas@48028
   824
    hence "Abs_finfun y = finfun_const b" unfolding finfun_const_def by simp
Andreas@48028
   825
    thus ?case by(simp add: const)
Andreas@48028
   826
  next
Andreas@48028
   827
    case (insert a A)
Andreas@48028
   828
    note IH = `\<And>y. \<lbrakk> A = {a. y a \<noteq> b}; y \<in> finfun  \<rbrakk> \<Longrightarrow> P (Abs_finfun y)`
Andreas@48028
   829
    note y = `y \<in> finfun`
Andreas@48028
   830
    with `insert a A = {a. y a \<noteq> b}` `a \<notin> A`
Andreas@48028
   831
    have "A = {a'. (y(a := b)) a' \<noteq> b}" "y(a := b) \<in> finfun" by auto
Andreas@48028
   832
    from IH[OF this] have "P (finfun_update (Abs_finfun (y(a := b))) a (y a))" by(rule update)
Andreas@48028
   833
    thus ?case using y unfolding finfun_update_def by simp
Andreas@48028
   834
  qed
Andreas@48028
   835
qed
Andreas@48028
   836
Andreas@48028
   837
lemma finfun_exhaust_disj: "(\<exists>b. x = finfun_const b) \<or> (\<exists>f a b. x = finfun_update f a b)"
Andreas@48028
   838
by(induct x rule: finfun_weak_induct) blast+
Andreas@48028
   839
Andreas@48028
   840
lemma finfun_exhaust:
Andreas@48028
   841
  obtains b where "x = (\<lambda>\<^isup>f b)"
Andreas@48028
   842
        | f a b where "x = f(\<^sup>f a := b)"
Andreas@48028
   843
by(atomize_elim)(rule finfun_exhaust_disj)
Andreas@48028
   844
Andreas@48028
   845
lemma finfun_rec_unique:
Andreas@48034
   846
  fixes f :: "'a \<Rightarrow>f 'b \<Rightarrow> 'c"
Andreas@48028
   847
  assumes c: "\<And>c. f (\<lambda>\<^isup>f c) = cnst c"
Andreas@48028
   848
  and u: "\<And>g a b. f (g(\<^sup>f a := b)) = upd g a b (f g)"
Andreas@48028
   849
  and c': "\<And>c. f' (\<lambda>\<^isup>f c) = cnst c"
Andreas@48028
   850
  and u': "\<And>g a b. f' (g(\<^sup>f a := b)) = upd g a b (f' g)"
Andreas@48028
   851
  shows "f = f'"
Andreas@48028
   852
proof
Andreas@48034
   853
  fix g :: "'a \<Rightarrow>f 'b"
Andreas@48028
   854
  show "f g = f' g"
Andreas@48028
   855
    by(induct g rule: finfun_weak_induct)(auto simp add: c u c' u')
Andreas@48028
   856
qed
Andreas@48028
   857
Andreas@48028
   858
Andreas@48028
   859
subsection {* Function application *}
Andreas@48028
   860
Andreas@48029
   861
notation finfun_apply ("_\<^sub>f" [1000] 1000)
Andreas@48028
   862
Andreas@48028
   863
interpretation finfun_apply_aux: finfun_rec_wf_aux "\<lambda>b. b" "\<lambda>a' b c. if (a = a') then b else c"
Andreas@48028
   864
by(unfold_locales) auto
Andreas@48028
   865
Andreas@48028
   866
interpretation finfun_apply: finfun_rec_wf "\<lambda>b. b" "\<lambda>a' b c. if (a = a') then b else c"
Andreas@48028
   867
proof(unfold_locales)
Andreas@48028
   868
  fix b' b :: 'a
Andreas@48028
   869
  assume fin: "finite (UNIV :: 'b set)"
Andreas@48028
   870
  { fix A :: "'b set"
Andreas@48028
   871
    interpret comp_fun_commute "\<lambda>a'. If (a = a') b'" by(rule finfun_apply_aux.upd_left_comm)
Andreas@48028
   872
    from fin have "finite A" by(auto intro: finite_subset)
Andreas@48028
   873
    hence "Finite_Set.fold (\<lambda>a'. If (a = a') b') b A = (if a \<in> A then b' else b)"
Andreas@48028
   874
      by induct auto }
Andreas@48028
   875
  from this[of UNIV] show "Finite_Set.fold (\<lambda>a'. If (a = a') b') b UNIV = b'" by simp
Andreas@48028
   876
qed
Andreas@48028
   877
Andreas@48029
   878
lemma finfun_apply_def: "finfun_apply = (\<lambda>f a. finfun_rec (\<lambda>b. b) (\<lambda>a' b c. if (a = a') then b else c) f)"
Andreas@48029
   879
proof(rule finfun_rec_unique)
Andreas@48029
   880
  fix c show "finfun_apply (\<lambda>\<^isup>f c) = (\<lambda>a. c)" by(simp add: finfun_const.rep_eq)
Andreas@48029
   881
next
Andreas@48029
   882
  fix g a b show "finfun_apply g(\<^sup>f a := b) = (\<lambda>c. if c = a then b else finfun_apply g c)"
Andreas@48029
   883
    by(auto simp add: finfun_update_def fun_upd_finfun Abs_finfun_inverse finfun_apply)
Andreas@48029
   884
qed auto
Andreas@48028
   885
Andreas@48028
   886
lemma finfun_upd_apply: "f(\<^sup>fa := b)\<^sub>f a' = (if a = a' then b else f\<^sub>f a')"
Andreas@48028
   887
  and finfun_upd_apply_code [code]: "(finfun_update_code f a b)\<^sub>f a' = (if a = a' then b else f\<^sub>f a')"
Andreas@48028
   888
by(simp_all add: finfun_apply_def)
Andreas@48028
   889
Andreas@48029
   890
lemma finfun_const_apply [simp, code]: "(\<lambda>\<^isup>f b)\<^sub>f a = b"
Andreas@48029
   891
by(simp add: finfun_apply_def)
Andreas@48029
   892
Andreas@48028
   893
lemma finfun_upd_apply_same [simp]:
Andreas@48028
   894
  "f(\<^sup>fa := b)\<^sub>f a = b"
Andreas@48028
   895
by(simp add: finfun_upd_apply)
Andreas@48028
   896
Andreas@48028
   897
lemma finfun_upd_apply_other [simp]:
Andreas@48028
   898
  "a \<noteq> a' \<Longrightarrow> f(\<^sup>fa := b)\<^sub>f a' = f\<^sub>f a'"
Andreas@48028
   899
by(simp add: finfun_upd_apply)
Andreas@48028
   900
Andreas@48028
   901
lemma finfun_ext: "(\<And>a. f\<^sub>f a = g\<^sub>f a) \<Longrightarrow> f = g"
Andreas@48029
   902
by(auto simp add: finfun_apply_inject[symmetric] simp del: finfun_apply_inject)
Andreas@48028
   903
Andreas@48028
   904
lemma expand_finfun_eq: "(f = g) = (f\<^sub>f = g\<^sub>f)"
Andreas@48028
   905
by(auto intro: finfun_ext)
Andreas@48028
   906
Andreas@48028
   907
lemma finfun_const_inject [simp]: "(\<lambda>\<^isup>f b) = (\<lambda>\<^isup>f b') \<equiv> b = b'"
Andreas@48028
   908
by(simp add: expand_finfun_eq fun_eq_iff)
Andreas@48028
   909
Andreas@48028
   910
lemma finfun_const_eq_update:
Andreas@48028
   911
  "((\<lambda>\<^isup>f b) = f(\<^sup>f a := b')) = (b = b' \<and> (\<forall>a'. a \<noteq> a' \<longrightarrow> f\<^sub>f a' = b))"
Andreas@48028
   912
by(auto simp add: expand_finfun_eq fun_eq_iff finfun_upd_apply)
Andreas@48028
   913
Andreas@48028
   914
subsection {* Function composition *}
Andreas@48028
   915
Andreas@48034
   916
definition finfun_comp :: "('a \<Rightarrow> 'b) \<Rightarrow> 'c \<Rightarrow>f 'a \<Rightarrow> 'c \<Rightarrow>f 'b" (infixr "\<circ>\<^isub>f" 55)
Andreas@48028
   917
where [code del]: "g \<circ>\<^isub>f f  = finfun_rec (\<lambda>b. (\<lambda>\<^isup>f g b)) (\<lambda>a b c. c(\<^sup>f a := g b)) f"
Andreas@48028
   918
Andreas@48028
   919
interpretation finfun_comp_aux: finfun_rec_wf_aux "(\<lambda>b. (\<lambda>\<^isup>f g b))" "(\<lambda>a b c. c(\<^sup>f a := g b))"
Andreas@48028
   920
by(unfold_locales)(auto simp add: finfun_upd_apply intro: finfun_ext)
Andreas@48028
   921
Andreas@48028
   922
interpretation finfun_comp: finfun_rec_wf "(\<lambda>b. (\<lambda>\<^isup>f g b))" "(\<lambda>a b c. c(\<^sup>f a := g b))"
Andreas@48028
   923
proof
Andreas@48028
   924
  fix b' b :: 'a
Andreas@48028
   925
  assume fin: "finite (UNIV :: 'c set)"
Andreas@48028
   926
  { fix A :: "'c set"
Andreas@48028
   927
    from fin have "finite A" by(auto intro: finite_subset)
Andreas@48028
   928
    hence "Finite_Set.fold (\<lambda>(a :: 'c) c. c(\<^sup>f a := g b')) (\<lambda>\<^isup>f g b) A =
Andreas@48028
   929
      Abs_finfun (\<lambda>a. if a \<in> A then g b' else g b)"
Andreas@48028
   930
      by induct (simp_all add: finfun_const_def, auto simp add: finfun_update_def Abs_finfun_inverse_finite fun_upd_def Abs_finfun_inject_finite fun_eq_iff fin) }
Andreas@48028
   931
  from this[of UNIV] show "Finite_Set.fold (\<lambda>(a :: 'c) c. c(\<^sup>f a := g b')) (\<lambda>\<^isup>f g b) UNIV = (\<lambda>\<^isup>f g b')"
Andreas@48028
   932
    by(simp add: finfun_const_def)
Andreas@48028
   933
qed
Andreas@48028
   934
Andreas@48028
   935
lemma finfun_comp_const [simp, code]:
Andreas@48028
   936
  "g \<circ>\<^isub>f (\<lambda>\<^isup>f c) = (\<lambda>\<^isup>f g c)"
Andreas@48028
   937
by(simp add: finfun_comp_def)
Andreas@48028
   938
Andreas@48028
   939
lemma finfun_comp_update [simp]: "g \<circ>\<^isub>f (f(\<^sup>f a := b)) = (g \<circ>\<^isub>f f)(\<^sup>f a := g b)"
Andreas@48028
   940
  and finfun_comp_update_code [code]: "g \<circ>\<^isub>f (finfun_update_code f a b) = finfun_update_code (g \<circ>\<^isub>f f) a (g b)"
Andreas@48028
   941
by(simp_all add: finfun_comp_def)
Andreas@48028
   942
Andreas@48028
   943
lemma finfun_comp_apply [simp]:
Andreas@48028
   944
  "(g \<circ>\<^isub>f f)\<^sub>f = g \<circ> f\<^sub>f"
Andreas@48028
   945
by(induct f rule: finfun_weak_induct)(auto simp add: finfun_upd_apply intro: ext)
Andreas@48028
   946
Andreas@48028
   947
lemma finfun_comp_comp_collapse [simp]: "f \<circ>\<^isub>f g \<circ>\<^isub>f h = (f o g) \<circ>\<^isub>f h"
Andreas@48028
   948
by(induct h rule: finfun_weak_induct) simp_all
Andreas@48028
   949
Andreas@48028
   950
lemma finfun_comp_const1 [simp]: "(\<lambda>x. c) \<circ>\<^isub>f f = (\<lambda>\<^isup>f c)"
Andreas@48028
   951
by(induct f rule: finfun_weak_induct)(auto intro: finfun_ext simp add: finfun_upd_apply)
Andreas@48028
   952
Andreas@48028
   953
lemma finfun_comp_id1 [simp]: "(\<lambda>x. x) \<circ>\<^isub>f f = f" "id \<circ>\<^isub>f f = f"
Andreas@48028
   954
by(induct f rule: finfun_weak_induct) auto
Andreas@48028
   955
Andreas@48028
   956
lemma finfun_comp_conv_comp: "g \<circ>\<^isub>f f = Abs_finfun (g \<circ> finfun_apply f)"
Andreas@48030
   957
  including finfun
Andreas@48028
   958
proof -
Andreas@48028
   959
  have "(\<lambda>f. g \<circ>\<^isub>f f) = (\<lambda>f. Abs_finfun (g \<circ> finfun_apply f))"
Andreas@48028
   960
  proof(rule finfun_rec_unique)
Andreas@48028
   961
    { fix c show "Abs_finfun (g \<circ> (\<lambda>\<^isup>f c)\<^sub>f) = (\<lambda>\<^isup>f g c)"
Andreas@48028
   962
        by(simp add: finfun_comp_def o_def)(simp add: finfun_const_def) }
Andreas@48028
   963
    { fix g' a b show "Abs_finfun (g \<circ> g'(\<^sup>f a := b)\<^sub>f) = (Abs_finfun (g \<circ> g'\<^sub>f))(\<^sup>f a := g b)"
Andreas@48028
   964
      proof -
Andreas@48028
   965
        obtain y where y: "y \<in> finfun" and g': "g' = Abs_finfun y" by(cases g')
Andreas@48029
   966
        moreover hence "(g \<circ> g'\<^sub>f) \<in> finfun" by(simp add: finfun_left_compose)
Andreas@48028
   967
        moreover have "g \<circ> y(a := b) = (g \<circ> y)(a := g b)" by(auto intro: ext)
Andreas@48029
   968
        ultimately show ?thesis by(simp add: finfun_comp_def finfun_update_def)
Andreas@48028
   969
      qed }
Andreas@48028
   970
  qed auto
Andreas@48028
   971
  thus ?thesis by(auto simp add: fun_eq_iff)
Andreas@48028
   972
qed
Andreas@48028
   973
Andreas@48034
   974
definition finfun_comp2 :: "'b \<Rightarrow>f 'c \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow>f 'c" (infixr "\<^sub>f\<circ>" 55)
Andreas@48029
   975
where [code del]: "finfun_comp2 g f = Abs_finfun (finfun_apply g \<circ> f)"
Andreas@48028
   976
Andreas@48028
   977
lemma finfun_comp2_const [code, simp]: "finfun_comp2 (\<lambda>\<^isup>f c) f = (\<lambda>\<^isup>f c)"
Andreas@48030
   978
  including finfun
Andreas@48028
   979
by(simp add: finfun_comp2_def finfun_const_def comp_def)
Andreas@48028
   980
Andreas@48028
   981
lemma finfun_comp2_update:
Andreas@48030
   982
  includes finfun
Andreas@48028
   983
  assumes inj: "inj f"
Andreas@48028
   984
  shows "finfun_comp2 (g(\<^sup>f b := c)) f = (if b \<in> range f then (finfun_comp2 g f)(\<^sup>f inv f b := c) else finfun_comp2 g f)"
Andreas@48028
   985
proof(cases "b \<in> range f")
Andreas@48028
   986
  case True
Andreas@48029
   987
  from inj have "\<And>x. (finfun_apply g)(f x := c) \<circ> f = (finfun_apply g \<circ> f)(x := c)" by(auto intro!: ext dest: injD)
Andreas@48028
   988
  with inj True show ?thesis by(auto simp add: finfun_comp2_def finfun_update_def finfun_right_compose)
Andreas@48028
   989
next
Andreas@48028
   990
  case False
Andreas@48029
   991
  hence "(finfun_apply g)(b := c) \<circ> f = finfun_apply g \<circ> f" by(auto simp add: fun_eq_iff)
Andreas@48028
   992
  with False show ?thesis by(auto simp add: finfun_comp2_def finfun_update_def)
Andreas@48028
   993
qed
Andreas@48028
   994
Andreas@48028
   995
subsection {* Universal quantification *}
Andreas@48028
   996
Andreas@48034
   997
definition finfun_All_except :: "'a list \<Rightarrow> 'a \<Rightarrow>f bool \<Rightarrow> bool"
Andreas@48028
   998
where [code del]: "finfun_All_except A P \<equiv> \<forall>a. a \<in> set A \<or> P\<^sub>f a"
Andreas@48028
   999
Andreas@48028
  1000
lemma finfun_All_except_const: "finfun_All_except A (\<lambda>\<^isup>f b) \<longleftrightarrow> b \<or> set A = UNIV"
Andreas@48028
  1001
by(auto simp add: finfun_All_except_def)
Andreas@48028
  1002
Andreas@48028
  1003
lemma finfun_All_except_const_finfun_UNIV_code [code]:
Andreas@48028
  1004
  "finfun_All_except A (\<lambda>\<^isup>f b) = (b \<or> is_list_UNIV A)"
Andreas@48028
  1005
by(simp add: finfun_All_except_const is_list_UNIV_iff)
Andreas@48028
  1006
Andreas@48028
  1007
lemma finfun_All_except_update: 
Andreas@48028
  1008
  "finfun_All_except A f(\<^sup>f a := b) = ((a \<in> set A \<or> b) \<and> finfun_All_except (a # A) f)"
Andreas@48028
  1009
by(fastforce simp add: finfun_All_except_def finfun_upd_apply)
Andreas@48028
  1010
Andreas@48028
  1011
lemma finfun_All_except_update_code [code]:
Andreas@48028
  1012
  fixes a :: "'a :: card_UNIV"
Andreas@48028
  1013
  shows "finfun_All_except A (finfun_update_code f a b) = ((a \<in> set A \<or> b) \<and> finfun_All_except (a # A) f)"
Andreas@48028
  1014
by(simp add: finfun_All_except_update)
Andreas@48028
  1015
Andreas@48034
  1016
definition finfun_All :: "'a \<Rightarrow>f bool \<Rightarrow> bool"
Andreas@48028
  1017
where "finfun_All = finfun_All_except []"
Andreas@48028
  1018
Andreas@48028
  1019
lemma finfun_All_const [simp]: "finfun_All (\<lambda>\<^isup>f b) = b"
Andreas@48028
  1020
by(simp add: finfun_All_def finfun_All_except_def)
Andreas@48028
  1021
Andreas@48028
  1022
lemma finfun_All_update: "finfun_All f(\<^sup>f a := b) = (b \<and> finfun_All_except [a] f)"
Andreas@48028
  1023
by(simp add: finfun_All_def finfun_All_except_update)
Andreas@48028
  1024
Andreas@48028
  1025
lemma finfun_All_All: "finfun_All P = All P\<^sub>f"
Andreas@48028
  1026
by(simp add: finfun_All_def finfun_All_except_def)
Andreas@48028
  1027
Andreas@48028
  1028
Andreas@48034
  1029
definition finfun_Ex :: "'a \<Rightarrow>f bool \<Rightarrow> bool"
Andreas@48028
  1030
where "finfun_Ex P = Not (finfun_All (Not \<circ>\<^isub>f P))"
Andreas@48028
  1031
Andreas@48028
  1032
lemma finfun_Ex_Ex: "finfun_Ex P = Ex P\<^sub>f"
Andreas@48028
  1033
unfolding finfun_Ex_def finfun_All_All by simp
Andreas@48028
  1034
Andreas@48028
  1035
lemma finfun_Ex_const [simp]: "finfun_Ex (\<lambda>\<^isup>f b) = b"
Andreas@48028
  1036
by(simp add: finfun_Ex_def)
Andreas@48028
  1037
Andreas@48028
  1038
Andreas@48028
  1039
subsection {* A diagonal operator for FinFuns *}
Andreas@48028
  1040
Andreas@48034
  1041
definition finfun_Diag :: "'a \<Rightarrow>f 'b \<Rightarrow> 'a \<Rightarrow>f 'c \<Rightarrow> 'a \<Rightarrow>f ('b \<times> 'c)" ("(1'(_,/ _')\<^sup>f)" [0, 0] 1000)
Andreas@48028
  1042
where [code del]: "finfun_Diag f g = finfun_rec (\<lambda>b. Pair b \<circ>\<^isub>f g) (\<lambda>a b c. c(\<^sup>f a := (b, g\<^sub>f a))) f"
Andreas@48028
  1043
Andreas@48028
  1044
interpretation finfun_Diag_aux: finfun_rec_wf_aux "\<lambda>b. Pair b \<circ>\<^isub>f g" "\<lambda>a b c. c(\<^sup>f a := (b, g\<^sub>f a))"
Andreas@48028
  1045
by(unfold_locales)(simp_all add: expand_finfun_eq fun_eq_iff finfun_upd_apply)
Andreas@48028
  1046
Andreas@48028
  1047
interpretation finfun_Diag: finfun_rec_wf "\<lambda>b. Pair b \<circ>\<^isub>f g" "\<lambda>a b c. c(\<^sup>f a := (b, g\<^sub>f a))"
Andreas@48028
  1048
proof
Andreas@48028
  1049
  fix b' b :: 'a
Andreas@48028
  1050
  assume fin: "finite (UNIV :: 'c set)"
Andreas@48028
  1051
  { fix A :: "'c set"
Andreas@48028
  1052
    interpret comp_fun_commute "\<lambda>a c. c(\<^sup>f a := (b', g\<^sub>f a))" by(rule finfun_Diag_aux.upd_left_comm)
Andreas@48028
  1053
    from fin have "finite A" by(auto intro: finite_subset)
Andreas@48028
  1054
    hence "Finite_Set.fold (\<lambda>a c. c(\<^sup>f a := (b', g\<^sub>f a))) (Pair b \<circ>\<^isub>f g) A =
Andreas@48028
  1055
      Abs_finfun (\<lambda>a. (if a \<in> A then b' else b, g\<^sub>f a))"
Andreas@48028
  1056
      by(induct)(simp_all add: finfun_const_def finfun_comp_conv_comp o_def,
Andreas@48028
  1057
                 auto simp add: finfun_update_def Abs_finfun_inverse_finite fun_upd_def Abs_finfun_inject_finite fun_eq_iff fin) }
Andreas@48028
  1058
  from this[of UNIV] show "Finite_Set.fold (\<lambda>a c. c(\<^sup>f a := (b', g\<^sub>f a))) (Pair b \<circ>\<^isub>f g) UNIV = Pair b' \<circ>\<^isub>f g"
Andreas@48028
  1059
    by(simp add: finfun_const_def finfun_comp_conv_comp o_def)
Andreas@48028
  1060
qed
Andreas@48028
  1061
Andreas@48028
  1062
lemma finfun_Diag_const1: "(\<lambda>\<^isup>f b, g)\<^sup>f = Pair b \<circ>\<^isub>f g"
Andreas@48028
  1063
by(simp add: finfun_Diag_def)
Andreas@48028
  1064
Andreas@48028
  1065
text {*
Andreas@48028
  1066
  Do not use @{thm finfun_Diag_const1} for the code generator because @{term "Pair b"} is injective, i.e. if @{term g} is free of redundant updates, there is no need to check for redundant updates as is done for @{text "\<circ>\<^isub>f"}.
Andreas@48028
  1067
*}
Andreas@48028
  1068
Andreas@48028
  1069
lemma finfun_Diag_const_code [code]:
Andreas@48028
  1070
  "(\<lambda>\<^isup>f b, \<lambda>\<^isup>f c)\<^sup>f = (\<lambda>\<^isup>f (b, c))"
Andreas@48028
  1071
  "(\<lambda>\<^isup>f b, g(\<^sup>fc a := c))\<^sup>f = (\<lambda>\<^isup>f b, g)\<^sup>f(\<^sup>fc a := (b, c))"
Andreas@48028
  1072
by(simp_all add: finfun_Diag_const1)
Andreas@48028
  1073
Andreas@48028
  1074
lemma finfun_Diag_update1: "(f(\<^sup>f a := b), g)\<^sup>f = (f, g)\<^sup>f(\<^sup>f a := (b, g\<^sub>f a))"
Andreas@48028
  1075
  and finfun_Diag_update1_code [code]: "(finfun_update_code f a b, g)\<^sup>f = (f, g)\<^sup>f(\<^sup>f a := (b, g\<^sub>f a))"
Andreas@48028
  1076
by(simp_all add: finfun_Diag_def)
Andreas@48028
  1077
Andreas@48028
  1078
lemma finfun_Diag_const2: "(f, \<lambda>\<^isup>f c)\<^sup>f = (\<lambda>b. (b, c)) \<circ>\<^isub>f f"
Andreas@48028
  1079
by(induct f rule: finfun_weak_induct)(auto intro!: finfun_ext simp add: finfun_upd_apply finfun_Diag_const1 finfun_Diag_update1)
Andreas@48028
  1080
Andreas@48028
  1081
lemma finfun_Diag_update2: "(f, g(\<^sup>f a := c))\<^sup>f = (f, g)\<^sup>f(\<^sup>f a := (f\<^sub>f a, c))"
Andreas@48028
  1082
by(induct f rule: finfun_weak_induct)(auto intro!: finfun_ext simp add: finfun_upd_apply finfun_Diag_const1 finfun_Diag_update1)
Andreas@48028
  1083
Andreas@48028
  1084
lemma finfun_Diag_const_const [simp]: "(\<lambda>\<^isup>f b, \<lambda>\<^isup>f c)\<^sup>f = (\<lambda>\<^isup>f (b, c))"
Andreas@48028
  1085
by(simp add: finfun_Diag_const1)
Andreas@48028
  1086
Andreas@48028
  1087
lemma finfun_Diag_const_update:
Andreas@48028
  1088
  "(\<lambda>\<^isup>f b, g(\<^sup>f a := c))\<^sup>f = (\<lambda>\<^isup>f b, g)\<^sup>f(\<^sup>f a := (b, c))"
Andreas@48028
  1089
by(simp add: finfun_Diag_const1)
Andreas@48028
  1090
Andreas@48028
  1091
lemma finfun_Diag_update_const:
Andreas@48028
  1092
  "(f(\<^sup>f a := b), \<lambda>\<^isup>f c)\<^sup>f = (f, \<lambda>\<^isup>f c)\<^sup>f(\<^sup>f a := (b, c))"
Andreas@48028
  1093
by(simp add: finfun_Diag_def)
Andreas@48028
  1094
Andreas@48028
  1095
lemma finfun_Diag_update_update:
Andreas@48028
  1096
  "(f(\<^sup>f a := b), g(\<^sup>f a' := c))\<^sup>f = (if a = a' then (f, g)\<^sup>f(\<^sup>f a := (b, c)) else (f, g)\<^sup>f(\<^sup>f a := (b, g\<^sub>f a))(\<^sup>f a' := (f\<^sub>f a', c)))"
Andreas@48028
  1097
by(auto simp add: finfun_Diag_update1 finfun_Diag_update2)
Andreas@48028
  1098
Andreas@48028
  1099
lemma finfun_Diag_apply [simp]: "(f, g)\<^sup>f\<^sub>f = (\<lambda>x. (f\<^sub>f x, g\<^sub>f x))"
Andreas@48028
  1100
by(induct f rule: finfun_weak_induct)(auto simp add: finfun_Diag_const1 finfun_Diag_update1 finfun_upd_apply intro: ext)
Andreas@48028
  1101
Andreas@48028
  1102
lemma finfun_Diag_conv_Abs_finfun:
Andreas@48029
  1103
  "(f, g)\<^sup>f = Abs_finfun ((\<lambda>x. (finfun_apply f x, finfun_apply g x)))"
Andreas@48030
  1104
  including finfun
Andreas@48028
  1105
proof -
Andreas@48034
  1106
  have "(\<lambda>f :: 'a \<Rightarrow>f 'b. (f, g)\<^sup>f) = (\<lambda>f. Abs_finfun ((\<lambda>x. (finfun_apply f x, finfun_apply g x))))"
Andreas@48028
  1107
  proof(rule finfun_rec_unique)
Andreas@48029
  1108
    { fix c show "Abs_finfun (\<lambda>x. (finfun_apply (\<lambda>\<^isup>f c) x, finfun_apply g x)) = Pair c \<circ>\<^isub>f g"
Andreas@48029
  1109
        by(simp add: finfun_comp_conv_comp o_def finfun_const_def) }
Andreas@48028
  1110
    { fix g' a b
Andreas@48029
  1111
      show "Abs_finfun (\<lambda>x. (finfun_apply g'(\<^sup>f a := b) x, finfun_apply g x)) =
Andreas@48029
  1112
            (Abs_finfun (\<lambda>x. (finfun_apply g' x, finfun_apply g x)))(\<^sup>f a := (b, g\<^sub>f a))"
Andreas@48029
  1113
        by(auto simp add: finfun_update_def fun_eq_iff simp del: fun_upd_apply) simp }
Andreas@48028
  1114
  qed(simp_all add: finfun_Diag_const1 finfun_Diag_update1)
Andreas@48028
  1115
  thus ?thesis by(auto simp add: fun_eq_iff)
Andreas@48028
  1116
qed
Andreas@48028
  1117
Andreas@48028
  1118
lemma finfun_Diag_eq: "(f, g)\<^sup>f = (f', g')\<^sup>f \<longleftrightarrow> f = f' \<and> g = g'"
Andreas@48028
  1119
by(auto simp add: expand_finfun_eq fun_eq_iff)
Andreas@48028
  1120
Andreas@48034
  1121
definition finfun_fst :: "'a \<Rightarrow>f ('b \<times> 'c) \<Rightarrow> 'a \<Rightarrow>f 'b"
Andreas@48028
  1122
where [code]: "finfun_fst f = fst \<circ>\<^isub>f f"
Andreas@48028
  1123
Andreas@48028
  1124
lemma finfun_fst_const: "finfun_fst (\<lambda>\<^isup>f bc) = (\<lambda>\<^isup>f fst bc)"
Andreas@48028
  1125
by(simp add: finfun_fst_def)
Andreas@48028
  1126
Andreas@48028
  1127
lemma finfun_fst_update: "finfun_fst (f(\<^sup>f a := bc)) = (finfun_fst f)(\<^sup>f a := fst bc)"
Andreas@48028
  1128
  and finfun_fst_update_code: "finfun_fst (finfun_update_code f a bc) = (finfun_fst f)(\<^sup>f a := fst bc)"
Andreas@48028
  1129
by(simp_all add: finfun_fst_def)
Andreas@48028
  1130
Andreas@48028
  1131
lemma finfun_fst_comp_conv: "finfun_fst (f \<circ>\<^isub>f g) = (fst \<circ> f) \<circ>\<^isub>f g"
Andreas@48028
  1132
by(simp add: finfun_fst_def)
Andreas@48028
  1133
Andreas@48028
  1134
lemma finfun_fst_conv [simp]: "finfun_fst (f, g)\<^sup>f = f"
Andreas@48028
  1135
by(induct f rule: finfun_weak_induct)(simp_all add: finfun_Diag_const1 finfun_fst_comp_conv o_def finfun_Diag_update1 finfun_fst_update)
Andreas@48028
  1136
Andreas@48029
  1137
lemma finfun_fst_conv_Abs_finfun: "finfun_fst = (\<lambda>f. Abs_finfun (fst o finfun_apply f))"
Andreas@48029
  1138
by(simp add: finfun_fst_def [abs_def] finfun_comp_conv_comp)
Andreas@48028
  1139
Andreas@48028
  1140
Andreas@48034
  1141
definition finfun_snd :: "'a \<Rightarrow>f ('b \<times> 'c) \<Rightarrow> 'a \<Rightarrow>f 'c"
Andreas@48028
  1142
where [code]: "finfun_snd f = snd \<circ>\<^isub>f f"
Andreas@48028
  1143
Andreas@48028
  1144
lemma finfun_snd_const: "finfun_snd (\<lambda>\<^isup>f bc) = (\<lambda>\<^isup>f snd bc)"
Andreas@48028
  1145
by(simp add: finfun_snd_def)
Andreas@48028
  1146
Andreas@48028
  1147
lemma finfun_snd_update: "finfun_snd (f(\<^sup>f a := bc)) = (finfun_snd f)(\<^sup>f a := snd bc)"
Andreas@48028
  1148
  and finfun_snd_update_code [code]: "finfun_snd (finfun_update_code f a bc) = (finfun_snd f)(\<^sup>f a := snd bc)"
Andreas@48028
  1149
by(simp_all add: finfun_snd_def)
Andreas@48028
  1150
Andreas@48028
  1151
lemma finfun_snd_comp_conv: "finfun_snd (f \<circ>\<^isub>f g) = (snd \<circ> f) \<circ>\<^isub>f g"
Andreas@48028
  1152
by(simp add: finfun_snd_def)
Andreas@48028
  1153
Andreas@48028
  1154
lemma finfun_snd_conv [simp]: "finfun_snd (f, g)\<^sup>f = g"
Andreas@48028
  1155
apply(induct f rule: finfun_weak_induct)
Andreas@48028
  1156
apply(auto simp add: finfun_Diag_const1 finfun_snd_comp_conv o_def finfun_Diag_update1 finfun_snd_update finfun_upd_apply intro: finfun_ext)
Andreas@48028
  1157
done
Andreas@48028
  1158
Andreas@48029
  1159
lemma finfun_snd_conv_Abs_finfun: "finfun_snd = (\<lambda>f. Abs_finfun (snd o finfun_apply f))"
Andreas@48029
  1160
by(simp add: finfun_snd_def [abs_def] finfun_comp_conv_comp)
Andreas@48028
  1161
Andreas@48028
  1162
lemma finfun_Diag_collapse [simp]: "(finfun_fst f, finfun_snd f)\<^sup>f = f"
Andreas@48028
  1163
by(induct f rule: finfun_weak_induct)(simp_all add: finfun_fst_const finfun_snd_const finfun_fst_update finfun_snd_update finfun_Diag_update_update)
Andreas@48028
  1164
Andreas@48028
  1165
subsection {* Currying for FinFuns *}
Andreas@48028
  1166
Andreas@48034
  1167
definition finfun_curry :: "('a \<times> 'b) \<Rightarrow>f 'c \<Rightarrow> 'a \<Rightarrow>f 'b \<Rightarrow>f 'c"
Andreas@48028
  1168
where [code del]: "finfun_curry = finfun_rec (finfun_const \<circ> finfun_const) (\<lambda>(a, b) c f. f(\<^sup>f a := (f\<^sub>f a)(\<^sup>f b := c)))"
Andreas@48028
  1169
Andreas@48028
  1170
interpretation finfun_curry_aux: finfun_rec_wf_aux "finfun_const \<circ> finfun_const" "\<lambda>(a, b) c f. f(\<^sup>f a := (f\<^sub>f a)(\<^sup>f b := c))"
Andreas@48028
  1171
apply(unfold_locales)
Andreas@48028
  1172
apply(auto simp add: split_def finfun_update_twist finfun_upd_apply split_paired_all finfun_update_const_same)
Andreas@48028
  1173
done
Andreas@48028
  1174
Andreas@48028
  1175
interpretation finfun_curry: finfun_rec_wf "finfun_const \<circ> finfun_const" "\<lambda>(a, b) c f. f(\<^sup>f a := (f\<^sub>f a)(\<^sup>f b := c))"
Andreas@48028
  1176
proof(unfold_locales)
Andreas@48028
  1177
  fix b' b :: 'b
Andreas@48028
  1178
  assume fin: "finite (UNIV :: ('c \<times> 'a) set)"
Andreas@48028
  1179
  hence fin1: "finite (UNIV :: 'c set)" and fin2: "finite (UNIV :: 'a set)"
Andreas@48028
  1180
    unfolding UNIV_Times_UNIV[symmetric]
Andreas@48028
  1181
    by(fastforce dest: finite_cartesian_productD1 finite_cartesian_productD2)+
Andreas@48028
  1182
  note [simp] = Abs_finfun_inverse_finite[OF fin] Abs_finfun_inverse_finite[OF fin1] Abs_finfun_inverse_finite[OF fin2]
Andreas@48028
  1183
  { fix A :: "('c \<times> 'a) set"
Andreas@48028
  1184
    interpret comp_fun_commute "\<lambda>a :: 'c \<times> 'a. (\<lambda>(a, b) c f. f(\<^sup>f a := (f\<^sub>f a)(\<^sup>f b := c))) a b'"
Andreas@48028
  1185
      by(rule finfun_curry_aux.upd_left_comm)
Andreas@48028
  1186
    from fin have "finite A" by(auto intro: finite_subset)
Andreas@48028
  1187
    hence "Finite_Set.fold (\<lambda>a :: 'c \<times> 'a. (\<lambda>(a, b) c f. f(\<^sup>f a := (f\<^sub>f a)(\<^sup>f b := c))) a b') ((finfun_const \<circ> finfun_const) b) A = Abs_finfun (\<lambda>a. Abs_finfun (\<lambda>b''. if (a, b'') \<in> A then b' else b))"
Andreas@48029
  1188
      by induct (simp_all, auto simp add: finfun_update_def finfun_const_def split_def intro!: arg_cong[where f="Abs_finfun"] ext) }
Andreas@48028
  1189
  from this[of UNIV]
Andreas@48028
  1190
  show "Finite_Set.fold (\<lambda>a :: 'c \<times> 'a. (\<lambda>(a, b) c f. f(\<^sup>f a := (f\<^sub>f a)(\<^sup>f b := c))) a b') ((finfun_const \<circ> finfun_const) b) UNIV = (finfun_const \<circ> finfun_const) b'"
Andreas@48028
  1191
    by(simp add: finfun_const_def)
Andreas@48028
  1192
qed
Andreas@48028
  1193
Andreas@48028
  1194
lemma finfun_curry_const [simp, code]: "finfun_curry (\<lambda>\<^isup>f c) = (\<lambda>\<^isup>f \<lambda>\<^isup>f c)"
Andreas@48028
  1195
by(simp add: finfun_curry_def)
Andreas@48028
  1196
Andreas@48028
  1197
lemma finfun_curry_update [simp]:
Andreas@48028
  1198
  "finfun_curry (f(\<^sup>f (a, b) := c)) = (finfun_curry f)(\<^sup>f a := ((finfun_curry f)\<^sub>f a)(\<^sup>f b := c))"
Andreas@48028
  1199
  and finfun_curry_update_code [code]:
Andreas@48028
  1200
  "finfun_curry (f(\<^sup>fc (a, b) := c)) = (finfun_curry f)(\<^sup>f a := ((finfun_curry f)\<^sub>f a)(\<^sup>f b := c))"
Andreas@48028
  1201
by(simp_all add: finfun_curry_def)
Andreas@48028
  1202
Andreas@48028
  1203
lemma finfun_Abs_finfun_curry: assumes fin: "f \<in> finfun"
Andreas@48028
  1204
  shows "(\<lambda>a. Abs_finfun (curry f a)) \<in> finfun"
Andreas@48030
  1205
  including finfun
Andreas@48028
  1206
proof -
Andreas@48028
  1207
  from fin obtain c where c: "finite {ab. f ab \<noteq> c}" unfolding finfun_def by blast
Andreas@48028
  1208
  have "{a. \<exists>b. f (a, b) \<noteq> c} = fst ` {ab. f ab \<noteq> c}" by(force)
Andreas@48028
  1209
  hence "{a. curry f a \<noteq> (\<lambda>x. c)} = fst ` {ab. f ab \<noteq> c}"
Andreas@48028
  1210
    by(auto simp add: curry_def fun_eq_iff)
Andreas@48028
  1211
  with fin c have "finite {a.  Abs_finfun (curry f a) \<noteq> (\<lambda>\<^isup>f c)}"
Andreas@48028
  1212
    by(simp add: finfun_const_def finfun_curry)
Andreas@48028
  1213
  thus ?thesis unfolding finfun_def by auto
Andreas@48028
  1214
qed
Andreas@48028
  1215
Andreas@48028
  1216
lemma finfun_curry_conv_curry:
Andreas@48034
  1217
  fixes f :: "('a \<times> 'b) \<Rightarrow>f 'c"
Andreas@48029
  1218
  shows "finfun_curry f = Abs_finfun (\<lambda>a. Abs_finfun (curry (finfun_apply f) a))"
Andreas@48030
  1219
  including finfun
Andreas@48028
  1220
proof -
Andreas@48034
  1221
  have "finfun_curry = (\<lambda>f :: ('a \<times> 'b) \<Rightarrow>f 'c. Abs_finfun (\<lambda>a. Abs_finfun (curry (finfun_apply f) a)))"
Andreas@48028
  1222
  proof(rule finfun_rec_unique)
Andreas@48034
  1223
    fix c show "finfun_curry (\<lambda>\<^isup>f c) = (\<lambda>\<^isup>f \<lambda>\<^isup>f c)" by simp
Andreas@48034
  1224
    fix f a
Andreas@48034
  1225
    show "finfun_curry (f(\<^sup>f a := c)) = (finfun_curry f)(\<^sup>f fst a := ((finfun_curry f)\<^sub>f (fst a))(\<^sup>f snd a := c))"
Andreas@48034
  1226
      by(cases a) simp
Andreas@48034
  1227
    show "Abs_finfun (\<lambda>a. Abs_finfun (curry (finfun_apply (\<lambda>\<^isup>f c)) a)) = (\<lambda>\<^isup>f \<lambda>\<^isup>f c)"
Andreas@48034
  1228
      by(simp add: finfun_curry_def finfun_const_def curry_def)
Andreas@48034
  1229
    fix g b
Andreas@48034
  1230
    show "Abs_finfun (\<lambda>aa. Abs_finfun (curry (finfun_apply g(\<^sup>f a := b)) aa)) =
Andreas@48034
  1231
      (Abs_finfun (\<lambda>a. Abs_finfun (curry (finfun_apply g) a)))(\<^sup>f
Andreas@48034
  1232
      fst a := ((Abs_finfun (\<lambda>a. Abs_finfun (curry (finfun_apply g) a)))\<^sub>f (fst a))(\<^sup>f snd a := b))"
Andreas@48034
  1233
      by(cases a)(auto intro!: ext arg_cong[where f=Abs_finfun] simp add: finfun_curry_def finfun_update_def finfun_curry finfun_Abs_finfun_curry)
Andreas@48028
  1234
  qed
Andreas@48028
  1235
  thus ?thesis by(auto simp add: fun_eq_iff)
Andreas@48028
  1236
qed
Andreas@48028
  1237
Andreas@48028
  1238
subsection {* Executable equality for FinFuns *}
Andreas@48028
  1239
Andreas@48028
  1240
lemma eq_finfun_All_ext: "(f = g) \<longleftrightarrow> finfun_All ((\<lambda>(x, y). x = y) \<circ>\<^isub>f (f, g)\<^sup>f)"
Andreas@48028
  1241
by(simp add: expand_finfun_eq fun_eq_iff finfun_All_All o_def)
Andreas@48028
  1242
Andreas@48028
  1243
instantiation finfun :: ("{card_UNIV,equal}",equal) equal begin
Andreas@48028
  1244
definition eq_finfun_def [code]: "HOL.equal f g \<longleftrightarrow> finfun_All ((\<lambda>(x, y). x = y) \<circ>\<^isub>f (f, g)\<^sup>f)"
Andreas@48028
  1245
instance by(intro_classes)(simp add: eq_finfun_All_ext eq_finfun_def)
Andreas@48028
  1246
end
Andreas@48028
  1247
Andreas@48028
  1248
lemma [code nbe]:
Andreas@48034
  1249
  "HOL.equal (f :: _ \<Rightarrow>f _) f \<longleftrightarrow> True"
Andreas@48028
  1250
  by (fact equal_refl)
Andreas@48028
  1251
Andreas@48028
  1252
subsection {* An operator that explicitly removes all redundant updates in the generated representations *}
Andreas@48028
  1253
Andreas@48034
  1254
definition finfun_clearjunk :: "'a \<Rightarrow>f 'b \<Rightarrow> 'a \<Rightarrow>f 'b"
Andreas@48028
  1255
where [simp, code del]: "finfun_clearjunk = id"
Andreas@48028
  1256
Andreas@48028
  1257
lemma finfun_clearjunk_const [code]: "finfun_clearjunk (\<lambda>\<^isup>f b) = (\<lambda>\<^isup>f b)"
Andreas@48028
  1258
by simp
Andreas@48028
  1259
Andreas@48028
  1260
lemma finfun_clearjunk_update [code]: "finfun_clearjunk (finfun_update_code f a b) = f(\<^sup>f a := b)"
Andreas@48028
  1261
by simp
Andreas@48028
  1262
Andreas@48028
  1263
subsection {* The domain of a FinFun as a FinFun *}
Andreas@48028
  1264
Andreas@48034
  1265
definition finfun_dom :: "('a \<Rightarrow>f 'b) \<Rightarrow> ('a \<Rightarrow>f bool)"
Andreas@48028
  1266
where [code del]: "finfun_dom f = Abs_finfun (\<lambda>a. f\<^sub>f a \<noteq> finfun_default f)"
Andreas@48028
  1267
Andreas@48028
  1268
lemma finfun_dom_const:
Andreas@48034
  1269
  "finfun_dom ((\<lambda>\<^isup>f c) :: 'a \<Rightarrow>f 'b) = (\<lambda>\<^isup>f finite (UNIV :: 'a set) \<and> c \<noteq> undefined)"
Andreas@48028
  1270
unfolding finfun_dom_def finfun_default_const
Andreas@48028
  1271
by(auto)(simp_all add: finfun_const_def)
Andreas@48028
  1272
Andreas@48028
  1273
text {*
Andreas@48028
  1274
  @{term "finfun_dom" } raises an exception when called on a FinFun whose domain is a finite type. 
Andreas@48028
  1275
  For such FinFuns, the default value (and as such the domain) is undefined.
Andreas@48028
  1276
*}
Andreas@48028
  1277
Andreas@48028
  1278
lemma finfun_dom_const_code [code]:
Andreas@48034
  1279
  "finfun_dom ((\<lambda>\<^isup>f c) :: ('a :: card_UNIV) \<Rightarrow>f 'b) = 
Andreas@48028
  1280
   (if card_UNIV (TYPE('a)) = 0 then (\<lambda>\<^isup>f False) else FinFun.code_abort (\<lambda>_. finfun_dom (\<lambda>\<^isup>f c)))"
Andreas@48028
  1281
unfolding card_UNIV_eq_0_infinite_UNIV
Andreas@48028
  1282
by(simp add: finfun_dom_const)
Andreas@48028
  1283
Andreas@48028
  1284
lemma finfun_dom_finfunI: "(\<lambda>a. f\<^sub>f a \<noteq> finfun_default f) \<in> finfun"
Andreas@48028
  1285
using finite_finfun_default[of f]
Andreas@48029
  1286
by(simp add: finfun_def exI[where x=False])
Andreas@48028
  1287
Andreas@48028
  1288
lemma finfun_dom_update [simp]:
Andreas@48028
  1289
  "finfun_dom (f(\<^sup>f a := b)) = (finfun_dom f)(\<^sup>f a := (b \<noteq> finfun_default f))"
Andreas@48030
  1290
including finfun unfolding finfun_dom_def finfun_update_def
Andreas@48029
  1291
apply(simp add: finfun_default_update_const fun_upd_apply finfun_dom_finfunI)
Andreas@48028
  1292
apply(fold finfun_update.rep_eq)
Andreas@48029
  1293
apply(simp add: finfun_upd_apply fun_eq_iff fun_upd_def finfun_default_update_const)
Andreas@48028
  1294
done
Andreas@48028
  1295
Andreas@48028
  1296
lemma finfun_dom_update_code [code]:
Andreas@48028
  1297
  "finfun_dom (finfun_update_code f a b) = finfun_update_code (finfun_dom f) a (b \<noteq> finfun_default f)"
Andreas@48028
  1298
by(simp)
Andreas@48028
  1299
Andreas@48028
  1300
lemma finite_finfun_dom: "finite {x. (finfun_dom f)\<^sub>f x}"
Andreas@48028
  1301
proof(induct f rule: finfun_weak_induct)
Andreas@48028
  1302
  case (const b)
Andreas@48028
  1303
  thus ?case
Andreas@48028
  1304
    by (cases "finite (UNIV :: 'a set) \<and> b \<noteq> undefined")
Andreas@48028
  1305
      (auto simp add: finfun_dom_const UNIV_def [symmetric] Set.empty_def [symmetric])
Andreas@48028
  1306
next
Andreas@48028
  1307
  case (update f a b)
Andreas@48028
  1308
  have "{x. (finfun_dom f(\<^sup>f a := b))\<^sub>f x} =
Andreas@48028
  1309
    (if b = finfun_default f then {x. (finfun_dom f)\<^sub>f x} - {a} else insert a {x. (finfun_dom f)\<^sub>f x})"
Andreas@48028
  1310
    by (auto simp add: finfun_upd_apply split: split_if_asm)
Andreas@48028
  1311
  thus ?case using update by simp
Andreas@48028
  1312
qed
Andreas@48028
  1313
Andreas@48028
  1314
Andreas@48028
  1315
subsection {* The domain of a FinFun as a sorted list *}
Andreas@48028
  1316
Andreas@48034
  1317
definition finfun_to_list :: "('a :: linorder) \<Rightarrow>f 'b \<Rightarrow> 'a list"
Andreas@48028
  1318
where
Andreas@48028
  1319
  "finfun_to_list f = (THE xs. set xs = {x. (finfun_dom f)\<^sub>f x} \<and> sorted xs \<and> distinct xs)"
Andreas@48028
  1320
Andreas@48028
  1321
lemma set_finfun_to_list [simp]: "set (finfun_to_list f) = {x. (finfun_dom f)\<^sub>f x}" (is ?thesis1)
Andreas@48028
  1322
  and sorted_finfun_to_list: "sorted (finfun_to_list f)" (is ?thesis2)
Andreas@48028
  1323
  and distinct_finfun_to_list: "distinct (finfun_to_list f)" (is ?thesis3)
Andreas@48028
  1324
proof -
Andreas@48028
  1325
  have "?thesis1 \<and> ?thesis2 \<and> ?thesis3"
Andreas@48028
  1326
    unfolding finfun_to_list_def
Andreas@48028
  1327
    by(rule theI')(rule finite_sorted_distinct_unique finite_finfun_dom)+
Andreas@48028
  1328
  thus ?thesis1 ?thesis2 ?thesis3 by simp_all
Andreas@48028
  1329
qed
Andreas@48028
  1330
Andreas@48028
  1331
lemma finfun_const_False_conv_bot: "(\<lambda>\<^isup>f False)\<^sub>f = bot"
Andreas@48028
  1332
by auto
Andreas@48028
  1333
Andreas@48028
  1334
lemma finfun_const_True_conv_top: "(\<lambda>\<^isup>f True)\<^sub>f = top"
Andreas@48028
  1335
by auto
Andreas@48028
  1336
Andreas@48028
  1337
lemma finfun_to_list_const:
Andreas@48034
  1338
  "finfun_to_list ((\<lambda>\<^isup>f c) :: ('a :: {linorder} \<Rightarrow>f 'b)) = 
Andreas@48028
  1339
  (if \<not> finite (UNIV :: 'a set) \<or> c = undefined then [] else THE xs. set xs = UNIV \<and> sorted xs \<and> distinct xs)"
Andreas@48028
  1340
by(auto simp add: finfun_to_list_def finfun_const_False_conv_bot finfun_const_True_conv_top finfun_dom_const)
Andreas@48028
  1341
Andreas@48028
  1342
lemma finfun_to_list_const_code [code]:
Andreas@48034
  1343
  "finfun_to_list ((\<lambda>\<^isup>f c) :: ('a :: {linorder, card_UNIV} \<Rightarrow>f 'b)) =
Andreas@48034
  1344
   (if card_UNIV (TYPE('a)) = 0 then [] else FinFun.code_abort (\<lambda>_. finfun_to_list ((\<lambda>\<^isup>f c) :: ('a \<Rightarrow>f 'b))))"
Andreas@48028
  1345
unfolding card_UNIV_eq_0_infinite_UNIV
Andreas@48028
  1346
by(auto simp add: finfun_to_list_const)
Andreas@48028
  1347
Andreas@48028
  1348
lemma remove1_insort_insert_same:
Andreas@48028
  1349
  "x \<notin> set xs \<Longrightarrow> remove1 x (insort_insert x xs) = xs"
Andreas@48028
  1350
by (metis insort_insert_insort remove1_insort)
Andreas@48028
  1351
Andreas@48028
  1352
lemma finfun_dom_conv:
Andreas@48028
  1353
  "(finfun_dom f)\<^sub>f x \<longleftrightarrow> f\<^sub>f x \<noteq> finfun_default f"
Andreas@48028
  1354
by(induct f rule: finfun_weak_induct)(auto simp add: finfun_dom_const finfun_default_const finfun_default_update_const finfun_upd_apply)
Andreas@48028
  1355
Andreas@48028
  1356
lemma finfun_to_list_update:
Andreas@48028
  1357
  "finfun_to_list (f(\<^sup>f a := b)) = 
Andreas@48028
  1358
  (if b = finfun_default f then List.remove1 a (finfun_to_list f) else List.insort_insert a (finfun_to_list f))"
Andreas@48028
  1359
proof(subst finfun_to_list_def, rule the_equality)
Andreas@48028
  1360
  fix xs
Andreas@48028
  1361
  assume "set xs = {x. (finfun_dom f(\<^sup>f a := b))\<^sub>f x} \<and> sorted xs \<and> distinct xs"
Andreas@48028
  1362
  hence eq: "set xs = {x. (finfun_dom f(\<^sup>f a := b))\<^sub>f x}"
Andreas@48028
  1363
    and [simp]: "sorted xs" "distinct xs" by simp_all
Andreas@48028
  1364
  show "xs = (if b = finfun_default f then remove1 a (finfun_to_list f) else insort_insert a (finfun_to_list f))"
Andreas@48028
  1365
  proof(cases "b = finfun_default f")
Andreas@48028
  1366
    case True [simp]
Andreas@48028
  1367
    show ?thesis
Andreas@48028
  1368
    proof(cases "(finfun_dom f)\<^sub>f a")
Andreas@48028
  1369
      case True
Andreas@48028
  1370
      have "finfun_to_list f = insort_insert a xs"
Andreas@48028
  1371
        unfolding finfun_to_list_def
Andreas@48028
  1372
      proof(rule the_equality)
Andreas@48028
  1373
        have "set (insort_insert a xs) = insert a (set xs)" by(simp add: set_insort_insert)
Andreas@48028
  1374
        also note eq also
Andreas@48028
  1375
        have "insert a {x. (finfun_dom f(\<^sup>f a := b))\<^sub>f x} = {x. (finfun_dom f)\<^sub>f x}" using True
Andreas@48028
  1376
          by(auto simp add: finfun_upd_apply split: split_if_asm)
Andreas@48028
  1377
        finally show 1: "set (insort_insert a xs) = {x. (finfun_dom f)\<^sub>f x} \<and> sorted (insort_insert a xs) \<and> distinct (insort_insert a xs)"
Andreas@48028
  1378
          by(simp add: sorted_insort_insert distinct_insort_insert)
Andreas@48028
  1379
Andreas@48028
  1380
        fix xs'
Andreas@48028
  1381
        assume "set xs' = {x. (finfun_dom f)\<^sub>f x} \<and> sorted xs' \<and> distinct xs'"
Andreas@48028
  1382
        thus "xs' = insort_insert a xs" using 1 by(auto dest: sorted_distinct_set_unique)
Andreas@48028
  1383
      qed
Andreas@48028
  1384
      with eq True show ?thesis by(simp add: remove1_insort_insert_same)
Andreas@48028
  1385
    next
Andreas@48028
  1386
      case False
Andreas@48028
  1387
      hence "f\<^sub>f a = b" by(auto simp add: finfun_dom_conv)
Andreas@48028
  1388
      hence f: "f(\<^sup>f a := b) = f" by(simp add: expand_finfun_eq fun_eq_iff finfun_upd_apply)
Andreas@48028
  1389
      from eq have "finfun_to_list f = xs" unfolding f finfun_to_list_def
Andreas@48028
  1390
        by(auto elim: sorted_distinct_set_unique intro!: the_equality)
Andreas@48028
  1391
      with eq False show ?thesis unfolding f by(simp add: remove1_idem)
Andreas@48028
  1392
    qed
Andreas@48028
  1393
  next
Andreas@48028
  1394
    case False
Andreas@48028
  1395
    show ?thesis
Andreas@48028
  1396
    proof(cases "(finfun_dom f)\<^sub>f a")
Andreas@48028
  1397
      case True
Andreas@48028
  1398
      have "finfun_to_list f = xs"
Andreas@48028
  1399
        unfolding finfun_to_list_def
Andreas@48028
  1400
      proof(rule the_equality)
Andreas@48028
  1401
        have "finfun_dom f = finfun_dom f(\<^sup>f a := b)" using False True
Andreas@48028
  1402
          by(simp add: expand_finfun_eq fun_eq_iff finfun_upd_apply)
Andreas@48028
  1403
        with eq show 1: "set xs = {x. (finfun_dom f)\<^sub>f x} \<and> sorted xs \<and> distinct xs"
Andreas@48028
  1404
          by(simp del: finfun_dom_update)
Andreas@48028
  1405
        
Andreas@48028
  1406
        fix xs'
Andreas@48028
  1407
        assume "set xs' = {x. (finfun_dom f)\<^sub>f x} \<and> sorted xs' \<and> distinct xs'"
Andreas@48028
  1408
        thus "xs' = xs" using 1 by(auto elim: sorted_distinct_set_unique)
Andreas@48028
  1409
      qed
Andreas@48028
  1410
      thus ?thesis using False True eq by(simp add: insort_insert_triv)
Andreas@48028
  1411
    next
Andreas@48028
  1412
      case False
Andreas@48028
  1413
      have "finfun_to_list f = remove1 a xs"
Andreas@48028
  1414
        unfolding finfun_to_list_def
Andreas@48028
  1415
      proof(rule the_equality)
Andreas@48028
  1416
        have "set (remove1 a xs) = set xs - {a}" by simp
Andreas@48028
  1417
        also note eq also
Andreas@48028
  1418
        have "{x. (finfun_dom f(\<^sup>f a := b))\<^sub>f x} - {a} = {x. (finfun_dom f)\<^sub>f x}" using False
Andreas@48028
  1419
          by(auto simp add: finfun_upd_apply split: split_if_asm)
Andreas@48028
  1420
        finally show 1: "set (remove1 a xs) = {x. (finfun_dom f)\<^sub>f x} \<and> sorted (remove1 a xs) \<and> distinct (remove1 a xs)"
Andreas@48028
  1421
          by(simp add: sorted_remove1)
Andreas@48028
  1422
        
Andreas@48028
  1423
        fix xs'
Andreas@48028
  1424
        assume "set xs' = {x. (finfun_dom f)\<^sub>f x} \<and> sorted xs' \<and> distinct xs'"
Andreas@48028
  1425
        thus "xs' = remove1 a xs" using 1 by(blast intro: sorted_distinct_set_unique)
Andreas@48028
  1426
      qed
Andreas@48028
  1427
      thus ?thesis using False eq `b \<noteq> finfun_default f` 
Andreas@48028
  1428
        by (simp add: insort_insert_insort insort_remove1)
Andreas@48028
  1429
    qed
Andreas@48028
  1430
  qed
Andreas@48028
  1431
qed (auto simp add: distinct_finfun_to_list sorted_finfun_to_list sorted_remove1 set_insort_insert sorted_insort_insert distinct_insort_insert finfun_upd_apply split: split_if_asm)
Andreas@48028
  1432
Andreas@48028
  1433
lemma finfun_to_list_update_code [code]:
Andreas@48028
  1434
  "finfun_to_list (finfun_update_code f a b) = 
Andreas@48028
  1435
  (if b = finfun_default f then List.remove1 a (finfun_to_list f) else List.insort_insert a (finfun_to_list f))"
Andreas@48028
  1436
by(simp add: finfun_to_list_update)
Andreas@48028
  1437
Andreas@48028
  1438
end