src/HOL/ex/Refute_Examples.thy
changeset 23778 18f426a137a9
parent 23219 87ad6e8a5f2c
child 24447 fbd6d7cbf6dd
--- a/src/HOL/ex/Refute_Examples.thy	Wed Jul 11 11:54:03 2007 +0200
+++ b/src/HOL/ex/Refute_Examples.thy	Wed Jul 11 11:54:21 2007 +0200
@@ -937,35 +937,30 @@
 
 subsubsection {* Inductively defined sets *}
 
-consts
-  arbitrarySet :: "'a set"
-inductive arbitrarySet
-intros
+inductive_set arbitrarySet :: "'a set"
+where
   "arbitrary : arbitrarySet"
 
 lemma "x : arbitrarySet"
   refute
 oops
 
-consts
-  evenCard :: "'a set set"
-inductive evenCard
-intros
+inductive_set evenCard :: "'a set set"
+where
   "{} : evenCard"
-  "\<lbrakk> S : evenCard; x \<notin> S; y \<notin> S; x \<noteq> y \<rbrakk> \<Longrightarrow> S \<union> {x, y} : evenCard"
+| "\<lbrakk> S : evenCard; x \<notin> S; y \<notin> S; x \<noteq> y \<rbrakk> \<Longrightarrow> S \<union> {x, y} : evenCard"
 
 lemma "S : evenCard"
   refute
 oops
 
-consts
+inductive_set
   even :: "nat set"
-  odd  :: "nat set"
-inductive even odd
-intros
+  and odd  :: "nat set"
+where
   "0 : even"
-  "n : even \<Longrightarrow> Suc n : odd"
-  "n : odd \<Longrightarrow> Suc n : even"
+| "n : even \<Longrightarrow> Suc n : odd"
+| "n : odd \<Longrightarrow> Suc n : even"
 
 lemma "n : odd"
   (*refute*)  -- {* unfortunately, this little example already takes too long *}