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