src/HOL/Lattices_Big.thy
changeset 61169 4de9ff3ea29a
parent 60758 d8d85a8172b5
child 61566 c3d6e570ccef
--- a/src/HOL/Lattices_Big.thy	Sun Sep 13 22:25:21 2015 +0200
+++ b/src/HOL/Lattices_Big.thy	Sun Sep 13 22:56:52 2015 +0200
@@ -21,7 +21,7 @@
 begin
 
 interpretation comp_fun_idem f
-  by default (simp_all add: fun_eq_iff left_commute)
+  by standard (simp_all add: fun_eq_iff left_commute)
 
 definition F :: "'a set \<Rightarrow> 'a"
 where
@@ -33,7 +33,7 @@
 proof (rule sym)
   let ?f = "\<lambda>x y. Some (case y of None \<Rightarrow> x | Some z \<Rightarrow> f x z)"
   interpret comp_fun_idem "?f"
-    by default (simp_all add: fun_eq_iff commute left_commute split: option.split)
+    by standard (simp_all add: fun_eq_iff commute left_commute split: option.split)
   from assms show "Finite_Set.fold f x A = F (insert x A)"
   proof induct
     case empty then show ?case by (simp add: eq_fold')
@@ -189,7 +189,7 @@
 begin
 
 interpretation comp_fun_idem f
-  by default (simp_all add: fun_eq_iff left_commute)
+  by standard (simp_all add: fun_eq_iff left_commute)
 
 definition F :: "'a set \<Rightarrow> 'a"
 where
@@ -496,9 +496,9 @@
   "semilattice_set.F min = Min"
   and "semilattice_set.F max = Max"
 proof -
-  show "semilattice_order_set min less_eq less" by default (auto simp add: min_def)
+  show "semilattice_order_set min less_eq less" by standard (auto simp add: min_def)
   then interpret Min!: semilattice_order_set min less_eq less .
-  show "semilattice_order_set max greater_eq greater" by default (auto simp add: max_def)
+  show "semilattice_order_set max greater_eq greater" by standard (auto simp add: max_def)
   then interpret Max!: semilattice_order_set max greater_eq greater .
   from Min_def show "semilattice_set.F min = Min" by rule
   from Max_def show "semilattice_set.F max = Max" by rule