src/HOL/Library/RBT_Impl.thy
author nipkow
Mon Sep 13 11:13:15 2010 +0200 (2010-09-13)
changeset 39302 d7728f65b353
parent 39198 f967a16dfcdd
child 41074 286255f131bf
permissions -rw-r--r--
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
haftmann@36147
     1
(*  Title:      RBT_Impl.thy
krauss@26192
     2
    Author:     Markus Reiter, TU Muenchen
krauss@26192
     3
    Author:     Alexander Krauss, TU Muenchen
krauss@26192
     4
*)
krauss@26192
     5
haftmann@36147
     6
header {* Implementation of Red-Black Trees *}
krauss@26192
     7
haftmann@36147
     8
theory RBT_Impl
haftmann@37458
     9
imports Main More_List
krauss@26192
    10
begin
krauss@26192
    11
haftmann@36147
    12
text {*
haftmann@36147
    13
  For applications, you should use theory @{text RBT} which defines
haftmann@36147
    14
  an abstract type of red-black tree obeying the invariant.
haftmann@36147
    15
*}
haftmann@36147
    16
haftmann@35550
    17
subsection {* Datatype of RB trees *}
haftmann@35550
    18
krauss@26192
    19
datatype color = R | B
haftmann@35534
    20
datatype ('a, 'b) rbt = Empty | Branch color "('a, 'b) rbt" 'a 'b "('a, 'b) rbt"
haftmann@35534
    21
haftmann@35534
    22
lemma rbt_cases:
haftmann@35534
    23
  obtains (Empty) "t = Empty" 
haftmann@35534
    24
  | (Red) l k v r where "t = Branch R l k v r" 
haftmann@35534
    25
  | (Black) l k v r where "t = Branch B l k v r"
haftmann@35534
    26
proof (cases t)
haftmann@35534
    27
  case Empty with that show thesis by blast
haftmann@35534
    28
next
haftmann@35534
    29
  case (Branch c) with that show thesis by (cases c) blast+
haftmann@35534
    30
qed
haftmann@35534
    31
haftmann@35550
    32
subsection {* Tree properties *}
haftmann@35534
    33
haftmann@35550
    34
subsubsection {* Content of a tree *}
haftmann@35550
    35
haftmann@35550
    36
primrec entries :: "('a, 'b) rbt \<Rightarrow> ('a \<times> 'b) list"
haftmann@35534
    37
where 
haftmann@35534
    38
  "entries Empty = []"
haftmann@35534
    39
| "entries (Branch _ l k v r) = entries l @ (k,v) # entries r"
krauss@26192
    40
haftmann@35550
    41
abbreviation (input) entry_in_tree :: "'a \<Rightarrow> 'b \<Rightarrow> ('a, 'b) rbt \<Rightarrow> bool"
krauss@26192
    42
where
haftmann@35550
    43
  "entry_in_tree k v t \<equiv> (k, v) \<in> set (entries t)"
haftmann@35550
    44
haftmann@35550
    45
definition keys :: "('a, 'b) rbt \<Rightarrow> 'a list" where
haftmann@35550
    46
  "keys t = map fst (entries t)"
krauss@26192
    47
haftmann@35550
    48
lemma keys_simps [simp, code]:
haftmann@35550
    49
  "keys Empty = []"
haftmann@35550
    50
  "keys (Branch c l k v r) = keys l @ k # keys r"
haftmann@35550
    51
  by (simp_all add: keys_def)
krauss@26192
    52
haftmann@35534
    53
lemma entry_in_tree_keys:
haftmann@35550
    54
  assumes "(k, v) \<in> set (entries t)"
haftmann@35550
    55
  shows "k \<in> set (keys t)"
haftmann@35550
    56
proof -
haftmann@35550
    57
  from assms have "fst (k, v) \<in> fst ` set (entries t)" by (rule imageI)
haftmann@35550
    58
  then show ?thesis by (simp add: keys_def)
haftmann@35550
    59
qed
haftmann@35550
    60
haftmann@35602
    61
lemma keys_entries:
haftmann@35602
    62
  "k \<in> set (keys t) \<longleftrightarrow> (\<exists>v. (k, v) \<in> set (entries t))"
haftmann@35602
    63
  by (auto intro: entry_in_tree_keys) (auto simp add: keys_def)
haftmann@35602
    64
haftmann@35550
    65
haftmann@35550
    66
subsubsection {* Search tree properties *}
krauss@26192
    67
haftmann@35534
    68
definition tree_less :: "'a\<Colon>order \<Rightarrow> ('a, 'b) rbt \<Rightarrow> bool"
krauss@26192
    69
where
haftmann@35550
    70
  tree_less_prop: "tree_less k t \<longleftrightarrow> (\<forall>x\<in>set (keys t). x < k)"
haftmann@35534
    71
haftmann@35534
    72
abbreviation tree_less_symbol (infix "|\<guillemotleft>" 50)
haftmann@35534
    73
where "t |\<guillemotleft> x \<equiv> tree_less x t"
krauss@26192
    74
haftmann@35534
    75
definition tree_greater :: "'a\<Colon>order \<Rightarrow> ('a, 'b) rbt \<Rightarrow> bool" (infix "\<guillemotleft>|" 50) 
haftmann@35534
    76
where
haftmann@35550
    77
  tree_greater_prop: "tree_greater k t = (\<forall>x\<in>set (keys t). k < x)"
krauss@26192
    78
haftmann@35534
    79
lemma tree_less_simps [simp]:
haftmann@35534
    80
  "tree_less k Empty = True"
haftmann@35534
    81
  "tree_less k (Branch c lt kt v rt) \<longleftrightarrow> kt < k \<and> tree_less k lt \<and> tree_less k rt"
haftmann@35534
    82
  by (auto simp add: tree_less_prop)
krauss@26192
    83
haftmann@35534
    84
lemma tree_greater_simps [simp]:
haftmann@35534
    85
  "tree_greater k Empty = True"
haftmann@35534
    86
  "tree_greater k (Branch c lt kt v rt) \<longleftrightarrow> k < kt \<and> tree_greater k lt \<and> tree_greater k rt"
haftmann@35534
    87
  by (auto simp add: tree_greater_prop)
krauss@26192
    88
haftmann@35534
    89
lemmas tree_ord_props = tree_less_prop tree_greater_prop
krauss@26192
    90
haftmann@35534
    91
lemmas tree_greater_nit = tree_greater_prop entry_in_tree_keys
haftmann@35534
    92
lemmas tree_less_nit = tree_less_prop entry_in_tree_keys
krauss@26192
    93
haftmann@35550
    94
lemma tree_less_eq_trans: "l |\<guillemotleft> u \<Longrightarrow> u \<le> v \<Longrightarrow> l |\<guillemotleft> v"
haftmann@35550
    95
  and tree_less_trans: "t |\<guillemotleft> x \<Longrightarrow> x < y \<Longrightarrow> t |\<guillemotleft> y"
haftmann@35550
    96
  and tree_greater_eq_trans: "u \<le> v \<Longrightarrow> v \<guillemotleft>| r \<Longrightarrow> u \<guillemotleft>| r"
haftmann@35534
    97
  and tree_greater_trans: "x < y \<Longrightarrow> y \<guillemotleft>| t \<Longrightarrow> x \<guillemotleft>| t"
haftmann@35550
    98
  by (auto simp: tree_ord_props)
krauss@26192
    99
haftmann@35534
   100
primrec sorted :: "('a::linorder, 'b) rbt \<Rightarrow> bool"
krauss@26192
   101
where
haftmann@35534
   102
  "sorted Empty = True"
haftmann@35534
   103
| "sorted (Branch c l k v r) = (l |\<guillemotleft> k \<and> k \<guillemotleft>| r \<and> sorted l \<and> sorted r)"
krauss@26192
   104
haftmann@35550
   105
lemma sorted_entries:
haftmann@35550
   106
  "sorted t \<Longrightarrow> List.sorted (List.map fst (entries t))"
haftmann@35550
   107
by (induct t) 
haftmann@35550
   108
  (force simp: sorted_append sorted_Cons tree_ord_props 
haftmann@35550
   109
      dest!: entry_in_tree_keys)+
haftmann@35550
   110
haftmann@35550
   111
lemma distinct_entries:
haftmann@35550
   112
  "sorted t \<Longrightarrow> distinct (List.map fst (entries t))"
haftmann@35550
   113
by (induct t) 
haftmann@35550
   114
  (force simp: sorted_append sorted_Cons tree_ord_props 
haftmann@35550
   115
      dest!: entry_in_tree_keys)+
haftmann@35550
   116
haftmann@35550
   117
haftmann@35550
   118
subsubsection {* Tree lookup *}
haftmann@35550
   119
haftmann@35534
   120
primrec lookup :: "('a\<Colon>linorder, 'b) rbt \<Rightarrow> 'a \<rightharpoonup> 'b"
haftmann@35534
   121
where
haftmann@35534
   122
  "lookup Empty k = None"
haftmann@35534
   123
| "lookup (Branch _ l x y r) k = (if k < x then lookup l k else if x < k then lookup r k else Some y)"
haftmann@35534
   124
haftmann@35550
   125
lemma lookup_keys: "sorted t \<Longrightarrow> dom (lookup t) = set (keys t)"
haftmann@35550
   126
  by (induct t) (auto simp: dom_def tree_greater_prop tree_less_prop)
haftmann@35550
   127
haftmann@35550
   128
lemma dom_lookup_Branch: 
haftmann@35550
   129
  "sorted (Branch c t1 k v t2) \<Longrightarrow> 
haftmann@35550
   130
    dom (lookup (Branch c t1 k v t2)) 
haftmann@35550
   131
    = Set.insert k (dom (lookup t1) \<union> dom (lookup t2))"
haftmann@35550
   132
proof -
haftmann@35550
   133
  assume "sorted (Branch c t1 k v t2)"
haftmann@35550
   134
  moreover from this have "sorted t1" "sorted t2" by simp_all
haftmann@35550
   135
  ultimately show ?thesis by (simp add: lookup_keys)
haftmann@35550
   136
qed
haftmann@35550
   137
haftmann@35550
   138
lemma finite_dom_lookup [simp, intro!]: "finite (dom (lookup t))"
haftmann@35550
   139
proof (induct t)
haftmann@35550
   140
  case Empty then show ?case by simp
haftmann@35550
   141
next
haftmann@35550
   142
  case (Branch color t1 a b t2)
haftmann@35550
   143
  let ?A = "Set.insert a (dom (lookup t1) \<union> dom (lookup t2))"
haftmann@35550
   144
  have "dom (lookup (Branch color t1 a b t2)) \<subseteq> ?A" by (auto split: split_if_asm)
haftmann@35550
   145
  moreover from Branch have "finite (insert a (dom (lookup t1) \<union> dom (lookup t2)))" by simp
haftmann@35550
   146
  ultimately show ?case by (rule finite_subset)
haftmann@35550
   147
qed 
haftmann@35550
   148
haftmann@35534
   149
lemma lookup_tree_less[simp]: "t |\<guillemotleft> k \<Longrightarrow> lookup t k = None" 
krauss@26192
   150
by (induct t) auto
krauss@26192
   151
haftmann@35534
   152
lemma lookup_tree_greater[simp]: "k \<guillemotleft>| t \<Longrightarrow> lookup t k = None"
krauss@26192
   153
by (induct t) auto
krauss@26192
   154
haftmann@35534
   155
lemma lookup_Empty: "lookup Empty = empty"
krauss@26192
   156
by (rule ext) simp
krauss@26192
   157
haftmann@35618
   158
lemma map_of_entries:
haftmann@35618
   159
  "sorted t \<Longrightarrow> map_of (entries t) = lookup t"
haftmann@35550
   160
proof (induct t)
haftmann@35550
   161
  case Empty thus ?case by (simp add: lookup_Empty)
haftmann@35550
   162
next
haftmann@35550
   163
  case (Branch c t1 k v t2)
haftmann@35550
   164
  have "lookup (Branch c t1 k v t2) = lookup t2 ++ [k\<mapsto>v] ++ lookup t1"
haftmann@35550
   165
  proof (rule ext)
haftmann@35550
   166
    fix x
haftmann@35550
   167
    from Branch have SORTED: "sorted (Branch c t1 k v t2)" by simp
haftmann@35550
   168
    let ?thesis = "lookup (Branch c t1 k v t2) x = (lookup t2 ++ [k \<mapsto> v] ++ lookup t1) x"
haftmann@35550
   169
haftmann@35550
   170
    have DOM_T1: "!!k'. k'\<in>dom (lookup t1) \<Longrightarrow> k>k'"
haftmann@35550
   171
    proof -
haftmann@35550
   172
      fix k'
haftmann@35550
   173
      from SORTED have "t1 |\<guillemotleft> k" by simp
haftmann@35550
   174
      with tree_less_prop have "\<forall>k'\<in>set (keys t1). k>k'" by auto
haftmann@35550
   175
      moreover assume "k'\<in>dom (lookup t1)"
haftmann@35550
   176
      ultimately show "k>k'" using lookup_keys SORTED by auto
haftmann@35550
   177
    qed
haftmann@35550
   178
    
haftmann@35550
   179
    have DOM_T2: "!!k'. k'\<in>dom (lookup t2) \<Longrightarrow> k<k'"
haftmann@35550
   180
    proof -
haftmann@35550
   181
      fix k'
haftmann@35550
   182
      from SORTED have "k \<guillemotleft>| t2" by simp
haftmann@35550
   183
      with tree_greater_prop have "\<forall>k'\<in>set (keys t2). k<k'" by auto
haftmann@35550
   184
      moreover assume "k'\<in>dom (lookup t2)"
haftmann@35550
   185
      ultimately show "k<k'" using lookup_keys SORTED by auto
haftmann@35550
   186
    qed
haftmann@35550
   187
    
haftmann@35550
   188
    {
haftmann@35550
   189
      assume C: "x<k"
haftmann@35550
   190
      hence "lookup (Branch c t1 k v t2) x = lookup t1 x" by simp
haftmann@35550
   191
      moreover from C have "x\<notin>dom [k\<mapsto>v]" by simp
haftmann@35550
   192
      moreover have "x\<notin>dom (lookup t2)" proof
haftmann@35550
   193
        assume "x\<in>dom (lookup t2)"
haftmann@35550
   194
        with DOM_T2 have "k<x" by blast
haftmann@35550
   195
        with C show False by simp
haftmann@35550
   196
      qed
haftmann@35550
   197
      ultimately have ?thesis by (simp add: map_add_upd_left map_add_dom_app_simps)
haftmann@35550
   198
    } moreover {
haftmann@35550
   199
      assume [simp]: "x=k"
haftmann@35550
   200
      hence "lookup (Branch c t1 k v t2) x = [k \<mapsto> v] x" by simp
haftmann@35550
   201
      moreover have "x\<notin>dom (lookup t1)" proof
haftmann@35550
   202
        assume "x\<in>dom (lookup t1)"
haftmann@35550
   203
        with DOM_T1 have "k>x" by blast
haftmann@35550
   204
        thus False by simp
haftmann@35550
   205
      qed
haftmann@35550
   206
      ultimately have ?thesis by (simp add: map_add_upd_left map_add_dom_app_simps)
haftmann@35550
   207
    } moreover {
haftmann@35550
   208
      assume C: "x>k"
haftmann@35550
   209
      hence "lookup (Branch c t1 k v t2) x = lookup t2 x" by (simp add: less_not_sym[of k x])
haftmann@35550
   210
      moreover from C have "x\<notin>dom [k\<mapsto>v]" by simp
haftmann@35550
   211
      moreover have "x\<notin>dom (lookup t1)" proof
haftmann@35550
   212
        assume "x\<in>dom (lookup t1)"
haftmann@35550
   213
        with DOM_T1 have "k>x" by simp
haftmann@35550
   214
        with C show False by simp
haftmann@35550
   215
      qed
haftmann@35550
   216
      ultimately have ?thesis by (simp add: map_add_upd_left map_add_dom_app_simps)
haftmann@35550
   217
    } ultimately show ?thesis using less_linear by blast
haftmann@35550
   218
  qed
haftmann@35550
   219
  also from Branch have "lookup t2 ++ [k \<mapsto> v] ++ lookup t1 = map_of (entries (Branch c t1 k v t2))" by simp
haftmann@35618
   220
  finally show ?case by simp
haftmann@35550
   221
qed
haftmann@35550
   222
haftmann@35602
   223
lemma lookup_in_tree: "sorted t \<Longrightarrow> lookup t k = Some v \<longleftrightarrow> (k, v) \<in> set (entries t)"
haftmann@35618
   224
  by (simp add: map_of_entries [symmetric] distinct_entries)
haftmann@35602
   225
haftmann@35602
   226
lemma set_entries_inject:
haftmann@35602
   227
  assumes sorted: "sorted t1" "sorted t2" 
haftmann@35602
   228
  shows "set (entries t1) = set (entries t2) \<longleftrightarrow> entries t1 = entries t2"
haftmann@35602
   229
proof -
haftmann@35602
   230
  from sorted have "distinct (map fst (entries t1))"
haftmann@35602
   231
    "distinct (map fst (entries t2))"
haftmann@35602
   232
    by (auto intro: distinct_entries)
haftmann@35602
   233
  with sorted show ?thesis
haftmann@35602
   234
    by (auto intro: map_sorted_distinct_set_unique sorted_entries simp add: distinct_map)
haftmann@35602
   235
qed
haftmann@35550
   236
haftmann@35550
   237
lemma entries_eqI:
haftmann@35550
   238
  assumes sorted: "sorted t1" "sorted t2" 
haftmann@35550
   239
  assumes lookup: "lookup t1 = lookup t2"
haftmann@35602
   240
  shows "entries t1 = entries t2"
haftmann@35550
   241
proof -
haftmann@35550
   242
  from sorted lookup have "map_of (entries t1) = map_of (entries t2)"
haftmann@35618
   243
    by (simp add: map_of_entries)
haftmann@35602
   244
  with sorted have "set (entries t1) = set (entries t2)"
haftmann@35602
   245
    by (simp add: map_of_inject_set distinct_entries)
haftmann@35602
   246
  with sorted show ?thesis by (simp add: set_entries_inject)
haftmann@35602
   247
qed
haftmann@35550
   248
haftmann@35602
   249
lemma entries_lookup:
haftmann@35602
   250
  assumes "sorted t1" "sorted t2" 
haftmann@35602
   251
  shows "entries t1 = entries t2 \<longleftrightarrow> lookup t1 = lookup t2"
haftmann@35618
   252
  using assms by (auto intro: entries_eqI simp add: map_of_entries [symmetric])
haftmann@35602
   253
haftmann@35550
   254
lemma lookup_from_in_tree: 
haftmann@35602
   255
  assumes "sorted t1" "sorted t2" 
haftmann@35602
   256
  and "\<And>v. (k\<Colon>'a\<Colon>linorder, v) \<in> set (entries t1) \<longleftrightarrow> (k, v) \<in> set (entries t2)" 
haftmann@35534
   257
  shows "lookup t1 k = lookup t2 k"
haftmann@35602
   258
proof -
haftmann@35602
   259
  from assms have "k \<in> dom (lookup t1) \<longleftrightarrow> k \<in> dom (lookup t2)"
haftmann@35602
   260
    by (simp add: keys_entries lookup_keys)
haftmann@35602
   261
  with assms show ?thesis by (auto simp add: lookup_in_tree [symmetric])
krauss@26192
   262
qed
krauss@26192
   263
haftmann@35550
   264
haftmann@35550
   265
subsubsection {* Red-black properties *}
krauss@26192
   266
haftmann@35534
   267
primrec color_of :: "('a, 'b) rbt \<Rightarrow> color"
krauss@26192
   268
where
haftmann@35534
   269
  "color_of Empty = B"
haftmann@35534
   270
| "color_of (Branch c _ _ _ _) = c"
krauss@26192
   271
haftmann@35534
   272
primrec bheight :: "('a,'b) rbt \<Rightarrow> nat"
haftmann@35534
   273
where
haftmann@35534
   274
  "bheight Empty = 0"
haftmann@35534
   275
| "bheight (Branch c lt k v rt) = (if c = B then Suc (bheight lt) else bheight lt)"
haftmann@35534
   276
haftmann@35534
   277
primrec inv1 :: "('a, 'b) rbt \<Rightarrow> bool"
krauss@26192
   278
where
krauss@26192
   279
  "inv1 Empty = True"
haftmann@35534
   280
| "inv1 (Branch c lt k v rt) \<longleftrightarrow> inv1 lt \<and> inv1 rt \<and> (c = B \<or> color_of lt = B \<and> color_of rt = B)"
krauss@26192
   281
haftmann@35534
   282
primrec inv1l :: "('a, 'b) rbt \<Rightarrow> bool" -- {* Weaker version *}
krauss@26192
   283
where
krauss@26192
   284
  "inv1l Empty = True"
haftmann@35534
   285
| "inv1l (Branch c l k v r) = (inv1 l \<and> inv1 r)"
krauss@26192
   286
lemma [simp]: "inv1 t \<Longrightarrow> inv1l t" by (cases t) simp+
krauss@26192
   287
haftmann@35534
   288
primrec inv2 :: "('a, 'b) rbt \<Rightarrow> bool"
krauss@26192
   289
where
krauss@26192
   290
  "inv2 Empty = True"
haftmann@35534
   291
| "inv2 (Branch c lt k v rt) = (inv2 lt \<and> inv2 rt \<and> bheight lt = bheight rt)"
krauss@26192
   292
haftmann@35534
   293
definition is_rbt :: "('a\<Colon>linorder, 'b) rbt \<Rightarrow> bool" where
haftmann@35534
   294
  "is_rbt t \<longleftrightarrow> inv1 t \<and> inv2 t \<and> color_of t = B \<and> sorted t"
krauss@26192
   295
haftmann@35534
   296
lemma is_rbt_sorted [simp]:
haftmann@35534
   297
  "is_rbt t \<Longrightarrow> sorted t" by (simp add: is_rbt_def)
krauss@26192
   298
haftmann@35534
   299
theorem Empty_is_rbt [simp]:
haftmann@35534
   300
  "is_rbt Empty" by (simp add: is_rbt_def)
krauss@26192
   301
krauss@26192
   302
krauss@26192
   303
subsection {* Insertion *}
krauss@26192
   304
krauss@26192
   305
fun (* slow, due to massive case splitting *)
krauss@26192
   306
  balance :: "('a,'b) rbt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   307
where
haftmann@35534
   308
  "balance (Branch R a w x b) s t (Branch R c y z d) = Branch R (Branch B a w x b) s t (Branch B c y z d)" |
haftmann@35534
   309
  "balance (Branch R (Branch R a w x b) s t c) y z d = Branch R (Branch B a w x b) s t (Branch B c y z d)" |
haftmann@35534
   310
  "balance (Branch R a w x (Branch R b s t c)) y z d = Branch R (Branch B a w x b) s t (Branch B c y z d)" |
haftmann@35534
   311
  "balance a w x (Branch R b s t (Branch R c y z d)) = Branch R (Branch B a w x b) s t (Branch B c y z d)" |
haftmann@35534
   312
  "balance a w x (Branch R (Branch R b s t c) y z d) = Branch R (Branch B a w x b) s t (Branch B c y z d)" |
haftmann@35534
   313
  "balance a s t b = Branch B a s t b"
krauss@26192
   314
krauss@26192
   315
lemma balance_inv1: "\<lbrakk>inv1l l; inv1l r\<rbrakk> \<Longrightarrow> inv1 (balance l k v r)" 
krauss@26192
   316
  by (induct l k v r rule: balance.induct) auto
krauss@26192
   317
haftmann@35534
   318
lemma balance_bheight: "bheight l = bheight r \<Longrightarrow> bheight (balance l k v r) = Suc (bheight l)"
krauss@26192
   319
  by (induct l k v r rule: balance.induct) auto
krauss@26192
   320
krauss@26192
   321
lemma balance_inv2: 
haftmann@35534
   322
  assumes "inv2 l" "inv2 r" "bheight l = bheight r"
krauss@26192
   323
  shows "inv2 (balance l k v r)"
krauss@26192
   324
  using assms
krauss@26192
   325
  by (induct l k v r rule: balance.induct) auto
krauss@26192
   326
haftmann@35534
   327
lemma balance_tree_greater[simp]: "(v \<guillemotleft>| balance a k x b) = (v \<guillemotleft>| a \<and> v \<guillemotleft>| b \<and> v < k)" 
krauss@26192
   328
  by (induct a k x b rule: balance.induct) auto
krauss@26192
   329
haftmann@35534
   330
lemma balance_tree_less[simp]: "(balance a k x b |\<guillemotleft> v) = (a |\<guillemotleft> v \<and> b |\<guillemotleft> v \<and> k < v)"
krauss@26192
   331
  by (induct a k x b rule: balance.induct) auto
krauss@26192
   332
haftmann@35534
   333
lemma balance_sorted: 
krauss@26192
   334
  fixes k :: "'a::linorder"
haftmann@35534
   335
  assumes "sorted l" "sorted r" "l |\<guillemotleft> k" "k \<guillemotleft>| r"
haftmann@35534
   336
  shows "sorted (balance l k v r)"
krauss@26192
   337
using assms proof (induct l k v r rule: balance.induct)
krauss@26192
   338
  case ("2_2" a x w b y t c z s va vb vd vc)
haftmann@35534
   339
  hence "y < z \<and> z \<guillemotleft>| Branch B va vb vd vc" 
haftmann@35534
   340
    by (auto simp add: tree_ord_props)
haftmann@35534
   341
  hence "tree_greater y (Branch B va vb vd vc)" by (blast dest: tree_greater_trans)
krauss@26192
   342
  with "2_2" show ?case by simp
krauss@26192
   343
next
krauss@26192
   344
  case ("3_2" va vb vd vc x w b y s c z)
haftmann@35534
   345
  from "3_2" have "x < y \<and> tree_less x (Branch B va vb vd vc)" 
haftmann@35534
   346
    by simp
haftmann@35534
   347
  hence "tree_less y (Branch B va vb vd vc)" by (blast dest: tree_less_trans)
krauss@26192
   348
  with "3_2" show ?case by simp
krauss@26192
   349
next
krauss@26192
   350
  case ("3_3" x w b y s c z t va vb vd vc)
haftmann@35534
   351
  from "3_3" have "y < z \<and> tree_greater z (Branch B va vb vd vc)" by simp
haftmann@35534
   352
  hence "tree_greater y (Branch B va vb vd vc)" by (blast dest: tree_greater_trans)
krauss@26192
   353
  with "3_3" show ?case by simp
krauss@26192
   354
next
krauss@26192
   355
  case ("3_4" vd ve vg vf x w b y s c z t va vb vii vc)
haftmann@35534
   356
  hence "x < y \<and> tree_less x (Branch B vd ve vg vf)" by simp
haftmann@35534
   357
  hence 1: "tree_less y (Branch B vd ve vg vf)" by (blast dest: tree_less_trans)
haftmann@35534
   358
  from "3_4" have "y < z \<and> tree_greater z (Branch B va vb vii vc)" by simp
haftmann@35534
   359
  hence "tree_greater y (Branch B va vb vii vc)" by (blast dest: tree_greater_trans)
krauss@26192
   360
  with 1 "3_4" show ?case by simp
krauss@26192
   361
next
krauss@26192
   362
  case ("4_2" va vb vd vc x w b y s c z t dd)
haftmann@35534
   363
  hence "x < y \<and> tree_less x (Branch B va vb vd vc)" by simp
haftmann@35534
   364
  hence "tree_less y (Branch B va vb vd vc)" by (blast dest: tree_less_trans)
krauss@26192
   365
  with "4_2" show ?case by simp
krauss@26192
   366
next
krauss@26192
   367
  case ("5_2" x w b y s c z t va vb vd vc)
haftmann@35534
   368
  hence "y < z \<and> tree_greater z (Branch B va vb vd vc)" by simp
haftmann@35534
   369
  hence "tree_greater y (Branch B va vb vd vc)" by (blast dest: tree_greater_trans)
krauss@26192
   370
  with "5_2" show ?case by simp
krauss@26192
   371
next
krauss@26192
   372
  case ("5_3" va vb vd vc x w b y s c z t)
haftmann@35534
   373
  hence "x < y \<and> tree_less x (Branch B va vb vd vc)" by simp
haftmann@35534
   374
  hence "tree_less y (Branch B va vb vd vc)" by (blast dest: tree_less_trans)
krauss@26192
   375
  with "5_3" show ?case by simp
krauss@26192
   376
next
krauss@26192
   377
  case ("5_4" va vb vg vc x w b y s c z t vd ve vii vf)
haftmann@35534
   378
  hence "x < y \<and> tree_less x (Branch B va vb vg vc)" by simp
haftmann@35534
   379
  hence 1: "tree_less y (Branch B va vb vg vc)" by (blast dest: tree_less_trans)
haftmann@35534
   380
  from "5_4" have "y < z \<and> tree_greater z (Branch B vd ve vii vf)" by simp
haftmann@35534
   381
  hence "tree_greater y (Branch B vd ve vii vf)" by (blast dest: tree_greater_trans)
krauss@26192
   382
  with 1 "5_4" show ?case by simp
krauss@26192
   383
qed simp+
krauss@26192
   384
haftmann@35550
   385
lemma entries_balance [simp]:
haftmann@35550
   386
  "entries (balance l k v r) = entries l @ (k, v) # entries r"
haftmann@35550
   387
  by (induct l k v r rule: balance.induct) auto
krauss@26192
   388
haftmann@35550
   389
lemma keys_balance [simp]: 
haftmann@35550
   390
  "keys (balance l k v r) = keys l @ k # keys r"
haftmann@35550
   391
  by (simp add: keys_def)
haftmann@35550
   392
haftmann@35550
   393
lemma balance_in_tree:  
haftmann@35550
   394
  "entry_in_tree k x (balance l v y r) \<longleftrightarrow> entry_in_tree k x l \<or> k = v \<and> x = y \<or> entry_in_tree k x r"
haftmann@35550
   395
  by (auto simp add: keys_def)
krauss@26192
   396
haftmann@35534
   397
lemma lookup_balance[simp]: 
krauss@26192
   398
fixes k :: "'a::linorder"
haftmann@35534
   399
assumes "sorted l" "sorted r" "l |\<guillemotleft> k" "k \<guillemotleft>| r"
haftmann@35534
   400
shows "lookup (balance l k v r) x = lookup (Branch B l k v r) x"
haftmann@35550
   401
by (rule lookup_from_in_tree) (auto simp:assms balance_in_tree balance_sorted)
krauss@26192
   402
krauss@26192
   403
primrec paint :: "color \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   404
where
krauss@26192
   405
  "paint c Empty = Empty"
haftmann@35534
   406
| "paint c (Branch _ l k v r) = Branch c l k v r"
krauss@26192
   407
krauss@26192
   408
lemma paint_inv1l[simp]: "inv1l t \<Longrightarrow> inv1l (paint c t)" by (cases t) auto
krauss@26192
   409
lemma paint_inv1[simp]: "inv1l t \<Longrightarrow> inv1 (paint B t)" by (cases t) auto
krauss@26192
   410
lemma paint_inv2[simp]: "inv2 t \<Longrightarrow> inv2 (paint c t)" by (cases t) auto
haftmann@35534
   411
lemma paint_color_of[simp]: "color_of (paint B t) = B" by (cases t) auto
haftmann@35534
   412
lemma paint_sorted[simp]: "sorted t \<Longrightarrow> sorted (paint c t)" by (cases t) auto
haftmann@35550
   413
lemma paint_in_tree[simp]: "entry_in_tree k x (paint c t) = entry_in_tree k x t" by (cases t) auto
haftmann@35534
   414
lemma paint_lookup[simp]: "lookup (paint c t) = lookup t" by (rule ext) (cases t, auto)
haftmann@35534
   415
lemma paint_tree_greater[simp]: "(v \<guillemotleft>| paint c t) = (v \<guillemotleft>| t)" by (cases t) auto
haftmann@35534
   416
lemma paint_tree_less[simp]: "(paint c t |\<guillemotleft> v) = (t |\<guillemotleft> v)" by (cases t) auto
krauss@26192
   417
krauss@26192
   418
fun
krauss@26192
   419
  ins :: "('a\<Colon>linorder \<Rightarrow> 'b \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   420
where
haftmann@35534
   421
  "ins f k v Empty = Branch R Empty k v Empty" |
haftmann@35534
   422
  "ins f k v (Branch B l x y r) = (if k < x then balance (ins f k v l) x y r
krauss@26192
   423
                               else if k > x then balance l x y (ins f k v r)
haftmann@35534
   424
                               else Branch B l x (f k y v) r)" |
haftmann@35534
   425
  "ins f k v (Branch R l x y r) = (if k < x then Branch R (ins f k v l) x y r
haftmann@35534
   426
                               else if k > x then Branch R l x y (ins f k v r)
haftmann@35534
   427
                               else Branch R l x (f k y v) r)"
krauss@26192
   428
krauss@26192
   429
lemma ins_inv1_inv2: 
krauss@26192
   430
  assumes "inv1 t" "inv2 t"
haftmann@35534
   431
  shows "inv2 (ins f k x t)" "bheight (ins f k x t) = bheight t" 
haftmann@35534
   432
  "color_of t = B \<Longrightarrow> inv1 (ins f k x t)" "inv1l (ins f k x t)"
krauss@26192
   433
  using assms
haftmann@35534
   434
  by (induct f k x t rule: ins.induct) (auto simp: balance_inv1 balance_inv2 balance_bheight)
krauss@26192
   435
haftmann@35534
   436
lemma ins_tree_greater[simp]: "(v \<guillemotleft>| ins f k x t) = (v \<guillemotleft>| t \<and> k > v)"
krauss@26192
   437
  by (induct f k x t rule: ins.induct) auto
haftmann@35534
   438
lemma ins_tree_less[simp]: "(ins f k x t |\<guillemotleft> v) = (t |\<guillemotleft> v \<and> k < v)"
krauss@26192
   439
  by (induct f k x t rule: ins.induct) auto
haftmann@35534
   440
lemma ins_sorted[simp]: "sorted t \<Longrightarrow> sorted (ins f k x t)"
haftmann@35534
   441
  by (induct f k x t rule: ins.induct) (auto simp: balance_sorted)
krauss@26192
   442
haftmann@35550
   443
lemma keys_ins: "set (keys (ins f k v t)) = { k } \<union> set (keys t)"
haftmann@35550
   444
  by (induct f k v t rule: ins.induct) auto
krauss@26192
   445
haftmann@35534
   446
lemma lookup_ins: 
krauss@26192
   447
  fixes k :: "'a::linorder"
haftmann@35534
   448
  assumes "sorted t"
haftmann@35534
   449
  shows "lookup (ins f k v t) x = ((lookup t)(k |-> case lookup t k of None \<Rightarrow> v 
krauss@26192
   450
                                                       | Some w \<Rightarrow> f k w v)) x"
krauss@26192
   451
using assms by (induct f k v t rule: ins.induct) auto
krauss@26192
   452
krauss@26192
   453
definition
haftmann@35550
   454
  insert_with_key :: "('a\<Colon>linorder \<Rightarrow> 'b \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   455
where
haftmann@35550
   456
  "insert_with_key f k v t = paint B (ins f k v t)"
krauss@26192
   457
haftmann@35550
   458
lemma insertwk_sorted: "sorted t \<Longrightarrow> sorted (insert_with_key f k x t)"
haftmann@35550
   459
  by (auto simp: insert_with_key_def)
krauss@26192
   460
haftmann@35534
   461
theorem insertwk_is_rbt: 
haftmann@35534
   462
  assumes inv: "is_rbt t" 
haftmann@35550
   463
  shows "is_rbt (insert_with_key f k x t)"
krauss@26192
   464
using assms
haftmann@35550
   465
unfolding insert_with_key_def is_rbt_def
krauss@26192
   466
by (auto simp: ins_inv1_inv2)
krauss@26192
   467
haftmann@35534
   468
lemma lookup_insertwk: 
haftmann@35534
   469
  assumes "sorted t"
haftmann@35550
   470
  shows "lookup (insert_with_key f k v t) x = ((lookup t)(k |-> case lookup t k of None \<Rightarrow> v 
krauss@26192
   471
                                                       | Some w \<Rightarrow> f k w v)) x"
haftmann@35550
   472
unfolding insert_with_key_def using assms
haftmann@35534
   473
by (simp add:lookup_ins)
krauss@26192
   474
krauss@26192
   475
definition
haftmann@35550
   476
  insertw_def: "insert_with f = insert_with_key (\<lambda>_. f)"
krauss@26192
   477
haftmann@35550
   478
lemma insertw_sorted: "sorted t \<Longrightarrow> sorted (insert_with f k v t)" by (simp add: insertwk_sorted insertw_def)
haftmann@35550
   479
theorem insertw_is_rbt: "is_rbt t \<Longrightarrow> is_rbt (insert_with f k v t)" by (simp add: insertwk_is_rbt insertw_def)
krauss@26192
   480
haftmann@35534
   481
lemma lookup_insertw:
haftmann@35534
   482
  assumes "is_rbt t"
haftmann@35550
   483
  shows "lookup (insert_with f k v t) = (lookup t)(k \<mapsto> (if k:dom (lookup t) then f (the (lookup t k)) v else v))"
krauss@26192
   484
using assms
krauss@26192
   485
unfolding insertw_def
haftmann@35534
   486
by (rule_tac ext) (cases "lookup t k", auto simp:lookup_insertwk dom_def)
krauss@26192
   487
haftmann@35534
   488
definition insert :: "'a\<Colon>linorder \<Rightarrow> 'b \<Rightarrow> ('a, 'b) rbt \<Rightarrow> ('a, 'b) rbt" where
haftmann@35550
   489
  "insert = insert_with_key (\<lambda>_ _ nv. nv)"
krauss@26192
   490
haftmann@35534
   491
lemma insert_sorted: "sorted t \<Longrightarrow> sorted (insert k v t)" by (simp add: insertwk_sorted insert_def)
haftmann@35550
   492
theorem insert_is_rbt [simp]: "is_rbt t \<Longrightarrow> is_rbt (insert k v t)" by (simp add: insertwk_is_rbt insert_def)
krauss@26192
   493
haftmann@35534
   494
lemma lookup_insert: 
haftmann@35534
   495
  assumes "is_rbt t"
haftmann@35534
   496
  shows "lookup (insert k v t) = (lookup t)(k\<mapsto>v)"
haftmann@35534
   497
unfolding insert_def
krauss@26192
   498
using assms
haftmann@35534
   499
by (rule_tac ext) (simp add: lookup_insertwk split:option.split)
krauss@26192
   500
krauss@26192
   501
krauss@26192
   502
subsection {* Deletion *}
krauss@26192
   503
haftmann@35534
   504
lemma bheight_paintR'[simp]: "color_of t = B \<Longrightarrow> bheight (paint R t) = bheight t - 1"
krauss@26192
   505
by (cases t rule: rbt_cases) auto
krauss@26192
   506
krauss@26192
   507
fun
haftmann@35550
   508
  balance_left :: "('a,'b) rbt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   509
where
haftmann@35550
   510
  "balance_left (Branch R a k x b) s y c = Branch R (Branch B a k x b) s y c" |
haftmann@35550
   511
  "balance_left bl k x (Branch B a s y b) = balance bl k x (Branch R a s y b)" |
haftmann@35550
   512
  "balance_left bl k x (Branch R (Branch B a s y b) t z c) = Branch R (Branch B bl k x a) s y (balance b t z (paint R c))" |
haftmann@35550
   513
  "balance_left t k x s = Empty"
krauss@26192
   514
haftmann@35550
   515
lemma balance_left_inv2_with_inv1:
haftmann@35534
   516
  assumes "inv2 lt" "inv2 rt" "bheight lt + 1 = bheight rt" "inv1 rt"
haftmann@35550
   517
  shows "bheight (balance_left lt k v rt) = bheight lt + 1"
haftmann@35550
   518
  and   "inv2 (balance_left lt k v rt)"
krauss@26192
   519
using assms 
haftmann@35550
   520
by (induct lt k v rt rule: balance_left.induct) (auto simp: balance_inv2 balance_bheight)
krauss@26192
   521
haftmann@35550
   522
lemma balance_left_inv2_app: 
haftmann@35534
   523
  assumes "inv2 lt" "inv2 rt" "bheight lt + 1 = bheight rt" "color_of rt = B"
haftmann@35550
   524
  shows "inv2 (balance_left lt k v rt)" 
haftmann@35550
   525
        "bheight (balance_left lt k v rt) = bheight rt"
krauss@26192
   526
using assms 
haftmann@35550
   527
by (induct lt k v rt rule: balance_left.induct) (auto simp add: balance_inv2 balance_bheight)+ 
krauss@26192
   528
haftmann@35550
   529
lemma balance_left_inv1: "\<lbrakk>inv1l a; inv1 b; color_of b = B\<rbrakk> \<Longrightarrow> inv1 (balance_left a k x b)"
haftmann@35550
   530
  by (induct a k x b rule: balance_left.induct) (simp add: balance_inv1)+
krauss@26192
   531
haftmann@35550
   532
lemma balance_left_inv1l: "\<lbrakk> inv1l lt; inv1 rt \<rbrakk> \<Longrightarrow> inv1l (balance_left lt k x rt)"
haftmann@35550
   533
by (induct lt k x rt rule: balance_left.induct) (auto simp: balance_inv1)
krauss@26192
   534
haftmann@35550
   535
lemma balance_left_sorted: "\<lbrakk> sorted l; sorted r; tree_less k l; tree_greater k r \<rbrakk> \<Longrightarrow> sorted (balance_left l k v r)"
haftmann@35550
   536
apply (induct l k v r rule: balance_left.induct)
haftmann@35534
   537
apply (auto simp: balance_sorted)
haftmann@35534
   538
apply (unfold tree_greater_prop tree_less_prop)
krauss@26192
   539
by force+
krauss@26192
   540
haftmann@35550
   541
lemma balance_left_tree_greater: 
krauss@26192
   542
  fixes k :: "'a::order"
krauss@26192
   543
  assumes "k \<guillemotleft>| a" "k \<guillemotleft>| b" "k < x" 
haftmann@35550
   544
  shows "k \<guillemotleft>| balance_left a x t b"
krauss@26192
   545
using assms 
haftmann@35550
   546
by (induct a x t b rule: balance_left.induct) auto
krauss@26192
   547
haftmann@35550
   548
lemma balance_left_tree_less: 
krauss@26192
   549
  fixes k :: "'a::order"
krauss@26192
   550
  assumes "a |\<guillemotleft> k" "b |\<guillemotleft> k" "x < k" 
haftmann@35550
   551
  shows "balance_left a x t b |\<guillemotleft> k"
krauss@26192
   552
using assms
haftmann@35550
   553
by (induct a x t b rule: balance_left.induct) auto
krauss@26192
   554
haftmann@35550
   555
lemma balance_left_in_tree: 
haftmann@35534
   556
  assumes "inv1l l" "inv1 r" "bheight l + 1 = bheight r"
haftmann@35550
   557
  shows "entry_in_tree k v (balance_left l a b r) = (entry_in_tree k v l \<or> k = a \<and> v = b \<or> entry_in_tree k v r)"
krauss@26192
   558
using assms 
haftmann@35550
   559
by (induct l k v r rule: balance_left.induct) (auto simp: balance_in_tree)
krauss@26192
   560
krauss@26192
   561
fun
haftmann@35550
   562
  balance_right :: "('a,'b) rbt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   563
where
haftmann@35550
   564
  "balance_right a k x (Branch R b s y c) = Branch R a k x (Branch B b s y c)" |
haftmann@35550
   565
  "balance_right (Branch B a k x b) s y bl = balance (Branch R a k x b) s y bl" |
haftmann@35550
   566
  "balance_right (Branch R a k x (Branch B b s y c)) t z bl = Branch R (balance (paint R a) k x b) s y (Branch B c t z bl)" |
haftmann@35550
   567
  "balance_right t k x s = Empty"
krauss@26192
   568
haftmann@35550
   569
lemma balance_right_inv2_with_inv1:
haftmann@35534
   570
  assumes "inv2 lt" "inv2 rt" "bheight lt = bheight rt + 1" "inv1 lt"
haftmann@35550
   571
  shows "inv2 (balance_right lt k v rt) \<and> bheight (balance_right lt k v rt) = bheight lt"
krauss@26192
   572
using assms
haftmann@35550
   573
by (induct lt k v rt rule: balance_right.induct) (auto simp: balance_inv2 balance_bheight)
krauss@26192
   574
haftmann@35550
   575
lemma balance_right_inv1: "\<lbrakk>inv1 a; inv1l b; color_of a = B\<rbrakk> \<Longrightarrow> inv1 (balance_right a k x b)"
haftmann@35550
   576
by (induct a k x b rule: balance_right.induct) (simp add: balance_inv1)+
krauss@26192
   577
haftmann@35550
   578
lemma balance_right_inv1l: "\<lbrakk> inv1 lt; inv1l rt \<rbrakk> \<Longrightarrow>inv1l (balance_right lt k x rt)"
haftmann@35550
   579
by (induct lt k x rt rule: balance_right.induct) (auto simp: balance_inv1)
krauss@26192
   580
haftmann@35550
   581
lemma balance_right_sorted: "\<lbrakk> sorted l; sorted r; tree_less k l; tree_greater k r \<rbrakk> \<Longrightarrow> sorted (balance_right l k v r)"
haftmann@35550
   582
apply (induct l k v r rule: balance_right.induct)
haftmann@35534
   583
apply (auto simp:balance_sorted)
haftmann@35534
   584
apply (unfold tree_less_prop tree_greater_prop)
krauss@26192
   585
by force+
krauss@26192
   586
haftmann@35550
   587
lemma balance_right_tree_greater: 
krauss@26192
   588
  fixes k :: "'a::order"
krauss@26192
   589
  assumes "k \<guillemotleft>| a" "k \<guillemotleft>| b" "k < x" 
haftmann@35550
   590
  shows "k \<guillemotleft>| balance_right a x t b"
haftmann@35550
   591
using assms by (induct a x t b rule: balance_right.induct) auto
krauss@26192
   592
haftmann@35550
   593
lemma balance_right_tree_less: 
krauss@26192
   594
  fixes k :: "'a::order"
krauss@26192
   595
  assumes "a |\<guillemotleft> k" "b |\<guillemotleft> k" "x < k" 
haftmann@35550
   596
  shows "balance_right a x t b |\<guillemotleft> k"
haftmann@35550
   597
using assms by (induct a x t b rule: balance_right.induct) auto
krauss@26192
   598
haftmann@35550
   599
lemma balance_right_in_tree:
haftmann@35534
   600
  assumes "inv1 l" "inv1l r" "bheight l = bheight r + 1" "inv2 l" "inv2 r"
haftmann@35550
   601
  shows "entry_in_tree x y (balance_right l k v r) = (entry_in_tree x y l \<or> x = k \<and> y = v \<or> entry_in_tree x y r)"
haftmann@35550
   602
using assms by (induct l k v r rule: balance_right.induct) (auto simp: balance_in_tree)
krauss@26192
   603
krauss@26192
   604
fun
haftmann@35550
   605
  combine :: "('a,'b) rbt \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   606
where
haftmann@35550
   607
  "combine Empty x = x" 
haftmann@35550
   608
| "combine x Empty = x" 
haftmann@35550
   609
| "combine (Branch R a k x b) (Branch R c s y d) = (case (combine b c) of
haftmann@35534
   610
                                      Branch R b2 t z c2 \<Rightarrow> (Branch R (Branch R a k x b2) t z (Branch R c2 s y d)) |
haftmann@35534
   611
                                      bc \<Rightarrow> Branch R a k x (Branch R bc s y d))" 
haftmann@35550
   612
| "combine (Branch B a k x b) (Branch B c s y d) = (case (combine b c) of
haftmann@35534
   613
                                      Branch R b2 t z c2 \<Rightarrow> Branch R (Branch B a k x b2) t z (Branch B c2 s y d) |
haftmann@35550
   614
                                      bc \<Rightarrow> balance_left a k x (Branch B bc s y d))" 
haftmann@35550
   615
| "combine a (Branch R b k x c) = Branch R (combine a b) k x c" 
haftmann@35550
   616
| "combine (Branch R a k x b) c = Branch R a k x (combine b c)" 
krauss@26192
   617
haftmann@35550
   618
lemma combine_inv2:
haftmann@35534
   619
  assumes "inv2 lt" "inv2 rt" "bheight lt = bheight rt"
haftmann@35550
   620
  shows "bheight (combine lt rt) = bheight lt" "inv2 (combine lt rt)"
krauss@26192
   621
using assms 
haftmann@35550
   622
by (induct lt rt rule: combine.induct) 
haftmann@35550
   623
   (auto simp: balance_left_inv2_app split: rbt.splits color.splits)
krauss@26192
   624
haftmann@35550
   625
lemma combine_inv1: 
krauss@26192
   626
  assumes "inv1 lt" "inv1 rt"
haftmann@35550
   627
  shows "color_of lt = B \<Longrightarrow> color_of rt = B \<Longrightarrow> inv1 (combine lt rt)"
haftmann@35550
   628
         "inv1l (combine lt rt)"
krauss@26192
   629
using assms 
haftmann@35550
   630
by (induct lt rt rule: combine.induct)
haftmann@35550
   631
   (auto simp: balance_left_inv1 split: rbt.splits color.splits)
krauss@26192
   632
haftmann@35550
   633
lemma combine_tree_greater[simp]: 
krauss@26192
   634
  fixes k :: "'a::linorder"
krauss@26192
   635
  assumes "k \<guillemotleft>| l" "k \<guillemotleft>| r" 
haftmann@35550
   636
  shows "k \<guillemotleft>| combine l r"
krauss@26192
   637
using assms 
haftmann@35550
   638
by (induct l r rule: combine.induct)
haftmann@35550
   639
   (auto simp: balance_left_tree_greater split:rbt.splits color.splits)
krauss@26192
   640
haftmann@35550
   641
lemma combine_tree_less[simp]: 
krauss@26192
   642
  fixes k :: "'a::linorder"
krauss@26192
   643
  assumes "l |\<guillemotleft> k" "r |\<guillemotleft> k" 
haftmann@35550
   644
  shows "combine l r |\<guillemotleft> k"
krauss@26192
   645
using assms 
haftmann@35550
   646
by (induct l r rule: combine.induct)
haftmann@35550
   647
   (auto simp: balance_left_tree_less split:rbt.splits color.splits)
krauss@26192
   648
haftmann@35550
   649
lemma combine_sorted: 
krauss@26192
   650
  fixes k :: "'a::linorder"
haftmann@35534
   651
  assumes "sorted l" "sorted r" "l |\<guillemotleft> k" "k \<guillemotleft>| r"
haftmann@35550
   652
  shows "sorted (combine l r)"
haftmann@35550
   653
using assms proof (induct l r rule: combine.induct)
krauss@26192
   654
  case (3 a x v b c y w d)
krauss@26192
   655
  hence ineqs: "a |\<guillemotleft> x" "x \<guillemotleft>| b" "b |\<guillemotleft> k" "k \<guillemotleft>| c" "c |\<guillemotleft> y" "y \<guillemotleft>| d"
krauss@26192
   656
    by auto
krauss@26192
   657
  with 3
krauss@26192
   658
  show ?case
haftmann@35550
   659
    by (cases "combine b c" rule: rbt_cases)
haftmann@35550
   660
      (auto, (metis combine_tree_greater combine_tree_less ineqs ineqs tree_less_simps(2) tree_greater_simps(2) tree_greater_trans tree_less_trans)+)
krauss@26192
   661
next
krauss@26192
   662
  case (4 a x v b c y w d)
haftmann@35534
   663
  hence "x < k \<and> tree_greater k c" by simp
haftmann@35534
   664
  hence "tree_greater x c" by (blast dest: tree_greater_trans)
haftmann@35550
   665
  with 4 have 2: "tree_greater x (combine b c)" by (simp add: combine_tree_greater)
haftmann@35534
   666
  from 4 have "k < y \<and> tree_less k b" by simp
haftmann@35534
   667
  hence "tree_less y b" by (blast dest: tree_less_trans)
haftmann@35550
   668
  with 4 have 3: "tree_less y (combine b c)" by (simp add: combine_tree_less)
krauss@26192
   669
  show ?case
haftmann@35550
   670
  proof (cases "combine b c" rule: rbt_cases)
krauss@26192
   671
    case Empty
haftmann@35534
   672
    from 4 have "x < y \<and> tree_greater y d" by auto
haftmann@35534
   673
    hence "tree_greater x d" by (blast dest: tree_greater_trans)
haftmann@35534
   674
    with 4 Empty have "sorted a" and "sorted (Branch B Empty y w d)" and "tree_less x a" and "tree_greater x (Branch B Empty y w d)" by auto
haftmann@35550
   675
    with Empty show ?thesis by (simp add: balance_left_sorted)
krauss@26192
   676
  next
krauss@26192
   677
    case (Red lta va ka rta)
haftmann@35534
   678
    with 2 4 have "x < va \<and> tree_less x a" by simp
haftmann@35534
   679
    hence 5: "tree_less va a" by (blast dest: tree_less_trans)
haftmann@35534
   680
    from Red 3 4 have "va < y \<and> tree_greater y d" by simp
haftmann@35534
   681
    hence "tree_greater va d" by (blast dest: tree_greater_trans)
krauss@26192
   682
    with Red 2 3 4 5 show ?thesis by simp
krauss@26192
   683
  next
krauss@26192
   684
    case (Black lta va ka rta)
haftmann@35534
   685
    from 4 have "x < y \<and> tree_greater y d" by auto
haftmann@35534
   686
    hence "tree_greater x d" by (blast dest: tree_greater_trans)
haftmann@35550
   687
    with Black 2 3 4 have "sorted a" and "sorted (Branch B (combine b c) y w d)" and "tree_less x a" and "tree_greater x (Branch B (combine b c) y w d)" by auto
haftmann@35550
   688
    with Black show ?thesis by (simp add: balance_left_sorted)
krauss@26192
   689
  qed
krauss@26192
   690
next
krauss@26192
   691
  case (5 va vb vd vc b x w c)
haftmann@35534
   692
  hence "k < x \<and> tree_less k (Branch B va vb vd vc)" by simp
haftmann@35534
   693
  hence "tree_less x (Branch B va vb vd vc)" by (blast dest: tree_less_trans)
haftmann@35550
   694
  with 5 show ?case by (simp add: combine_tree_less)
krauss@26192
   695
next
krauss@26192
   696
  case (6 a x v b va vb vd vc)
haftmann@35534
   697
  hence "x < k \<and> tree_greater k (Branch B va vb vd vc)" by simp
haftmann@35534
   698
  hence "tree_greater x (Branch B va vb vd vc)" by (blast dest: tree_greater_trans)
haftmann@35550
   699
  with 6 show ?case by (simp add: combine_tree_greater)
krauss@26192
   700
qed simp+
krauss@26192
   701
haftmann@35550
   702
lemma combine_in_tree: 
haftmann@35534
   703
  assumes "inv2 l" "inv2 r" "bheight l = bheight r" "inv1 l" "inv1 r"
haftmann@35550
   704
  shows "entry_in_tree k v (combine l r) = (entry_in_tree k v l \<or> entry_in_tree k v r)"
krauss@26192
   705
using assms 
haftmann@35550
   706
proof (induct l r rule: combine.induct)
krauss@26192
   707
  case (4 _ _ _ b c)
haftmann@35550
   708
  hence a: "bheight (combine b c) = bheight b" by (simp add: combine_inv2)
haftmann@35550
   709
  from 4 have b: "inv1l (combine b c)" by (simp add: combine_inv1)
krauss@26192
   710
krauss@26192
   711
  show ?case
haftmann@35550
   712
  proof (cases "combine b c" rule: rbt_cases)
krauss@26192
   713
    case Empty
haftmann@35550
   714
    with 4 a show ?thesis by (auto simp: balance_left_in_tree)
krauss@26192
   715
  next
krauss@26192
   716
    case (Red lta ka va rta)
krauss@26192
   717
    with 4 show ?thesis by auto
krauss@26192
   718
  next
krauss@26192
   719
    case (Black lta ka va rta)
haftmann@35550
   720
    with a b 4  show ?thesis by (auto simp: balance_left_in_tree)
krauss@26192
   721
  qed 
krauss@26192
   722
qed (auto split: rbt.splits color.splits)
krauss@26192
   723
krauss@26192
   724
fun
haftmann@35550
   725
  del_from_left :: "('a\<Colon>linorder) \<Rightarrow> ('a,'b) rbt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt" and
haftmann@35550
   726
  del_from_right :: "('a\<Colon>linorder) \<Rightarrow> ('a,'b) rbt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt" and
krauss@26192
   727
  del :: "('a\<Colon>linorder) \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   728
where
krauss@26192
   729
  "del x Empty = Empty" |
haftmann@35550
   730
  "del x (Branch c a y s b) = (if x < y then del_from_left x a y s b else (if x > y then del_from_right x a y s b else combine a b))" |
haftmann@35550
   731
  "del_from_left x (Branch B lt z v rt) y s b = balance_left (del x (Branch B lt z v rt)) y s b" |
haftmann@35550
   732
  "del_from_left x a y s b = Branch R (del x a) y s b" |
haftmann@35550
   733
  "del_from_right x a y s (Branch B lt z v rt) = balance_right a y s (del x (Branch B lt z v rt))" | 
haftmann@35550
   734
  "del_from_right x a y s b = Branch R a y s (del x b)"
krauss@26192
   735
krauss@26192
   736
lemma 
krauss@26192
   737
  assumes "inv2 lt" "inv1 lt"
krauss@26192
   738
  shows
haftmann@35534
   739
  "\<lbrakk>inv2 rt; bheight lt = bheight rt; inv1 rt\<rbrakk> \<Longrightarrow>
haftmann@35550
   740
  inv2 (del_from_left x lt k v rt) \<and> bheight (del_from_left x lt k v rt) = bheight lt \<and> (color_of lt = B \<and> color_of rt = B \<and> inv1 (del_from_left x lt k v rt) \<or> (color_of lt \<noteq> B \<or> color_of rt \<noteq> B) \<and> inv1l (del_from_left x lt k v rt))"
haftmann@35534
   741
  and "\<lbrakk>inv2 rt; bheight lt = bheight rt; inv1 rt\<rbrakk> \<Longrightarrow>
haftmann@35550
   742
  inv2 (del_from_right x lt k v rt) \<and> bheight (del_from_right x lt k v rt) = bheight lt \<and> (color_of lt = B \<and> color_of rt = B \<and> inv1 (del_from_right x lt k v rt) \<or> (color_of lt \<noteq> B \<or> color_of rt \<noteq> B) \<and> inv1l (del_from_right x lt k v rt))"
haftmann@35534
   743
  and del_inv1_inv2: "inv2 (del x lt) \<and> (color_of lt = R \<and> bheight (del x lt) = bheight lt \<and> inv1 (del x lt) 
haftmann@35534
   744
  \<or> color_of lt = B \<and> bheight (del x lt) = bheight lt - 1 \<and> inv1l (del x lt))"
krauss@26192
   745
using assms
haftmann@35550
   746
proof (induct x lt k v rt and x lt k v rt and x lt rule: del_from_left_del_from_right_del.induct)
krauss@26192
   747
case (2 y c _ y')
krauss@26192
   748
  have "y = y' \<or> y < y' \<or> y > y'" by auto
krauss@26192
   749
  thus ?case proof (elim disjE)
krauss@26192
   750
    assume "y = y'"
haftmann@35550
   751
    with 2 show ?thesis by (cases c) (simp add: combine_inv2 combine_inv1)+
krauss@26192
   752
  next
krauss@26192
   753
    assume "y < y'"
krauss@26192
   754
    with 2 show ?thesis by (cases c) auto
krauss@26192
   755
  next
krauss@26192
   756
    assume "y' < y"
krauss@26192
   757
    with 2 show ?thesis by (cases c) auto
krauss@26192
   758
  qed
krauss@26192
   759
next
krauss@26192
   760
  case (3 y lt z v rta y' ss bb) 
haftmann@35550
   761
  thus ?case by (cases "color_of (Branch B lt z v rta) = B \<and> color_of bb = B") (simp add: balance_left_inv2_with_inv1 balance_left_inv1 balance_left_inv1l)+
krauss@26192
   762
next
krauss@26192
   763
  case (5 y a y' ss lt z v rta)
haftmann@35550
   764
  thus ?case by (cases "color_of a = B \<and> color_of (Branch B lt z v rta) = B") (simp add: balance_right_inv2_with_inv1 balance_right_inv1 balance_right_inv1l)+
krauss@26192
   765
next
haftmann@35534
   766
  case ("6_1" y a y' ss) thus ?case by (cases "color_of a = B \<and> color_of Empty = B") simp+
krauss@26192
   767
qed auto
krauss@26192
   768
krauss@26192
   769
lemma 
haftmann@35550
   770
  del_from_left_tree_less: "\<lbrakk>tree_less v lt; tree_less v rt; k < v\<rbrakk> \<Longrightarrow> tree_less v (del_from_left x lt k y rt)"
haftmann@35550
   771
  and del_from_right_tree_less: "\<lbrakk>tree_less v lt; tree_less v rt; k < v\<rbrakk> \<Longrightarrow> tree_less v (del_from_right x lt k y rt)"
haftmann@35534
   772
  and del_tree_less: "tree_less v lt \<Longrightarrow> tree_less v (del x lt)"
haftmann@35550
   773
by (induct x lt k y rt and x lt k y rt and x lt rule: del_from_left_del_from_right_del.induct) 
haftmann@35550
   774
   (auto simp: balance_left_tree_less balance_right_tree_less)
krauss@26192
   775
haftmann@35550
   776
lemma del_from_left_tree_greater: "\<lbrakk>tree_greater v lt; tree_greater v rt; k > v\<rbrakk> \<Longrightarrow> tree_greater v (del_from_left x lt k y rt)"
haftmann@35550
   777
  and del_from_right_tree_greater: "\<lbrakk>tree_greater v lt; tree_greater v rt; k > v\<rbrakk> \<Longrightarrow> tree_greater v (del_from_right x lt k y rt)"
haftmann@35534
   778
  and del_tree_greater: "tree_greater v lt \<Longrightarrow> tree_greater v (del x lt)"
haftmann@35550
   779
by (induct x lt k y rt and x lt k y rt and x lt rule: del_from_left_del_from_right_del.induct)
haftmann@35550
   780
   (auto simp: balance_left_tree_greater balance_right_tree_greater)
krauss@26192
   781
haftmann@35550
   782
lemma "\<lbrakk>sorted lt; sorted rt; tree_less k lt; tree_greater k rt\<rbrakk> \<Longrightarrow> sorted (del_from_left x lt k y rt)"
haftmann@35550
   783
  and "\<lbrakk>sorted lt; sorted rt; tree_less k lt; tree_greater k rt\<rbrakk> \<Longrightarrow> sorted (del_from_right x lt k y rt)"
haftmann@35534
   784
  and del_sorted: "sorted lt \<Longrightarrow> sorted (del x lt)"
haftmann@35550
   785
proof (induct x lt k y rt and x lt k y rt and x lt rule: del_from_left_del_from_right_del.induct)
krauss@26192
   786
  case (3 x lta zz v rta yy ss bb)
haftmann@35534
   787
  from 3 have "tree_less yy (Branch B lta zz v rta)" by simp
haftmann@35534
   788
  hence "tree_less yy (del x (Branch B lta zz v rta))" by (rule del_tree_less)
haftmann@35550
   789
  with 3 show ?case by (simp add: balance_left_sorted)
krauss@26192
   790
next
krauss@26192
   791
  case ("4_2" x vaa vbb vdd vc yy ss bb)
haftmann@35534
   792
  hence "tree_less yy (Branch R vaa vbb vdd vc)" by simp
haftmann@35534
   793
  hence "tree_less yy (del x (Branch R vaa vbb vdd vc))" by (rule del_tree_less)
krauss@26192
   794
  with "4_2" show ?case by simp
krauss@26192
   795
next
krauss@26192
   796
  case (5 x aa yy ss lta zz v rta) 
haftmann@35534
   797
  hence "tree_greater yy (Branch B lta zz v rta)" by simp
haftmann@35534
   798
  hence "tree_greater yy (del x (Branch B lta zz v rta))" by (rule del_tree_greater)
haftmann@35550
   799
  with 5 show ?case by (simp add: balance_right_sorted)
krauss@26192
   800
next
krauss@26192
   801
  case ("6_2" x aa yy ss vaa vbb vdd vc)
haftmann@35534
   802
  hence "tree_greater yy (Branch R vaa vbb vdd vc)" by simp
haftmann@35534
   803
  hence "tree_greater yy (del x (Branch R vaa vbb vdd vc))" by (rule del_tree_greater)
krauss@26192
   804
  with "6_2" show ?case by simp
haftmann@35550
   805
qed (auto simp: combine_sorted)
krauss@26192
   806
haftmann@35550
   807
lemma "\<lbrakk>sorted lt; sorted rt; tree_less kt lt; tree_greater kt rt; inv1 lt; inv1 rt; inv2 lt; inv2 rt; bheight lt = bheight rt; x < kt\<rbrakk> \<Longrightarrow> entry_in_tree k v (del_from_left x lt kt y rt) = (False \<or> (x \<noteq> k \<and> entry_in_tree k v (Branch c lt kt y rt)))"
haftmann@35550
   808
  and "\<lbrakk>sorted lt; sorted rt; tree_less kt lt; tree_greater kt rt; inv1 lt; inv1 rt; inv2 lt; inv2 rt; bheight lt = bheight rt; x > kt\<rbrakk> \<Longrightarrow> entry_in_tree k v (del_from_right x lt kt y rt) = (False \<or> (x \<noteq> k \<and> entry_in_tree k v (Branch c lt kt y rt)))"
haftmann@35550
   809
  and del_in_tree: "\<lbrakk>sorted t; inv1 t; inv2 t\<rbrakk> \<Longrightarrow> entry_in_tree k v (del x t) = (False \<or> (x \<noteq> k \<and> entry_in_tree k v t))"
haftmann@35550
   810
proof (induct x lt kt y rt and x lt kt y rt and x t rule: del_from_left_del_from_right_del.induct)
krauss@26192
   811
  case (2 xx c aa yy ss bb)
krauss@26192
   812
  have "xx = yy \<or> xx < yy \<or> xx > yy" by auto
krauss@26192
   813
  from this 2 show ?case proof (elim disjE)
krauss@26192
   814
    assume "xx = yy"
krauss@26192
   815
    with 2 show ?thesis proof (cases "xx = k")
krauss@26192
   816
      case True
haftmann@35534
   817
      from 2 `xx = yy` `xx = k` have "sorted (Branch c aa yy ss bb) \<and> k = yy" by simp
haftmann@35534
   818
      hence "\<not> entry_in_tree k v aa" "\<not> entry_in_tree k v bb" by (auto simp: tree_less_nit tree_greater_prop)
haftmann@35550
   819
      with `xx = yy` 2 `xx = k` show ?thesis by (simp add: combine_in_tree)
haftmann@35550
   820
    qed (simp add: combine_in_tree)
krauss@26192
   821
  qed simp+
krauss@26192
   822
next    
krauss@26192
   823
  case (3 xx lta zz vv rta yy ss bb)
haftmann@35534
   824
  def mt[simp]: mt == "Branch B lta zz vv rta"
krauss@26192
   825
  from 3 have "inv2 mt \<and> inv1 mt" by simp
haftmann@35534
   826
  hence "inv2 (del xx mt) \<and> (color_of mt = R \<and> bheight (del xx mt) = bheight mt \<and> inv1 (del xx mt) \<or> color_of mt = B \<and> bheight (del xx mt) = bheight mt - 1 \<and> inv1l (del xx mt))" by (blast dest: del_inv1_inv2)
haftmann@35550
   827
  with 3 have 4: "entry_in_tree k v (del_from_left xx mt yy ss bb) = (False \<or> xx \<noteq> k \<and> entry_in_tree k v mt \<or> (k = yy \<and> v = ss) \<or> entry_in_tree k v bb)" by (simp add: balance_left_in_tree)
krauss@26192
   828
  thus ?case proof (cases "xx = k")
krauss@26192
   829
    case True
haftmann@35534
   830
    from 3 True have "tree_greater yy bb \<and> yy > k" by simp
haftmann@35534
   831
    hence "tree_greater k bb" by (blast dest: tree_greater_trans)
haftmann@35534
   832
    with 3 4 True show ?thesis by (auto simp: tree_greater_nit)
krauss@26192
   833
  qed auto
krauss@26192
   834
next
krauss@26192
   835
  case ("4_1" xx yy ss bb)
krauss@26192
   836
  show ?case proof (cases "xx = k")
krauss@26192
   837
    case True
haftmann@35534
   838
    with "4_1" have "tree_greater yy bb \<and> k < yy" by simp
haftmann@35534
   839
    hence "tree_greater k bb" by (blast dest: tree_greater_trans)
krauss@26192
   840
    with "4_1" `xx = k` 
haftmann@35534
   841
   have "entry_in_tree k v (Branch R Empty yy ss bb) = entry_in_tree k v Empty" by (auto simp: tree_greater_nit)
krauss@26192
   842
    thus ?thesis by auto
krauss@26192
   843
  qed simp+
krauss@26192
   844
next
krauss@26192
   845
  case ("4_2" xx vaa vbb vdd vc yy ss bb)
krauss@26192
   846
  thus ?case proof (cases "xx = k")
krauss@26192
   847
    case True
haftmann@35534
   848
    with "4_2" have "k < yy \<and> tree_greater yy bb" by simp
haftmann@35534
   849
    hence "tree_greater k bb" by (blast dest: tree_greater_trans)
haftmann@35534
   850
    with True "4_2" show ?thesis by (auto simp: tree_greater_nit)
haftmann@35550
   851
  qed auto
krauss@26192
   852
next
krauss@26192
   853
  case (5 xx aa yy ss lta zz vv rta)
haftmann@35534
   854
  def mt[simp]: mt == "Branch B lta zz vv rta"
krauss@26192
   855
  from 5 have "inv2 mt \<and> inv1 mt" by simp
haftmann@35534
   856
  hence "inv2 (del xx mt) \<and> (color_of mt = R \<and> bheight (del xx mt) = bheight mt \<and> inv1 (del xx mt) \<or> color_of mt = B \<and> bheight (del xx mt) = bheight mt - 1 \<and> inv1l (del xx mt))" by (blast dest: del_inv1_inv2)
haftmann@35550
   857
  with 5 have 3: "entry_in_tree k v (del_from_right xx aa yy ss mt) = (entry_in_tree k v aa \<or> (k = yy \<and> v = ss) \<or> False \<or> xx \<noteq> k \<and> entry_in_tree k v mt)" by (simp add: balance_right_in_tree)
krauss@26192
   858
  thus ?case proof (cases "xx = k")
krauss@26192
   859
    case True
haftmann@35534
   860
    from 5 True have "tree_less yy aa \<and> yy < k" by simp
haftmann@35534
   861
    hence "tree_less k aa" by (blast dest: tree_less_trans)
haftmann@35534
   862
    with 3 5 True show ?thesis by (auto simp: tree_less_nit)
krauss@26192
   863
  qed auto
krauss@26192
   864
next
krauss@26192
   865
  case ("6_1" xx aa yy ss)
krauss@26192
   866
  show ?case proof (cases "xx = k")
krauss@26192
   867
    case True
haftmann@35534
   868
    with "6_1" have "tree_less yy aa \<and> k > yy" by simp
haftmann@35534
   869
    hence "tree_less k aa" by (blast dest: tree_less_trans)
haftmann@35534
   870
    with "6_1" `xx = k` show ?thesis by (auto simp: tree_less_nit)
krauss@26192
   871
  qed simp
krauss@26192
   872
next
krauss@26192
   873
  case ("6_2" xx aa yy ss vaa vbb vdd vc)
krauss@26192
   874
  thus ?case proof (cases "xx = k")
krauss@26192
   875
    case True
haftmann@35534
   876
    with "6_2" have "k > yy \<and> tree_less yy aa" by simp
haftmann@35534
   877
    hence "tree_less k aa" by (blast dest: tree_less_trans)
haftmann@35534
   878
    with True "6_2" show ?thesis by (auto simp: tree_less_nit)
haftmann@35550
   879
  qed auto
krauss@26192
   880
qed simp
krauss@26192
   881
krauss@26192
   882
krauss@26192
   883
definition delete where
krauss@26192
   884
  delete_def: "delete k t = paint B (del k t)"
krauss@26192
   885
haftmann@35550
   886
theorem delete_is_rbt [simp]: assumes "is_rbt t" shows "is_rbt (delete k t)"
krauss@26192
   887
proof -
haftmann@35534
   888
  from assms have "inv2 t" and "inv1 t" unfolding is_rbt_def by auto 
haftmann@35534
   889
  hence "inv2 (del k t) \<and> (color_of t = R \<and> bheight (del k t) = bheight t \<and> inv1 (del k t) \<or> color_of t = B \<and> bheight (del k t) = bheight t - 1 \<and> inv1l (del k t))" by (rule del_inv1_inv2)
haftmann@35534
   890
  hence "inv2 (del k t) \<and> inv1l (del k t)" by (cases "color_of t") auto
krauss@26192
   891
  with assms show ?thesis
haftmann@35534
   892
    unfolding is_rbt_def delete_def
haftmann@35534
   893
    by (auto intro: paint_sorted del_sorted)
krauss@26192
   894
qed
krauss@26192
   895
haftmann@35550
   896
lemma delete_in_tree: 
haftmann@35534
   897
  assumes "is_rbt t" 
haftmann@35534
   898
  shows "entry_in_tree k v (delete x t) = (x \<noteq> k \<and> entry_in_tree k v t)"
haftmann@35534
   899
  using assms unfolding is_rbt_def delete_def
haftmann@35550
   900
  by (auto simp: del_in_tree)
krauss@26192
   901
haftmann@35534
   902
lemma lookup_delete:
haftmann@35534
   903
  assumes is_rbt: "is_rbt t"
haftmann@35534
   904
  shows "lookup (delete k t) = (lookup t)|`(-{k})"
krauss@26192
   905
proof
krauss@26192
   906
  fix x
haftmann@35534
   907
  show "lookup (delete k t) x = (lookup t |` (-{k})) x" 
krauss@26192
   908
  proof (cases "x = k")
krauss@26192
   909
    assume "x = k" 
haftmann@35534
   910
    with is_rbt show ?thesis
haftmann@35550
   911
      by (cases "lookup (delete k t) k") (auto simp: lookup_in_tree delete_in_tree)
krauss@26192
   912
  next
krauss@26192
   913
    assume "x \<noteq> k"
krauss@26192
   914
    thus ?thesis
haftmann@35550
   915
      by auto (metis is_rbt delete_is_rbt delete_in_tree is_rbt_sorted lookup_from_in_tree)
krauss@26192
   916
  qed
krauss@26192
   917
qed
krauss@26192
   918
haftmann@35550
   919
krauss@26192
   920
subsection {* Union *}
krauss@26192
   921
krauss@26192
   922
primrec
haftmann@35550
   923
  union_with_key :: "('a\<Colon>linorder \<Rightarrow> 'b \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt \<Rightarrow> ('a,'b) rbt"
krauss@26192
   924
where
haftmann@35550
   925
  "union_with_key f t Empty = t"
haftmann@35550
   926
| "union_with_key f t (Branch c lt k v rt) = union_with_key f (union_with_key f (insert_with_key f k v t) lt) rt"
krauss@26192
   927
haftmann@35550
   928
lemma unionwk_sorted: "sorted lt \<Longrightarrow> sorted (union_with_key f lt rt)" 
haftmann@35534
   929
  by (induct rt arbitrary: lt) (auto simp: insertwk_sorted)
haftmann@35550
   930
theorem unionwk_is_rbt[simp]: "is_rbt lt \<Longrightarrow> is_rbt (union_with_key f lt rt)" 
haftmann@35534
   931
  by (induct rt arbitrary: lt) (simp add: insertwk_is_rbt)+
krauss@26192
   932
krauss@26192
   933
definition
haftmann@35550
   934
  union_with where
haftmann@35550
   935
  "union_with f = union_with_key (\<lambda>_. f)"
krauss@26192
   936
haftmann@35550
   937
theorem unionw_is_rbt: "is_rbt lt \<Longrightarrow> is_rbt (union_with f lt rt)" unfolding union_with_def by simp
krauss@26192
   938
krauss@26192
   939
definition union where
haftmann@35550
   940
  "union = union_with_key (%_ _ rv. rv)"
krauss@26192
   941
haftmann@35534
   942
theorem union_is_rbt: "is_rbt lt \<Longrightarrow> is_rbt (union lt rt)" unfolding union_def by simp
krauss@26192
   943
haftmann@35534
   944
lemma union_Branch[simp]:
haftmann@35534
   945
  "union t (Branch c lt k v rt) = union (union (insert k v t) lt) rt"
haftmann@35534
   946
  unfolding union_def insert_def
krauss@26192
   947
  by simp
krauss@26192
   948
haftmann@35534
   949
lemma lookup_union:
haftmann@35534
   950
  assumes "is_rbt s" "sorted t"
haftmann@35534
   951
  shows "lookup (union s t) = lookup s ++ lookup t"
krauss@26192
   952
using assms
krauss@26192
   953
proof (induct t arbitrary: s)
krauss@26192
   954
  case Empty thus ?case by (auto simp: union_def)
krauss@26192
   955
next
haftmann@35534
   956
  case (Branch c l k v r s)
haftmann@35550
   957
  then have "sorted r" "sorted l" "l |\<guillemotleft> k" "k \<guillemotleft>| r" by auto
krauss@26192
   958
haftmann@35534
   959
  have meq: "lookup s(k \<mapsto> v) ++ lookup l ++ lookup r =
haftmann@35534
   960
    lookup s ++
haftmann@35534
   961
    (\<lambda>a. if a < k then lookup l a
haftmann@35534
   962
    else if k < a then lookup r a else Some v)" (is "?m1 = ?m2")
krauss@26192
   963
  proof (rule ext)
krauss@26192
   964
    fix a
krauss@26192
   965
krauss@26192
   966
   have "k < a \<or> k = a \<or> k > a" by auto
krauss@26192
   967
    thus "?m1 a = ?m2 a"
krauss@26192
   968
    proof (elim disjE)
krauss@26192
   969
      assume "k < a"
haftmann@35534
   970
      with `l |\<guillemotleft> k` have "l |\<guillemotleft> a" by (rule tree_less_trans)
krauss@26192
   971
      with `k < a` show ?thesis
krauss@26192
   972
        by (auto simp: map_add_def split: option.splits)
krauss@26192
   973
    next
krauss@26192
   974
      assume "k = a"
krauss@26192
   975
      with `l |\<guillemotleft> k` `k \<guillemotleft>| r` 
krauss@26192
   976
      show ?thesis by (auto simp: map_add_def)
krauss@26192
   977
    next
krauss@26192
   978
      assume "a < k"
haftmann@35534
   979
      from this `k \<guillemotleft>| r` have "a \<guillemotleft>| r" by (rule tree_greater_trans)
krauss@26192
   980
      with `a < k` show ?thesis
krauss@26192
   981
        by (auto simp: map_add_def split: option.splits)
krauss@26192
   982
    qed
krauss@26192
   983
  qed
krauss@26192
   984
haftmann@36147
   985
  from Branch have is_rbt: "is_rbt (RBT_Impl.union (RBT_Impl.insert k v s) l)"
haftmann@35550
   986
    by (auto intro: union_is_rbt insert_is_rbt)
haftmann@35550
   987
  with Branch have IHs:
haftmann@35534
   988
    "lookup (union (union (insert k v s) l) r) = lookup (union (insert k v s) l) ++ lookup r"
haftmann@35534
   989
    "lookup (union (insert k v s) l) = lookup (insert k v s) ++ lookup l"
haftmann@35550
   990
    by auto
krauss@26192
   991
  
krauss@26192
   992
  with meq show ?case
haftmann@35534
   993
    by (auto simp: lookup_insert[OF Branch(3)])
haftmann@35550
   994
krauss@26192
   995
qed
krauss@26192
   996
haftmann@35550
   997
haftmann@35550
   998
subsection {* Modifying existing entries *}
krauss@26192
   999
krauss@26192
  1000
primrec
haftmann@35602
  1001
  map_entry :: "'a\<Colon>linorder \<Rightarrow> ('b \<Rightarrow> 'b) \<Rightarrow> ('a, 'b) rbt \<Rightarrow> ('a, 'b) rbt"
krauss@26192
  1002
where
haftmann@35602
  1003
  "map_entry k f Empty = Empty"
haftmann@35602
  1004
| "map_entry k f (Branch c lt x v rt) =
haftmann@35602
  1005
    (if k < x then Branch c (map_entry k f lt) x v rt
haftmann@35602
  1006
    else if k > x then (Branch c lt x v (map_entry k f rt))
haftmann@35602
  1007
    else Branch c lt x (f v) rt)"
krauss@26192
  1008
haftmann@35602
  1009
lemma map_entry_color_of: "color_of (map_entry k f t) = color_of t" by (induct t) simp+
haftmann@35602
  1010
lemma map_entry_inv1: "inv1 (map_entry k f t) = inv1 t" by (induct t) (simp add: map_entry_color_of)+
haftmann@35602
  1011
lemma map_entry_inv2: "inv2 (map_entry k f t) = inv2 t" "bheight (map_entry k f t) = bheight t" by (induct t) simp+
haftmann@35602
  1012
lemma map_entry_tree_greater: "tree_greater a (map_entry k f t) = tree_greater a t" by (induct t) simp+
haftmann@35602
  1013
lemma map_entry_tree_less: "tree_less a (map_entry k f t) = tree_less a t" by (induct t) simp+
haftmann@35602
  1014
lemma map_entry_sorted: "sorted (map_entry k f t) = sorted t"
haftmann@35602
  1015
  by (induct t) (simp_all add: map_entry_tree_less map_entry_tree_greater)
krauss@26192
  1016
haftmann@35602
  1017
theorem map_entry_is_rbt [simp]: "is_rbt (map_entry k f t) = is_rbt t" 
haftmann@35602
  1018
unfolding is_rbt_def by (simp add: map_entry_inv2 map_entry_color_of map_entry_sorted map_entry_inv1 )
krauss@26192
  1019
haftmann@35618
  1020
theorem lookup_map_entry:
haftmann@35618
  1021
  "lookup (map_entry k f t) = (lookup t)(k := Option.map f (lookup t k))"
nipkow@39302
  1022
  by (induct t) (auto split: option.splits simp add: fun_eq_iff)
krauss@26192
  1023
krauss@26192
  1024
haftmann@35550
  1025
subsection {* Mapping all entries *}
krauss@26192
  1026
krauss@26192
  1027
primrec
haftmann@35602
  1028
  map :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> ('a, 'b) rbt \<Rightarrow> ('a, 'c) rbt"
krauss@26192
  1029
where
haftmann@35550
  1030
  "map f Empty = Empty"
haftmann@35550
  1031
| "map f (Branch c lt k v rt) = Branch c (map f lt) k (f k v) (map f rt)"
krauss@32237
  1032
haftmann@35550
  1033
lemma map_entries [simp]: "entries (map f t) = List.map (\<lambda>(k, v). (k, f k v)) (entries t)"
haftmann@35550
  1034
  by (induct t) auto
haftmann@35550
  1035
lemma map_keys [simp]: "keys (map f t) = keys t" by (simp add: keys_def split_def)
haftmann@35550
  1036
lemma map_tree_greater: "tree_greater k (map f t) = tree_greater k t" by (induct t) simp+
haftmann@35550
  1037
lemma map_tree_less: "tree_less k (map f t) = tree_less k t" by (induct t) simp+
haftmann@35550
  1038
lemma map_sorted: "sorted (map f t) = sorted t"  by (induct t) (simp add: map_tree_less map_tree_greater)+
haftmann@35550
  1039
lemma map_color_of: "color_of (map f t) = color_of t" by (induct t) simp+
haftmann@35550
  1040
lemma map_inv1: "inv1 (map f t) = inv1 t" by (induct t) (simp add: map_color_of)+
haftmann@35550
  1041
lemma map_inv2: "inv2 (map f t) = inv2 t" "bheight (map f t) = bheight t" by (induct t) simp+
haftmann@35550
  1042
theorem map_is_rbt [simp]: "is_rbt (map f t) = is_rbt t" 
haftmann@35550
  1043
unfolding is_rbt_def by (simp add: map_inv1 map_inv2 map_sorted map_color_of)
krauss@32237
  1044
haftmann@35618
  1045
theorem lookup_map: "lookup (map f t) x = Option.map (f x) (lookup t x)"
haftmann@35618
  1046
  by (induct t) auto
krauss@26192
  1047
haftmann@35550
  1048
haftmann@35550
  1049
subsection {* Folding over entries *}
haftmann@35550
  1050
haftmann@35550
  1051
definition fold :: "('a \<Rightarrow> 'b \<Rightarrow> 'c \<Rightarrow> 'c) \<Rightarrow> ('a, 'b) rbt \<Rightarrow> 'c \<Rightarrow> 'c" where
haftmann@37458
  1052
  "fold f t = More_List.fold (prod_case f) (entries t)"
krauss@26192
  1053
haftmann@35550
  1054
lemma fold_simps [simp, code]:
haftmann@35550
  1055
  "fold f Empty = id"
haftmann@35550
  1056
  "fold f (Branch c lt k v rt) = fold f rt \<circ> f k v \<circ> fold f lt"
nipkow@39302
  1057
  by (simp_all add: fold_def fun_eq_iff)
haftmann@35534
  1058
haftmann@35606
  1059
haftmann@35606
  1060
subsection {* Bulkloading a tree *}
haftmann@35606
  1061
haftmann@35618
  1062
definition bulkload :: "('a \<times> 'b) list \<Rightarrow> ('a\<Colon>linorder, 'b) rbt" where
haftmann@36147
  1063
  "bulkload xs = foldr (\<lambda>(k, v). insert k v) xs Empty"
haftmann@35606
  1064
haftmann@35606
  1065
lemma bulkload_is_rbt [simp, intro]:
haftmann@35606
  1066
  "is_rbt (bulkload xs)"
haftmann@35606
  1067
  unfolding bulkload_def by (induct xs) auto
haftmann@35606
  1068
haftmann@35606
  1069
lemma lookup_bulkload:
haftmann@36147
  1070
  "lookup (bulkload xs) = map_of xs"
haftmann@35606
  1071
proof -
haftmann@35606
  1072
  obtain ys where "ys = rev xs" by simp
haftmann@35606
  1073
  have "\<And>t. is_rbt t \<Longrightarrow>
haftmann@37458
  1074
    lookup (More_List.fold (prod_case insert) ys t) = lookup t ++ map_of (rev ys)"
haftmann@37458
  1075
      by (induct ys) (simp_all add: bulkload_def lookup_insert prod_case_beta)
haftmann@35606
  1076
  from this Empty_is_rbt have
haftmann@37458
  1077
    "lookup (More_List.fold (prod_case insert) (rev xs) Empty) = lookup Empty ++ map_of xs"
haftmann@35606
  1078
     by (simp add: `ys = rev xs`)
haftmann@37591
  1079
  then show ?thesis by (simp add: bulkload_def lookup_Empty foldr_fold_rev)
haftmann@35606
  1080
qed
haftmann@35606
  1081
wenzelm@36176
  1082
hide_const (open) Empty insert delete entries keys bulkload lookup map_entry map fold union sorted
krauss@26192
  1083
krauss@26192
  1084
end