src/HOL/Data_Structures/Tree23_Map.thy
changeset 68440 6826718f732d
parent 68431 b294e095f64c
     1.1 --- a/src/HOL/Data_Structures/Tree23_Map.thy	Wed Jun 13 11:53:25 2018 +0200
     1.2 +++ b/src/HOL/Data_Structures/Tree23_Map.thy	Wed Jun 13 15:24:20 2018 +0200
     1.3 @@ -81,7 +81,7 @@
     1.4    "sorted1(inorder t) \<Longrightarrow> inorder(tree\<^sub>i(upd x y t)) = upd_list x y (inorder t)"
     1.5  by(induction t) (auto simp: upd_list_simps split: up\<^sub>i.splits)
     1.6  
     1.7 -corollary inorder_update_23:
     1.8 +corollary inorder_update:
     1.9    "sorted1(inorder t) \<Longrightarrow> inorder(update x y t) = upd_list x y (inorder t)"
    1.10  by(simp add: update_def inorder_upd)
    1.11  
    1.12 @@ -91,7 +91,7 @@
    1.13  by(induction t rule: del.induct)
    1.14    (auto simp: del_list_simps inorder_nodes split_minD split!: if_split prod.splits)
    1.15  
    1.16 -corollary inorder_delete_23: "\<lbrakk> bal t ; sorted1(inorder t) \<rbrakk> \<Longrightarrow>
    1.17 +corollary inorder_delete: "\<lbrakk> bal t ; sorted1(inorder t) \<rbrakk> \<Longrightarrow>
    1.18    inorder(delete x t) = del_list x (inorder t)"
    1.19  by(simp add: delete_def inorder_del)
    1.20  
    1.21 @@ -119,7 +119,7 @@
    1.22  
    1.23  subsection \<open>Overall Correctness\<close>
    1.24  
    1.25 -interpretation Map_by_Ordered
    1.26 +interpretation M: Map_by_Ordered
    1.27  where empty = empty and lookup = lookup and update = update and delete = delete
    1.28  and inorder = inorder and inv = bal
    1.29  proof (standard, goal_cases)
    1.30 @@ -127,9 +127,9 @@
    1.31  next
    1.32    case 2 thus ?case by(simp add: lookup_map_of)
    1.33  next
    1.34 -  case 3 thus ?case by(simp add: inorder_update_23)
    1.35 +  case 3 thus ?case by(simp add: inorder_update)
    1.36  next
    1.37 -  case 4 thus ?case by(simp add: inorder_delete_23)
    1.38 +  case 4 thus ?case by(simp add: inorder_delete)
    1.39  next
    1.40    case 5 thus ?case by(simp add: empty_def)
    1.41  next