--- a/src/HOL/Data_Structures/Tree_Map.thy Sat Dec 05 16:13:28 2015 +0100
+++ b/src/HOL/Data_Structures/Tree_Map.thy Sat Dec 05 16:33:20 2015 +0100
@@ -30,7 +30,7 @@
subsection "Functional Correctness Proofs"
-lemma lookup_eq:
+lemma lookup_map_of:
"sorted1(inorder t) \<Longrightarrow> lookup t x = map_of (inorder t) x"
by (induction t) (auto simp: map_of_simps split: option.split)
@@ -48,7 +48,7 @@
proof (standard, goal_cases)
case 1 show ?case by simp
next
- case 2 thus ?case by(simp add: lookup_eq)
+ case 2 thus ?case by(simp add: lookup_map_of)
next
case 3 thus ?case by(simp add: inorder_update)
next