--- a/src/HOL/Data_Structures/Tree_Set.thy Thu Mar 22 17:18:33 2018 +0100
+++ b/src/HOL/Data_Structures/Tree_Set.thy Fri Mar 23 11:37:02 2018 +0100
@@ -42,12 +42,8 @@
subsection "Functional Correctness Proofs"
-lemma "sorted(inorder t) \<Longrightarrow> isin t x = (x \<in> elems (inorder t))"
-by (induction t) (auto simp: elems_simps1)
-
-lemma isin_set: "sorted(inorder t) \<Longrightarrow> isin t x = (x \<in> elems (inorder t))"
-by (induction t) (auto simp: elems_simps2)
-
+lemma isin_set: "sorted(inorder t) \<Longrightarrow> isin t x = (x \<in> set (inorder t))"
+by (induction t) (auto simp: isin_simps)
lemma inorder_insert:
"sorted(inorder t) \<Longrightarrow> inorder(insert x t) = ins_list x (inorder t)"