--- a/src/HOL/Tools/inductive.ML Mon Dec 28 15:11:03 2015 +0100
+++ b/src/HOL/Tools/inductive.ML Mon Dec 28 16:13:15 2015 +0100
@@ -839,6 +839,8 @@
(* add definition of recursive predicates to theory *)
+ val is_auxiliary = length cs > 1;
+
val rec_binding =
if Binding.is_empty alt_name then
Binding.name (space_implode "_" (map (Binding.name_of o fst) cnames_syn))
@@ -846,7 +848,6 @@
val rec_name = Binding.name_of rec_binding;
val inductive_defs = Config.get lthy inductive_defs;
- val is_auxiliary = length cs >= 2;
val ((rec_const, (_, fp_def)), lthy') = lthy
|> is_auxiliary ? Proof_Context.concealed