src/HOL/Tools/datatype_package/datatype_abs_proofs.ML
author haftmann
Fri Jun 19 17:23:21 2009 +0200 (2009-06-19)
changeset 31723 f5cafe803b55
parent 31668 a616e56a5ec8
child 31737 b3f63611784e
permissions -rw-r--r--
discontinued ancient tradition to suffix certain ML module names with "_package"
berghofe@5177
     1
(*  Title:      HOL/Tools/datatype_abs_proofs.ML
wenzelm@11539
     2
    Author:     Stefan Berghofer, TU Muenchen
berghofe@5177
     3
berghofe@5177
     4
Proofs and defintions independent of concrete representation
berghofe@5177
     5
of datatypes  (i.e. requiring only abstract properties such as
berghofe@5177
     6
injectivity / distinctness of constructors and induction)
berghofe@5177
     7
berghofe@5177
     8
 - case distinction (exhaustion) theorems
berghofe@5177
     9
 - characteristic equations for primrec combinators
berghofe@5177
    10
 - characteristic equations for case combinators
berghofe@5177
    11
 - equations for splitting "P (case ...)" expressions
wenzelm@29264
    12
 - "nchotomy" and "case_cong" theorems for TFL
berghofe@5177
    13
*)
berghofe@5177
    14
berghofe@5177
    15
signature DATATYPE_ABS_PROOFS =
berghofe@5177
    16
sig
haftmann@31668
    17
  type datatype_config = DatatypeAux.datatype_config
haftmann@31668
    18
  type descr = DatatypeAux.descr
haftmann@31668
    19
  type datatype_info = DatatypeAux.datatype_info
haftmann@31668
    20
  val prove_casedist_thms : datatype_config -> string list ->
haftmann@31668
    21
    descr list -> (string * sort) list -> thm ->
wenzelm@18728
    22
    attribute list -> theory -> thm list * theory
haftmann@31668
    23
  val prove_primrec_thms : datatype_config -> string list ->
haftmann@31668
    24
    descr list -> (string * sort) list ->
haftmann@31668
    25
      datatype_info Symtab.table -> thm list list -> thm list list ->
haftmann@18314
    26
        simpset -> thm -> theory -> (string list * thm list) * theory
haftmann@31668
    27
  val prove_case_thms : datatype_config -> string list ->
haftmann@31668
    28
    descr list -> (string * sort) list ->
haftmann@18314
    29
      string list -> thm list -> theory -> (thm list list * string list) * theory
haftmann@31668
    30
  val prove_split_thms : datatype_config -> string list ->
haftmann@31668
    31
    descr list -> (string * sort) list ->
berghofe@5177
    32
      thm list list -> thm list list -> thm list -> thm list list -> theory ->
haftmann@18314
    33
        (thm * thm) list * theory
haftmann@31668
    34
  val prove_nchotomys : datatype_config -> string list -> descr list ->
haftmann@18314
    35
    (string * sort) list -> thm list -> theory -> thm list * theory
haftmann@31668
    36
  val prove_weak_case_congs : string list -> descr list ->
haftmann@18314
    37
    (string * sort) list -> theory -> thm list * theory
berghofe@13641
    38
  val prove_case_congs : string list ->
haftmann@31668
    39
    descr list -> (string * sort) list ->
haftmann@18314
    40
      thm list -> thm list list -> theory -> thm list * theory
berghofe@5177
    41
end;
berghofe@5177
    42
wenzelm@8436
    43
structure DatatypeAbsProofs: DATATYPE_ABS_PROOFS =
berghofe@5177
    44
struct
berghofe@5177
    45
berghofe@5177
    46
open DatatypeAux;
berghofe@5177
    47
berghofe@5177
    48
(************************ case distinction theorems ***************************)
berghofe@5177
    49
haftmann@31668
    50
fun prove_casedist_thms (config : datatype_config) new_type_names descr sorts induct case_names_exhausts thy =
berghofe@5177
    51
  let
haftmann@31668
    52
    val _ = message config "Proving case distinction theorems ...";
berghofe@5177
    53
skalberg@15570
    54
    val descr' = List.concat descr;
berghofe@5177
    55
    val recTs = get_rec_types descr' sorts;
skalberg@15570
    56
    val newTs = Library.take (length (hd descr), recTs);
berghofe@5177
    57
berghofe@8477
    58
    val {maxidx, ...} = rep_thm induct;
wenzelm@8305
    59
    val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)));
berghofe@5177
    60
berghofe@5177
    61
    fun prove_casedist_thm ((i, t), T) =
berghofe@5177
    62
      let
berghofe@5177
    63
        val dummyPs = map (fn (Var (_, Type (_, [T', T'']))) =>
berghofe@5177
    64
          Abs ("z", T', Const ("True", T''))) induct_Ps;
berghofe@8477
    65
        val P = Abs ("z", T, HOLogic.imp $ HOLogic.mk_eq (Var (("a", maxidx+1), T), Bound 0) $
berghofe@5177
    66
          Var (("P", 0), HOLogic.boolT))
skalberg@15570
    67
        val insts = Library.take (i, dummyPs) @ (P::(Library.drop (i + 1, dummyPs)));
wenzelm@17985
    68
        val cert = cterm_of thy;
berghofe@5177
    69
        val insts' = (map cert induct_Ps) ~~ (map cert insts);
skalberg@15570
    70
        val induct' = refl RS ((List.nth
skalberg@15570
    71
          (split_conj_thm (cterm_instantiate insts' induct), i)) RSN (2, rev_mp))
berghofe@5177
    72
wenzelm@17985
    73
      in
berghofe@26531
    74
        SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
wenzelm@26711
    75
          (fn {prems, ...} => EVERY
wenzelm@17985
    76
            [rtac induct' 1,
wenzelm@17985
    77
             REPEAT (rtac TrueI 1),
wenzelm@17985
    78
             REPEAT ((rtac impI 1) THEN (eresolve_tac prems 1)),
wenzelm@20046
    79
             REPEAT (rtac TrueI 1)])
berghofe@5177
    80
      end;
berghofe@5177
    81
berghofe@5177
    82
    val casedist_thms = map prove_casedist_thm ((0 upto (length newTs - 1)) ~~
berghofe@5177
    83
      (DatatypeProp.make_casedists descr sorts) ~~ newTs)
haftmann@18314
    84
  in
haftmann@18314
    85
    thy
haftmann@18314
    86
    |> store_thms_atts "exhaust" new_type_names (map single case_names_exhausts) casedist_thms
haftmann@18314
    87
  end;
berghofe@5177
    88
berghofe@5177
    89
berghofe@5177
    90
(*************************** primrec combinators ******************************)
berghofe@5177
    91
haftmann@31668
    92
fun prove_primrec_thms (config : datatype_config) new_type_names descr sorts
berghofe@7015
    93
    (dt_info : datatype_info Symtab.table) constr_inject dist_rewrites dist_ss induct thy =
berghofe@5177
    94
  let
haftmann@31668
    95
    val _ = message config "Constructing primrec combinators ...";
berghofe@5661
    96
berghofe@5661
    97
    val big_name = space_implode "_" new_type_names;
haftmann@31668
    98
    val thy0 = add_path (#flat_names config) big_name thy;
berghofe@5177
    99
skalberg@15570
   100
    val descr' = List.concat descr;
berghofe@5177
   101
    val recTs = get_rec_types descr' sorts;
wenzelm@30190
   102
    val used = List.foldr OldTerm.add_typ_tfree_names [] recTs;
skalberg@15570
   103
    val newTs = Library.take (length (hd descr), recTs);
berghofe@5177
   104
wenzelm@8305
   105
    val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)));
berghofe@5177
   106
berghofe@5661
   107
    val big_rec_name' = big_name ^ "_rec_set";
berghofe@21021
   108
    val rec_set_names' =
berghofe@21021
   109
      if length descr' = 1 then [big_rec_name'] else
berghofe@21021
   110
        map ((curry (op ^) (big_rec_name' ^ "_")) o string_of_int)
berghofe@21021
   111
          (1 upto (length descr'));
haftmann@28965
   112
    val rec_set_names = map (Sign.full_bname thy0) rec_set_names';
berghofe@5177
   113
berghofe@15459
   114
    val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used;
berghofe@5177
   115
berghofe@21021
   116
    val rec_set_Ts = map (fn (T1, T2) =>
berghofe@21021
   117
      reccomb_fn_Ts @ [T1, T2] ---> HOLogic.boolT) (recTs ~~ rec_result_Ts);
berghofe@5177
   118
berghofe@5177
   119
    val rec_fns = map (uncurry (mk_Free "f"))
berghofe@5177
   120
      (reccomb_fn_Ts ~~ (1 upto (length reccomb_fn_Ts)));
berghofe@21021
   121
    val rec_sets' = map (fn c => list_comb (Free c, rec_fns))
berghofe@21021
   122
      (rec_set_names' ~~ rec_set_Ts);
berghofe@5177
   123
    val rec_sets = map (fn c => list_comb (Const c, rec_fns))
berghofe@5177
   124
      (rec_set_names ~~ rec_set_Ts);
berghofe@5177
   125
berghofe@5177
   126
    (* introduction rules for graph of primrec function *)
berghofe@5177
   127
berghofe@21021
   128
    fun make_rec_intr T rec_set ((rec_intr_ts, l), (cname, cargs)) =
berghofe@5177
   129
      let
berghofe@7015
   130
        fun mk_prem ((dt, U), (j, k, prems, t1s, t2s)) =
berghofe@7015
   131
          let val free1 = mk_Free "x" U j
berghofe@13641
   132
          in (case (strip_dtyp dt, strip_type U) of
berghofe@13641
   133
             ((_, DtRec m), (Us, _)) =>
berghofe@13641
   134
               let
skalberg@15570
   135
                 val free2 = mk_Free "y" (Us ---> List.nth (rec_result_Ts, m)) k;
berghofe@13641
   136
                 val i = length Us
berghofe@13641
   137
               in (j + 1, k + 1, HOLogic.mk_Trueprop (HOLogic.list_all
berghofe@21021
   138
                     (map (pair "x") Us, List.nth (rec_sets', m) $
berghofe@21021
   139
                       app_bnds free1 i $ app_bnds free2 i)) :: prems,
berghofe@5177
   140
                   free1::t1s, free2::t2s)
berghofe@5177
   141
               end
berghofe@5177
   142
           | _ => (j + 1, k, prems, free1::t1s, t2s))
berghofe@5177
   143
          end;
berghofe@5177
   144
berghofe@5177
   145
        val Ts = map (typ_of_dtyp descr' sorts) cargs;
wenzelm@30190
   146
        val (_, _, prems, t1s, t2s) = List.foldr mk_prem (1, 1, [], [], []) (cargs ~~ Ts)
berghofe@5177
   147
berghofe@21021
   148
      in (rec_intr_ts @ [Logic.list_implies (prems, HOLogic.mk_Trueprop
berghofe@21021
   149
        (rec_set $ list_comb (Const (cname, Ts ---> T), t1s) $
berghofe@21021
   150
          list_comb (List.nth (rec_fns, l), t1s @ t2s)))], l + 1)
berghofe@5177
   151
      end;
berghofe@5177
   152
skalberg@15570
   153
    val (rec_intr_ts, _) = Library.foldl (fn (x, ((d, T), set_name)) =>
skalberg@15570
   154
      Library.foldl (make_rec_intr T set_name) (x, #3 (snd d)))
berghofe@21021
   155
        (([], 0), descr' ~~ recTs ~~ rec_sets');
berghofe@5177
   156
wenzelm@21365
   157
    val ({intrs = rec_intrs, elims = rec_elims, ...}, thy1) =
haftmann@31723
   158
        Inductive.add_inductive_global (serial_string ())
haftmann@31668
   159
          {quiet_mode = #quiet config, verbose = false, kind = Thm.internalK,
haftmann@28965
   160
            alt_name = Binding.name big_rec_name', coind = false, no_elim = false, no_ind = true,
wenzelm@29389
   161
            skip_mono = true, fork_mono = false}
haftmann@28965
   162
          (map (fn (s, T) => ((Binding.name s, T), NoSyn)) (rec_set_names' ~~ rec_set_Ts))
wenzelm@26128
   163
          (map dest_Free rec_fns)
haftmann@28965
   164
          (map (fn x => (Attrib.empty_binding, x)) rec_intr_ts) [] thy0;
berghofe@5177
   165
berghofe@5177
   166
    (* prove uniqueness and termination of primrec combinators *)
berghofe@5177
   167
haftmann@31668
   168
    val _ = message config "Proving termination and uniqueness of primrec functions ...";
berghofe@5177
   169
berghofe@5177
   170
    fun mk_unique_tac ((tac, intrs), ((((i, (tname, _, constrs)), elim), T), T')) =
berghofe@5177
   171
      let
berghofe@21021
   172
        val distinct_tac =
berghofe@5177
   173
          (if i < length newTs then
skalberg@15570
   174
             full_simp_tac (HOL_ss addsimps (List.nth (dist_rewrites, i))) 1
berghofe@7015
   175
           else full_simp_tac dist_ss 1);
berghofe@5177
   176
berghofe@5177
   177
        val inject = map (fn r => r RS iffD1)
skalberg@15570
   178
          (if i < length newTs then List.nth (constr_inject, i)
wenzelm@17412
   179
            else #inject (the (Symtab.lookup dt_info tname)));
berghofe@5177
   180
berghofe@5177
   181
        fun mk_unique_constr_tac n ((tac, intr::intrs, j), (cname, cargs)) =
berghofe@5177
   182
          let
skalberg@15570
   183
            val k = length (List.filter is_rec_type cargs)
berghofe@5177
   184
berghofe@5177
   185
          in (EVERY [DETERM tac,
berghofe@5177
   186
                REPEAT (etac ex1E 1), rtac ex1I 1,
berghofe@5177
   187
                DEPTH_SOLVE_1 (ares_tac [intr] 1),
berghofe@13641
   188
                REPEAT_DETERM_N k (etac thin_rl 1 THEN rotate_tac 1 1),
berghofe@5177
   189
                etac elim 1,
berghofe@5177
   190
                REPEAT_DETERM_N j distinct_tac,
berghofe@21021
   191
                TRY (dresolve_tac inject 1),
berghofe@5177
   192
                REPEAT (etac conjE 1), hyp_subst_tac 1,
berghofe@13641
   193
                REPEAT (EVERY [etac allE 1, dtac mp 1, atac 1]),
berghofe@5177
   194
                TRY (hyp_subst_tac 1),
berghofe@5177
   195
                rtac refl 1,
berghofe@5177
   196
                REPEAT_DETERM_N (n - j - 1) distinct_tac],
berghofe@5177
   197
              intrs, j + 1)
berghofe@5177
   198
          end;
berghofe@5177
   199
skalberg@15570
   200
        val (tac', intrs', _) = Library.foldl (mk_unique_constr_tac (length constrs))
berghofe@5177
   201
          ((tac, intrs, 0), constrs);
berghofe@5177
   202
berghofe@5177
   203
      in (tac', intrs') end;
berghofe@5177
   204
berghofe@5177
   205
    val rec_unique_thms =
berghofe@5177
   206
      let
berghofe@5177
   207
        val rec_unique_ts = map (fn (((set_t, T1), T2), i) =>
berghofe@5177
   208
          Const ("Ex1", (T2 --> HOLogic.boolT) --> HOLogic.boolT) $
berghofe@21021
   209
            absfree ("y", T2, set_t $ mk_Free "x" T1 i $ Free ("y", T2)))
berghofe@21021
   210
              (rec_sets ~~ recTs ~~ rec_result_Ts ~~ (1 upto length recTs));
wenzelm@17985
   211
        val cert = cterm_of thy1
berghofe@5177
   212
        val insts = map (fn ((i, T), t) => absfree ("x" ^ (string_of_int i), T, t))
berghofe@5177
   213
          ((1 upto length recTs) ~~ recTs ~~ rec_unique_ts);
berghofe@5177
   214
        val induct' = cterm_instantiate ((map cert induct_Ps) ~~
berghofe@5177
   215
          (map cert insts)) induct;
skalberg@15570
   216
        val (tac, _) = Library.foldl mk_unique_tac
wenzelm@23590
   217
          (((rtac induct' THEN_ALL_NEW ObjectLogic.atomize_prems_tac) 1
wenzelm@28839
   218
              THEN rewrite_goals_tac [mk_meta_eq choice_eq], rec_intrs),
wenzelm@10911
   219
            descr' ~~ rec_elims ~~ recTs ~~ rec_result_Ts);
berghofe@5177
   220
berghofe@26531
   221
      in split_conj_thm (SkipProof.prove_global thy1 [] []
wenzelm@20046
   222
        (HOLogic.mk_Trueprop (mk_conj rec_unique_ts)) (K tac))
berghofe@5177
   223
      end;
berghofe@5177
   224
wenzelm@11435
   225
    val rec_total_thms = map (fn r => r RS theI') rec_unique_thms;
berghofe@5177
   226
berghofe@5177
   227
    (* define primrec combinators *)
berghofe@5177
   228
berghofe@5177
   229
    val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
haftmann@28965
   230
    val reccomb_names = map (Sign.full_bname thy1)
berghofe@5177
   231
      (if length descr' = 1 then [big_reccomb_name] else
berghofe@5177
   232
        (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
berghofe@5177
   233
          (1 upto (length descr'))));
berghofe@5177
   234
    val reccombs = map (fn ((name, T), T') => list_comb
berghofe@5177
   235
      (Const (name, reccomb_fn_Ts @ [T] ---> T'), rec_fns))
berghofe@5177
   236
        (reccomb_names ~~ recTs ~~ rec_result_Ts);
berghofe@5177
   237
haftmann@18358
   238
    val (reccomb_defs, thy2) =
haftmann@18358
   239
      thy1
wenzelm@24712
   240
      |> Sign.add_consts_i (map (fn ((name, T), T') =>
wenzelm@30364
   241
          (Binding.name (Long_Name.base_name name), reccomb_fn_Ts @ [T] ---> T', NoSyn))
haftmann@18358
   242
          (reccomb_names ~~ recTs ~~ rec_result_Ts))
haftmann@27691
   243
      |> (PureThy.add_defs false o map Thm.no_attributes) (map (fn ((((name, comb), set), T), T') =>
wenzelm@30364
   244
          (Binding.name (Long_Name.base_name name ^ "_def"), Logic.mk_equals (comb, absfree ("x", T,
wenzelm@11435
   245
           Const ("The", (T' --> HOLogic.boolT) --> T') $ absfree ("y", T',
berghofe@21021
   246
             set $ Free ("x", T) $ Free ("y", T'))))))
haftmann@18358
   247
               (reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts))
haftmann@31668
   248
      ||> parent_path (#flat_names config) 
wenzelm@28361
   249
      ||> Theory.checkpoint;
berghofe@5177
   250
berghofe@5177
   251
berghofe@5177
   252
    (* prove characteristic equations for primrec combinators *)
berghofe@5177
   253
haftmann@31668
   254
    val _ = message config "Proving characteristic theorems for primrec combinators ..."
berghofe@5177
   255
berghofe@26531
   256
    val rec_thms = map (fn t => SkipProof.prove_global thy2 [] [] t
wenzelm@17985
   257
      (fn _ => EVERY
wenzelm@17985
   258
        [rewrite_goals_tac reccomb_defs,
wenzelm@17985
   259
         rtac the1_equality 1,
berghofe@5177
   260
         resolve_tac rec_unique_thms 1,
berghofe@5177
   261
         resolve_tac rec_intrs 1,
wenzelm@20046
   262
         REPEAT (rtac allI 1 ORELSE resolve_tac rec_total_thms 1)]))
berghofe@5177
   263
           (DatatypeProp.make_primrecs new_type_names descr sorts thy2)
berghofe@5177
   264
berghofe@5177
   265
  in
haftmann@18314
   266
    thy2
wenzelm@24712
   267
    |> Sign.add_path (space_implode "_" new_type_names)
blanchet@29927
   268
    |> PureThy.add_thmss [((Binding.name "recs", rec_thms),
blanchet@29927
   269
         [Nitpick_Const_Simp_Thms.add])]
wenzelm@24712
   270
    ||> Sign.parent_path
wenzelm@28361
   271
    ||> Theory.checkpoint
haftmann@18314
   272
    |-> (fn thms => pair (reccomb_names, Library.flat thms))
berghofe@5177
   273
  end;
berghofe@5177
   274
berghofe@8477
   275
berghofe@5177
   276
(***************************** case combinators *******************************)
berghofe@5177
   277
haftmann@31668
   278
fun prove_case_thms (config : datatype_config) new_type_names descr sorts reccomb_names primrec_thms thy =
berghofe@5177
   279
  let
haftmann@31668
   280
    val _ = message config "Proving characteristic theorems for case combinators ...";
berghofe@5661
   281
haftmann@31668
   282
    val thy1 = add_path (#flat_names config) (space_implode "_" new_type_names) thy;
berghofe@5177
   283
skalberg@15570
   284
    val descr' = List.concat descr;
berghofe@5177
   285
    val recTs = get_rec_types descr' sorts;
wenzelm@30190
   286
    val used = List.foldr OldTerm.add_typ_tfree_names [] recTs;
skalberg@15570
   287
    val newTs = Library.take (length (hd descr), recTs);
wenzelm@20071
   288
    val T' = TFree (Name.variant used "'t", HOLogic.typeS);
berghofe@5177
   289
berghofe@13641
   290
    fun mk_dummyT dt = binder_types (typ_of_dtyp descr' sorts dt) ---> T';
berghofe@7015
   291
berghofe@5177
   292
    val case_dummy_fns = map (fn (_, (_, _, constrs)) => map (fn (_, cargs) =>
berghofe@5177
   293
      let
berghofe@5177
   294
        val Ts = map (typ_of_dtyp descr' sorts) cargs;
skalberg@15570
   295
        val Ts' = map mk_dummyT (List.filter is_rec_type cargs)
haftmann@28524
   296
      in Const (@{const_name undefined}, Ts @ Ts' ---> T')
berghofe@5177
   297
      end) constrs) descr';
berghofe@5177
   298
haftmann@28965
   299
    val case_names = map (fn s => Sign.full_bname thy1 (s ^ "_case")) new_type_names;
berghofe@5177
   300
berghofe@5177
   301
    (* define case combinators via primrec combinators *)
berghofe@5177
   302
skalberg@15570
   303
    val (case_defs, thy2) = Library.foldl (fn ((defs, thy),
berghofe@5177
   304
      ((((i, (_, _, constrs)), T), name), recname)) =>
berghofe@5177
   305
        let
berghofe@5177
   306
          val (fns1, fns2) = ListPair.unzip (map (fn ((_, cargs), j) =>
berghofe@5177
   307
            let
berghofe@5177
   308
              val Ts = map (typ_of_dtyp descr' sorts) cargs;
skalberg@15570
   309
              val Ts' = Ts @ map mk_dummyT (List.filter is_rec_type cargs);
berghofe@5177
   310
              val frees' = map (uncurry (mk_Free "x")) (Ts' ~~ (1 upto length Ts'));
skalberg@15570
   311
              val frees = Library.take (length cargs, frees');
berghofe@5177
   312
              val free = mk_Free "f" (Ts ---> T') j
berghofe@5177
   313
            in
berghofe@5177
   314
             (free, list_abs_free (map dest_Free frees',
berghofe@5177
   315
               list_comb (free, frees)))
berghofe@5177
   316
            end) (constrs ~~ (1 upto length constrs)));
berghofe@5177
   317
berghofe@5177
   318
          val caseT = (map (snd o dest_Free) fns1) @ [T] ---> T';
skalberg@15570
   319
          val fns = (List.concat (Library.take (i, case_dummy_fns))) @
skalberg@15570
   320
            fns2 @ (List.concat (Library.drop (i + 1, case_dummy_fns)));
berghofe@5177
   321
          val reccomb = Const (recname, (map fastype_of fns) @ [T] ---> T');
wenzelm@30364
   322
          val decl = ((Binding.name (Long_Name.base_name name), caseT), NoSyn);
wenzelm@30364
   323
          val def = (Binding.name (Long_Name.base_name name ^ "_def"),
berghofe@5177
   324
            Logic.mk_equals (list_comb (Const (name, caseT), fns1),
skalberg@15570
   325
              list_comb (reccomb, (List.concat (Library.take (i, case_dummy_fns))) @
skalberg@15570
   326
                fns2 @ (List.concat (Library.drop (i + 1, case_dummy_fns))) )));
haftmann@18358
   327
          val ([def_thm], thy') =
haftmann@18358
   328
            thy
wenzelm@24959
   329
            |> Sign.declare_const [] decl |> snd
haftmann@27691
   330
            |> (PureThy.add_defs false o map Thm.no_attributes) [def];
berghofe@5177
   331
wenzelm@8436
   332
        in (defs @ [def_thm], thy')
berghofe@5661
   333
        end) (([], thy1), (hd descr) ~~ newTs ~~ case_names ~~
wenzelm@28361
   334
          (Library.take (length newTs, reccomb_names)))
wenzelm@28361
   335
      ||> Theory.checkpoint;
berghofe@5177
   336
berghofe@26531
   337
    val case_thms = map (map (fn t => SkipProof.prove_global thy2 [] [] t
wenzelm@20046
   338
      (fn _ => EVERY [rewrite_goals_tac (case_defs @ map mk_meta_eq primrec_thms), rtac refl 1])))
berghofe@8477
   339
          (DatatypeProp.make_cases new_type_names descr sorts thy2)
berghofe@8477
   340
  in
haftmann@18314
   341
    thy2
blanchet@29866
   342
    |> Context.the_theory o fold (fold Nitpick_Const_Simp_Thms.add_thm) case_thms
blanchet@29866
   343
       o Context.Theory
haftmann@31668
   344
    |> parent_path (#flat_names config)
haftmann@18314
   345
    |> store_thmss "cases" new_type_names case_thms
haftmann@18314
   346
    |-> (fn thmss => pair (thmss, case_names))
berghofe@8477
   347
  end;
berghofe@5177
   348
berghofe@5177
   349
berghofe@5177
   350
(******************************* case splitting *******************************)
berghofe@5177
   351
haftmann@31668
   352
fun prove_split_thms (config : datatype_config) new_type_names descr sorts constr_inject dist_rewrites
berghofe@5177
   353
    casedist_thms case_thms thy =
berghofe@5177
   354
  let
haftmann@31668
   355
    val _ = message config "Proving equations for case splitting ...";
berghofe@5177
   356
haftmann@31668
   357
    val descr' = flat descr;
berghofe@5177
   358
    val recTs = get_rec_types descr' sorts;
skalberg@15570
   359
    val newTs = Library.take (length (hd descr), recTs);
berghofe@5177
   360
berghofe@5177
   361
    fun prove_split_thms ((((((t1, t2), inject), dist_rewrites'),
berghofe@5177
   362
        exhaustion), case_thms'), T) =
berghofe@5177
   363
      let
wenzelm@17985
   364
        val cert = cterm_of thy;
berghofe@5177
   365
        val _ $ (_ $ lhs $ _) = hd (Logic.strip_assums_hyp (hd (prems_of exhaustion)));
berghofe@5177
   366
        val exhaustion' = cterm_instantiate
berghofe@5177
   367
          [(cert lhs, cert (Free ("x", T)))] exhaustion;
wenzelm@17985
   368
        val tacf = K (EVERY [rtac exhaustion' 1, ALLGOALS (asm_simp_tac
wenzelm@17985
   369
          (HOL_ss addsimps (dist_rewrites' @ inject @ case_thms')))])
berghofe@5177
   370
      in
berghofe@26531
   371
        (SkipProof.prove_global thy [] [] t1 tacf,
berghofe@26531
   372
         SkipProof.prove_global thy [] [] t2 tacf)
berghofe@5177
   373
      end;
berghofe@5177
   374
berghofe@5177
   375
    val split_thm_pairs = map prove_split_thms
berghofe@5177
   376
      ((DatatypeProp.make_splits new_type_names descr sorts thy) ~~ constr_inject ~~
berghofe@5177
   377
        dist_rewrites ~~ casedist_thms ~~ case_thms ~~ newTs);
berghofe@5177
   378
berghofe@5177
   379
    val (split_thms, split_asm_thms) = ListPair.unzip split_thm_pairs
berghofe@5177
   380
berghofe@5177
   381
  in
haftmann@18314
   382
    thy
haftmann@18314
   383
    |> store_thms "split" new_type_names split_thms
haftmann@18314
   384
    ||>> store_thms "split_asm" new_type_names split_asm_thms
haftmann@18314
   385
    |-> (fn (thms1, thms2) => pair (thms1 ~~ thms2))
berghofe@5177
   386
  end;
berghofe@5177
   387
nipkow@8601
   388
fun prove_weak_case_congs new_type_names descr sorts thy =
nipkow@8601
   389
  let
nipkow@8601
   390
    fun prove_weak_case_cong t =
berghofe@26531
   391
       SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
wenzelm@26711
   392
         (fn {prems, ...} => EVERY [rtac ((hd prems) RS arg_cong) 1])
nipkow@8601
   393
nipkow@8601
   394
    val weak_case_congs = map prove_weak_case_cong (DatatypeProp.make_weak_case_congs
nipkow@8601
   395
      new_type_names descr sorts thy)
nipkow@8601
   396
nipkow@8601
   397
  in thy |> store_thms "weak_case_cong" new_type_names weak_case_congs end;
berghofe@8477
   398
berghofe@5177
   399
(************************* additional theorems for TFL ************************)
berghofe@5177
   400
haftmann@31668
   401
fun prove_nchotomys (config : datatype_config) new_type_names descr sorts casedist_thms thy =
berghofe@5177
   402
  let
haftmann@31668
   403
    val _ = message config "Proving additional theorems for TFL ...";
berghofe@5177
   404
berghofe@5177
   405
    fun prove_nchotomy (t, exhaustion) =
berghofe@5177
   406
      let
berghofe@5177
   407
        (* For goal i, select the correct disjunct to attack, then prove it *)
berghofe@5177
   408
        fun tac i 0 = EVERY [TRY (rtac disjI1 i),
berghofe@5177
   409
              hyp_subst_tac i, REPEAT (rtac exI i), rtac refl i]
berghofe@5177
   410
          | tac i n = rtac disjI2 i THEN tac i (n - 1)
berghofe@5177
   411
      in 
berghofe@26531
   412
        SkipProof.prove_global thy [] [] t (fn _ =>
wenzelm@17985
   413
          EVERY [rtac allI 1,
berghofe@5177
   414
           exh_tac (K exhaustion) 1,
wenzelm@20046
   415
           ALLGOALS (fn i => tac i (i-1))])
berghofe@5177
   416
      end;
berghofe@5177
   417
berghofe@5177
   418
    val nchotomys =
berghofe@5177
   419
      map prove_nchotomy (DatatypeProp.make_nchotomys descr sorts ~~ casedist_thms)
berghofe@5177
   420
wenzelm@8436
   421
  in thy |> store_thms "nchotomy" new_type_names nchotomys end;
berghofe@5177
   422
berghofe@5177
   423
fun prove_case_congs new_type_names descr sorts nchotomys case_thms thy =
berghofe@5177
   424
  let
berghofe@5177
   425
    fun prove_case_cong ((t, nchotomy), case_rewrites) =
berghofe@5177
   426
      let
berghofe@5177
   427
        val (Const ("==>", _) $ tm $ _) = t;
berghofe@5177
   428
        val (Const ("Trueprop", _) $ (Const ("op =", _) $ _ $ Ma)) = tm;
wenzelm@22578
   429
        val cert = cterm_of thy;
berghofe@5177
   430
        val nchotomy' = nchotomy RS spec;
wenzelm@29264
   431
        val [v] = Term.add_vars (concl_of nchotomy') [];
wenzelm@29264
   432
        val nchotomy'' = cterm_instantiate [(cert (Var v), cert Ma)] nchotomy'
berghofe@5177
   433
      in
berghofe@26531
   434
        SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
wenzelm@26711
   435
          (fn {prems, ...} => 
wenzelm@17985
   436
            let val simplify = asm_simp_tac (HOL_ss addsimps (prems @ case_rewrites))
wenzelm@17985
   437
            in EVERY [simp_tac (HOL_ss addsimps [hd prems]) 1,
wenzelm@17985
   438
                cut_facts_tac [nchotomy''] 1,
wenzelm@17985
   439
                REPEAT (etac disjE 1 THEN REPEAT (etac exE 1) THEN simplify 1),
wenzelm@17985
   440
                REPEAT (etac exE 1) THEN simplify 1 (* Get last disjunct *)]
wenzelm@20046
   441
            end)
berghofe@5177
   442
      end;
berghofe@5177
   443
berghofe@5177
   444
    val case_congs = map prove_case_cong (DatatypeProp.make_case_congs
berghofe@5177
   445
      new_type_names descr sorts thy ~~ nchotomys ~~ case_thms)
berghofe@5177
   446
wenzelm@8436
   447
  in thy |> store_thms "case_cong" new_type_names case_congs end;
berghofe@5177
   448
berghofe@5177
   449
end;