src/HOLCF/Tools/domain/domain_theorems.ML
author huffman
Fri May 22 13:18:59 2009 -0700 (2009-05-22)
changeset 31232 689aa7da48cc
parent 31160 2823f1b6b860
child 31288 67dff9c5b2bd
permissions -rw-r--r--
define copy functions using combinators; add checking for failed proofs of induction rules
wenzelm@23152
     1
(*  Title:      HOLCF/Tools/domain/domain_theorems.ML
wenzelm@23152
     2
    ID:         $Id$
wenzelm@23152
     3
    Author:     David von Oheimb
wenzelm@23152
     4
                New proofs/tactics by Brian Huffman
wenzelm@23152
     5
wenzelm@23152
     6
Proof generator for domain command.
wenzelm@23152
     7
*)
wenzelm@23152
     8
wenzelm@26342
     9
val HOLCF_ss = @{simpset};
wenzelm@23152
    10
huffman@31005
    11
signature DOMAIN_THEOREMS =
huffman@31005
    12
sig
huffman@31005
    13
  val theorems: Domain_Library.eq * Domain_Library.eq list -> theory -> thm list * theory;
huffman@31005
    14
  val comp_theorems: bstring * Domain_Library.eq list -> theory -> thm list * theory;
huffman@31160
    15
  val quiet_mode: bool ref;
huffman@31160
    16
  val trace_domain: bool ref;
huffman@31005
    17
end;
huffman@31005
    18
huffman@31023
    19
structure Domain_Theorems :> DOMAIN_THEOREMS =
huffman@31005
    20
struct
wenzelm@23152
    21
huffman@29402
    22
val quiet_mode = ref false;
huffman@29402
    23
val trace_domain = ref false;
huffman@29402
    24
huffman@29402
    25
fun message s = if !quiet_mode then () else writeln s;
huffman@29402
    26
fun trace s = if !trace_domain then tracing s else ();
huffman@29402
    27
wenzelm@23152
    28
local
wenzelm@23152
    29
huffman@25805
    30
val adm_impl_admw = @{thm adm_impl_admw};
huffman@25895
    31
val adm_all = @{thm adm_all};
huffman@25805
    32
val adm_conj = @{thm adm_conj};
huffman@25805
    33
val adm_subst = @{thm adm_subst};
huffman@31076
    34
val antisym_less_inverse = @{thm below_antisym_inverse};
huffman@25805
    35
val beta_cfun = @{thm beta_cfun};
huffman@25805
    36
val cfun_arg_cong = @{thm cfun_arg_cong};
huffman@25805
    37
val ch2ch_Rep_CFunL = @{thm ch2ch_Rep_CFunL};
huffman@25805
    38
val ch2ch_Rep_CFunR = @{thm ch2ch_Rep_CFunR};
huffman@25805
    39
val chain_iterate = @{thm chain_iterate};
huffman@25805
    40
val compact_ONE = @{thm compact_ONE};
huffman@25805
    41
val compact_sinl = @{thm compact_sinl};
huffman@25805
    42
val compact_sinr = @{thm compact_sinr};
huffman@25805
    43
val compact_spair = @{thm compact_spair};
huffman@25805
    44
val compact_up = @{thm compact_up};
huffman@25805
    45
val contlub_cfun_arg = @{thm contlub_cfun_arg};
huffman@25805
    46
val contlub_cfun_fun = @{thm contlub_cfun_fun};
huffman@25805
    47
val fix_def2 = @{thm fix_def2};
huffman@25805
    48
val injection_eq = @{thm injection_eq};
huffman@31076
    49
val injection_less = @{thm injection_below};
huffman@25805
    50
val lub_equal = @{thm lub_equal};
huffman@25805
    51
val monofun_cfun_arg = @{thm monofun_cfun_arg};
huffman@25805
    52
val retraction_strict = @{thm retraction_strict};
huffman@25805
    53
val spair_eq = @{thm spair_eq};
huffman@31076
    54
val spair_less = @{thm spair_below};
huffman@25805
    55
val sscase1 = @{thm sscase1};
huffman@25805
    56
val ssplit1 = @{thm ssplit1};
huffman@25805
    57
val strictify1 = @{thm strictify1};
huffman@25805
    58
val wfix_ind = @{thm wfix_ind};
huffman@25805
    59
huffman@25805
    60
val iso_intro       = @{thm iso.intro};
huffman@25805
    61
val iso_abs_iso     = @{thm iso.abs_iso};
huffman@25805
    62
val iso_rep_iso     = @{thm iso.rep_iso};
huffman@25805
    63
val iso_abs_strict  = @{thm iso.abs_strict};
huffman@25805
    64
val iso_rep_strict  = @{thm iso.rep_strict};
huffman@25805
    65
val iso_abs_defin'  = @{thm iso.abs_defin'};
huffman@25805
    66
val iso_rep_defin'  = @{thm iso.rep_defin'};
huffman@25805
    67
val iso_abs_defined = @{thm iso.abs_defined};
huffman@25805
    68
val iso_rep_defined = @{thm iso.rep_defined};
huffman@25805
    69
val iso_compact_abs = @{thm iso.compact_abs};
huffman@25805
    70
val iso_compact_rep = @{thm iso.compact_rep};
huffman@25805
    71
val iso_iso_swap    = @{thm iso.iso_swap};
huffman@25805
    72
huffman@25805
    73
val exh_start = @{thm exh_start};
huffman@25805
    74
val ex_defined_iffs = @{thms ex_defined_iffs};
huffman@25805
    75
val exh_casedist0 = @{thm exh_casedist0};
huffman@25805
    76
val exh_casedists = @{thms exh_casedists};
wenzelm@23152
    77
wenzelm@23152
    78
open Domain_Library;
wenzelm@23152
    79
infixr 0 ===>;
wenzelm@23152
    80
infixr 0 ==>;
wenzelm@23152
    81
infix 0 == ; 
wenzelm@23152
    82
infix 1 ===;
wenzelm@23152
    83
infix 1 ~= ;
wenzelm@23152
    84
infix 1 <<;
wenzelm@23152
    85
infix 1 ~<<;
wenzelm@23152
    86
infix 9 `   ;
wenzelm@23152
    87
infix 9 `% ;
wenzelm@23152
    88
infix 9 `%%;
wenzelm@23152
    89
infixr 9 oo;
wenzelm@23152
    90
wenzelm@23152
    91
(* ----- general proof facilities ------------------------------------------- *)
wenzelm@23152
    92
wenzelm@24503
    93
fun legacy_infer_term thy t =
wenzelm@24503
    94
  let val ctxt = ProofContext.set_mode ProofContext.mode_schematic (ProofContext.init thy)
wenzelm@24503
    95
  in singleton (Syntax.check_terms ctxt) (Sign.intern_term thy t) end;
wenzelm@24503
    96
wenzelm@23152
    97
fun pg'' thy defs t tacs =
wenzelm@23152
    98
  let
wenzelm@24503
    99
    val t' = legacy_infer_term thy t;
wenzelm@23152
   100
    val asms = Logic.strip_imp_prems t';
wenzelm@23152
   101
    val prop = Logic.strip_imp_concl t';
wenzelm@26711
   102
    fun tac {prems, context} =
wenzelm@23152
   103
      rewrite_goals_tac defs THEN
wenzelm@27208
   104
      EVERY (tacs {prems = map (rewrite_rule defs) prems, context = context})
wenzelm@23152
   105
  in Goal.prove_global thy [] asms prop tac end;
wenzelm@23152
   106
wenzelm@23152
   107
fun pg' thy defs t tacsf =
wenzelm@23152
   108
  let
wenzelm@27208
   109
    fun tacs {prems, context} =
wenzelm@27208
   110
      if null prems then tacsf context
wenzelm@27208
   111
      else cut_facts_tac prems 1 :: tacsf context;
wenzelm@23152
   112
  in pg'' thy defs t tacs end;
wenzelm@23152
   113
wenzelm@27208
   114
fun case_UU_tac ctxt rews i v =
wenzelm@27208
   115
  InductTacs.case_tac ctxt (v^"=UU") i THEN
wenzelm@23152
   116
  asm_simp_tac (HOLCF_ss addsimps rews) i;
wenzelm@23152
   117
wenzelm@23152
   118
val chain_tac =
wenzelm@23152
   119
  REPEAT_DETERM o resolve_tac 
wenzelm@23152
   120
    [chain_iterate, ch2ch_Rep_CFunR, ch2ch_Rep_CFunL];
wenzelm@23152
   121
wenzelm@23152
   122
(* ----- general proofs ----------------------------------------------------- *)
wenzelm@23152
   123
wenzelm@29064
   124
val all2E = @{lemma "!x y . P x y ==> (P x y ==> R) ==> R" by simp}
wenzelm@23152
   125
huffman@31076
   126
val dist_eqI = @{lemma "!!x::'a::po. ~ x << y ==> x ~= y" by (blast dest!: below_antisym_inverse)}
wenzelm@23152
   127
wenzelm@23152
   128
in
wenzelm@23152
   129
wenzelm@23152
   130
fun theorems (((dname, _), cons) : eq, eqs : eq list) thy =
wenzelm@23152
   131
let
wenzelm@23152
   132
huffman@29402
   133
val _ = message ("Proving isomorphism properties of domain "^dname^" ...");
wenzelm@23152
   134
val pg = pg' thy;
wenzelm@23152
   135
wenzelm@23152
   136
(* ----- getting the axioms and definitions --------------------------------- *)
wenzelm@23152
   137
wenzelm@23152
   138
local
wenzelm@26343
   139
  fun ga s dn = PureThy.get_thm thy (dn ^ "." ^ s);
wenzelm@23152
   140
in
wenzelm@23152
   141
  val ax_abs_iso  = ga "abs_iso"  dname;
wenzelm@23152
   142
  val ax_rep_iso  = ga "rep_iso"  dname;
wenzelm@23152
   143
  val ax_when_def = ga "when_def" dname;
wenzelm@23152
   144
  fun get_def mk_name (con,_) = ga (mk_name con^"_def") dname;
wenzelm@23152
   145
  val axs_con_def = map (get_def extern_name) cons;
wenzelm@23152
   146
  val axs_dis_def = map (get_def dis_name) cons;
wenzelm@23152
   147
  val axs_mat_def = map (get_def mat_name) cons;
wenzelm@23152
   148
  val axs_pat_def = map (get_def pat_name) cons;
wenzelm@23152
   149
  val axs_sel_def =
wenzelm@23152
   150
    let
wenzelm@23152
   151
      fun def_of_sel sel = ga (sel^"_def") dname;
wenzelm@23152
   152
      fun def_of_arg arg = Option.map def_of_sel (sel_of arg);
wenzelm@23152
   153
      fun defs_of_con (_, args) = List.mapPartial def_of_arg args;
wenzelm@23152
   154
    in
wenzelm@26336
   155
      maps defs_of_con cons
wenzelm@23152
   156
    end;
wenzelm@23152
   157
  val ax_copy_def = ga "copy_def" dname;
wenzelm@23152
   158
end; (* local *)
wenzelm@23152
   159
wenzelm@23152
   160
(* ----- theorems concerning the isomorphism -------------------------------- *)
wenzelm@23152
   161
wenzelm@23152
   162
val dc_abs  = %%:(dname^"_abs");
wenzelm@23152
   163
val dc_rep  = %%:(dname^"_rep");
wenzelm@23152
   164
val dc_copy = %%:(dname^"_copy");
wenzelm@23152
   165
val x_name = "x";
wenzelm@23152
   166
wenzelm@23152
   167
val iso_locale = iso_intro OF [ax_abs_iso, ax_rep_iso];
wenzelm@23152
   168
val abs_strict = ax_rep_iso RS (allI RS retraction_strict);
wenzelm@23152
   169
val rep_strict = ax_abs_iso RS (allI RS retraction_strict);
wenzelm@23152
   170
val abs_defin' = iso_locale RS iso_abs_defin';
wenzelm@23152
   171
val rep_defin' = iso_locale RS iso_rep_defin';
wenzelm@23152
   172
val iso_rews = map standard [ax_abs_iso,ax_rep_iso,abs_strict,rep_strict];
wenzelm@23152
   173
wenzelm@23152
   174
(* ----- generating beta reduction rules from definitions-------------------- *)
wenzelm@23152
   175
huffman@29402
   176
val _ = trace " Proving beta reduction rules...";
huffman@29402
   177
wenzelm@23152
   178
local
wenzelm@23152
   179
  fun arglist (Const _ $ Abs (s, _, t)) =
wenzelm@23152
   180
    let
wenzelm@23152
   181
      val (vars,body) = arglist t;
wenzelm@23152
   182
    in (s :: vars, body) end
wenzelm@23152
   183
    | arglist t = ([], t);
wenzelm@23152
   184
  fun bind_fun vars t = Library.foldr mk_All (vars, t);
wenzelm@23152
   185
  fun bound_vars 0 = []
wenzelm@23152
   186
    | bound_vars i = Bound (i-1) :: bound_vars (i - 1);
wenzelm@23152
   187
in
wenzelm@23152
   188
  fun appl_of_def def =
wenzelm@23152
   189
    let
wenzelm@23152
   190
      val (_ $ con $ lam) = concl_of def;
wenzelm@23152
   191
      val (vars, rhs) = arglist lam;
wenzelm@23152
   192
      val lhs = list_ccomb (con, bound_vars (length vars));
wenzelm@23152
   193
      val appl = bind_fun vars (lhs == rhs);
wenzelm@23152
   194
      val cs = ContProc.cont_thms lam;
wenzelm@23152
   195
      val betas = map (fn c => mk_meta_eq (c RS beta_cfun)) cs;
wenzelm@27208
   196
    in pg (def::betas) appl (K [rtac reflexive_thm 1]) end;
wenzelm@23152
   197
end;
wenzelm@23152
   198
huffman@29402
   199
val _ = trace "Proving when_appl...";
wenzelm@23152
   200
val when_appl = appl_of_def ax_when_def;
huffman@29402
   201
val _ = trace "Proving con_appls...";
wenzelm@23152
   202
val con_appls = map appl_of_def axs_con_def;
wenzelm@23152
   203
wenzelm@23152
   204
local
wenzelm@23152
   205
  fun arg2typ n arg =
wenzelm@23152
   206
    let val t = TVar (("'a", n), pcpoS)
wenzelm@23152
   207
    in (n + 1, if is_lazy arg then mk_uT t else t) end;
wenzelm@23152
   208
wenzelm@23152
   209
  fun args2typ n [] = (n, oneT)
wenzelm@23152
   210
    | args2typ n [arg] = arg2typ n arg
wenzelm@23152
   211
    | args2typ n (arg::args) =
wenzelm@23152
   212
    let
wenzelm@23152
   213
      val (n1, t1) = arg2typ n arg;
wenzelm@23152
   214
      val (n2, t2) = args2typ n1 args
wenzelm@23152
   215
    in (n2, mk_sprodT (t1, t2)) end;
wenzelm@23152
   216
wenzelm@23152
   217
  fun cons2typ n [] = (n,oneT)
wenzelm@23152
   218
    | cons2typ n [con] = args2typ n (snd con)
wenzelm@23152
   219
    | cons2typ n (con::cons) =
wenzelm@23152
   220
    let
wenzelm@23152
   221
      val (n1, t1) = args2typ n (snd con);
wenzelm@23152
   222
      val (n2, t2) = cons2typ n1 cons
wenzelm@23152
   223
    in (n2, mk_ssumT (t1, t2)) end;
wenzelm@23152
   224
in
wenzelm@23152
   225
  fun cons2ctyp cons = ctyp_of thy (snd (cons2typ 1 cons));
wenzelm@23152
   226
end;
wenzelm@23152
   227
wenzelm@23152
   228
local 
wenzelm@23152
   229
  val iso_swap = iso_locale RS iso_iso_swap;
wenzelm@23152
   230
  fun one_con (con, args) =
wenzelm@23152
   231
    let
wenzelm@23152
   232
      val vns = map vname args;
wenzelm@23152
   233
      val eqn = %:x_name === con_app2 con %: vns;
wenzelm@23152
   234
      val conj = foldr1 mk_conj (eqn :: map (defined o %:) (nonlazy args));
wenzelm@23152
   235
    in Library.foldr mk_ex (vns, conj) end;
wenzelm@23152
   236
wenzelm@23894
   237
  val conj_assoc = @{thm conj_assoc};
wenzelm@23152
   238
  val exh = foldr1 mk_disj ((%:x_name === UU) :: map one_con cons);
wenzelm@23152
   239
  val thm1 = instantiate' [SOME (cons2ctyp cons)] [] exh_start;
wenzelm@23152
   240
  val thm2 = rewrite_rule (map mk_meta_eq ex_defined_iffs) thm1;
huffman@25805
   241
  val thm3 = rewrite_rule [mk_meta_eq @{thm conj_assoc}] thm2;
wenzelm@23152
   242
wenzelm@23152
   243
  (* first 3 rules replace "x = UU \/ P" with "rep$x = UU \/ P" *)
wenzelm@23152
   244
  val tacs = [
wenzelm@23152
   245
    rtac disjE 1,
wenzelm@23152
   246
    etac (rep_defin' RS disjI1) 2,
wenzelm@23152
   247
    etac disjI2 2,
wenzelm@23152
   248
    rewrite_goals_tac [mk_meta_eq iso_swap],
wenzelm@23152
   249
    rtac thm3 1];
wenzelm@23152
   250
in
huffman@29402
   251
  val _ = trace " Proving exhaust...";
wenzelm@27208
   252
  val exhaust = pg con_appls (mk_trp exh) (K tacs);
huffman@29402
   253
  val _ = trace " Proving casedist...";
wenzelm@23152
   254
  val casedist =
wenzelm@23152
   255
    standard (rewrite_rule exh_casedists (exhaust RS exh_casedist0));
wenzelm@23152
   256
end;
wenzelm@23152
   257
wenzelm@23152
   258
local 
wenzelm@23152
   259
  fun bind_fun t = Library.foldr mk_All (when_funs cons, t);
wenzelm@23152
   260
  fun bound_fun i _ = Bound (length cons - i);
wenzelm@23152
   261
  val when_app = list_ccomb (%%:(dname^"_when"), mapn bound_fun 1 cons);
wenzelm@23152
   262
in
huffman@29402
   263
  val _ = trace " Proving when_strict...";
wenzelm@23152
   264
  val when_strict =
wenzelm@23152
   265
    let
wenzelm@23152
   266
      val axs = [when_appl, mk_meta_eq rep_strict];
wenzelm@23152
   267
      val goal = bind_fun (mk_trp (strict when_app));
wenzelm@23152
   268
      val tacs = [resolve_tac [sscase1, ssplit1, strictify1] 1];
wenzelm@27208
   269
    in pg axs goal (K tacs) end;
wenzelm@23152
   270
huffman@29402
   271
  val _ = trace " Proving when_apps...";
wenzelm@23152
   272
  val when_apps =
wenzelm@23152
   273
    let
wenzelm@23152
   274
      fun one_when n (con,args) =
wenzelm@23152
   275
        let
wenzelm@23152
   276
          val axs = when_appl :: con_appls;
wenzelm@23152
   277
          val goal = bind_fun (lift_defined %: (nonlazy args, 
wenzelm@23152
   278
                mk_trp (when_app`(con_app con args) ===
wenzelm@23152
   279
                       list_ccomb (bound_fun n 0, map %# args))));
wenzelm@23152
   280
          val tacs = [asm_simp_tac (HOLCF_ss addsimps [ax_abs_iso]) 1];
wenzelm@27208
   281
        in pg axs goal (K tacs) end;
wenzelm@23152
   282
    in mapn one_when 1 cons end;
wenzelm@23152
   283
end;
wenzelm@23152
   284
val when_rews = when_strict :: when_apps;
wenzelm@23152
   285
wenzelm@23152
   286
(* ----- theorems concerning the constructors, discriminators and selectors - *)
wenzelm@23152
   287
wenzelm@23152
   288
local
wenzelm@23152
   289
  fun dis_strict (con, _) =
wenzelm@23152
   290
    let
wenzelm@23152
   291
      val goal = mk_trp (strict (%%:(dis_name con)));
wenzelm@27208
   292
    in pg axs_dis_def goal (K [rtac when_strict 1]) end;
wenzelm@23152
   293
wenzelm@23152
   294
  fun dis_app c (con, args) =
wenzelm@23152
   295
    let
wenzelm@23152
   296
      val lhs = %%:(dis_name c) ` con_app con args;
huffman@26012
   297
      val rhs = if con = c then TT else FF;
wenzelm@23152
   298
      val goal = lift_defined %: (nonlazy args, mk_trp (lhs === rhs));
wenzelm@23152
   299
      val tacs = [asm_simp_tac (HOLCF_ss addsimps when_rews) 1];
wenzelm@27208
   300
    in pg axs_dis_def goal (K tacs) end;
wenzelm@23152
   301
huffman@29402
   302
  val _ = trace " Proving dis_apps...";
wenzelm@26336
   303
  val dis_apps = maps (fn (c,_) => map (dis_app c) cons) cons;
wenzelm@23152
   304
wenzelm@23152
   305
  fun dis_defin (con, args) =
wenzelm@23152
   306
    let
wenzelm@23152
   307
      val goal = defined (%:x_name) ==> defined (%%:(dis_name con) `% x_name);
wenzelm@23152
   308
      val tacs =
wenzelm@23152
   309
        [rtac casedist 1,
wenzelm@23152
   310
         contr_tac 1,
wenzelm@23152
   311
         DETERM_UNTIL_SOLVED (CHANGED
wenzelm@23152
   312
          (asm_simp_tac (HOLCF_ss addsimps dis_apps) 1))];
wenzelm@27208
   313
    in pg [] goal (K tacs) end;
wenzelm@23152
   314
huffman@29402
   315
  val _ = trace " Proving dis_stricts...";
wenzelm@23152
   316
  val dis_stricts = map dis_strict cons;
huffman@29402
   317
  val _ = trace " Proving dis_defins...";
wenzelm@23152
   318
  val dis_defins = map dis_defin cons;
wenzelm@23152
   319
in
wenzelm@23152
   320
  val dis_rews = dis_stricts @ dis_defins @ dis_apps;
wenzelm@23152
   321
end;
wenzelm@23152
   322
wenzelm@23152
   323
local
wenzelm@23152
   324
  fun mat_strict (con, _) =
wenzelm@23152
   325
    let
huffman@30912
   326
      val goal = mk_trp (%%:(mat_name con) ` UU ` %:"rhs" === UU);
huffman@30912
   327
      val tacs = [asm_simp_tac (HOLCF_ss addsimps [when_strict]) 1];
wenzelm@27208
   328
    in pg axs_mat_def goal (K tacs) end;
wenzelm@23152
   329
huffman@29402
   330
  val _ = trace " Proving mat_stricts...";
wenzelm@23152
   331
  val mat_stricts = map mat_strict cons;
wenzelm@23152
   332
wenzelm@23152
   333
  fun one_mat c (con, args) =
wenzelm@23152
   334
    let
huffman@30912
   335
      val lhs = %%:(mat_name c) ` con_app con args ` %:"rhs";
wenzelm@23152
   336
      val rhs =
wenzelm@23152
   337
        if con = c
huffman@30912
   338
        then list_ccomb (%:"rhs", map %# args)
huffman@26012
   339
        else mk_fail;
wenzelm@23152
   340
      val goal = lift_defined %: (nonlazy args, mk_trp (lhs === rhs));
wenzelm@23152
   341
      val tacs = [asm_simp_tac (HOLCF_ss addsimps when_rews) 1];
wenzelm@27208
   342
    in pg axs_mat_def goal (K tacs) end;
wenzelm@23152
   343
huffman@29402
   344
  val _ = trace " Proving mat_apps...";
wenzelm@23152
   345
  val mat_apps =
wenzelm@26336
   346
    maps (fn (c,_) => map (one_mat c) cons) cons;
wenzelm@23152
   347
in
wenzelm@23152
   348
  val mat_rews = mat_stricts @ mat_apps;
wenzelm@23152
   349
end;
wenzelm@23152
   350
wenzelm@23152
   351
local
wenzelm@23152
   352
  fun ps args = mapn (fn n => fn _ => %:("pat" ^ string_of_int n)) 1 args;
wenzelm@23152
   353
huffman@26012
   354
  fun pat_lhs (con,args) = mk_branch (list_comb (%%:(pat_name con), ps args));
wenzelm@23152
   355
huffman@26012
   356
  fun pat_rhs (con,[]) = mk_return ((%:"rhs") ` HOLogic.unit)
wenzelm@23152
   357
    | pat_rhs (con,args) =
huffman@26012
   358
        (mk_branch (mk_ctuple_pat (ps args)))
wenzelm@23152
   359
          `(%:"rhs")`(mk_ctuple (map %# args));
wenzelm@23152
   360
wenzelm@23152
   361
  fun pat_strict c =
wenzelm@23152
   362
    let
wenzelm@25132
   363
      val axs = @{thm branch_def} :: axs_pat_def;
wenzelm@23152
   364
      val goal = mk_trp (strict (pat_lhs c ` (%:"rhs")));
wenzelm@23152
   365
      val tacs = [simp_tac (HOLCF_ss addsimps [when_strict]) 1];
wenzelm@27208
   366
    in pg axs goal (K tacs) end;
wenzelm@23152
   367
wenzelm@23152
   368
  fun pat_app c (con, args) =
wenzelm@23152
   369
    let
wenzelm@25132
   370
      val axs = @{thm branch_def} :: axs_pat_def;
wenzelm@23152
   371
      val lhs = (pat_lhs c)`(%:"rhs")`(con_app con args);
huffman@26012
   372
      val rhs = if con = fst c then pat_rhs c else mk_fail;
wenzelm@23152
   373
      val goal = lift_defined %: (nonlazy args, mk_trp (lhs === rhs));
wenzelm@23152
   374
      val tacs = [asm_simp_tac (HOLCF_ss addsimps when_rews) 1];
wenzelm@27208
   375
    in pg axs goal (K tacs) end;
wenzelm@23152
   376
huffman@29402
   377
  val _ = trace " Proving pat_stricts...";
wenzelm@23152
   378
  val pat_stricts = map pat_strict cons;
huffman@29402
   379
  val _ = trace " Proving pat_apps...";
wenzelm@26336
   380
  val pat_apps = maps (fn c => map (pat_app c) cons) cons;
wenzelm@23152
   381
in
wenzelm@23152
   382
  val pat_rews = pat_stricts @ pat_apps;
wenzelm@23152
   383
end;
wenzelm@23152
   384
wenzelm@23152
   385
local
wenzelm@23152
   386
  fun con_strict (con, args) = 
wenzelm@23152
   387
    let
huffman@30911
   388
      val rules = abs_strict :: @{thms con_strict_rules};
wenzelm@23152
   389
      fun one_strict vn =
wenzelm@23152
   390
        let
wenzelm@23152
   391
          fun f arg = if vname arg = vn then UU else %# arg;
wenzelm@23152
   392
          val goal = mk_trp (con_app2 con f args === UU);
huffman@30911
   393
          val tacs = [simp_tac (HOL_basic_ss addsimps rules) 1];
wenzelm@27208
   394
        in pg con_appls goal (K tacs) end;
wenzelm@23152
   395
    in map one_strict (nonlazy args) end;
wenzelm@23152
   396
wenzelm@23152
   397
  fun con_defin (con, args) =
wenzelm@23152
   398
    let
huffman@30913
   399
      fun iff_disj (t, []) = HOLogic.mk_not t
huffman@30913
   400
        | iff_disj (t, ts) = t === foldr1 HOLogic.mk_disj ts;
huffman@30913
   401
      val lhs = con_app con args === UU;
huffman@30913
   402
      val rhss = map (fn x => %:x === UU) (nonlazy args);
huffman@30913
   403
      val goal = mk_trp (iff_disj (lhs, rhss));
huffman@30913
   404
      val rule1 = iso_locale RS @{thm iso.abs_defined_iff};
huffman@30913
   405
      val rules = rule1 :: @{thms con_defined_iff_rules};
huffman@30913
   406
      val tacs = [simp_tac (HOL_ss addsimps rules) 1];
huffman@30911
   407
    in pg con_appls goal (K tacs) end;
wenzelm@23152
   408
in
huffman@29402
   409
  val _ = trace " Proving con_stricts...";
wenzelm@26336
   410
  val con_stricts = maps con_strict cons;
huffman@30911
   411
  val _ = trace " Proving con_defins...";
wenzelm@23152
   412
  val con_defins = map con_defin cons;
wenzelm@23152
   413
  val con_rews = con_stricts @ con_defins;
wenzelm@23152
   414
end;
wenzelm@23152
   415
wenzelm@23152
   416
local
wenzelm@23152
   417
  val rules =
wenzelm@23152
   418
    [compact_sinl, compact_sinr, compact_spair, compact_up, compact_ONE];
wenzelm@23152
   419
  fun con_compact (con, args) =
wenzelm@23152
   420
    let
huffman@26012
   421
      val concl = mk_trp (mk_compact (con_app con args));
huffman@26012
   422
      val goal = lift (fn x => mk_compact (%#x)) (args, concl);
wenzelm@23152
   423
      val tacs = [
wenzelm@23152
   424
        rtac (iso_locale RS iso_compact_abs) 1,
wenzelm@23152
   425
        REPEAT (resolve_tac rules 1 ORELSE atac 1)];
wenzelm@27208
   426
    in pg con_appls goal (K tacs) end;
wenzelm@23152
   427
in
huffman@29402
   428
  val _ = trace " Proving con_compacts...";
wenzelm@23152
   429
  val con_compacts = map con_compact cons;
wenzelm@23152
   430
end;
wenzelm@23152
   431
wenzelm@23152
   432
local
wenzelm@23152
   433
  fun one_sel sel =
wenzelm@23152
   434
    pg axs_sel_def (mk_trp (strict (%%:sel)))
wenzelm@27208
   435
      (K [simp_tac (HOLCF_ss addsimps when_rews) 1]);
wenzelm@23152
   436
wenzelm@23152
   437
  fun sel_strict (_, args) =
wenzelm@23152
   438
    List.mapPartial (Option.map one_sel o sel_of) args;
wenzelm@23152
   439
in
huffman@29402
   440
  val _ = trace " Proving sel_stricts...";
wenzelm@26336
   441
  val sel_stricts = maps sel_strict cons;
wenzelm@23152
   442
end;
wenzelm@23152
   443
wenzelm@23152
   444
local
wenzelm@23152
   445
  fun sel_app_same c n sel (con, args) =
wenzelm@23152
   446
    let
wenzelm@23152
   447
      val nlas = nonlazy args;
wenzelm@23152
   448
      val vns = map vname args;
wenzelm@23152
   449
      val vnn = List.nth (vns, n);
wenzelm@23152
   450
      val nlas' = List.filter (fn v => v <> vnn) nlas;
wenzelm@23152
   451
      val lhs = (%%:sel)`(con_app con args);
wenzelm@23152
   452
      val goal = lift_defined %: (nlas', mk_trp (lhs === %:vnn));
wenzelm@27208
   453
      fun tacs1 ctxt =
wenzelm@23152
   454
        if vnn mem nlas
wenzelm@27208
   455
        then [case_UU_tac ctxt (when_rews @ con_stricts) 1 vnn]
wenzelm@23152
   456
        else [];
wenzelm@23152
   457
      val tacs2 = [asm_simp_tac (HOLCF_ss addsimps when_rews) 1];
wenzelm@27208
   458
    in pg axs_sel_def goal (fn ctxt => (tacs1 ctxt @ tacs2)) end;
wenzelm@23152
   459
wenzelm@23152
   460
  fun sel_app_diff c n sel (con, args) =
wenzelm@23152
   461
    let
wenzelm@23152
   462
      val nlas = nonlazy args;
wenzelm@23152
   463
      val goal = mk_trp (%%:sel ` con_app con args === UU);
wenzelm@27208
   464
      fun tacs1 ctxt = map (case_UU_tac ctxt (when_rews @ con_stricts) 1) nlas;
wenzelm@23152
   465
      val tacs2 = [asm_simp_tac (HOLCF_ss addsimps when_rews) 1];
wenzelm@27208
   466
    in pg axs_sel_def goal (fn ctxt => (tacs1 ctxt @ tacs2)) end;
wenzelm@23152
   467
wenzelm@23152
   468
  fun sel_app c n sel (con, args) =
wenzelm@23152
   469
    if con = c
wenzelm@23152
   470
    then sel_app_same c n sel (con, args)
wenzelm@23152
   471
    else sel_app_diff c n sel (con, args);
wenzelm@23152
   472
wenzelm@23152
   473
  fun one_sel c n sel = map (sel_app c n sel) cons;
wenzelm@23152
   474
  fun one_sel' c n arg = Option.map (one_sel c n) (sel_of arg);
wenzelm@23152
   475
  fun one_con (c, args) =
wenzelm@26336
   476
    flat (map_filter I (mapn (one_sel' c) 0 args));
wenzelm@23152
   477
in
huffman@29402
   478
  val _ = trace " Proving sel_apps...";
wenzelm@26336
   479
  val sel_apps = maps one_con cons;
wenzelm@23152
   480
end;
wenzelm@23152
   481
wenzelm@23152
   482
local
wenzelm@23152
   483
  fun sel_defin sel =
wenzelm@23152
   484
    let
wenzelm@23152
   485
      val goal = defined (%:x_name) ==> defined (%%:sel`%x_name);
wenzelm@23152
   486
      val tacs = [
wenzelm@23152
   487
        rtac casedist 1,
wenzelm@23152
   488
        contr_tac 1,
wenzelm@23152
   489
        DETERM_UNTIL_SOLVED (CHANGED
wenzelm@23152
   490
          (asm_simp_tac (HOLCF_ss addsimps sel_apps) 1))];
wenzelm@27208
   491
    in pg [] goal (K tacs) end;
wenzelm@23152
   492
in
huffman@29402
   493
  val _ = trace " Proving sel_defins...";
wenzelm@23152
   494
  val sel_defins =
wenzelm@23152
   495
    if length cons = 1
wenzelm@23152
   496
    then List.mapPartial (fn arg => Option.map sel_defin (sel_of arg))
wenzelm@23152
   497
                 (filter_out is_lazy (snd (hd cons)))
wenzelm@23152
   498
    else [];
wenzelm@23152
   499
end;
wenzelm@23152
   500
wenzelm@23152
   501
val sel_rews = sel_stricts @ sel_defins @ sel_apps;
wenzelm@23152
   502
huffman@29402
   503
val _ = trace " Proving dist_les...";
wenzelm@23152
   504
val distincts_le =
wenzelm@23152
   505
  let
wenzelm@23152
   506
    fun dist (con1, args1) (con2, args2) =
wenzelm@23152
   507
      let
wenzelm@23152
   508
        val goal = lift_defined %: (nonlazy args1,
wenzelm@23152
   509
                        mk_trp (con_app con1 args1 ~<< con_app con2 args2));
wenzelm@27208
   510
        fun tacs ctxt = [
huffman@25805
   511
          rtac @{thm rev_contrapos} 1,
wenzelm@27239
   512
          eres_inst_tac ctxt [(("f", 0), dis_name con1)] monofun_cfun_arg 1]
wenzelm@27208
   513
          @ map (case_UU_tac ctxt (con_stricts @ dis_rews) 1) (nonlazy args2)
wenzelm@23152
   514
          @ [asm_simp_tac (HOLCF_ss addsimps dis_rews) 1];
wenzelm@23152
   515
      in pg [] goal tacs end;
wenzelm@23152
   516
wenzelm@23152
   517
    fun distinct (con1, args1) (con2, args2) =
wenzelm@23152
   518
        let
wenzelm@23152
   519
          val arg1 = (con1, args1);
wenzelm@23152
   520
          val arg2 =
wenzelm@23152
   521
            (con2, ListPair.map (fn (arg,vn) => upd_vname (K vn) arg)
wenzelm@23152
   522
              (args2, Name.variant_list (map vname args1) (map vname args2)));
wenzelm@23152
   523
        in [dist arg1 arg2, dist arg2 arg1] end;
wenzelm@23152
   524
    fun distincts []      = []
wenzelm@23152
   525
      | distincts (c::cs) = (map (distinct c) cs) :: distincts cs;
wenzelm@23152
   526
  in distincts cons end;
wenzelm@26336
   527
val dist_les = flat (flat distincts_le);
huffman@29402
   528
huffman@29402
   529
val _ = trace " Proving dist_eqs...";
wenzelm@23152
   530
val dist_eqs =
wenzelm@23152
   531
  let
wenzelm@23152
   532
    fun distinct (_,args1) ((_,args2), leqs) =
wenzelm@23152
   533
      let
wenzelm@23152
   534
        val (le1,le2) = (hd leqs, hd(tl leqs));
wenzelm@23152
   535
        val (eq1,eq2) = (le1 RS dist_eqI, le2 RS dist_eqI)
wenzelm@23152
   536
      in
wenzelm@23152
   537
        if nonlazy args1 = [] then [eq1, eq1 RS not_sym] else
wenzelm@23152
   538
        if nonlazy args2 = [] then [eq2, eq2 RS not_sym] else
wenzelm@23152
   539
          [eq1, eq2]
wenzelm@23152
   540
      end;
wenzelm@23152
   541
    fun distincts []      = []
wenzelm@26336
   542
      | distincts ((c,leqs)::cs) = flat
wenzelm@23152
   543
	            (ListPair.map (distinct c) ((map #1 cs),leqs)) @
wenzelm@23152
   544
		    distincts cs;
wenzelm@23152
   545
  in map standard (distincts (cons ~~ distincts_le)) end;
wenzelm@23152
   546
wenzelm@23152
   547
local 
wenzelm@23152
   548
  fun pgterm rel con args =
wenzelm@23152
   549
    let
wenzelm@23152
   550
      fun append s = upd_vname (fn v => v^s);
wenzelm@23152
   551
      val (largs, rargs) = (args, map (append "'") args);
wenzelm@23152
   552
      val concl =
wenzelm@23152
   553
        foldr1 mk_conj (ListPair.map rel (map %# largs, map %# rargs));
wenzelm@23152
   554
      val prem = rel (con_app con largs, con_app con rargs);
wenzelm@23152
   555
      val sargs = case largs of [_] => [] | _ => nonlazy args;
wenzelm@23152
   556
      val prop = lift_defined %: (sargs, mk_trp (prem === concl));
wenzelm@23152
   557
    in pg con_appls prop end;
wenzelm@23152
   558
  val cons' = List.filter (fn (_,args) => args<>[]) cons;
wenzelm@23152
   559
in
huffman@29402
   560
  val _ = trace " Proving inverts...";
wenzelm@23152
   561
  val inverts =
wenzelm@23152
   562
    let
wenzelm@23152
   563
      val abs_less = ax_abs_iso RS (allI RS injection_less);
wenzelm@23152
   564
      val tacs =
wenzelm@23152
   565
        [asm_full_simp_tac (HOLCF_ss addsimps [abs_less, spair_less]) 1];
wenzelm@27208
   566
    in map (fn (con, args) => pgterm (op <<) con args (K tacs)) cons' end;
wenzelm@23152
   567
huffman@29402
   568
  val _ = trace " Proving injects...";
wenzelm@23152
   569
  val injects =
wenzelm@23152
   570
    let
wenzelm@23152
   571
      val abs_eq = ax_abs_iso RS (allI RS injection_eq);
wenzelm@23152
   572
      val tacs = [asm_full_simp_tac (HOLCF_ss addsimps [abs_eq, spair_eq]) 1];
wenzelm@27208
   573
    in map (fn (con, args) => pgterm (op ===) con args (K tacs)) cons' end;
wenzelm@23152
   574
end;
wenzelm@23152
   575
wenzelm@23152
   576
(* ----- theorems concerning one induction step ----------------------------- *)
wenzelm@23152
   577
wenzelm@23152
   578
val copy_strict =
wenzelm@23152
   579
  let
huffman@31232
   580
    val _ = trace " Proving copy_strict...";
wenzelm@23152
   581
    val goal = mk_trp (strict (dc_copy `% "f"));
huffman@31232
   582
    val rules = [abs_strict, rep_strict] @ @{thms domain_fun_stricts};
huffman@31232
   583
    val tacs = [asm_simp_tac (HOLCF_ss addsimps rules) 1];
wenzelm@27208
   584
  in pg [ax_copy_def] goal (K tacs) end;
wenzelm@23152
   585
wenzelm@23152
   586
local
wenzelm@23152
   587
  fun copy_app (con, args) =
wenzelm@23152
   588
    let
wenzelm@23152
   589
      val lhs = dc_copy`%"f"`(con_app con args);
huffman@31232
   590
      fun one_rhs arg =
huffman@31232
   591
          if DatatypeAux.is_rec_type (dtyp_of arg)
huffman@31232
   592
          then Domain_Axioms.copy_of_dtyp (cproj (%:"f") eqs) (dtyp_of arg) ` (%# arg)
huffman@31232
   593
          else (%# arg);
huffman@31232
   594
      val rhs = con_app2 con one_rhs args;
wenzelm@23152
   595
      val goal = lift_defined %: (nonlazy_rec args, mk_trp (lhs === rhs));
wenzelm@23152
   596
      val args' = List.filter (fn a => not (is_rec a orelse is_lazy a)) args;
huffman@31232
   597
      val stricts = abs_strict :: rep_strict :: @{thms domain_fun_stricts};
wenzelm@27208
   598
      fun tacs1 ctxt = map (case_UU_tac ctxt stricts 1 o vname) args';
huffman@31232
   599
      val rules = [ax_abs_iso] @ @{thms domain_fun_simps};
huffman@31232
   600
      val tacs2 = [asm_simp_tac (HOLCF_ss addsimps rules) 1];
huffman@31232
   601
    in pg (ax_copy_def::con_appls) goal (fn ctxt => (tacs1 ctxt @ tacs2)) end;
wenzelm@23152
   602
in
huffman@29402
   603
  val _ = trace " Proving copy_apps...";
wenzelm@23152
   604
  val copy_apps = map copy_app cons;
wenzelm@23152
   605
end;
wenzelm@23152
   606
wenzelm@23152
   607
local
wenzelm@23152
   608
  fun one_strict (con, args) = 
wenzelm@23152
   609
    let
wenzelm@23152
   610
      val goal = mk_trp (dc_copy`UU`(con_app con args) === UU);
wenzelm@23152
   611
      val rews = copy_strict :: copy_apps @ con_rews;
wenzelm@27208
   612
      fun tacs ctxt = map (case_UU_tac ctxt rews 1) (nonlazy args) @
wenzelm@23152
   613
        [asm_simp_tac (HOLCF_ss addsimps rews) 1];
wenzelm@23152
   614
    in pg [] goal tacs end;
wenzelm@23152
   615
wenzelm@23152
   616
  fun has_nonlazy_rec (_, args) = exists is_nonlazy_rec args;
wenzelm@23152
   617
in
huffman@29402
   618
  val _ = trace " Proving copy_stricts...";
wenzelm@23152
   619
  val copy_stricts = map one_strict (List.filter has_nonlazy_rec cons);
wenzelm@23152
   620
end;
wenzelm@23152
   621
wenzelm@23152
   622
val copy_rews = copy_strict :: copy_apps @ copy_stricts;
wenzelm@23152
   623
wenzelm@23152
   624
in
wenzelm@23152
   625
  thy
wenzelm@30364
   626
    |> Sign.add_path (Long_Name.base_name dname)
huffman@31004
   627
    |> snd o PureThy.add_thmss [
huffman@31004
   628
        ((Binding.name "iso_rews"  , iso_rews    ), [Simplifier.simp_add]),
huffman@31004
   629
        ((Binding.name "exhaust"   , [exhaust]   ), []),
huffman@31004
   630
        ((Binding.name "casedist"  , [casedist]  ), [Induct.cases_type dname]),
huffman@31004
   631
        ((Binding.name "when_rews" , when_rews   ), [Simplifier.simp_add]),
huffman@31004
   632
        ((Binding.name "compacts"  , con_compacts), [Simplifier.simp_add]),
huffman@31004
   633
        ((Binding.name "con_rews"  , con_rews    ), [Simplifier.simp_add]),
huffman@31004
   634
        ((Binding.name "sel_rews"  , sel_rews    ), [Simplifier.simp_add]),
huffman@31004
   635
        ((Binding.name "dis_rews"  , dis_rews    ), [Simplifier.simp_add]),
huffman@31004
   636
        ((Binding.name "pat_rews"  , pat_rews    ), [Simplifier.simp_add]),
huffman@31004
   637
        ((Binding.name "dist_les"  , dist_les    ), [Simplifier.simp_add]),
huffman@31004
   638
        ((Binding.name "dist_eqs"  , dist_eqs    ), [Simplifier.simp_add]),
huffman@31004
   639
        ((Binding.name "inverts"   , inverts     ), [Simplifier.simp_add]),
huffman@31004
   640
        ((Binding.name "injects"   , injects     ), [Simplifier.simp_add]),
huffman@31004
   641
        ((Binding.name "copy_rews" , copy_rews   ), [Simplifier.simp_add]),
huffman@31004
   642
        ((Binding.name "match_rews", mat_rews    ), [Simplifier.simp_add])]
wenzelm@24712
   643
    |> Sign.parent_path
haftmann@28536
   644
    |> pair (iso_rews @ when_rews @ con_rews @ sel_rews @ dis_rews @
wenzelm@23152
   645
        pat_rews @ dist_les @ dist_eqs @ copy_rews)
wenzelm@23152
   646
end; (* let *)
wenzelm@23152
   647
wenzelm@23152
   648
fun comp_theorems (comp_dnam, eqs: eq list) thy =
wenzelm@23152
   649
let
wenzelm@27232
   650
val global_ctxt = ProofContext.init thy;
wenzelm@27232
   651
wenzelm@23152
   652
val dnames = map (fst o fst) eqs;
wenzelm@23152
   653
val conss  = map  snd        eqs;
haftmann@28965
   654
val comp_dname = Sign.full_bname thy comp_dnam;
wenzelm@23152
   655
huffman@29402
   656
val _ = message ("Proving induction properties of domain "^comp_dname^" ...");
wenzelm@23152
   657
val pg = pg' thy;
wenzelm@23152
   658
wenzelm@23152
   659
(* ----- getting the composite axiom and definitions ------------------------ *)
wenzelm@23152
   660
wenzelm@23152
   661
local
wenzelm@26343
   662
  fun ga s dn = PureThy.get_thm thy (dn ^ "." ^ s);
wenzelm@23152
   663
in
wenzelm@23152
   664
  val axs_reach      = map (ga "reach"     ) dnames;
wenzelm@23152
   665
  val axs_take_def   = map (ga "take_def"  ) dnames;
wenzelm@23152
   666
  val axs_finite_def = map (ga "finite_def") dnames;
wenzelm@23152
   667
  val ax_copy2_def   =      ga "copy_def"  comp_dnam;
wenzelm@23152
   668
  val ax_bisim_def   =      ga "bisim_def" comp_dnam;
wenzelm@23152
   669
end;
wenzelm@23152
   670
wenzelm@23152
   671
local
wenzelm@26343
   672
  fun gt  s dn = PureThy.get_thm  thy (dn ^ "." ^ s);
wenzelm@26343
   673
  fun gts s dn = PureThy.get_thms thy (dn ^ "." ^ s);
wenzelm@23152
   674
in
wenzelm@23152
   675
  val cases = map (gt  "casedist" ) dnames;
wenzelm@26336
   676
  val con_rews  = maps (gts "con_rews" ) dnames;
wenzelm@26336
   677
  val copy_rews = maps (gts "copy_rews") dnames;
wenzelm@23152
   678
end;
wenzelm@23152
   679
wenzelm@23152
   680
fun dc_take dn = %%:(dn^"_take");
wenzelm@23152
   681
val x_name = idx_name dnames "x"; 
wenzelm@23152
   682
val P_name = idx_name dnames "P";
wenzelm@23152
   683
val n_eqs = length eqs;
wenzelm@23152
   684
wenzelm@23152
   685
(* ----- theorems concerning finite approximation and finite induction ------ *)
wenzelm@23152
   686
wenzelm@23152
   687
local
wenzelm@26342
   688
  val iterate_Cprod_ss = simpset_of @{theory Fix};
wenzelm@23152
   689
  val copy_con_rews  = copy_rews @ con_rews;
wenzelm@23152
   690
  val copy_take_defs =
wenzelm@23152
   691
    (if n_eqs = 1 then [] else [ax_copy2_def]) @ axs_take_def;
huffman@29402
   692
  val _ = trace " Proving take_stricts...";
wenzelm@23152
   693
  val take_stricts =
wenzelm@23152
   694
    let
wenzelm@23152
   695
      fun one_eq ((dn, args), _) = strict (dc_take dn $ %:"n");
wenzelm@23152
   696
      val goal = mk_trp (foldr1 mk_conj (map one_eq eqs));
wenzelm@27208
   697
      fun tacs ctxt = [
wenzelm@27208
   698
        InductTacs.induct_tac ctxt [[SOME "n"]] 1,
wenzelm@23152
   699
        simp_tac iterate_Cprod_ss 1,
wenzelm@23152
   700
        asm_simp_tac (iterate_Cprod_ss addsimps copy_rews) 1];
wenzelm@23152
   701
    in pg copy_take_defs goal tacs end;
wenzelm@23152
   702
wenzelm@23152
   703
  val take_stricts' = rewrite_rule copy_take_defs take_stricts;
wenzelm@23152
   704
  fun take_0 n dn =
wenzelm@23152
   705
    let
wenzelm@23152
   706
      val goal = mk_trp ((dc_take dn $ %%:"HOL.zero") `% x_name n === UU);
wenzelm@27208
   707
    in pg axs_take_def goal (K [simp_tac iterate_Cprod_ss 1]) end;
wenzelm@23152
   708
  val take_0s = mapn take_0 1 dnames;
wenzelm@27208
   709
  fun c_UU_tac ctxt = case_UU_tac ctxt (take_stricts'::copy_con_rews) 1;
huffman@29402
   710
  val _ = trace " Proving take_apps...";
wenzelm@23152
   711
  val take_apps =
wenzelm@23152
   712
    let
wenzelm@23152
   713
      fun mk_eqn dn (con, args) =
wenzelm@23152
   714
        let
wenzelm@23152
   715
          fun mk_take n = dc_take (List.nth (dnames, n)) $ %:"n";
huffman@31232
   716
          fun one_rhs arg =
huffman@31232
   717
              if DatatypeAux.is_rec_type (dtyp_of arg)
huffman@31232
   718
              then Domain_Axioms.copy_of_dtyp mk_take (dtyp_of arg) ` (%# arg)
huffman@31232
   719
              else (%# arg);
wenzelm@23152
   720
          val lhs = (dc_take dn $ (%%:"Suc" $ %:"n"))`(con_app con args);
huffman@31232
   721
          val rhs = con_app2 con one_rhs args;
wenzelm@23152
   722
        in Library.foldr mk_all (map vname args, lhs === rhs) end;
wenzelm@23152
   723
      fun mk_eqns ((dn, _), cons) = map (mk_eqn dn) cons;
wenzelm@26336
   724
      val goal = mk_trp (foldr1 mk_conj (maps mk_eqns eqs));
wenzelm@23152
   725
      val simps = List.filter (has_fewer_prems 1) copy_rews;
wenzelm@27208
   726
      fun con_tac ctxt (con, args) =
wenzelm@23152
   727
        if nonlazy_rec args = []
wenzelm@23152
   728
        then all_tac
wenzelm@27208
   729
        else EVERY (map (c_UU_tac ctxt) (nonlazy_rec args)) THEN
wenzelm@23152
   730
          asm_full_simp_tac (HOLCF_ss addsimps copy_rews) 1;
wenzelm@27208
   731
      fun eq_tacs ctxt ((dn, _), cons) = map (con_tac ctxt) cons;
wenzelm@27208
   732
      fun tacs ctxt =
wenzelm@23152
   733
        simp_tac iterate_Cprod_ss 1 ::
wenzelm@27208
   734
        InductTacs.induct_tac ctxt [[SOME "n"]] 1 ::
wenzelm@23152
   735
        simp_tac (iterate_Cprod_ss addsimps copy_con_rews) 1 ::
wenzelm@23152
   736
        asm_full_simp_tac (HOLCF_ss addsimps simps) 1 ::
wenzelm@23152
   737
        TRY (safe_tac HOL_cs) ::
wenzelm@27208
   738
        maps (eq_tacs ctxt) eqs;
wenzelm@23152
   739
    in pg copy_take_defs goal tacs end;
wenzelm@23152
   740
in
wenzelm@23152
   741
  val take_rews = map standard
wenzelm@27232
   742
    (atomize global_ctxt take_stricts @ take_0s @ atomize global_ctxt take_apps);
wenzelm@23152
   743
end; (* local *)
wenzelm@23152
   744
wenzelm@23152
   745
local
wenzelm@23152
   746
  fun one_con p (con,args) =
wenzelm@23152
   747
    let
wenzelm@23152
   748
      fun ind_hyp arg = %:(P_name (1 + rec_of arg)) $ bound_arg args arg;
wenzelm@23152
   749
      val t1 = mk_trp (%:p $ con_app2 con (bound_arg args) args);
wenzelm@23152
   750
      val t2 = lift ind_hyp (List.filter is_rec args, t1);
wenzelm@23152
   751
      val t3 = lift_defined (bound_arg (map vname args)) (nonlazy args, t2);
wenzelm@23152
   752
    in Library.foldr mk_All (map vname args, t3) end;
wenzelm@23152
   753
wenzelm@23152
   754
  fun one_eq ((p, cons), concl) =
wenzelm@23152
   755
    mk_trp (%:p $ UU) ===> Logic.list_implies (map (one_con p) cons, concl);
wenzelm@23152
   756
wenzelm@23152
   757
  fun ind_term concf = Library.foldr one_eq
wenzelm@23152
   758
    (mapn (fn n => fn x => (P_name n, x)) 1 conss,
wenzelm@23152
   759
     mk_trp (foldr1 mk_conj (mapn concf 1 dnames)));
wenzelm@23152
   760
  val take_ss = HOL_ss addsimps take_rews;
wenzelm@27208
   761
  fun quant_tac ctxt i = EVERY
wenzelm@27239
   762
    (mapn (fn n => fn _ => res_inst_tac ctxt [(("x", 0), x_name n)] spec i) 1 dnames);
wenzelm@23152
   763
wenzelm@23152
   764
  fun ind_prems_tac prems = EVERY
wenzelm@26336
   765
    (maps (fn cons =>
wenzelm@23152
   766
      (resolve_tac prems 1 ::
wenzelm@26336
   767
        maps (fn (_,args) => 
wenzelm@23152
   768
          resolve_tac prems 1 ::
wenzelm@23152
   769
          map (K(atac 1)) (nonlazy args) @
wenzelm@23152
   770
          map (K(atac 1)) (List.filter is_rec args))
wenzelm@26336
   771
        cons))
wenzelm@26336
   772
      conss);
wenzelm@23152
   773
  local 
wenzelm@23152
   774
    (* check whether every/exists constructor of the n-th part of the equation:
wenzelm@23152
   775
       it has a possibly indirectly recursive argument that isn't/is possibly 
wenzelm@23152
   776
       indirectly lazy *)
wenzelm@23152
   777
    fun rec_to quant nfn rfn ns lazy_rec (n,cons) = quant (exists (fn arg => 
wenzelm@23152
   778
          is_rec arg andalso not(rec_of arg mem ns) andalso
wenzelm@23152
   779
          ((rec_of arg =  n andalso nfn(lazy_rec orelse is_lazy arg)) orelse 
wenzelm@23152
   780
            rec_of arg <> n andalso rec_to quant nfn rfn (rec_of arg::ns) 
wenzelm@23152
   781
              (lazy_rec orelse is_lazy arg) (n, (List.nth(conss,rec_of arg))))
wenzelm@23152
   782
          ) o snd) cons;
wenzelm@23152
   783
    fun all_rec_to ns  = rec_to forall not all_rec_to  ns;
wenzelm@23152
   784
    fun warn (n,cons) =
wenzelm@23152
   785
      if all_rec_to [] false (n,cons)
wenzelm@23152
   786
      then (warning ("domain "^List.nth(dnames,n)^" is empty!"); true)
wenzelm@23152
   787
      else false;
wenzelm@23152
   788
    fun lazy_rec_to ns = rec_to exists I  lazy_rec_to ns;
wenzelm@23152
   789
wenzelm@23152
   790
  in
wenzelm@23152
   791
    val n__eqs = mapn (fn n => fn (_,cons) => (n,cons)) 0 eqs;
wenzelm@23152
   792
    val is_emptys = map warn n__eqs;
wenzelm@23152
   793
    val is_finite = forall (not o lazy_rec_to [] false) n__eqs;
wenzelm@23152
   794
  end;
wenzelm@23152
   795
in (* local *)
huffman@29402
   796
  val _ = trace " Proving finite_ind...";
wenzelm@23152
   797
  val finite_ind =
wenzelm@23152
   798
    let
wenzelm@23152
   799
      fun concf n dn = %:(P_name n) $ (dc_take dn $ %:"n" `%(x_name n));
wenzelm@23152
   800
      val goal = ind_term concf;
wenzelm@23152
   801
wenzelm@27208
   802
      fun tacf {prems, context} =
wenzelm@23152
   803
        let
wenzelm@23152
   804
          val tacs1 = [
wenzelm@27208
   805
            quant_tac context 1,
wenzelm@23152
   806
            simp_tac HOL_ss 1,
wenzelm@27208
   807
            InductTacs.induct_tac context [[SOME "n"]] 1,
wenzelm@23152
   808
            simp_tac (take_ss addsimps prems) 1,
wenzelm@23152
   809
            TRY (safe_tac HOL_cs)];
wenzelm@23152
   810
          fun arg_tac arg =
wenzelm@27208
   811
            case_UU_tac context (prems @ con_rews) 1
wenzelm@23152
   812
              (List.nth (dnames, rec_of arg) ^ "_take n$" ^ vname arg);
wenzelm@23152
   813
          fun con_tacs (con, args) = 
wenzelm@23152
   814
            asm_simp_tac take_ss 1 ::
wenzelm@23152
   815
            map arg_tac (List.filter is_nonlazy_rec args) @
wenzelm@23152
   816
            [resolve_tac prems 1] @
wenzelm@23152
   817
            map (K (atac 1))      (nonlazy args) @
wenzelm@23152
   818
            map (K (etac spec 1)) (List.filter is_rec args);
wenzelm@23152
   819
          fun cases_tacs (cons, cases) =
wenzelm@27239
   820
            res_inst_tac context [(("x", 0), "x")] cases 1 ::
wenzelm@23152
   821
            asm_simp_tac (take_ss addsimps prems) 1 ::
wenzelm@26336
   822
            maps con_tacs cons;
wenzelm@23152
   823
        in
wenzelm@26336
   824
          tacs1 @ maps cases_tacs (conss ~~ cases)
wenzelm@23152
   825
        end;
huffman@31232
   826
    in pg'' thy [] goal tacf
huffman@31232
   827
       handle ERROR _ => (warning "Proof of finite_ind failed."; TrueI)
huffman@31232
   828
    end;
wenzelm@23152
   829
huffman@29402
   830
  val _ = trace " Proving take_lemmas...";
wenzelm@23152
   831
  val take_lemmas =
wenzelm@23152
   832
    let
wenzelm@23152
   833
      fun take_lemma n (dn, ax_reach) =
wenzelm@23152
   834
        let
wenzelm@23152
   835
          val lhs = dc_take dn $ Bound 0 `%(x_name n);
wenzelm@23152
   836
          val rhs = dc_take dn $ Bound 0 `%(x_name n^"'");
wenzelm@23152
   837
          val concl = mk_trp (%:(x_name n) === %:(x_name n^"'"));
wenzelm@23152
   838
          val goal = mk_All ("n", mk_trp (lhs === rhs)) ===> concl;
wenzelm@27208
   839
          fun tacf {prems, context} = [
wenzelm@27239
   840
            res_inst_tac context [(("t", 0), x_name n    )] (ax_reach RS subst) 1,
wenzelm@27239
   841
            res_inst_tac context [(("t", 0), x_name n^"'")] (ax_reach RS subst) 1,
wenzelm@23152
   842
            stac fix_def2 1,
wenzelm@23152
   843
            REPEAT (CHANGED
wenzelm@23152
   844
              (rtac (contlub_cfun_arg RS ssubst) 1 THEN chain_tac 1)),
wenzelm@23152
   845
            stac contlub_cfun_fun 1,
wenzelm@23152
   846
            stac contlub_cfun_fun 2,
wenzelm@23152
   847
            rtac lub_equal 3,
wenzelm@23152
   848
            chain_tac 1,
wenzelm@23152
   849
            rtac allI 1,
wenzelm@23152
   850
            resolve_tac prems 1];
wenzelm@23152
   851
        in pg'' thy axs_take_def goal tacf end;
wenzelm@23152
   852
    in mapn take_lemma 1 (dnames ~~ axs_reach) end;
wenzelm@23152
   853
wenzelm@23152
   854
(* ----- theorems concerning finiteness and induction ----------------------- *)
wenzelm@23152
   855
huffman@29402
   856
  val _ = trace " Proving finites, ind...";
wenzelm@23152
   857
  val (finites, ind) =
huffman@31232
   858
  (
wenzelm@23152
   859
    if is_finite
wenzelm@23152
   860
    then (* finite case *)
wenzelm@23152
   861
      let 
wenzelm@23152
   862
        fun take_enough dn = mk_ex ("n",dc_take dn $ Bound 0 ` %:"x" === %:"x");
wenzelm@23152
   863
        fun dname_lemma dn =
wenzelm@23152
   864
          let
wenzelm@23152
   865
            val prem1 = mk_trp (defined (%:"x"));
wenzelm@23152
   866
            val disj1 = mk_all ("n", dc_take dn $ Bound 0 ` %:"x" === UU);
wenzelm@23152
   867
            val prem2 = mk_trp (mk_disj (disj1, take_enough dn));
wenzelm@23152
   868
            val concl = mk_trp (take_enough dn);
wenzelm@23152
   869
            val goal = prem1 ===> prem2 ===> concl;
wenzelm@23152
   870
            val tacs = [
wenzelm@23152
   871
              etac disjE 1,
wenzelm@23152
   872
              etac notE 1,
wenzelm@23152
   873
              resolve_tac take_lemmas 1,
wenzelm@23152
   874
              asm_simp_tac take_ss 1,
wenzelm@23152
   875
              atac 1];
wenzelm@27208
   876
          in pg [] goal (K tacs) end;
huffman@31232
   877
        val _ = trace " Proving finite_lemmas1a";
wenzelm@23152
   878
        val finite_lemmas1a = map dname_lemma dnames;
wenzelm@23152
   879
 
huffman@31232
   880
        val _ = trace " Proving finite_lemma1b";
wenzelm@23152
   881
        val finite_lemma1b =
wenzelm@23152
   882
          let
wenzelm@23152
   883
            fun mk_eqn n ((dn, args), _) =
wenzelm@23152
   884
              let
wenzelm@23152
   885
                val disj1 = dc_take dn $ Bound 1 ` Bound 0 === UU;
wenzelm@23152
   886
                val disj2 = dc_take dn $ Bound 1 ` Bound 0 === Bound 0;
wenzelm@23152
   887
              in
wenzelm@23152
   888
                mk_constrainall
wenzelm@23152
   889
                  (x_name n, Type (dn,args), mk_disj (disj1, disj2))
wenzelm@23152
   890
              end;
wenzelm@23152
   891
            val goal =
wenzelm@23152
   892
              mk_trp (mk_all ("n", foldr1 mk_conj (mapn mk_eqn 1 eqs)));
wenzelm@27208
   893
            fun arg_tacs ctxt vn = [
wenzelm@27239
   894
              eres_inst_tac ctxt [(("x", 0), vn)] all_dupE 1,
wenzelm@23152
   895
              etac disjE 1,
wenzelm@23152
   896
              asm_simp_tac (HOL_ss addsimps con_rews) 1,
wenzelm@23152
   897
              asm_simp_tac take_ss 1];
wenzelm@27208
   898
            fun con_tacs ctxt (con, args) =
wenzelm@23152
   899
              asm_simp_tac take_ss 1 ::
wenzelm@27208
   900
              maps (arg_tacs ctxt) (nonlazy_rec args);
wenzelm@27208
   901
            fun foo_tacs ctxt n (cons, cases) =
wenzelm@23152
   902
              simp_tac take_ss 1 ::
wenzelm@23152
   903
              rtac allI 1 ::
wenzelm@27239
   904
              res_inst_tac ctxt [(("x", 0), x_name n)] cases 1 ::
wenzelm@23152
   905
              asm_simp_tac take_ss 1 ::
wenzelm@27208
   906
              maps (con_tacs ctxt) cons;
wenzelm@27208
   907
            fun tacs ctxt =
wenzelm@23152
   908
              rtac allI 1 ::
wenzelm@27208
   909
              InductTacs.induct_tac ctxt [[SOME "n"]] 1 ::
wenzelm@23152
   910
              simp_tac take_ss 1 ::
wenzelm@23152
   911
              TRY (safe_tac (empty_cs addSEs [conjE] addSIs [conjI])) ::
wenzelm@27208
   912
              flat (mapn (foo_tacs ctxt) 1 (conss ~~ cases));
wenzelm@23152
   913
          in pg [] goal tacs end;
wenzelm@23152
   914
wenzelm@23152
   915
        fun one_finite (dn, l1b) =
wenzelm@23152
   916
          let
wenzelm@23152
   917
            val goal = mk_trp (%%:(dn^"_finite") $ %:"x");
wenzelm@27208
   918
            fun tacs ctxt = [
wenzelm@27208
   919
              case_UU_tac ctxt take_rews 1 "x",
wenzelm@23152
   920
              eresolve_tac finite_lemmas1a 1,
wenzelm@23152
   921
              step_tac HOL_cs 1,
wenzelm@23152
   922
              step_tac HOL_cs 1,
wenzelm@23152
   923
              cut_facts_tac [l1b] 1,
wenzelm@23152
   924
              fast_tac HOL_cs 1];
wenzelm@23152
   925
          in pg axs_finite_def goal tacs end;
wenzelm@23152
   926
huffman@31232
   927
        val _ = trace " Proving finites";
wenzelm@27232
   928
        val finites = map one_finite (dnames ~~ atomize global_ctxt finite_lemma1b);
huffman@31232
   929
        val _ = trace " Proving ind";
wenzelm@23152
   930
        val ind =
wenzelm@23152
   931
          let
wenzelm@23152
   932
            fun concf n dn = %:(P_name n) $ %:(x_name n);
wenzelm@27208
   933
            fun tacf {prems, context} =
wenzelm@23152
   934
              let
wenzelm@23152
   935
                fun finite_tacs (finite, fin_ind) = [
wenzelm@23152
   936
                  rtac(rewrite_rule axs_finite_def finite RS exE)1,
wenzelm@23152
   937
                  etac subst 1,
wenzelm@23152
   938
                  rtac fin_ind 1,
wenzelm@23152
   939
                  ind_prems_tac prems];
wenzelm@23152
   940
              in
wenzelm@23152
   941
                TRY (safe_tac HOL_cs) ::
wenzelm@27232
   942
                maps finite_tacs (finites ~~ atomize global_ctxt finite_ind)
wenzelm@23152
   943
              end;
wenzelm@23152
   944
          in pg'' thy [] (ind_term concf) tacf end;
wenzelm@23152
   945
      in (finites, ind) end (* let *)
wenzelm@23152
   946
wenzelm@23152
   947
    else (* infinite case *)
wenzelm@23152
   948
      let
wenzelm@23152
   949
        fun one_finite n dn =
wenzelm@27239
   950
          read_instantiate global_ctxt [(("P", 0), dn ^ "_finite " ^ x_name n)] excluded_middle;
wenzelm@23152
   951
        val finites = mapn one_finite 1 dnames;
wenzelm@23152
   952
wenzelm@23152
   953
        val goal =
wenzelm@23152
   954
          let
huffman@26012
   955
            fun one_adm n _ = mk_trp (mk_adm (%:(P_name n)));
wenzelm@23152
   956
            fun concf n dn = %:(P_name n) $ %:(x_name n);
wenzelm@23152
   957
          in Logic.list_implies (mapn one_adm 1 dnames, ind_term concf) end;
wenzelm@27208
   958
        fun tacf {prems, context} =
wenzelm@23152
   959
          map (fn ax_reach => rtac (ax_reach RS subst) 1) axs_reach @ [
wenzelm@27208
   960
          quant_tac context 1,
wenzelm@23152
   961
          rtac (adm_impl_admw RS wfix_ind) 1,
huffman@25895
   962
          REPEAT_DETERM (rtac adm_all 1),
wenzelm@23152
   963
          REPEAT_DETERM (
wenzelm@23152
   964
            TRY (rtac adm_conj 1) THEN 
wenzelm@23152
   965
            rtac adm_subst 1 THEN 
wenzelm@23152
   966
            cont_tacR 1 THEN resolve_tac prems 1),
wenzelm@23152
   967
          strip_tac 1,
wenzelm@23152
   968
          rtac (rewrite_rule axs_take_def finite_ind) 1,
wenzelm@23152
   969
          ind_prems_tac prems];
wenzelm@23152
   970
        val ind = (pg'' thy [] goal tacf
wenzelm@23152
   971
          handle ERROR _ =>
wenzelm@23152
   972
            (warning "Cannot prove infinite induction rule"; refl));
huffman@31232
   973
      in (finites, ind) end
huffman@31232
   974
  )
huffman@31232
   975
      handle THM _ =>
huffman@31232
   976
             (warning "Induction proofs failed (THM raised)."; ([], TrueI))
huffman@31232
   977
           | ERROR _ =>
huffman@31232
   978
             (warning "Induction proofs failed (ERROR raised)."; ([], TrueI));
huffman@31232
   979
huffman@31232
   980
wenzelm@23152
   981
end; (* local *)
wenzelm@23152
   982
wenzelm@23152
   983
(* ----- theorem concerning coinduction ------------------------------------- *)
wenzelm@23152
   984
wenzelm@23152
   985
local
wenzelm@23152
   986
  val xs = mapn (fn n => K (x_name n)) 1 dnames;
wenzelm@23152
   987
  fun bnd_arg n i = Bound(2*(n_eqs - n)-i-1);
wenzelm@23152
   988
  val take_ss = HOL_ss addsimps take_rews;
wenzelm@23152
   989
  val sproj = prj (fn s => K("fst("^s^")")) (fn s => K("snd("^s^")"));
huffman@29402
   990
  val _ = trace " Proving coind_lemma...";
wenzelm@23152
   991
  val coind_lemma =
wenzelm@23152
   992
    let
wenzelm@23152
   993
      fun mk_prj n _ = proj (%:"R") eqs n $ bnd_arg n 0 $ bnd_arg n 1;
wenzelm@23152
   994
      fun mk_eqn n dn =
wenzelm@23152
   995
        (dc_take dn $ %:"n" ` bnd_arg n 0) ===
wenzelm@23152
   996
        (dc_take dn $ %:"n" ` bnd_arg n 1);
wenzelm@23152
   997
      fun mk_all2 (x,t) = mk_all (x, mk_all (x^"'", t));
wenzelm@23152
   998
      val goal =
wenzelm@23152
   999
        mk_trp (mk_imp (%%:(comp_dname^"_bisim") $ %:"R",
wenzelm@23152
  1000
          Library.foldr mk_all2 (xs,
wenzelm@23152
  1001
            Library.foldr mk_imp (mapn mk_prj 0 dnames,
wenzelm@23152
  1002
              foldr1 mk_conj (mapn mk_eqn 0 dnames)))));
wenzelm@27208
  1003
      fun x_tacs ctxt n x = [
wenzelm@23152
  1004
        rotate_tac (n+1) 1,
wenzelm@23152
  1005
        etac all2E 1,
wenzelm@27239
  1006
        eres_inst_tac ctxt [(("P", 1), sproj "R" eqs n^" "^x^" "^x^"'")] (mp RS disjE) 1,
wenzelm@23152
  1007
        TRY (safe_tac HOL_cs),
wenzelm@23152
  1008
        REPEAT (CHANGED (asm_simp_tac take_ss 1))];
wenzelm@27208
  1009
      fun tacs ctxt = [
wenzelm@23152
  1010
        rtac impI 1,
wenzelm@27208
  1011
        InductTacs.induct_tac ctxt [[SOME "n"]] 1,
wenzelm@23152
  1012
        simp_tac take_ss 1,
wenzelm@23152
  1013
        safe_tac HOL_cs] @
wenzelm@27208
  1014
        flat (mapn (x_tacs ctxt) 0 xs);
wenzelm@23152
  1015
    in pg [ax_bisim_def] goal tacs end;
wenzelm@23152
  1016
in
huffman@29402
  1017
  val _ = trace " Proving coind...";
wenzelm@23152
  1018
  val coind = 
wenzelm@23152
  1019
    let
wenzelm@23152
  1020
      fun mk_prj n x = mk_trp (proj (%:"R") eqs n $ %:x $ %:(x^"'"));
wenzelm@23152
  1021
      fun mk_eqn x = %:x === %:(x^"'");
wenzelm@23152
  1022
      val goal =
wenzelm@23152
  1023
        mk_trp (%%:(comp_dname^"_bisim") $ %:"R") ===>
wenzelm@23152
  1024
          Logic.list_implies (mapn mk_prj 0 xs,
wenzelm@23152
  1025
            mk_trp (foldr1 mk_conj (map mk_eqn xs)));
wenzelm@23152
  1026
      val tacs =
wenzelm@23152
  1027
        TRY (safe_tac HOL_cs) ::
wenzelm@26336
  1028
        maps (fn take_lemma => [
wenzelm@23152
  1029
          rtac take_lemma 1,
wenzelm@23152
  1030
          cut_facts_tac [coind_lemma] 1,
wenzelm@23152
  1031
          fast_tac HOL_cs 1])
wenzelm@26336
  1032
        take_lemmas;
wenzelm@27208
  1033
    in pg [] goal (K tacs) end;
wenzelm@23152
  1034
end; (* local *)
wenzelm@23152
  1035
huffman@30829
  1036
val inducts = ProjectRule.projections (ProofContext.init thy) ind;
huffman@30829
  1037
fun ind_rule (dname, rule) = ((Binding.empty, [rule]), [Induct.induct_type dname]);
huffman@31232
  1038
val induct_failed = (Thm.prop_of ind = Thm.prop_of TrueI);
huffman@30829
  1039
wenzelm@24712
  1040
in thy |> Sign.add_path comp_dnam
huffman@31004
  1041
       |> snd o PureThy.add_thmss [
huffman@31004
  1042
           ((Binding.name "take_rews"  , take_rews   ), [Simplifier.simp_add]),
huffman@31004
  1043
           ((Binding.name "take_lemmas", take_lemmas ), []),
huffman@31004
  1044
           ((Binding.name "finites"    , finites     ), []),
huffman@31004
  1045
           ((Binding.name "finite_ind" , [finite_ind]), []),
huffman@31004
  1046
           ((Binding.name "ind"        , [ind]       ), []),
huffman@31004
  1047
           ((Binding.name "coind"      , [coind]     ), [])]
huffman@31232
  1048
       |> (if induct_failed then I
huffman@31232
  1049
           else snd o PureThy.add_thmss (map ind_rule (dnames ~~ inducts)))
haftmann@28536
  1050
       |> Sign.parent_path |> pair take_rews
wenzelm@23152
  1051
end; (* let *)
wenzelm@23152
  1052
end; (* local *)
wenzelm@23152
  1053
end; (* struct *)