src/HOL/Nominal/nominal_datatype.ML
author wenzelm
Wed Oct 28 16:25:27 2009 +0100 (2009-10-28)
changeset 33278 ba9f52f56356
parent 33244 db230399f890
child 33317 b4534348b8fd
permissions -rw-r--r--
conceal internal bindings;
haftmann@31936
     1
(*  Title:      HOL/Nominal/nominal_datatype.ML
berghofe@19494
     2
    Author:     Stefan Berghofer and Christian Urban, TU Muenchen
berghofe@19494
     3
berghofe@19494
     4
Nominal datatype package for Isabelle/HOL.
berghofe@19494
     5
*)
berghofe@17870
     6
haftmann@31936
     7
signature NOMINAL_DATATYPE =
berghofe@17870
     8
sig
haftmann@31737
     9
  val add_nominal_datatype : Datatype.config -> string list ->
haftmann@31671
    10
    (string list * bstring * mixfix *
haftmann@31671
    11
      (bstring * string list * mixfix) list) list -> theory -> theory
berghofe@22433
    12
  type descr
berghofe@21540
    13
  type nominal_datatype_info
berghofe@21540
    14
  val get_nominal_datatypes : theory -> nominal_datatype_info Symtab.table
berghofe@21540
    15
  val get_nominal_datatype : theory -> string -> nominal_datatype_info option
berghofe@22311
    16
  val mk_perm: typ list -> term -> term -> term
berghofe@22529
    17
  val perm_of_pair: term * term -> term
berghofe@22529
    18
  val mk_not_sym: thm list -> thm list
berghofe@22529
    19
  val perm_simproc: simproc
berghofe@25823
    20
  val fresh_const: typ -> typ -> term
berghofe@28373
    21
  val fresh_star_const: typ -> typ -> term
berghofe@17870
    22
end
berghofe@17870
    23
haftmann@31936
    24
structure NominalDatatype : NOMINAL_DATATYPE =
berghofe@17870
    25
struct
berghofe@17870
    26
berghofe@22274
    27
val finite_emptyI = thm "finite.emptyI";
wenzelm@21669
    28
val finite_Diff = thm "finite_Diff";
wenzelm@21669
    29
val finite_Un = thm "finite_Un";
wenzelm@21669
    30
val Un_iff = thm "Un_iff";
wenzelm@21669
    31
val In0_eq = thm "In0_eq";
wenzelm@21669
    32
val In1_eq = thm "In1_eq";
wenzelm@21669
    33
val In0_not_In1 = thm "In0_not_In1";
wenzelm@21669
    34
val In1_not_In0 = thm "In1_not_In0";
wenzelm@21669
    35
val Un_assoc = thm "Un_assoc";
wenzelm@21669
    36
val Collect_disj_eq = thm "Collect_disj_eq";
haftmann@32129
    37
val Collect_False_empty = @{thm empty_def [THEN sym, THEN eq_reflection]};
berghofe@24459
    38
val empty_iff = thm "empty_iff";
wenzelm@21669
    39
berghofe@17870
    40
open DatatypeAux;
berghofe@18068
    41
open NominalAtoms;
berghofe@17870
    42
haftmann@31723
    43
(** FIXME: Datatype should export this function **)
berghofe@18016
    44
berghofe@18016
    45
local
berghofe@18016
    46
berghofe@18016
    47
fun dt_recs (DtTFree _) = []
wenzelm@32952
    48
  | dt_recs (DtType (_, dts)) = maps dt_recs dts
berghofe@18016
    49
  | dt_recs (DtRec i) = [i];
berghofe@18016
    50
berghofe@18016
    51
fun dt_cases (descr: descr) (_, args, constrs) =
berghofe@18016
    52
  let
wenzelm@33035
    53
    fun the_bname i = Long_Name.base_name (#1 (the (AList.lookup (op =) descr i)));
wenzelm@32952
    54
    val bnames = map the_bname (distinct op = (maps dt_recs args));
wenzelm@30364
    55
  in map (fn (c, _) => space_implode "_" (Long_Name.base_name c :: bnames)) constrs end;
berghofe@18016
    56
berghofe@18016
    57
berghofe@18016
    58
fun induct_cases descr =
wenzelm@32952
    59
  DatatypeProp.indexify_names (maps (dt_cases descr) (map #2 descr));
berghofe@18016
    60
wenzelm@33035
    61
fun exhaust_cases descr i = dt_cases descr (the (AList.lookup (op =) descr i));
berghofe@18016
    62
berghofe@18016
    63
in
berghofe@18016
    64
berghofe@18016
    65
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr);
berghofe@18016
    66
berghofe@18016
    67
fun mk_case_names_exhausts descr new =
berghofe@18016
    68
  map (RuleCases.case_names o exhaust_cases descr o #1)
berghofe@18016
    69
    (List.filter (fn ((_, (name, _, _))) => name mem_string new) descr);
berghofe@18016
    70
berghofe@18016
    71
end;
berghofe@18016
    72
wenzelm@22846
    73
(* theory data *)
berghofe@21540
    74
berghofe@22433
    75
type descr = (int * (string * dtyp list * (string * (dtyp list * dtyp) list) list)) list;
berghofe@22433
    76
berghofe@21540
    77
type nominal_datatype_info =
berghofe@21540
    78
  {index : int,
berghofe@21540
    79
   descr : descr,
berghofe@21540
    80
   sorts : (string * sort) list,
berghofe@21540
    81
   rec_names : string list,
berghofe@21540
    82
   rec_rewrites : thm list,
berghofe@21540
    83
   induction : thm,
berghofe@21540
    84
   distinct : thm list,
berghofe@21540
    85
   inject : thm list};
berghofe@21540
    86
berghofe@21540
    87
structure NominalDatatypesData = TheoryDataFun
wenzelm@22846
    88
(
berghofe@21540
    89
  type T = nominal_datatype_info Symtab.table;
berghofe@21540
    90
  val empty = Symtab.empty;
berghofe@21540
    91
  val copy = I;
berghofe@21540
    92
  val extend = I;
berghofe@21540
    93
  fun merge _ tabs : T = Symtab.merge (K true) tabs;
wenzelm@22846
    94
);
berghofe@21540
    95
berghofe@21540
    96
val get_nominal_datatypes = NominalDatatypesData.get;
berghofe@21540
    97
val put_nominal_datatypes = NominalDatatypesData.put;
berghofe@21540
    98
val map_nominal_datatypes = NominalDatatypesData.map;
berghofe@21540
    99
val get_nominal_datatype = Symtab.lookup o get_nominal_datatypes;
wenzelm@22846
   100
berghofe@21540
   101
berghofe@21540
   102
(**** make datatype info ****)
berghofe@21540
   103
berghofe@21540
   104
fun make_dt_info descr sorts induct reccomb_names rec_thms
haftmann@33063
   105
    (i, (((_, (tname, _, _)), distinct), inject)) =
berghofe@21540
   106
  (tname,
berghofe@21540
   107
   {index = i,
berghofe@21540
   108
    descr = descr,
berghofe@21540
   109
    sorts = sorts,
berghofe@21540
   110
    rec_names = reccomb_names,
berghofe@21540
   111
    rec_rewrites = rec_thms,
berghofe@21540
   112
    induction = induct,
berghofe@21540
   113
    distinct = distinct,
berghofe@21540
   114
    inject = inject});
berghofe@21540
   115
berghofe@18016
   116
(*******************************)
berghofe@18016
   117
berghofe@17870
   118
val (_ $ (_ $ (_ $ (distinct_f $ _) $ _))) = hd (prems_of distinct_lemma);
berghofe@17870
   119
berghofe@17870
   120
berghofe@18658
   121
(** simplification procedure for sorting permutations **)
berghofe@18658
   122
berghofe@18658
   123
val dj_cp = thm "dj_cp";
berghofe@18658
   124
berghofe@18658
   125
fun dest_permT (Type ("fun", [Type ("List.list", [Type ("*", [T, _])]),
berghofe@18658
   126
      Type ("fun", [_, U])])) = (T, U);
berghofe@18658
   127
berghofe@19494
   128
fun permTs_of (Const ("Nominal.perm", T) $ t $ u) = fst (dest_permT T) :: permTs_of u
berghofe@18658
   129
  | permTs_of _ = [];
berghofe@18658
   130
berghofe@19494
   131
fun perm_simproc' thy ss (Const ("Nominal.perm", T) $ t $ (u as Const ("Nominal.perm", U) $ r $ s)) =
berghofe@18658
   132
      let
berghofe@18658
   133
        val (aT as Type (a, []), S) = dest_permT T;
berghofe@18658
   134
        val (bT as Type (b, []), _) = dest_permT U
berghofe@18658
   135
      in if aT mem permTs_of u andalso aT <> bT then
berghofe@18658
   136
          let
berghofe@28731
   137
            val cp = cp_inst_of thy a b;
berghofe@28731
   138
            val dj = dj_thm_of thy b a;
berghofe@18658
   139
            val dj_cp' = [cp, dj] MRS dj_cp;
berghofe@18658
   140
            val cert = SOME o cterm_of thy
berghofe@18658
   141
          in
berghofe@18658
   142
            SOME (mk_meta_eq (Drule.instantiate' [SOME (ctyp_of thy S)]
berghofe@18658
   143
              [cert t, cert r, cert s] dj_cp'))
berghofe@18658
   144
          end
berghofe@18658
   145
        else NONE
berghofe@18658
   146
      end
berghofe@18658
   147
  | perm_simproc' thy ss _ = NONE;
berghofe@18658
   148
berghofe@18658
   149
val perm_simproc =
wenzelm@32010
   150
  Simplifier.simproc @{theory} "perm_simp" ["pi1 \<bullet> (pi2 \<bullet> x)"] perm_simproc';
berghofe@18658
   151
berghofe@18658
   152
val meta_spec = thm "meta_spec";
berghofe@18658
   153
wenzelm@18582
   154
fun projections rule =
wenzelm@32172
   155
  Project_Rule.projections (ProofContext.init (Thm.theory_of_thm rule)) rule
wenzelm@32957
   156
  |> map (Drule.standard #> RuleCases.save rule);
wenzelm@18582
   157
berghofe@20267
   158
val supp_prod = thm "supp_prod";
berghofe@20376
   159
val fresh_prod = thm "fresh_prod";
berghofe@20376
   160
val supports_fresh = thm "supports_fresh";
wenzelm@22812
   161
val supports_def = thm "Nominal.supports_def";
berghofe@20376
   162
val fresh_def = thm "fresh_def";
berghofe@20376
   163
val supp_def = thm "supp_def";
berghofe@20376
   164
val rev_simps = thms "rev.simps";
haftmann@23029
   165
val app_simps = thms "append.simps";
berghofe@25951
   166
val at_fin_set_supp = thm "at_fin_set_supp";
berghofe@25951
   167
val at_fin_set_fresh = thm "at_fin_set_fresh";
berghofe@25951
   168
val abs_fun_eq1 = thm "abs_fun_eq1";
berghofe@20267
   169
berghofe@21021
   170
val collect_simp = rewrite_rule [mk_meta_eq mem_Collect_eq];
berghofe@21021
   171
berghofe@22311
   172
fun mk_perm Ts t u =
berghofe@22311
   173
  let
berghofe@22311
   174
    val T = fastype_of1 (Ts, t);
berghofe@22311
   175
    val U = fastype_of1 (Ts, u)
berghofe@22311
   176
  in Const ("Nominal.perm", T --> U --> U) $ t $ u end;
berghofe@22311
   177
berghofe@22529
   178
fun perm_of_pair (x, y) =
berghofe@22529
   179
  let
berghofe@22529
   180
    val T = fastype_of x;
berghofe@22529
   181
    val pT = mk_permT T
berghofe@22529
   182
  in Const ("List.list.Cons", HOLogic.mk_prodT (T, T) --> pT --> pT) $
berghofe@22529
   183
    HOLogic.mk_prod (x, y) $ Const ("List.list.Nil", pT)
berghofe@22529
   184
  end;
berghofe@22529
   185
berghofe@22529
   186
fun mk_not_sym ths = maps (fn th => case prop_of th of
berghofe@25951
   187
    _ $ (Const ("Not", _) $ (Const ("op =", _) $ _ $ _)) => [th, th RS not_sym]
berghofe@22529
   188
  | _ => [th]) ths;
berghofe@22529
   189
berghofe@25823
   190
fun fresh_const T U = Const ("Nominal.fresh", T --> U --> HOLogic.boolT);
berghofe@28373
   191
fun fresh_star_const T U =
berghofe@28373
   192
  Const ("Nominal.fresh_star", HOLogic.mk_setT T --> U --> HOLogic.boolT);
berghofe@25823
   193
haftmann@31671
   194
fun gen_add_nominal_datatype prep_typ config new_type_names dts thy =
berghofe@17870
   195
  let
berghofe@17870
   196
    (* this theory is used just for parsing *)
wenzelm@21365
   197
berghofe@17870
   198
    val tmp_thy = thy |>
berghofe@17870
   199
      Theory.copy |>
wenzelm@24712
   200
      Sign.add_types (map (fn (tvs, tname, mx, _) =>
wenzelm@30345
   201
        (Binding.name tname, length tvs, mx)) dts);
berghofe@17870
   202
berghofe@17870
   203
    val atoms = atoms_of thy;
berghofe@17870
   204
wenzelm@33244
   205
    fun prep_constr (cname, cargs, mx) (constrs, sorts) =
wenzelm@33244
   206
      let val (cargs', sorts') = fold_map (prep_typ tmp_thy) cargs sorts
berghofe@17870
   207
      in (constrs @ [(cname, cargs', mx)], sorts') end
berghofe@17870
   208
wenzelm@33244
   209
    fun prep_dt_spec (tvs, tname, mx, constrs) (dts, sorts) =
wenzelm@33244
   210
      let val (constrs', sorts') = fold prep_constr constrs ([], sorts)
berghofe@17870
   211
      in (dts @ [(tvs, tname, mx, constrs')], sorts') end
berghofe@17870
   212
wenzelm@33244
   213
    val (dts', sorts) = fold prep_dt_spec dts ([], []);
berghofe@28736
   214
    val tyvars = map (map (fn s =>
berghofe@28736
   215
      (s, the (AList.lookup (op =) sorts s))) o #1) dts';
berghofe@17870
   216
berghofe@28731
   217
    fun inter_sort thy S S' = Type.inter_sort (Sign.tsig_of thy) (S, S');
berghofe@28731
   218
    fun augment_sort_typ thy S =
berghofe@28731
   219
      let val S = Sign.certify_sort thy S
berghofe@28731
   220
      in map_type_tfree (fn (s, S') => TFree (s,
berghofe@28731
   221
        if member (op = o apsnd fst) sorts s then inter_sort thy S S' else S'))
berghofe@28731
   222
      end;
berghofe@28731
   223
    fun augment_sort thy S = map_types (augment_sort_typ thy S);
berghofe@28731
   224
berghofe@17870
   225
    val types_syntax = map (fn (tvs, tname, mx, constrs) => (tname, mx)) dts';
berghofe@17870
   226
    val constr_syntax = map (fn (tvs, tname, mx, constrs) =>
berghofe@17870
   227
      map (fn (cname, cargs, mx) => (cname, mx)) constrs) dts';
berghofe@17870
   228
berghofe@17870
   229
    val ps = map (fn (_, n, _, _) =>
haftmann@28965
   230
      (Sign.full_bname tmp_thy n, Sign.full_bname tmp_thy (n ^ "_Rep"))) dts;
berghofe@17870
   231
    val rps = map Library.swap ps;
berghofe@17870
   232
wenzelm@21365
   233
    fun replace_types (Type ("Nominal.ABS", [T, U])) =
berghofe@19494
   234
          Type ("fun", [T, Type ("Nominal.noption", [replace_types U])])
berghofe@17870
   235
      | replace_types (Type (s, Ts)) =
wenzelm@33035
   236
          Type (the_default s (AList.lookup op = ps s), map replace_types Ts)
berghofe@17870
   237
      | replace_types T = T;
berghofe@17870
   238
wenzelm@30345
   239
    val dts'' = map (fn (tvs, tname, mx, constrs) => (tvs, Binding.name (tname ^ "_Rep"), NoSyn,
wenzelm@30345
   240
      map (fn (cname, cargs, mx) => (Binding.name (cname ^ "_Rep"),
berghofe@28731
   241
        map replace_types cargs, NoSyn)) constrs)) dts';
berghofe@17870
   242
berghofe@17870
   243
    val new_type_names' = map (fn n => n ^ "_Rep") new_type_names;
berghofe@17870
   244
haftmann@31783
   245
    val (full_new_type_names',thy1) =
haftmann@31723
   246
      Datatype.add_datatype config new_type_names' dts'' thy;
berghofe@17870
   247
haftmann@32727
   248
    val {descr, induct, ...} =
haftmann@31784
   249
      Datatype.the_info thy1 (hd full_new_type_names');
berghofe@28731
   250
    fun nth_dtyp i = typ_of_dtyp descr sorts (DtRec i);
berghofe@18107
   251
wenzelm@26651
   252
    val big_name = space_implode "_" new_type_names;
wenzelm@26651
   253
wenzelm@26651
   254
berghofe@17870
   255
    (**** define permutation functions ****)
berghofe@17870
   256
berghofe@17870
   257
    val permT = mk_permT (TFree ("'x", HOLogic.typeS));
berghofe@17870
   258
    val pi = Free ("pi", permT);
berghofe@17870
   259
    val perm_types = map (fn (i, _) =>
berghofe@17870
   260
      let val T = nth_dtyp i
berghofe@17870
   261
      in permT --> T --> T end) descr;
berghofe@26680
   262
    val perm_names' = DatatypeProp.indexify_names (map (fn (i, _) =>
berghofe@26680
   263
      "perm_" ^ name_of_typ (nth_dtyp i)) descr);
berghofe@19494
   264
    val perm_names = replicate (length new_type_names) "Nominal.perm" @
haftmann@28965
   265
      map (Sign.full_bname thy1) (List.drop (perm_names', length new_type_names));
berghofe@17870
   266
    val perm_names_types = perm_names ~~ perm_types;
berghofe@26680
   267
    val perm_names_types' = perm_names' ~~ perm_types;
berghofe@17870
   268
berghofe@26680
   269
    val perm_eqs = maps (fn (i, (_, _, constrs)) =>
berghofe@17870
   270
      let val T = nth_dtyp i
wenzelm@21365
   271
      in map (fn (cname, dts) =>
berghofe@17870
   272
        let
berghofe@28731
   273
          val Ts = map (typ_of_dtyp descr sorts) dts;
berghofe@28641
   274
          val names = Name.variant_list ["pi"] (DatatypeProp.make_tnames Ts);
berghofe@17870
   275
          val args = map Free (names ~~ Ts);
berghofe@17870
   276
          val c = Const (cname, Ts ---> T);
berghofe@17870
   277
          fun perm_arg (dt, x) =
berghofe@17870
   278
            let val T = type_of x
berghofe@17870
   279
            in if is_rec_type dt then
berghofe@17870
   280
                let val (Us, _) = strip_type T
berghofe@17870
   281
                in list_abs (map (pair "x") Us,
berghofe@26680
   282
                  Free (nth perm_names_types' (body_index dt)) $ pi $
berghofe@17870
   283
                    list_comb (x, map (fn (i, U) =>
berghofe@19494
   284
                      Const ("Nominal.perm", permT --> U --> U) $
berghofe@17870
   285
                        (Const ("List.rev", permT --> permT) $ pi) $
berghofe@17870
   286
                        Bound i) ((length Us - 1 downto 0) ~~ Us)))
berghofe@17870
   287
                end
berghofe@19494
   288
              else Const ("Nominal.perm", permT --> T --> T) $ pi $ x
wenzelm@21365
   289
            end;
berghofe@17870
   290
        in
haftmann@28965
   291
          (Attrib.empty_binding, HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@26680
   292
            (Free (nth perm_names_types' i) $
berghofe@17870
   293
               Free ("pi", mk_permT (TFree ("'x", HOLogic.typeS))) $
berghofe@17870
   294
               list_comb (c, args),
berghofe@26680
   295
             list_comb (c, map perm_arg (dts ~~ args)))))
berghofe@17870
   296
        end) constrs
berghofe@26680
   297
      end) descr;
berghofe@17870
   298
berghofe@26689
   299
    val (perm_simps, thy2) =
haftmann@31723
   300
      Primrec.add_primrec_overloaded
berghofe@26689
   301
        (map (fn (s, sT) => (s, sT, false))
berghofe@26689
   302
           (List.take (perm_names' ~~ perm_names_types, length new_type_names)))
haftmann@28965
   303
        (map (fn s => (Binding.name s, NONE, NoSyn)) perm_names') perm_eqs thy1;
berghofe@17870
   304
berghofe@17870
   305
    (**** prove that permutation functions introduced by unfolding are ****)
berghofe@17870
   306
    (**** equivalent to already existing permutation functions         ****)
berghofe@17870
   307
berghofe@17870
   308
    val _ = warning ("length descr: " ^ string_of_int (length descr));
berghofe@17870
   309
    val _ = warning ("length new_type_names: " ^ string_of_int (length new_type_names));
berghofe@17870
   310
berghofe@17870
   311
    val perm_indnames = DatatypeProp.make_tnames (map body_type perm_types);
wenzelm@26343
   312
    val perm_fun_def = PureThy.get_thm thy2 "perm_fun_def";
berghofe@17870
   313
berghofe@17870
   314
    val unfolded_perm_eq_thms =
berghofe@17870
   315
      if length descr = length new_type_names then []
wenzelm@32957
   316
      else map Drule.standard (List.drop (split_conj_thm
wenzelm@20046
   317
        (Goal.prove_global thy2 [] []
berghofe@17870
   318
          (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   319
            (map (fn (c as (s, T), x) =>
berghofe@17870
   320
               let val [T1, T2] = binder_types T
berghofe@17870
   321
               in HOLogic.mk_eq (Const c $ pi $ Free (x, T2),
berghofe@19494
   322
                 Const ("Nominal.perm", T) $ pi $ Free (x, T2))
berghofe@17870
   323
               end)
berghofe@18010
   324
             (perm_names_types ~~ perm_indnames))))
haftmann@32715
   325
          (fn _ => EVERY [indtac induct perm_indnames 1,
berghofe@17870
   326
            ALLGOALS (asm_full_simp_tac
wenzelm@32149
   327
              (global_simpset_of thy2 addsimps [perm_fun_def]))])),
berghofe@17870
   328
        length new_type_names));
berghofe@17870
   329
berghofe@17870
   330
    (**** prove [] \<bullet> t = t ****)
berghofe@17870
   331
berghofe@17870
   332
    val _ = warning "perm_empty_thms";
berghofe@17870
   333
wenzelm@32952
   334
    val perm_empty_thms = maps (fn a =>
berghofe@17870
   335
      let val permT = mk_permT (Type (a, []))
wenzelm@32957
   336
      in map Drule.standard (List.take (split_conj_thm
wenzelm@20046
   337
        (Goal.prove_global thy2 [] []
berghofe@28731
   338
          (augment_sort thy2 [pt_class_of thy2 a]
berghofe@28731
   339
            (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@28731
   340
              (map (fn ((s, T), x) => HOLogic.mk_eq
berghofe@28731
   341
                  (Const (s, permT --> T --> T) $
berghofe@28731
   342
                     Const ("List.list.Nil", permT) $ Free (x, T),
berghofe@28731
   343
                   Free (x, T)))
berghofe@28731
   344
               (perm_names ~~
berghofe@28731
   345
                map body_type perm_types ~~ perm_indnames)))))
haftmann@32715
   346
          (fn _ => EVERY [indtac induct perm_indnames 1,
wenzelm@32149
   347
            ALLGOALS (asm_full_simp_tac (global_simpset_of thy2))])),
berghofe@17870
   348
        length new_type_names))
berghofe@17870
   349
      end)
wenzelm@32952
   350
      atoms;
berghofe@17870
   351
berghofe@17870
   352
    (**** prove (pi1 @ pi2) \<bullet> t = pi1 \<bullet> (pi2 \<bullet> t) ****)
berghofe@17870
   353
berghofe@17870
   354
    val _ = warning "perm_append_thms";
berghofe@17870
   355
berghofe@17870
   356
    (*FIXME: these should be looked up statically*)
wenzelm@26343
   357
    val at_pt_inst = PureThy.get_thm thy2 "at_pt_inst";
wenzelm@26343
   358
    val pt2 = PureThy.get_thm thy2 "pt2";
berghofe@17870
   359
wenzelm@32952
   360
    val perm_append_thms = maps (fn a =>
berghofe@17870
   361
      let
berghofe@17870
   362
        val permT = mk_permT (Type (a, []));
berghofe@17870
   363
        val pi1 = Free ("pi1", permT);
berghofe@17870
   364
        val pi2 = Free ("pi2", permT);
berghofe@28731
   365
        val pt_inst = pt_inst_of thy2 a;
berghofe@17870
   366
        val pt2' = pt_inst RS pt2;
wenzelm@30364
   367
        val pt2_ax = PureThy.get_thm thy2 (Long_Name.map_base_name (fn s => "pt_" ^ s ^ "2") a);
wenzelm@32957
   368
      in List.take (map Drule.standard (split_conj_thm
wenzelm@20046
   369
        (Goal.prove_global thy2 [] []
berghofe@28731
   370
           (augment_sort thy2 [pt_class_of thy2 a]
berghofe@17870
   371
             (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   372
                (map (fn ((s, T), x) =>
berghofe@17870
   373
                    let val perm = Const (s, permT --> T --> T)
berghofe@17870
   374
                    in HOLogic.mk_eq
haftmann@23029
   375
                      (perm $ (Const ("List.append", permT --> permT --> permT) $
berghofe@17870
   376
                         pi1 $ pi2) $ Free (x, T),
berghofe@17870
   377
                       perm $ pi1 $ (perm $ pi2 $ Free (x, T)))
berghofe@17870
   378
                    end)
berghofe@17870
   379
                  (perm_names ~~
berghofe@28731
   380
                   map body_type perm_types ~~ perm_indnames)))))
haftmann@32715
   381
           (fn _ => EVERY [indtac induct perm_indnames 1,
wenzelm@32149
   382
              ALLGOALS (asm_full_simp_tac (global_simpset_of thy2 addsimps [pt2', pt2_ax]))]))),
berghofe@17870
   383
         length new_type_names)
wenzelm@32952
   384
      end) atoms;
berghofe@17870
   385
berghofe@17870
   386
    (**** prove pi1 ~ pi2 ==> pi1 \<bullet> t = pi2 \<bullet> t ****)
berghofe@17870
   387
berghofe@17870
   388
    val _ = warning "perm_eq_thms";
berghofe@17870
   389
wenzelm@26343
   390
    val pt3 = PureThy.get_thm thy2 "pt3";
wenzelm@26343
   391
    val pt3_rev = PureThy.get_thm thy2 "pt3_rev";
berghofe@17870
   392
wenzelm@32952
   393
    val perm_eq_thms = maps (fn a =>
berghofe@17870
   394
      let
berghofe@17870
   395
        val permT = mk_permT (Type (a, []));
berghofe@17870
   396
        val pi1 = Free ("pi1", permT);
berghofe@17870
   397
        val pi2 = Free ("pi2", permT);
berghofe@28731
   398
        val at_inst = at_inst_of thy2 a;
berghofe@28731
   399
        val pt_inst = pt_inst_of thy2 a;
berghofe@17870
   400
        val pt3' = pt_inst RS pt3;
berghofe@17870
   401
        val pt3_rev' = at_inst RS (pt_inst RS pt3_rev);
wenzelm@30364
   402
        val pt3_ax = PureThy.get_thm thy2 (Long_Name.map_base_name (fn s => "pt_" ^ s ^ "3") a);
wenzelm@32957
   403
      in List.take (map Drule.standard (split_conj_thm
berghofe@28731
   404
        (Goal.prove_global thy2 [] []
berghofe@28731
   405
          (augment_sort thy2 [pt_class_of thy2 a] (Logic.mk_implies
berghofe@19494
   406
             (HOLogic.mk_Trueprop (Const ("Nominal.prm_eq",
berghofe@17870
   407
                permT --> permT --> HOLogic.boolT) $ pi1 $ pi2),
berghofe@17870
   408
              HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   409
                (map (fn ((s, T), x) =>
berghofe@17870
   410
                    let val perm = Const (s, permT --> T --> T)
berghofe@17870
   411
                    in HOLogic.mk_eq
berghofe@17870
   412
                      (perm $ pi1 $ Free (x, T),
berghofe@17870
   413
                       perm $ pi2 $ Free (x, T))
berghofe@17870
   414
                    end)
berghofe@17870
   415
                  (perm_names ~~
berghofe@28731
   416
                   map body_type perm_types ~~ perm_indnames))))))
haftmann@32715
   417
           (fn _ => EVERY [indtac induct perm_indnames 1,
wenzelm@32149
   418
              ALLGOALS (asm_full_simp_tac (global_simpset_of thy2 addsimps [pt3', pt3_rev', pt3_ax]))]))),
berghofe@17870
   419
         length new_type_names)
wenzelm@32952
   420
      end) atoms;
berghofe@17870
   421
berghofe@17870
   422
    (**** prove pi1 \<bullet> (pi2 \<bullet> t) = (pi1 \<bullet> pi2) \<bullet> (pi1 \<bullet> t) ****)
berghofe@17870
   423
wenzelm@26343
   424
    val cp1 = PureThy.get_thm thy2 "cp1";
wenzelm@26343
   425
    val dj_cp = PureThy.get_thm thy2 "dj_cp";
wenzelm@26343
   426
    val pt_perm_compose = PureThy.get_thm thy2 "pt_perm_compose";
wenzelm@26343
   427
    val pt_perm_compose_rev = PureThy.get_thm thy2 "pt_perm_compose_rev";
wenzelm@26343
   428
    val dj_perm_perm_forget = PureThy.get_thm thy2 "dj_perm_perm_forget";
berghofe@17870
   429
berghofe@17870
   430
    fun composition_instance name1 name2 thy =
berghofe@17870
   431
      let
berghofe@28731
   432
        val cp_class = cp_class_of thy name1 name2;
berghofe@28731
   433
        val pt_class =
berghofe@28731
   434
          if name1 = name2 then [pt_class_of thy name1]
berghofe@28731
   435
          else [];
berghofe@17870
   436
        val permT1 = mk_permT (Type (name1, []));
berghofe@17870
   437
        val permT2 = mk_permT (Type (name2, []));
berghofe@28731
   438
        val Ts = map body_type perm_types;
berghofe@28731
   439
        val cp_inst = cp_inst_of thy name1 name2;
wenzelm@32149
   440
        val simps = global_simpset_of thy addsimps (perm_fun_def ::
berghofe@17870
   441
          (if name1 <> name2 then
berghofe@28731
   442
             let val dj = dj_thm_of thy name2 name1
berghofe@17870
   443
             in [dj RS (cp_inst RS dj_cp), dj RS dj_perm_perm_forget] end
berghofe@17870
   444
           else
berghofe@17870
   445
             let
berghofe@28731
   446
               val at_inst = at_inst_of thy name1;
berghofe@28731
   447
               val pt_inst = pt_inst_of thy name1;
berghofe@17870
   448
             in
berghofe@17870
   449
               [cp_inst RS cp1 RS sym,
berghofe@17870
   450
                at_inst RS (pt_inst RS pt_perm_compose) RS sym,
berghofe@17870
   451
                at_inst RS (pt_inst RS pt_perm_compose_rev) RS sym]
berghofe@17870
   452
            end))
berghofe@28736
   453
        val sort = Sign.certify_sort thy (cp_class :: pt_class);
wenzelm@20046
   454
        val thms = split_conj_thm (Goal.prove_global thy [] []
berghofe@28736
   455
          (augment_sort thy sort
berghofe@17870
   456
            (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   457
              (map (fn ((s, T), x) =>
berghofe@17870
   458
                  let
berghofe@17870
   459
                    val pi1 = Free ("pi1", permT1);
berghofe@17870
   460
                    val pi2 = Free ("pi2", permT2);
berghofe@17870
   461
                    val perm1 = Const (s, permT1 --> T --> T);
berghofe@17870
   462
                    val perm2 = Const (s, permT2 --> T --> T);
berghofe@19494
   463
                    val perm3 = Const ("Nominal.perm", permT1 --> permT2 --> permT2)
berghofe@17870
   464
                  in HOLogic.mk_eq
berghofe@17870
   465
                    (perm1 $ pi1 $ (perm2 $ pi2 $ Free (x, T)),
berghofe@17870
   466
                     perm2 $ (perm3 $ pi1 $ pi2) $ (perm1 $ pi1 $ Free (x, T)))
berghofe@17870
   467
                  end)
berghofe@28731
   468
                (perm_names ~~ Ts ~~ perm_indnames)))))
haftmann@32715
   469
          (fn _ => EVERY [indtac induct perm_indnames 1,
wenzelm@20046
   470
             ALLGOALS (asm_full_simp_tac simps)]))
berghofe@17870
   471
      in
berghofe@28736
   472
        fold (fn (s, tvs) => fn thy => AxClass.prove_arity
berghofe@28736
   473
            (s, map (inter_sort thy sort o snd) tvs, [cp_class])
haftmann@24218
   474
            (Class.intro_classes_tac [] THEN ALLGOALS (resolve_tac thms)) thy)
berghofe@28736
   475
          (full_new_type_names' ~~ tyvars) thy
berghofe@17870
   476
      end;
berghofe@17870
   477
urbanc@18381
   478
    val (perm_thmss,thy3) = thy2 |>
berghofe@17870
   479
      fold (fn name1 => fold (composition_instance name1) atoms) atoms |>
berghofe@28731
   480
      fold (fn atom => fn thy =>
berghofe@28731
   481
        let val pt_name = pt_class_of thy atom
berghofe@28731
   482
        in
berghofe@28736
   483
          fold (fn (s, tvs) => fn thy => AxClass.prove_arity
berghofe@28736
   484
              (s, map (inter_sort thy [pt_name] o snd) tvs, [pt_name])
berghofe@28731
   485
              (EVERY
berghofe@28731
   486
                [Class.intro_classes_tac [],
berghofe@28731
   487
                 resolve_tac perm_empty_thms 1,
berghofe@28731
   488
                 resolve_tac perm_append_thms 1,
berghofe@28736
   489
                 resolve_tac perm_eq_thms 1, assume_tac 1]) thy)
berghofe@28736
   490
            (full_new_type_names' ~~ tyvars) thy
berghofe@28731
   491
        end) atoms |>
berghofe@17870
   492
      PureThy.add_thmss
haftmann@29585
   493
        [((Binding.name (space_implode "_" new_type_names ^ "_unfolded_perm_eq"),
krauss@18759
   494
          unfolded_perm_eq_thms), [Simplifier.simp_add]),
haftmann@29585
   495
         ((Binding.name (space_implode "_" new_type_names ^ "_perm_empty"),
krauss@18759
   496
          perm_empty_thms), [Simplifier.simp_add]),
haftmann@29585
   497
         ((Binding.name (space_implode "_" new_type_names ^ "_perm_append"),
krauss@18759
   498
          perm_append_thms), [Simplifier.simp_add]),
haftmann@29585
   499
         ((Binding.name (space_implode "_" new_type_names ^ "_perm_eq"),
krauss@18759
   500
          perm_eq_thms), [Simplifier.simp_add])];
wenzelm@21365
   501
berghofe@17870
   502
    (**** Define representing sets ****)
berghofe@17870
   503
berghofe@17870
   504
    val _ = warning "representing sets";
berghofe@17870
   505
berghofe@21021
   506
    val rep_set_names = DatatypeProp.indexify_names
berghofe@21021
   507
      (map (fn (i, _) => name_of_typ (nth_dtyp i) ^ "_set") descr);
berghofe@17870
   508
    val big_rep_name =
wenzelm@32952
   509
      space_implode "_" (DatatypeProp.indexify_names (map_filter
berghofe@19494
   510
        (fn (i, ("Nominal.noption", _, _)) => NONE
berghofe@17870
   511
          | (i, _) => SOME (name_of_typ (nth_dtyp i))) descr)) ^ "_set";
berghofe@17870
   512
    val _ = warning ("big_rep_name: " ^ big_rep_name);
berghofe@17870
   513
berghofe@17870
   514
    fun strip_option (dtf as DtType ("fun", [dt, DtRec i])) =
berghofe@17870
   515
          (case AList.lookup op = descr i of
berghofe@19494
   516
             SOME ("Nominal.noption", _, [(_, [dt']), _]) =>
berghofe@17870
   517
               apfst (cons dt) (strip_option dt')
berghofe@17870
   518
           | _ => ([], dtf))
berghofe@19494
   519
      | strip_option (DtType ("fun", [dt, DtType ("Nominal.noption", [dt'])])) =
berghofe@18261
   520
          apfst (cons dt) (strip_option dt')
berghofe@17870
   521
      | strip_option dt = ([], dt);
berghofe@17870
   522
berghofe@28731
   523
    val dt_atomTs = distinct op = (map (typ_of_dtyp descr sorts)
wenzelm@32952
   524
      (maps (fn (_, (_, _, cs)) => maps (maps (fst o strip_option) o snd) cs) descr));
berghofe@28731
   525
    val dt_atoms = map (fst o dest_Type) dt_atomTs;
berghofe@18280
   526
berghofe@17870
   527
    fun make_intr s T (cname, cargs) =
berghofe@17870
   528
      let
wenzelm@21365
   529
        fun mk_prem (dt, (j, j', prems, ts)) =
berghofe@17870
   530
          let
berghofe@17870
   531
            val (dts, dt') = strip_option dt;
berghofe@17870
   532
            val (dts', dt'') = strip_dtyp dt';
berghofe@28731
   533
            val Ts = map (typ_of_dtyp descr sorts) dts;
berghofe@28731
   534
            val Us = map (typ_of_dtyp descr sorts) dts';
berghofe@28731
   535
            val T = typ_of_dtyp descr sorts dt'';
berghofe@17870
   536
            val free = mk_Free "x" (Us ---> T) j;
berghofe@17870
   537
            val free' = app_bnds free (length Us);
berghofe@17870
   538
            fun mk_abs_fun (T, (i, t)) =
berghofe@17870
   539
              let val U = fastype_of t
berghofe@19494
   540
              in (i + 1, Const ("Nominal.abs_fun", [T, U, T] --->
berghofe@19494
   541
                Type ("Nominal.noption", [U])) $ mk_Free "y" T i $ t)
berghofe@17870
   542
              end
berghofe@17870
   543
          in (j + 1, j' + length Ts,
berghofe@17870
   544
            case dt'' of
berghofe@17870
   545
                DtRec k => list_all (map (pair "x") Us,
berghofe@21021
   546
                  HOLogic.mk_Trueprop (Free (List.nth (rep_set_names, k),
berghofe@21021
   547
                    T --> HOLogic.boolT) $ free')) :: prems
berghofe@17870
   548
              | _ => prems,
wenzelm@30190
   549
            snd (List.foldr mk_abs_fun (j', free) Ts) :: ts)
berghofe@17870
   550
          end;
berghofe@17870
   551
wenzelm@30190
   552
        val (_, _, prems, ts) = List.foldr mk_prem (1, 1, [], []) cargs;
berghofe@21021
   553
        val concl = HOLogic.mk_Trueprop (Free (s, T --> HOLogic.boolT) $
berghofe@21021
   554
          list_comb (Const (cname, map fastype_of ts ---> T), ts))
berghofe@17870
   555
      in Logic.list_implies (prems, concl)
berghofe@17870
   556
      end;
berghofe@17870
   557
berghofe@21021
   558
    val (intr_ts, (rep_set_names', recTs')) =
wenzelm@32952
   559
      apfst flat (apsnd ListPair.unzip (ListPair.unzip (map_filter
berghofe@19494
   560
        (fn ((_, ("Nominal.noption", _, _)), _) => NONE
berghofe@17870
   561
          | ((i, (_, _, constrs)), rep_set_name) =>
berghofe@17870
   562
              let val T = nth_dtyp i
berghofe@17870
   563
              in SOME (map (make_intr rep_set_name T) constrs,
berghofe@21021
   564
                (rep_set_name, T))
berghofe@17870
   565
              end)
berghofe@21021
   566
                (descr ~~ rep_set_names))));
haftmann@28965
   567
    val rep_set_names'' = map (Sign.full_bname thy3) rep_set_names';
berghofe@17870
   568
wenzelm@21365
   569
    val ({raw_induct = rep_induct, intrs = rep_intrs, ...}, thy4) =
wenzelm@33278
   570
      thy3
wenzelm@33278
   571
      |> Sign.map_naming Name_Space.conceal
wenzelm@33278
   572
      |> Inductive.add_inductive_global (serial ())
wenzelm@26475
   573
          {quiet_mode = false, verbose = false, kind = Thm.internalK,
haftmann@28965
   574
           alt_name = Binding.name big_rep_name, coind = false, no_elim = true, no_ind = false,
wenzelm@29389
   575
           skip_mono = true, fork_mono = false}
haftmann@28965
   576
          (map (fn (s, T) => ((Binding.name s, T --> HOLogic.boolT), NoSyn))
wenzelm@26128
   577
             (rep_set_names' ~~ recTs'))
wenzelm@33278
   578
          [] (map (fn x => (Attrib.empty_binding, x)) intr_ts) []
wenzelm@33278
   579
      ||> Sign.restore_naming thy3;
berghofe@17870
   580
berghofe@17870
   581
    (**** Prove that representing set is closed under permutation ****)
berghofe@17870
   582
berghofe@17870
   583
    val _ = warning "proving closure under permutation...";
berghofe@17870
   584
wenzelm@26343
   585
    val abs_perm = PureThy.get_thms thy4 "abs_perm";
berghofe@25951
   586
wenzelm@32952
   587
    val perm_indnames' = map_filter
berghofe@19494
   588
      (fn (x, (_, ("Nominal.noption", _, _))) => NONE | (x, _) => SOME x)
berghofe@17870
   589
      (perm_indnames ~~ descr);
berghofe@17870
   590
wenzelm@32957
   591
    fun mk_perm_closed name = map (fn th => Drule.standard (th RS mp))
wenzelm@20046
   592
      (List.take (split_conj_thm (Goal.prove_global thy4 [] []
berghofe@28731
   593
        (augment_sort thy4
haftmann@33040
   594
          (pt_class_of thy4 name :: map (cp_class_of thy4 name) (remove (op =) name dt_atoms))
berghofe@28731
   595
          (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map
berghofe@28731
   596
            (fn ((s, T), x) =>
berghofe@28731
   597
               let
berghofe@28731
   598
                 val S = Const (s, T --> HOLogic.boolT);
berghofe@28731
   599
                 val permT = mk_permT (Type (name, []))
berghofe@28731
   600
               in HOLogic.mk_imp (S $ Free (x, T),
berghofe@28731
   601
                 S $ (Const ("Nominal.perm", permT --> T --> T) $
berghofe@28731
   602
                   Free ("pi", permT) $ Free (x, T)))
berghofe@28731
   603
               end) (rep_set_names'' ~~ recTs' ~~ perm_indnames')))))
berghofe@28731
   604
        (fn _ => EVERY
berghofe@17870
   605
           [indtac rep_induct [] 1,
wenzelm@32149
   606
            ALLGOALS (simp_tac (global_simpset_of thy4 addsimps
berghofe@25951
   607
              (symmetric perm_fun_def :: abs_perm))),
berghofe@28731
   608
            ALLGOALS (resolve_tac rep_intrs THEN_ALL_NEW assume_tac)])),
berghofe@17870
   609
        length new_type_names));
berghofe@17870
   610
berghofe@17870
   611
    val perm_closed_thmss = map mk_perm_closed atoms;
berghofe@17870
   612
berghofe@17870
   613
    (**** typedef ****)
berghofe@17870
   614
berghofe@17870
   615
    val _ = warning "defining type...";
berghofe@17870
   616
berghofe@18366
   617
    val (typedefs, thy6) =
wenzelm@26651
   618
      thy4
berghofe@21021
   619
      |> fold_map (fn ((((name, mx), tvs), (cname, U)), name') => fn thy =>
haftmann@31723
   620
          Typedef.add_typedef false (SOME (Binding.name name'))
wenzelm@30345
   621
            (Binding.name name, map fst tvs, mx)
berghofe@21021
   622
            (Const ("Collect", (U --> HOLogic.boolT) --> HOLogic.mk_setT U) $
berghofe@21021
   623
               Const (cname, U --> HOLogic.boolT)) NONE
berghofe@21021
   624
            (rtac exI 1 THEN rtac CollectI 1 THEN
berghofe@17870
   625
              QUIET_BREADTH_FIRST (has_fewer_prems 1)
wenzelm@26475
   626
              (resolve_tac rep_intrs 1)) thy |> (fn ((_, r), thy) =>
berghofe@17870
   627
        let
berghofe@28736
   628
          val permT = mk_permT
berghofe@28736
   629
            (TFree (Name.variant (map fst tvs) "'a", HOLogic.typeS));
berghofe@17870
   630
          val pi = Free ("pi", permT);
berghofe@28736
   631
          val T = Type (Sign.intern_type thy name, map TFree tvs);
berghofe@18366
   632
        in apfst (pair r o hd)
haftmann@29585
   633
          (PureThy.add_defs_unchecked true [((Binding.name ("prm_" ^ name ^ "_def"), Logic.mk_equals
berghofe@19494
   634
            (Const ("Nominal.perm", permT --> T --> T) $ pi $ Free ("x", T),
berghofe@17870
   635
             Const (Sign.intern_const thy ("Abs_" ^ name), U --> T) $
berghofe@19494
   636
               (Const ("Nominal.perm", permT --> U --> U) $ pi $
berghofe@17870
   637
                 (Const (Sign.intern_const thy ("Rep_" ^ name), T --> U) $
berghofe@17870
   638
                   Free ("x", T))))), [])] thy)
berghofe@17870
   639
        end))
berghofe@18366
   640
          (types_syntax ~~ tyvars ~~
berghofe@21021
   641
            List.take (rep_set_names'' ~~ recTs', length new_type_names) ~~
berghofe@21021
   642
            new_type_names);
berghofe@17870
   643
berghofe@17870
   644
    val perm_defs = map snd typedefs;
berghofe@21021
   645
    val Abs_inverse_thms = map (collect_simp o #Abs_inverse o fst) typedefs;
berghofe@18016
   646
    val Rep_inverse_thms = map (#Rep_inverse o fst) typedefs;
berghofe@21021
   647
    val Rep_thms = map (collect_simp o #Rep o fst) typedefs;
berghofe@17870
   648
berghofe@18016
   649
berghofe@17870
   650
    (** prove that new types are in class pt_<name> **)
berghofe@17870
   651
berghofe@17870
   652
    val _ = warning "prove that new types are in class pt_<name> ...";
berghofe@17870
   653
berghofe@28731
   654
    fun pt_instance (atom, perm_closed_thms) =
berghofe@21021
   655
      fold (fn ((((((Abs_inverse, Rep_inverse), Rep),
berghofe@17870
   656
        perm_def), name), tvs), perm_closed) => fn thy =>
berghofe@28731
   657
          let
berghofe@28731
   658
            val pt_class = pt_class_of thy atom;
berghofe@28736
   659
            val sort = Sign.certify_sort thy
haftmann@33040
   660
              (pt_class :: map (cp_class_of thy atom) (remove (op =) atom dt_atoms))
berghofe@28731
   661
          in AxClass.prove_arity
berghofe@17870
   662
            (Sign.intern_type thy name,
berghofe@28736
   663
              map (inter_sort thy sort o snd) tvs, [pt_class])
haftmann@24218
   664
            (EVERY [Class.intro_classes_tac [],
berghofe@17870
   665
              rewrite_goals_tac [perm_def],
wenzelm@32149
   666
              asm_full_simp_tac (global_simpset_of thy addsimps [Rep_inverse]) 1,
wenzelm@32149
   667
              asm_full_simp_tac (global_simpset_of thy addsimps
berghofe@17870
   668
                [Rep RS perm_closed RS Abs_inverse]) 1,
wenzelm@26343
   669
              asm_full_simp_tac (HOL_basic_ss addsimps [PureThy.get_thm thy
wenzelm@30364
   670
                ("pt_" ^ Long_Name.base_name atom ^ "3")]) 1]) thy
berghofe@28731
   671
          end)
berghofe@21021
   672
        (Abs_inverse_thms ~~ Rep_inverse_thms ~~ Rep_thms ~~ perm_defs ~~
berghofe@21021
   673
           new_type_names ~~ tyvars ~~ perm_closed_thms);
berghofe@17870
   674
berghofe@17870
   675
berghofe@17870
   676
    (** prove that new types are in class cp_<name1>_<name2> **)
berghofe@17870
   677
berghofe@17870
   678
    val _ = warning "prove that new types are in class cp_<name1>_<name2> ...";
berghofe@17870
   679
berghofe@17870
   680
    fun cp_instance (atom1, perm_closed_thms1) (atom2, perm_closed_thms2) thy =
berghofe@17870
   681
      let
berghofe@28731
   682
        val cp_class = cp_class_of thy atom1 atom2;
berghofe@28736
   683
        val sort = Sign.certify_sort thy
haftmann@33040
   684
          (pt_class_of thy atom1 :: map (cp_class_of thy atom1) (remove (op =) atom1 dt_atoms) @
berghofe@28736
   685
           (if atom1 = atom2 then [cp_class_of thy atom1 atom1] else
haftmann@33040
   686
            pt_class_of thy atom2 :: map (cp_class_of thy atom2) (remove (op =) atom2 dt_atoms)));
berghofe@28731
   687
        val cp1' = cp_inst_of thy atom1 atom2 RS cp1
berghofe@21021
   688
      in fold (fn ((((((Abs_inverse, Rep),
berghofe@17870
   689
        perm_def), name), tvs), perm_closed1), perm_closed2) => fn thy =>
berghofe@19275
   690
          AxClass.prove_arity
berghofe@17870
   691
            (Sign.intern_type thy name,
berghofe@28736
   692
              map (inter_sort thy sort o snd) tvs, [cp_class])
haftmann@24218
   693
            (EVERY [Class.intro_classes_tac [],
berghofe@17870
   694
              rewrite_goals_tac [perm_def],
wenzelm@32149
   695
              asm_full_simp_tac (global_simpset_of thy addsimps
berghofe@17870
   696
                ((Rep RS perm_closed1 RS Abs_inverse) ::
berghofe@17870
   697
                 (if atom1 = atom2 then []
berghofe@17870
   698
                  else [Rep RS perm_closed2 RS Abs_inverse]))) 1,
berghofe@18016
   699
              cong_tac 1,
berghofe@17870
   700
              rtac refl 1,
berghofe@17870
   701
              rtac cp1' 1]) thy)
berghofe@21021
   702
        (Abs_inverse_thms ~~ Rep_thms ~~ perm_defs ~~ new_type_names ~~
berghofe@21021
   703
           tyvars ~~ perm_closed_thms1 ~~ perm_closed_thms2) thy
berghofe@17870
   704
      end;
berghofe@17870
   705
berghofe@17870
   706
    val thy7 = fold (fn x => fn thy => thy |>
berghofe@17870
   707
      pt_instance x |>
berghofe@28731
   708
      fold (cp_instance x) (atoms ~~ perm_closed_thmss))
berghofe@28731
   709
        (atoms ~~ perm_closed_thmss) thy6;
berghofe@17870
   710
berghofe@17870
   711
    (**** constructors ****)
berghofe@17870
   712
berghofe@17870
   713
    fun mk_abs_fun (x, t) =
berghofe@17870
   714
      let
berghofe@17870
   715
        val T = fastype_of x;
berghofe@17870
   716
        val U = fastype_of t
berghofe@17870
   717
      in
berghofe@19494
   718
        Const ("Nominal.abs_fun", T --> U --> T -->
berghofe@19494
   719
          Type ("Nominal.noption", [U])) $ x $ t
berghofe@17870
   720
      end;
berghofe@17870
   721
wenzelm@30190
   722
    val (ty_idxs, _) = List.foldl
berghofe@19494
   723
      (fn ((i, ("Nominal.noption", _, _)), p) => p
berghofe@18016
   724
        | ((i, _), (ty_idxs, j)) => (ty_idxs @ [(i, j)], j + 1)) ([], 0) descr;
berghofe@18016
   725
berghofe@18016
   726
    fun reindex (DtType (s, dts)) = DtType (s, map reindex dts)
berghofe@18016
   727
      | reindex (DtRec i) = DtRec (the (AList.lookup op = ty_idxs i))
berghofe@18016
   728
      | reindex dt = dt;
berghofe@18016
   729
berghofe@18016
   730
    fun strip_suffix i s = implode (List.take (explode s, size s - i));
berghofe@18016
   731
berghofe@18016
   732
    (** strips the "_Rep" in type names *)
wenzelm@21365
   733
    fun strip_nth_name i s =
wenzelm@30364
   734
      let val xs = Long_Name.explode s;
wenzelm@30364
   735
      in Long_Name.implode (Library.nth_map (length xs - i) (strip_suffix 4) xs) end;
berghofe@18016
   736
haftmann@31458
   737
    val (descr'', ndescr) = ListPair.unzip (map_filter
berghofe@19494
   738
      (fn (i, ("Nominal.noption", _, _)) => NONE
berghofe@18107
   739
        | (i, (s, dts, constrs)) =>
berghofe@18107
   740
             let
berghofe@18107
   741
               val SOME index = AList.lookup op = ty_idxs i;
haftmann@31458
   742
               val (constrs2, constrs1) =
haftmann@31458
   743
                 map_split (fn (cname, cargs) =>
haftmann@31458
   744
                   apsnd (pair (strip_nth_name 2 (strip_nth_name 1 cname)))
haftmann@31458
   745
                   (fold_map (fn dt => fn dts =>
berghofe@18107
   746
                     let val (dts', dt') = strip_option dt
haftmann@31458
   747
                     in ((length dts, length dts'), dts @ dts' @ [reindex dt']) end)
haftmann@31458
   748
                       cargs [])) constrs
berghofe@18107
   749
             in SOME ((index, (strip_nth_name 1 s,  map reindex dts, constrs1)),
berghofe@18107
   750
               (index, constrs2))
berghofe@18107
   751
             end) descr);
urbanc@18045
   752
berghofe@19489
   753
    val (descr1, descr2) = chop (length new_type_names) descr'';
berghofe@18016
   754
    val descr' = [descr1, descr2];
berghofe@18016
   755
berghofe@19710
   756
    fun partition_cargs idxs xs = map (fn (i, j) =>
berghofe@19710
   757
      (List.take (List.drop (xs, i), j), List.nth (xs, i + j))) idxs;
berghofe@19710
   758
berghofe@19833
   759
    val pdescr = map (fn ((i, (s, dts, constrs)), (_, idxss)) => (i, (s, dts,
berghofe@19833
   760
      map (fn ((cname, cargs), idxs) => (cname, partition_cargs idxs cargs))
berghofe@19833
   761
        (constrs ~~ idxss)))) (descr'' ~~ ndescr);
berghofe@19833
   762
berghofe@28731
   763
    fun nth_dtyp' i = typ_of_dtyp descr'' sorts (DtRec i);
berghofe@17870
   764
berghofe@17870
   765
    val rep_names = map (fn s =>
berghofe@17870
   766
      Sign.intern_const thy7 ("Rep_" ^ s)) new_type_names;
berghofe@17870
   767
    val abs_names = map (fn s =>
berghofe@17870
   768
      Sign.intern_const thy7 ("Abs_" ^ s)) new_type_names;
berghofe@17870
   769
berghofe@28731
   770
    val recTs = get_rec_types descr'' sorts;
berghofe@18016
   771
    val newTs' = Library.take (length new_type_names, recTs');
berghofe@18016
   772
    val newTs = Library.take (length new_type_names, recTs);
berghofe@17870
   773
haftmann@28965
   774
    val full_new_type_names = map (Sign.full_bname thy) new_type_names;
berghofe@17870
   775
wenzelm@33244
   776
    fun make_constr_def tname T T' (((cname_rep, _), (cname, cargs)), (cname', mx))
wenzelm@33244
   777
        (thy, defs, eqns) =
berghofe@17870
   778
      let
berghofe@19833
   779
        fun constr_arg ((dts, dt), (j, l_args, r_args)) =
berghofe@17870
   780
          let
berghofe@28731
   781
            val xs = map (fn (dt, i) => mk_Free "x" (typ_of_dtyp descr'' sorts dt) i)
berghofe@17870
   782
              (dts ~~ (j upto j + length dts - 1))
berghofe@28731
   783
            val x = mk_Free "x" (typ_of_dtyp descr'' sorts dt) (j + length dts)
berghofe@18261
   784
          in
berghofe@18261
   785
            (j + length dts + 1,
berghofe@18261
   786
             xs @ x :: l_args,
wenzelm@30190
   787
             List.foldr mk_abs_fun
berghofe@19833
   788
               (case dt of
berghofe@18261
   789
                  DtRec k => if k < length new_type_names then
berghofe@28731
   790
                      Const (List.nth (rep_names, k), typ_of_dtyp descr'' sorts dt -->
berghofe@28731
   791
                        typ_of_dtyp descr sorts dt) $ x
berghofe@18261
   792
                    else error "nested recursion not (yet) supported"
berghofe@18261
   793
                | _ => x) xs :: r_args)
berghofe@17870
   794
          end
berghofe@17870
   795
wenzelm@30190
   796
        val (_, l_args, r_args) = List.foldr constr_arg (1, [], []) cargs;
wenzelm@22578
   797
        val abs_name = Sign.intern_const thy ("Abs_" ^ tname);
wenzelm@22578
   798
        val rep_name = Sign.intern_const thy ("Rep_" ^ tname);
berghofe@17870
   799
        val constrT = map fastype_of l_args ---> T;
berghofe@19833
   800
        val lhs = list_comb (Const (cname, constrT), l_args);
berghofe@19833
   801
        val rhs = list_comb (Const (cname_rep, map fastype_of r_args ---> T'), r_args);
berghofe@17870
   802
        val def = Logic.mk_equals (lhs, Const (abs_name, T' --> T) $ rhs);
berghofe@17870
   803
        val eqn = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   804
          (Const (rep_name, T --> T') $ lhs, rhs));
wenzelm@30364
   805
        val def_name = (Long_Name.base_name cname) ^ "_def";
berghofe@18366
   806
        val ([def_thm], thy') = thy |>
wenzelm@30345
   807
          Sign.add_consts_i [(Binding.name cname', constrT, mx)] |>
haftmann@29585
   808
          (PureThy.add_defs false o map Thm.no_attributes) [(Binding.name def_name, def)]
berghofe@17870
   809
      in (thy', defs @ [def_thm], eqns @ [eqn]) end;
berghofe@17870
   810
wenzelm@33244
   811
    fun dt_constr_defs ((((((_, (_, _, constrs)),
wenzelm@33244
   812
        (_, (_, _, constrs'))), tname), T), T'), constr_syntax) (thy, defs, eqns, dist_lemmas) =
berghofe@17870
   813
      let
berghofe@17870
   814
        val rep_const = cterm_of thy
berghofe@17870
   815
          (Const (Sign.intern_const thy ("Rep_" ^ tname), T --> T'));
wenzelm@33244
   816
        val dist =
wenzelm@33244
   817
          Drule.standard (cterm_instantiate [(cterm_of thy distinct_f, rep_const)] distinct_lemma);
wenzelm@33244
   818
        val (thy', defs', eqns') = fold (make_constr_def tname T T')
wenzelm@33244
   819
          (constrs ~~ constrs' ~~ constr_syntax) (Sign.add_path tname thy, defs, [])
berghofe@17870
   820
      in
haftmann@32124
   821
        (Sign.parent_path thy', defs', eqns @ [eqns'], dist_lemmas @ [dist])
berghofe@17870
   822
      end;
berghofe@17870
   823
wenzelm@33244
   824
    val (thy8, constr_defs, constr_rep_eqns, dist_lemmas) = fold dt_constr_defs
wenzelm@33244
   825
      (List.take (descr, length new_type_names) ~~
berghofe@19833
   826
        List.take (pdescr, length new_type_names) ~~
wenzelm@33244
   827
        new_type_names ~~ newTs ~~ newTs' ~~ constr_syntax)
wenzelm@33244
   828
      (thy7, [], [], []);
berghofe@17870
   829
berghofe@21021
   830
    val abs_inject_thms = map (collect_simp o #Abs_inject o fst) typedefs
berghofe@21021
   831
    val rep_inject_thms = map (#Rep_inject o fst) typedefs
berghofe@17870
   832
berghofe@17870
   833
    (* prove theorem  Rep_i (Constr_j ...) = Constr'_j ...  *)
wenzelm@21365
   834
berghofe@17870
   835
    fun prove_constr_rep_thm eqn =
berghofe@17870
   836
      let
berghofe@17870
   837
        val inj_thms = map (fn r => r RS iffD1) abs_inject_thms;
berghofe@21021
   838
        val rewrites = constr_defs @ map mk_meta_eq Rep_inverse_thms
wenzelm@20046
   839
      in Goal.prove_global thy8 [] [] eqn (fn _ => EVERY
berghofe@17870
   840
        [resolve_tac inj_thms 1,
berghofe@17870
   841
         rewrite_goals_tac rewrites,
berghofe@17870
   842
         rtac refl 3,
berghofe@17870
   843
         resolve_tac rep_intrs 2,
berghofe@21021
   844
         REPEAT (resolve_tac Rep_thms 1)])
berghofe@17870
   845
      end;
berghofe@17870
   846
berghofe@17870
   847
    val constr_rep_thmss = map (map prove_constr_rep_thm) constr_rep_eqns;
berghofe@17870
   848
berghofe@17870
   849
    (* prove theorem  pi \<bullet> Rep_i x = Rep_i (pi \<bullet> x) *)
berghofe@17870
   850
berghofe@17870
   851
    fun prove_perm_rep_perm (atom, perm_closed_thms) = map (fn th =>
berghofe@17870
   852
      let
berghofe@21021
   853
        val _ $ (_ $ (Rep $ x)) = Logic.unvarify (prop_of th);
berghofe@17870
   854
        val Type ("fun", [T, U]) = fastype_of Rep;
berghofe@17870
   855
        val permT = mk_permT (Type (atom, []));
berghofe@17870
   856
        val pi = Free ("pi", permT);
berghofe@17870
   857
      in
berghofe@28731
   858
        Goal.prove_global thy8 [] []
berghofe@28731
   859
          (augment_sort thy8
haftmann@33040
   860
            (pt_class_of thy8 atom :: map (cp_class_of thy8 atom) (remove (op =) atom dt_atoms))
berghofe@28731
   861
            (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@28731
   862
              (Const ("Nominal.perm", permT --> U --> U) $ pi $ (Rep $ x),
berghofe@28731
   863
               Rep $ (Const ("Nominal.perm", permT --> T --> T) $ pi $ x)))))
berghofe@18010
   864
          (fn _ => simp_tac (HOL_basic_ss addsimps (perm_defs @ Abs_inverse_thms @
wenzelm@20046
   865
            perm_closed_thms @ Rep_thms)) 1)
berghofe@17870
   866
      end) Rep_thms;
berghofe@17870
   867
wenzelm@32952
   868
    val perm_rep_perm_thms = maps prove_perm_rep_perm (atoms ~~ perm_closed_thmss);
berghofe@17870
   869
berghofe@17870
   870
    (* prove distinctness theorems *)
berghofe@17870
   871
berghofe@28731
   872
    val distinct_props = DatatypeProp.make_distincts descr' sorts;
haftmann@27300
   873
    val dist_rewrites = map2 (fn rep_thms => fn dist_lemma =>
haftmann@27300
   874
      dist_lemma :: rep_thms @ [In0_eq, In1_eq, In0_not_In1, In1_not_In0])
haftmann@27300
   875
        constr_rep_thmss dist_lemmas;
berghofe@17870
   876
haftmann@26969
   877
    fun prove_distinct_thms _ (_, []) = []
haftmann@26969
   878
      | prove_distinct_thms (p as (rep_thms, dist_lemma)) (k, t :: ts) =
berghofe@17870
   879
          let
wenzelm@20046
   880
            val dist_thm = Goal.prove_global thy8 [] [] t (fn _ =>
wenzelm@32149
   881
              simp_tac (global_simpset_of thy8 addsimps (dist_lemma :: rep_thms)) 1)
wenzelm@32957
   882
          in dist_thm :: Drule.standard (dist_thm RS not_sym) ::
haftmann@27300
   883
            prove_distinct_thms p (k, ts)
berghofe@17870
   884
          end;
berghofe@17870
   885
haftmann@26969
   886
    val distinct_thms = map2 prove_distinct_thms
haftmann@26969
   887
      (constr_rep_thmss ~~ dist_lemmas) distinct_props;
berghofe@17870
   888
berghofe@17870
   889
    (** prove equations for permutation functions **)
berghofe@17870
   890
berghofe@17870
   891
    val perm_simps' = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) =>
berghofe@19833
   892
      let val T = nth_dtyp' i
wenzelm@32952
   893
      in maps (fn (atom, perm_closed_thms) =>
wenzelm@21365
   894
          map (fn ((cname, dts), constr_rep_thm) =>
berghofe@17870
   895
        let
berghofe@17870
   896
          val cname = Sign.intern_const thy8
wenzelm@30364
   897
            (Long_Name.append tname (Long_Name.base_name cname));
berghofe@17870
   898
          val permT = mk_permT (Type (atom, []));
berghofe@17870
   899
          val pi = Free ("pi", permT);
berghofe@17870
   900
berghofe@17870
   901
          fun perm t =
berghofe@17870
   902
            let val T = fastype_of t
berghofe@19494
   903
            in Const ("Nominal.perm", permT --> T --> T) $ pi $ t end;
berghofe@17870
   904
berghofe@19833
   905
          fun constr_arg ((dts, dt), (j, l_args, r_args)) =
berghofe@17870
   906
            let
berghofe@28731
   907
              val Ts = map (typ_of_dtyp descr'' sorts) dts;
berghofe@17870
   908
              val xs = map (fn (T, i) => mk_Free "x" T i)
berghofe@17870
   909
                (Ts ~~ (j upto j + length dts - 1))
berghofe@28731
   910
              val x = mk_Free "x" (typ_of_dtyp descr'' sorts dt) (j + length dts)
berghofe@18261
   911
            in
berghofe@18261
   912
              (j + length dts + 1,
berghofe@18261
   913
               xs @ x :: l_args,
berghofe@18261
   914
               map perm (xs @ [x]) @ r_args)
berghofe@17870
   915
            end
berghofe@17870
   916
wenzelm@30190
   917
          val (_, l_args, r_args) = List.foldr constr_arg (1, [], []) dts;
berghofe@17870
   918
          val c = Const (cname, map fastype_of l_args ---> T)
berghofe@17870
   919
        in
wenzelm@20046
   920
          Goal.prove_global thy8 [] []
berghofe@28731
   921
            (augment_sort thy8
haftmann@33040
   922
              (pt_class_of thy8 atom :: map (cp_class_of thy8 atom) (remove (op =) atom dt_atoms))
berghofe@28731
   923
              (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@28731
   924
                (perm (list_comb (c, l_args)), list_comb (c, r_args)))))
berghofe@18010
   925
            (fn _ => EVERY
wenzelm@32149
   926
              [simp_tac (global_simpset_of thy8 addsimps (constr_rep_thm :: perm_defs)) 1,
berghofe@17870
   927
               simp_tac (HOL_basic_ss addsimps (Rep_thms @ Abs_inverse_thms @
berghofe@17870
   928
                 constr_defs @ perm_closed_thms)) 1,
berghofe@17870
   929
               TRY (simp_tac (HOL_basic_ss addsimps
berghofe@17870
   930
                 (symmetric perm_fun_def :: abs_perm)) 1),
berghofe@17870
   931
               TRY (simp_tac (HOL_basic_ss addsimps
berghofe@17870
   932
                 (perm_fun_def :: perm_defs @ Rep_thms @ Abs_inverse_thms @
wenzelm@20046
   933
                    perm_closed_thms)) 1)])
wenzelm@32952
   934
        end) (constrs ~~ constr_rep_thms)) (atoms ~~ perm_closed_thmss)
berghofe@19833
   935
      end) (List.take (pdescr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss);
berghofe@17870
   936
berghofe@17870
   937
    (** prove injectivity of constructors **)
berghofe@17870
   938
berghofe@17870
   939
    val rep_inject_thms' = map (fn th => th RS sym) rep_inject_thms;
wenzelm@26343
   940
    val alpha = PureThy.get_thms thy8 "alpha";
wenzelm@26343
   941
    val abs_fresh = PureThy.get_thms thy8 "abs_fresh";
berghofe@17870
   942
berghofe@28731
   943
    val pt_cp_sort =
berghofe@28731
   944
      map (pt_class_of thy8) dt_atoms @
haftmann@33040
   945
      maps (fn s => map (cp_class_of thy8 s) (remove (op =) s dt_atoms)) dt_atoms;
berghofe@28731
   946
berghofe@17870
   947
    val inject_thms = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) =>
berghofe@19833
   948
      let val T = nth_dtyp' i
wenzelm@32952
   949
      in map_filter (fn ((cname, dts), constr_rep_thm) =>
berghofe@17870
   950
        if null dts then NONE else SOME
berghofe@17870
   951
        let
berghofe@17870
   952
          val cname = Sign.intern_const thy8
wenzelm@30364
   953
            (Long_Name.append tname (Long_Name.base_name cname));
berghofe@17870
   954
berghofe@19833
   955
          fun make_inj ((dts, dt), (j, args1, args2, eqs)) =
berghofe@17870
   956
            let
berghofe@28731
   957
              val Ts_idx = map (typ_of_dtyp descr'' sorts) dts ~~ (j upto j + length dts - 1);
berghofe@17870
   958
              val xs = map (fn (T, i) => mk_Free "x" T i) Ts_idx;
berghofe@17870
   959
              val ys = map (fn (T, i) => mk_Free "y" T i) Ts_idx;
berghofe@28731
   960
              val x = mk_Free "x" (typ_of_dtyp descr'' sorts dt) (j + length dts);
berghofe@28731
   961
              val y = mk_Free "y" (typ_of_dtyp descr'' sorts dt) (j + length dts)
berghofe@18261
   962
            in
berghofe@18261
   963
              (j + length dts + 1,
berghofe@18261
   964
               xs @ (x :: args1), ys @ (y :: args2),
berghofe@18261
   965
               HOLogic.mk_eq
wenzelm@30190
   966
                 (List.foldr mk_abs_fun x xs, List.foldr mk_abs_fun y ys) :: eqs)
berghofe@17870
   967
            end;
berghofe@17870
   968
wenzelm@30190
   969
          val (_, args1, args2, eqs) = List.foldr make_inj (1, [], [], []) dts;
berghofe@17870
   970
          val Ts = map fastype_of args1;
berghofe@17870
   971
          val c = Const (cname, Ts ---> T)
berghofe@17870
   972
        in
berghofe@28731
   973
          Goal.prove_global thy8 [] []
berghofe@28731
   974
            (augment_sort thy8 pt_cp_sort
berghofe@28731
   975
              (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@28731
   976
                (HOLogic.mk_eq (list_comb (c, args1), list_comb (c, args2)),
berghofe@28731
   977
                 foldr1 HOLogic.mk_conj eqs))))
berghofe@18010
   978
            (fn _ => EVERY
wenzelm@32149
   979
               [asm_full_simp_tac (global_simpset_of thy8 addsimps (constr_rep_thm ::
berghofe@17870
   980
                  rep_inject_thms')) 1,
berghofe@17870
   981
                TRY (asm_full_simp_tac (HOL_basic_ss addsimps (fresh_def :: supp_def ::
berghofe@17870
   982
                  alpha @ abs_perm @ abs_fresh @ rep_inject_thms @
berghofe@28731
   983
                  perm_rep_perm_thms)) 1)])
berghofe@17870
   984
        end) (constrs ~~ constr_rep_thms)
berghofe@19833
   985
      end) (List.take (pdescr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss);
berghofe@17870
   986
berghofe@17872
   987
    (** equations for support and freshness **)
berghofe@17872
   988
berghofe@17872
   989
    val (supp_thms, fresh_thms) = ListPair.unzip (map ListPair.unzip
berghofe@17872
   990
      (map (fn ((((i, (_, _, constrs)), tname), inject_thms'), perm_thms') =>
berghofe@19833
   991
      let val T = nth_dtyp' i
wenzelm@32952
   992
      in maps (fn (cname, dts) => map (fn atom =>
berghofe@17872
   993
        let
berghofe@17872
   994
          val cname = Sign.intern_const thy8
wenzelm@30364
   995
            (Long_Name.append tname (Long_Name.base_name cname));
berghofe@17872
   996
          val atomT = Type (atom, []);
berghofe@17872
   997
berghofe@19833
   998
          fun process_constr ((dts, dt), (j, args1, args2)) =
berghofe@17872
   999
            let
berghofe@28731
  1000
              val Ts_idx = map (typ_of_dtyp descr'' sorts) dts ~~ (j upto j + length dts - 1);
berghofe@17872
  1001
              val xs = map (fn (T, i) => mk_Free "x" T i) Ts_idx;
berghofe@28731
  1002
              val x = mk_Free "x" (typ_of_dtyp descr'' sorts dt) (j + length dts)
berghofe@18261
  1003
            in
berghofe@18261
  1004
              (j + length dts + 1,
wenzelm@30190
  1005
               xs @ (x :: args1), List.foldr mk_abs_fun x xs :: args2)
berghofe@17872
  1006
            end;
berghofe@17872
  1007
wenzelm@30190
  1008
          val (_, args1, args2) = List.foldr process_constr (1, [], []) dts;
berghofe@17872
  1009
          val Ts = map fastype_of args1;
berghofe@17872
  1010
          val c = list_comb (Const (cname, Ts ---> T), args1);
berghofe@17872
  1011
          fun supp t =
berghofe@19494
  1012
            Const ("Nominal.supp", fastype_of t --> HOLogic.mk_setT atomT) $ t;
berghofe@25823
  1013
          fun fresh t = fresh_const atomT (fastype_of t) $ Free ("a", atomT) $ t;
wenzelm@20046
  1014
          val supp_thm = Goal.prove_global thy8 [] []
berghofe@28731
  1015
            (augment_sort thy8 pt_cp_sort
berghofe@17872
  1016
              (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17872
  1017
                (supp c,
haftmann@30450
  1018
                 if null dts then HOLogic.mk_set atomT []
haftmann@32134
  1019
                 else foldr1 (HOLogic.mk_binop @{const_name union}) (map supp args2)))))
berghofe@17872
  1020
            (fn _ =>
berghofe@18010
  1021
              simp_tac (HOL_basic_ss addsimps (supp_def ::
berghofe@17872
  1022
                 Un_assoc :: de_Morgan_conj :: Collect_disj_eq :: finite_Un ::
haftmann@32129
  1023
                 Collect_False_empty :: finite_emptyI :: simp_thms @
wenzelm@20046
  1024
                 abs_perm @ abs_fresh @ inject_thms' @ perm_thms')) 1)
berghofe@17872
  1025
        in
berghofe@17872
  1026
          (supp_thm,
berghofe@28731
  1027
           Goal.prove_global thy8 [] [] (augment_sort thy8 pt_cp_sort
berghofe@28731
  1028
             (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@28731
  1029
               (fresh c,
berghofe@28731
  1030
                if null dts then HOLogic.true_const
berghofe@28731
  1031
                else foldr1 HOLogic.mk_conj (map fresh args2)))))
berghofe@17872
  1032
             (fn _ =>
berghofe@24459
  1033
               simp_tac (HOL_ss addsimps [Un_iff, empty_iff, fresh_def, supp_thm]) 1))
wenzelm@32952
  1034
        end) atoms) constrs
berghofe@19833
  1035
      end) (List.take (pdescr, length new_type_names) ~~ new_type_names ~~ inject_thms ~~ perm_simps')));
berghofe@17872
  1036
berghofe@18107
  1037
    (**** weak induction theorem ****)
berghofe@18016
  1038
wenzelm@33244
  1039
    fun mk_indrule_lemma (((i, _), T), U) (prems, concls) =
berghofe@18016
  1040
      let
berghofe@18016
  1041
        val Rep_t = Const (List.nth (rep_names, i), T --> U) $
berghofe@18016
  1042
          mk_Free "x" T i;
berghofe@18016
  1043
berghofe@18016
  1044
        val Abs_t =  Const (List.nth (abs_names, i), U --> T)
berghofe@18016
  1045
berghofe@21021
  1046
      in (prems @ [HOLogic.imp $
berghofe@21021
  1047
            (Const (List.nth (rep_set_names'', i), U --> HOLogic.boolT) $ Rep_t) $
berghofe@18016
  1048
              (mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ (Abs_t $ Rep_t))],
berghofe@18016
  1049
          concls @ [mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ mk_Free "x" T i])
berghofe@18016
  1050
      end;
berghofe@18016
  1051
berghofe@18016
  1052
    val (indrule_lemma_prems, indrule_lemma_concls) =
wenzelm@33244
  1053
      fold mk_indrule_lemma (descr'' ~~ recTs ~~ recTs') ([], []);
berghofe@18016
  1054
wenzelm@20046
  1055
    val indrule_lemma = Goal.prove_global thy8 [] []
berghofe@18016
  1056
      (Logic.mk_implies
berghofe@18016
  1057
        (HOLogic.mk_Trueprop (mk_conj indrule_lemma_prems),
berghofe@18016
  1058
         HOLogic.mk_Trueprop (mk_conj indrule_lemma_concls))) (fn _ => EVERY
berghofe@18016
  1059
           [REPEAT (etac conjE 1),
berghofe@18016
  1060
            REPEAT (EVERY
berghofe@18016
  1061
              [TRY (rtac conjI 1), full_simp_tac (HOL_basic_ss addsimps Rep_inverse_thms) 1,
wenzelm@20046
  1062
               etac mp 1, resolve_tac Rep_thms 1])]);
berghofe@18016
  1063
berghofe@18016
  1064
    val Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule_lemma)));
berghofe@18016
  1065
    val frees = if length Ps = 1 then [Free ("P", snd (dest_Var (hd Ps)))] else
berghofe@18016
  1066
      map (Free o apfst fst o dest_Var) Ps;
berghofe@18016
  1067
    val indrule_lemma' = cterm_instantiate
berghofe@18016
  1068
      (map (cterm_of thy8) Ps ~~ map (cterm_of thy8) frees) indrule_lemma;
berghofe@18016
  1069
berghofe@19833
  1070
    val Abs_inverse_thms' = map (fn r => r RS subst) Abs_inverse_thms;
berghofe@18016
  1071
berghofe@28731
  1072
    val dt_induct_prop = DatatypeProp.make_ind descr' sorts;
wenzelm@20046
  1073
    val dt_induct = Goal.prove_global thy8 []
berghofe@18016
  1074
      (Logic.strip_imp_prems dt_induct_prop) (Logic.strip_imp_concl dt_induct_prop)
wenzelm@26711
  1075
      (fn {prems, ...} => EVERY
berghofe@18016
  1076
        [rtac indrule_lemma' 1,
berghofe@25674
  1077
         (indtac rep_induct [] THEN_ALL_NEW ObjectLogic.atomize_prems_tac) 1,
berghofe@18016
  1078
         EVERY (map (fn (prem, r) => (EVERY
berghofe@18016
  1079
           [REPEAT (eresolve_tac Abs_inverse_thms' 1),
berghofe@18016
  1080
            simp_tac (HOL_basic_ss addsimps [symmetric r]) 1,
berghofe@18016
  1081
            DEPTH_SOLVE_1 (ares_tac [prem] 1 ORELSE etac allE 1)]))
wenzelm@20046
  1082
                (prems ~~ constr_defs))]);
berghofe@18016
  1083
berghofe@18107
  1084
    val case_names_induct = mk_case_names_induct descr'';
berghofe@18016
  1085
berghofe@18066
  1086
    (**** prove that new datatypes have finite support ****)
berghofe@18066
  1087
urbanc@18246
  1088
    val _ = warning "proving finite support for the new datatype";
urbanc@18246
  1089
berghofe@18066
  1090
    val indnames = DatatypeProp.make_tnames recTs;
berghofe@18066
  1091
wenzelm@26343
  1092
    val abs_supp = PureThy.get_thms thy8 "abs_supp";
wenzelm@26343
  1093
    val supp_atm = PureThy.get_thms thy8 "supp_atm";
berghofe@18066
  1094
berghofe@18066
  1095
    val finite_supp_thms = map (fn atom =>
berghofe@18066
  1096
      let val atomT = Type (atom, [])
wenzelm@32957
  1097
      in map Drule.standard (List.take
berghofe@28731
  1098
        (split_conj_thm (Goal.prove_global thy8 [] []
berghofe@28731
  1099
           (augment_sort thy8 (fs_class_of thy8 atom :: pt_cp_sort)
berghofe@28731
  1100
             (HOLogic.mk_Trueprop
berghofe@28731
  1101
               (foldr1 HOLogic.mk_conj (map (fn (s, T) =>
berghofe@28731
  1102
                 Const ("Finite_Set.finite", HOLogic.mk_setT atomT --> HOLogic.boolT) $
berghofe@28731
  1103
                   (Const ("Nominal.supp", T --> HOLogic.mk_setT atomT) $ Free (s, T)))
berghofe@28731
  1104
                   (indnames ~~ recTs)))))
berghofe@18066
  1105
           (fn _ => indtac dt_induct indnames 1 THEN
wenzelm@32149
  1106
            ALLGOALS (asm_full_simp_tac (global_simpset_of thy8 addsimps
urbanc@18067
  1107
              (abs_supp @ supp_atm @
wenzelm@30364
  1108
               PureThy.get_thms thy8 ("fs_" ^ Long_Name.base_name atom ^ "1") @
wenzelm@32952
  1109
               flat supp_thms))))),
berghofe@18066
  1110
         length new_type_names))
berghofe@18066
  1111
      end) atoms;
berghofe@18066
  1112
krauss@18759
  1113
    val simp_atts = replicate (length new_type_names) [Simplifier.simp_add];
berghofe@18658
  1114
wenzelm@32960
  1115
        (* Function to add both the simp and eqvt attributes *)
urbanc@22245
  1116
        (* These two attributes are duplicated on all the types in the mutual nominal datatypes *)
urbanc@22245
  1117
urbanc@22245
  1118
    val simp_eqvt_atts = replicate (length new_type_names) [Simplifier.simp_add, NominalThmDecls.eqvt_add];
urbanc@22245
  1119
 
berghofe@18658
  1120
    val (_, thy9) = thy8 |>
wenzelm@24712
  1121
      Sign.add_path big_name |>
haftmann@29585
  1122
      PureThy.add_thms [((Binding.name "induct", dt_induct), [case_names_induct])] ||>>
haftmann@29585
  1123
      PureThy.add_thmss [((Binding.name "inducts", projections dt_induct), [case_names_induct])] ||>
wenzelm@24712
  1124
      Sign.parent_path ||>>
berghofe@18658
  1125
      DatatypeAux.store_thmss_atts "distinct" new_type_names simp_atts distinct_thms ||>>
berghofe@18658
  1126
      DatatypeAux.store_thmss "constr_rep" new_type_names constr_rep_thmss ||>>
urbanc@22231
  1127
      DatatypeAux.store_thmss_atts "perm" new_type_names simp_eqvt_atts perm_simps' ||>>
berghofe@18658
  1128
      DatatypeAux.store_thmss "inject" new_type_names inject_thms ||>>
berghofe@18658
  1129
      DatatypeAux.store_thmss "supp" new_type_names supp_thms ||>>
berghofe@18658
  1130
      DatatypeAux.store_thmss_atts "fresh" new_type_names simp_atts fresh_thms ||>
berghofe@18658
  1131
      fold (fn (atom, ths) => fn thy =>
berghofe@28736
  1132
        let
berghofe@28736
  1133
          val class = fs_class_of thy atom;
berghofe@28736
  1134
          val sort = Sign.certify_sort thy (class :: pt_cp_sort)
berghofe@28736
  1135
        in fold (fn Type (s, Ts) => AxClass.prove_arity
berghofe@28736
  1136
          (s, map (inter_sort thy sort o snd o dest_TFree) Ts, [class])
berghofe@28736
  1137
          (Class.intro_classes_tac [] THEN resolve_tac ths 1)) newTs thy
berghofe@18658
  1138
        end) (atoms ~~ finite_supp_thms);
berghofe@18658
  1139
berghofe@18107
  1140
    (**** strong induction theorem ****)
berghofe@18107
  1141
berghofe@18107
  1142
    val pnames = if length descr'' = 1 then ["P"]
berghofe@18107
  1143
      else map (fn i => "P" ^ string_of_int i) (1 upto length descr'');
berghofe@18245
  1144
    val ind_sort = if null dt_atomTs then HOLogic.typeS
berghofe@28731
  1145
      else Sign.certify_sort thy9 (map (fs_class_of thy9) dt_atoms);
berghofe@18107
  1146
    val fsT = TFree ("'n", ind_sort);
berghofe@18658
  1147
    val fsT' = TFree ("'n", HOLogic.typeS);
berghofe@18107
  1148
berghofe@18658
  1149
    val fresh_fs = map (fn (s, T) => (T, Free (s, fsT' --> HOLogic.mk_setT T)))
berghofe@18658
  1150
      (DatatypeProp.indexify_names (replicate (length dt_atomTs) "f") ~~ dt_atomTs);
berghofe@18658
  1151
berghofe@18658
  1152
    fun make_pred fsT i T =
berghofe@18302
  1153
      Free (List.nth (pnames, i), fsT --> T --> HOLogic.boolT);
berghofe@18107
  1154
berghofe@19851
  1155
    fun mk_fresh1 xs [] = []
berghofe@19851
  1156
      | mk_fresh1 xs ((y as (_, T)) :: ys) = map (fn x => HOLogic.mk_Trueprop
berghofe@19851
  1157
            (HOLogic.mk_not (HOLogic.mk_eq (Free y, Free x))))
berghofe@19851
  1158
              (filter (fn (_, U) => T = U) (rev xs)) @
berghofe@19851
  1159
          mk_fresh1 (y :: xs) ys;
berghofe@19851
  1160
berghofe@19851
  1161
    fun mk_fresh2 xss [] = []
wenzelm@32952
  1162
      | mk_fresh2 xss ((p as (ys, _)) :: yss) = maps (fn y as (_, T) =>
berghofe@19851
  1163
            map (fn (_, x as (_, U)) => HOLogic.mk_Trueprop
wenzelm@32952
  1164
              (fresh_const T U $ Free y $ Free x)) (rev xss @ yss)) ys @
berghofe@19851
  1165
          mk_fresh2 (p :: xss) yss;
berghofe@19851
  1166
berghofe@18658
  1167
    fun make_ind_prem fsT f k T ((cname, cargs), idxs) =
berghofe@18107
  1168
      let
berghofe@18107
  1169
        val recs = List.filter is_rec_type cargs;
berghofe@28731
  1170
        val Ts = map (typ_of_dtyp descr'' sorts) cargs;
berghofe@28731
  1171
        val recTs' = map (typ_of_dtyp descr'' sorts) recs;
wenzelm@20071
  1172
        val tnames = Name.variant_list pnames (DatatypeProp.make_tnames Ts);
berghofe@18107
  1173
        val rec_tnames = map fst (List.filter (is_rec_type o snd) (tnames ~~ cargs));
berghofe@18107
  1174
        val frees = tnames ~~ Ts;
berghofe@19710
  1175
        val frees' = partition_cargs idxs frees;
wenzelm@20071
  1176
        val z = (Name.variant tnames "z", fsT);
berghofe@18107
  1177
berghofe@18107
  1178
        fun mk_prem ((dt, s), T) =
berghofe@18107
  1179
          let
berghofe@18107
  1180
            val (Us, U) = strip_type T;
berghofe@18107
  1181
            val l = length Us
berghofe@18107
  1182
          in list_all (z :: map (pair "x") Us, HOLogic.mk_Trueprop
berghofe@18658
  1183
            (make_pred fsT (body_index dt) U $ Bound l $ app_bnds (Free (s, T)) l))
berghofe@18107
  1184
          end;
berghofe@18107
  1185
berghofe@18107
  1186
        val prems = map mk_prem (recs ~~ rec_tnames ~~ recTs');
berghofe@18107
  1187
        val prems' = map (fn p as (_, T) => HOLogic.mk_Trueprop
wenzelm@32952
  1188
            (f T (Free p) (Free z))) (maps fst frees') @
wenzelm@32952
  1189
          mk_fresh1 [] (maps fst frees') @
berghofe@19710
  1190
          mk_fresh2 [] frees'
berghofe@18107
  1191
berghofe@18302
  1192
      in list_all_free (frees @ [z], Logic.list_implies (prems' @ prems,
berghofe@18658
  1193
        HOLogic.mk_Trueprop (make_pred fsT k T $ Free z $
berghofe@18302
  1194
          list_comb (Const (cname, Ts ---> T), map Free frees))))
berghofe@18107
  1195
      end;
berghofe@18107
  1196
wenzelm@32952
  1197
    val ind_prems = maps (fn (((i, (_, _, constrs)), (_, idxss)), T) =>
berghofe@18658
  1198
      map (make_ind_prem fsT (fn T => fn t => fn u =>
berghofe@25823
  1199
        fresh_const T fsT $ t $ u) i T)
wenzelm@32952
  1200
          (constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs);
berghofe@18107
  1201
    val tnames = DatatypeProp.make_tnames recTs;
wenzelm@20071
  1202
    val zs = Name.variant_list tnames (replicate (length descr'') "z");
berghofe@18107
  1203
    val ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18658
  1204
      (map (fn ((((i, _), T), tname), z) =>
berghofe@18658
  1205
        make_pred fsT i T $ Free (z, fsT) $ Free (tname, T))
berghofe@18658
  1206
        (descr'' ~~ recTs ~~ tnames ~~ zs)));
berghofe@18107
  1207
    val induct = Logic.list_implies (ind_prems, ind_concl);
berghofe@18107
  1208
berghofe@18658
  1209
    val ind_prems' =
berghofe@18658
  1210
      map (fn (_, f as Free (_, T)) => list_all_free ([("x", fsT')],
berghofe@26806
  1211
        HOLogic.mk_Trueprop (Const ("Finite_Set.finite",
berghofe@26806
  1212
          (snd (split_last (binder_types T)) --> HOLogic.boolT) -->
berghofe@26806
  1213
            HOLogic.boolT) $ (f $ Free ("x", fsT'))))) fresh_fs @
wenzelm@32952
  1214
      maps (fn (((i, (_, _, constrs)), (_, idxss)), T) =>
berghofe@18658
  1215
        map (make_ind_prem fsT' (fn T => fn t => fn u => HOLogic.Not $
berghofe@18658
  1216
          HOLogic.mk_mem (t, the (AList.lookup op = fresh_fs T) $ u)) i T)
wenzelm@32952
  1217
            (constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs);
berghofe@18658
  1218
    val ind_concl' = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18658
  1219
      (map (fn ((((i, _), T), tname), z) =>
berghofe@18658
  1220
        make_pred fsT' i T $ Free (z, fsT') $ Free (tname, T))
berghofe@18658
  1221
        (descr'' ~~ recTs ~~ tnames ~~ zs)));
berghofe@18658
  1222
    val induct' = Logic.list_implies (ind_prems', ind_concl');
berghofe@18658
  1223
berghofe@18658
  1224
    val aux_ind_vars =
berghofe@18658
  1225
      (DatatypeProp.indexify_names (replicate (length dt_atomTs) "pi") ~~
berghofe@18658
  1226
       map mk_permT dt_atomTs) @ [("z", fsT')];
berghofe@18658
  1227
    val aux_ind_Ts = rev (map snd aux_ind_vars);
berghofe@18658
  1228
    val aux_ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18658
  1229
      (map (fn (((i, _), T), tname) =>
berghofe@18658
  1230
        HOLogic.list_all (aux_ind_vars, make_pred fsT' i T $ Bound 0 $
berghofe@22311
  1231
          fold_rev (mk_perm aux_ind_Ts) (map Bound (length dt_atomTs downto 1))
berghofe@22311
  1232
            (Free (tname, T))))
berghofe@18658
  1233
        (descr'' ~~ recTs ~~ tnames)));
berghofe@18658
  1234
berghofe@28731
  1235
    val fin_set_supp = map (fn s =>
berghofe@28731
  1236
      at_inst_of thy9 s RS at_fin_set_supp) dt_atoms;
berghofe@28731
  1237
    val fin_set_fresh = map (fn s =>
berghofe@28731
  1238
      at_inst_of thy9 s RS at_fin_set_fresh) dt_atoms;
berghofe@25951
  1239
    val pt1_atoms = map (fn Type (s, _) =>
wenzelm@30364
  1240
      PureThy.get_thm thy9 ("pt_" ^ Long_Name.base_name s ^ "1")) dt_atomTs;
berghofe@25951
  1241
    val pt2_atoms = map (fn Type (s, _) =>
wenzelm@30364
  1242
      PureThy.get_thm thy9 ("pt_" ^ Long_Name.base_name s ^ "2") RS sym) dt_atomTs;
wenzelm@26343
  1243
    val exists_fresh' = PureThy.get_thms thy9 "exists_fresh'";
wenzelm@26343
  1244
    val fs_atoms = PureThy.get_thms thy9 "fin_supp";
wenzelm@26343
  1245
    val abs_supp = PureThy.get_thms thy9 "abs_supp";
wenzelm@26343
  1246
    val perm_fresh_fresh = PureThy.get_thms thy9 "perm_fresh_fresh";
wenzelm@26343
  1247
    val calc_atm = PureThy.get_thms thy9 "calc_atm";
wenzelm@26343
  1248
    val fresh_atm = PureThy.get_thms thy9 "fresh_atm";
wenzelm@26343
  1249
    val fresh_left = PureThy.get_thms thy9 "fresh_left";
wenzelm@26343
  1250
    val perm_swap = PureThy.get_thms thy9 "perm_swap";
berghofe@18658
  1251
berghofe@25951
  1252
    fun obtain_fresh_name' ths ts T (freshs1, freshs2, ctxt) =
berghofe@18658
  1253
      let
berghofe@25951
  1254
        val p = foldr1 HOLogic.mk_prod (ts @ freshs1);
berghofe@25951
  1255
        val ex = Goal.prove ctxt [] [] (HOLogic.mk_Trueprop
berghofe@25951
  1256
            (HOLogic.exists_const T $ Abs ("x", T,
berghofe@25951
  1257
              fresh_const T (fastype_of p) $
berghofe@25951
  1258
                Bound 0 $ p)))
berghofe@25951
  1259
          (fn _ => EVERY
berghofe@25951
  1260
            [resolve_tac exists_fresh' 1,
berghofe@25951
  1261
             simp_tac (HOL_ss addsimps (supp_prod :: finite_Un :: fs_atoms @
berghofe@25951
  1262
               fin_set_supp @ ths)) 1]);
wenzelm@32202
  1263
        val (([(_, cx)], ths), ctxt') = Obtain.result
berghofe@25951
  1264
          (fn _ => EVERY
berghofe@25951
  1265
            [etac exE 1,
berghofe@25951
  1266
             full_simp_tac (HOL_ss addsimps (fresh_prod :: fresh_atm)) 1,
berghofe@25951
  1267
             REPEAT (etac conjE 1)])
berghofe@25951
  1268
          [ex] ctxt
berghofe@25951
  1269
      in (freshs1 @ [term_of cx], freshs2 @ ths, ctxt') end;
berghofe@25951
  1270
berghofe@25951
  1271
    fun fresh_fresh_inst thy a b =
berghofe@25951
  1272
      let
berghofe@25951
  1273
        val T = fastype_of a;
berghofe@25951
  1274
        val SOME th = find_first (fn th => case prop_of th of
berghofe@25951
  1275
            _ $ (_ $ (Const (_, Type (_, [U, _])) $ _ $ _)) $ _ => U = T
berghofe@25951
  1276
          | _ => false) perm_fresh_fresh
berghofe@18658
  1277
      in
berghofe@25951
  1278
        Drule.instantiate' []
berghofe@25951
  1279
          [SOME (cterm_of thy a), NONE, SOME (cterm_of thy b)] th
berghofe@18658
  1280
      end;
urbanc@18104
  1281
berghofe@28731
  1282
    val fs_cp_sort =
berghofe@28731
  1283
      map (fs_class_of thy9) dt_atoms @
haftmann@33040
  1284
      maps (fn s => map (cp_class_of thy9 s) (remove (op =) s dt_atoms)) dt_atoms;
berghofe@28731
  1285
berghofe@19710
  1286
    (**********************************************************************
berghofe@19710
  1287
      The subgoals occurring in the proof of induct_aux have the
berghofe@19710
  1288
      following parameters:
berghofe@19710
  1289
berghofe@25951
  1290
        x_1 ... x_k p_1 ... p_m z
berghofe@19710
  1291
berghofe@19710
  1292
      where
berghofe@19710
  1293
berghofe@19710
  1294
        x_i : constructor arguments (introduced by weak induction rule)
berghofe@19710
  1295
        p_i : permutations (one for each atom type in the data type)
berghofe@19710
  1296
        z   : freshness context
berghofe@19710
  1297
    ***********************************************************************)
berghofe@19710
  1298
berghofe@19710
  1299
    val _ = warning "proving strong induction theorem ...";
berghofe@19710
  1300
berghofe@28731
  1301
    val induct_aux = Goal.prove_global thy9 []
berghofe@28731
  1302
        (map (augment_sort thy9 fs_cp_sort) ind_prems')
berghofe@28731
  1303
        (augment_sort thy9 fs_cp_sort ind_concl') (fn {prems, context} =>
berghofe@25951
  1304
      let
berghofe@25951
  1305
        val (prems1, prems2) = chop (length dt_atomTs) prems;
berghofe@25951
  1306
        val ind_ss2 = HOL_ss addsimps
berghofe@25951
  1307
          finite_Diff :: abs_fresh @ abs_supp @ fs_atoms;
berghofe@25951
  1308
        val ind_ss1 = ind_ss2 addsimps fresh_left @ calc_atm @
berghofe@25951
  1309
          fresh_atm @ rev_simps @ app_simps;
berghofe@25951
  1310
        val ind_ss3 = HOL_ss addsimps abs_fun_eq1 ::
berghofe@25951
  1311
          abs_perm @ calc_atm @ perm_swap;
berghofe@25951
  1312
        val ind_ss4 = HOL_basic_ss addsimps fresh_left @ prems1 @
berghofe@25951
  1313
          fin_set_fresh @ calc_atm;
berghofe@25951
  1314
        val ind_ss5 = HOL_basic_ss addsimps pt1_atoms;
berghofe@25951
  1315
        val ind_ss6 = HOL_basic_ss addsimps flat perm_simps';
berghofe@28731
  1316
        val th = Goal.prove context [] []
berghofe@28731
  1317
          (augment_sort thy9 fs_cp_sort aux_ind_concl)
berghofe@25951
  1318
          (fn {context = context1, ...} =>
berghofe@25951
  1319
             EVERY (indtac dt_induct tnames 1 ::
berghofe@25951
  1320
               maps (fn ((_, (_, _, constrs)), (_, constrs')) =>
berghofe@25951
  1321
                 map (fn ((cname, cargs), is) =>
berghofe@25951
  1322
                   REPEAT (rtac allI 1) THEN
berghofe@25951
  1323
                   SUBPROOF (fn {prems = iprems, params, concl,
berghofe@25951
  1324
                       context = context2, ...} =>
berghofe@18658
  1325
                     let
berghofe@25951
  1326
                       val concl' = term_of concl;
berghofe@25951
  1327
                       val _ $ (_ $ _ $ u) = concl';
berghofe@25951
  1328
                       val U = fastype_of u;
berghofe@25951
  1329
                       val (xs, params') =
wenzelm@32202
  1330
                         chop (length cargs) (map (term_of o #2) params);
berghofe@25951
  1331
                       val Ts = map fastype_of xs;
berghofe@25951
  1332
                       val cnstr = Const (cname, Ts ---> U);
berghofe@25951
  1333
                       val (pis, z) = split_last params';
berghofe@25951
  1334
                       val mk_pi = fold_rev (mk_perm []) pis;
berghofe@25951
  1335
                       val xs' = partition_cargs is xs;
berghofe@25951
  1336
                       val xs'' = map (fn (ts, u) => (map mk_pi ts, mk_pi u)) xs';
berghofe@25951
  1337
                       val ts = maps (fn (ts, u) => ts @ [u]) xs'';
berghofe@25951
  1338
                       val (freshs1, freshs2, context3) = fold (fn t =>
berghofe@25951
  1339
                         let val T = fastype_of t
berghofe@25951
  1340
                         in obtain_fresh_name' prems1
berghofe@25951
  1341
                           (the (AList.lookup op = fresh_fs T) $ z :: ts) T
berghofe@25951
  1342
                         end) (maps fst xs') ([], [], context2);
berghofe@25951
  1343
                       val freshs1' = unflat (map fst xs') freshs1;
berghofe@25951
  1344
                       val freshs2' = map (Simplifier.simplify ind_ss4)
berghofe@25951
  1345
                         (mk_not_sym freshs2);
berghofe@25951
  1346
                       val ind_ss1' = ind_ss1 addsimps freshs2';
berghofe@25951
  1347
                       val ind_ss3' = ind_ss3 addsimps freshs2';
berghofe@25951
  1348
                       val rename_eq =
berghofe@25951
  1349
                         if forall (null o fst) xs' then []
berghofe@25951
  1350
                         else [Goal.prove context3 [] []
berghofe@25951
  1351
                           (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@25951
  1352
                             (list_comb (cnstr, ts),
berghofe@25951
  1353
                              list_comb (cnstr, maps (fn ((bs, t), cs) =>
berghofe@25951
  1354
                                cs @ [fold_rev (mk_perm []) (map perm_of_pair
berghofe@25951
  1355
                                  (bs ~~ cs)) t]) (xs'' ~~ freshs1')))))
berghofe@25951
  1356
                           (fn _ => EVERY
berghofe@25951
  1357
                              (simp_tac (HOL_ss addsimps flat inject_thms) 1 ::
berghofe@25951
  1358
                               REPEAT (FIRSTGOAL (rtac conjI)) ::
berghofe@25951
  1359
                               maps (fn ((bs, t), cs) =>
berghofe@25951
  1360
                                 if null bs then []
berghofe@25951
  1361
                                 else rtac sym 1 :: maps (fn (b, c) =>
berghofe@25951
  1362
                                   [rtac trans 1, rtac sym 1,
berghofe@25951
  1363
                                    rtac (fresh_fresh_inst thy9 b c) 1,
berghofe@25951
  1364
                                    simp_tac ind_ss1' 1,
berghofe@25951
  1365
                                    simp_tac ind_ss2 1,
berghofe@25951
  1366
                                    simp_tac ind_ss3' 1]) (bs ~~ cs))
berghofe@25951
  1367
                                 (xs'' ~~ freshs1')))];
berghofe@25951
  1368
                       val th = Goal.prove context3 [] [] concl' (fn _ => EVERY
berghofe@25951
  1369
                         [simp_tac (ind_ss6 addsimps rename_eq) 1,
berghofe@25951
  1370
                          cut_facts_tac iprems 1,
berghofe@25951
  1371
                          (resolve_tac prems THEN_ALL_NEW
berghofe@25951
  1372
                            SUBGOAL (fn (t, i) => case Logic.strip_assums_concl t of
berghofe@25951
  1373
                                _ $ (Const ("Nominal.fresh", _) $ _ $ _) =>
berghofe@25951
  1374
                                  simp_tac ind_ss1' i
berghofe@25951
  1375
                              | _ $ (Const ("Not", _) $ _) =>
berghofe@25951
  1376
                                  resolve_tac freshs2' i
berghofe@25951
  1377
                              | _ => asm_simp_tac (HOL_basic_ss addsimps
berghofe@25951
  1378
                                  pt2_atoms addsimprocs [perm_simproc]) i)) 1])
berghofe@25951
  1379
                       val final = ProofContext.export context3 context2 [th]
berghofe@18658
  1380
                     in
berghofe@25951
  1381
                       resolve_tac final 1
berghofe@25951
  1382
                     end) context1 1) (constrs ~~ constrs')) (descr'' ~~ ndescr)))
berghofe@25951
  1383
      in
berghofe@25951
  1384
        EVERY
berghofe@25951
  1385
          [cut_facts_tac [th] 1,
wenzelm@27228
  1386
           REPEAT (eresolve_tac [conjE, @{thm allE_Nil}] 1),
berghofe@25951
  1387
           REPEAT (etac allE 1),
berghofe@25951
  1388
           REPEAT (TRY (rtac conjI 1) THEN asm_full_simp_tac ind_ss5 1)]
berghofe@25951
  1389
      end);
berghofe@18658
  1390
berghofe@18658
  1391
    val induct_aux' = Thm.instantiate ([],
berghofe@28731
  1392
      map (fn (s, v as Var (_, T)) =>
berghofe@28731
  1393
        (cterm_of thy9 v, cterm_of thy9 (Free (s, T))))
berghofe@28731
  1394
          (pnames ~~ map head_of (HOLogic.dest_conj
berghofe@28731
  1395
             (HOLogic.dest_Trueprop (concl_of induct_aux)))) @
berghofe@18658
  1396
      map (fn (_, f) =>
berghofe@18658
  1397
        let val f' = Logic.varify f
berghofe@18658
  1398
        in (cterm_of thy9 f',
berghofe@19494
  1399
          cterm_of thy9 (Const ("Nominal.supp", fastype_of f')))
berghofe@18658
  1400
        end) fresh_fs) induct_aux;
berghofe@18658
  1401
berghofe@28731
  1402
    val induct = Goal.prove_global thy9 []
berghofe@28731
  1403
      (map (augment_sort thy9 fs_cp_sort) ind_prems)
berghofe@28731
  1404
      (augment_sort thy9 fs_cp_sort ind_concl)
wenzelm@26711
  1405
      (fn {prems, ...} => EVERY
berghofe@18658
  1406
         [rtac induct_aux' 1,
berghofe@25951
  1407
          REPEAT (resolve_tac fs_atoms 1),
berghofe@18658
  1408
          REPEAT ((resolve_tac prems THEN_ALL_NEW
wenzelm@20046
  1409
            (etac meta_spec ORELSE' full_simp_tac (HOL_basic_ss addsimps [fresh_def]))) 1)])
berghofe@18658
  1410
berghofe@18658
  1411
    val (_, thy10) = thy9 |>
wenzelm@24712
  1412
      Sign.add_path big_name |>
haftmann@29585
  1413
      PureThy.add_thms [((Binding.name "strong_induct'", induct_aux), [])] ||>>
haftmann@29585
  1414
      PureThy.add_thms [((Binding.name "strong_induct", induct), [case_names_induct])] ||>>
haftmann@29585
  1415
      PureThy.add_thmss [((Binding.name "strong_inducts", projections induct), [case_names_induct])];
berghofe@18658
  1416
berghofe@19322
  1417
    (**** recursion combinator ****)
berghofe@19251
  1418
berghofe@19322
  1419
    val _ = warning "defining recursion combinator ...";
berghofe@19251
  1420
wenzelm@30190
  1421
    val used = List.foldr OldTerm.add_typ_tfree_names [] recTs;
berghofe@19251
  1422
berghofe@28731
  1423
    val (rec_result_Ts', rec_fn_Ts') = DatatypeProp.make_primrec_Ts descr' sorts used;
berghofe@19985
  1424
wenzelm@21365
  1425
    val rec_sort = if null dt_atomTs then HOLogic.typeS else
berghofe@28731
  1426
      Sign.certify_sort thy10 pt_cp_sort;
berghofe@19985
  1427
berghofe@19985
  1428
    val rec_result_Ts = map (fn TFree (s, _) => TFree (s, rec_sort)) rec_result_Ts';
berghofe@19985
  1429
    val rec_fn_Ts = map (typ_subst_atomic (rec_result_Ts' ~~ rec_result_Ts)) rec_fn_Ts';
berghofe@19251
  1430
berghofe@21021
  1431
    val rec_set_Ts = map (fn (T1, T2) =>
berghofe@21021
  1432
      rec_fn_Ts @ [T1, T2] ---> HOLogic.boolT) (recTs ~~ rec_result_Ts);
berghofe@19251
  1433
berghofe@19322
  1434
    val big_rec_name = big_name ^ "_rec_set";
berghofe@21021
  1435
    val rec_set_names' =
berghofe@21021
  1436
      if length descr'' = 1 then [big_rec_name] else
berghofe@21021
  1437
        map ((curry (op ^) (big_rec_name ^ "_")) o string_of_int)
berghofe@21021
  1438
          (1 upto (length descr''));
haftmann@28965
  1439
    val rec_set_names =  map (Sign.full_bname thy10) rec_set_names';
berghofe@19251
  1440
berghofe@19322
  1441
    val rec_fns = map (uncurry (mk_Free "f"))
berghofe@19322
  1442
      (rec_fn_Ts ~~ (1 upto (length rec_fn_Ts)));
berghofe@21021
  1443
    val rec_sets' = map (fn c => list_comb (Free c, rec_fns))
berghofe@21021
  1444
      (rec_set_names' ~~ rec_set_Ts);
berghofe@19322
  1445
    val rec_sets = map (fn c => list_comb (Const c, rec_fns))
berghofe@19322
  1446
      (rec_set_names ~~ rec_set_Ts);
berghofe@19251
  1447
berghofe@19322
  1448
    (* introduction rules for graph of recursion function *)
berghofe@19251
  1449
berghofe@20145
  1450
    val rec_preds = map (fn (a, T) =>
berghofe@20145
  1451
      Free (a, T --> HOLogic.boolT)) (pnames ~~ rec_result_Ts);
berghofe@20145
  1452
berghofe@20267
  1453
    fun mk_fresh3 rs [] = []
wenzelm@32952
  1454
      | mk_fresh3 rs ((p as (ys, z)) :: yss) = maps (fn y as (_, T) =>
wenzelm@32952
  1455
            map_filter (fn ((_, (_, x)), r as (_, U)) => if z = x then NONE
berghofe@20267
  1456
              else SOME (HOLogic.mk_Trueprop
wenzelm@32952
  1457
                (fresh_const T U $ Free y $ Free r))) rs) ys @
berghofe@20267
  1458
          mk_fresh3 rs yss;
berghofe@20267
  1459
berghofe@21088
  1460
    (* FIXME: avoid collisions with other variable names? *)
berghofe@21088
  1461
    val rec_ctxt = Free ("z", fsT');
berghofe@21088
  1462
wenzelm@33244
  1463
    fun make_rec_intr T p rec_set ((cname, cargs), idxs)
wenzelm@33244
  1464
        (rec_intr_ts, rec_prems, rec_prems', rec_eq_prems, l) =
berghofe@19251
  1465
      let
berghofe@28731
  1466
        val Ts = map (typ_of_dtyp descr'' sorts) cargs;
berghofe@19851
  1467
        val frees = map (fn i => "x" ^ string_of_int i) (1 upto length Ts) ~~ Ts;
berghofe@19851
  1468
        val frees' = partition_cargs idxs frees;
wenzelm@32952
  1469
        val binders = maps fst frees';
berghofe@20411
  1470
        val atomTs = distinct op = (maps (map snd o fst) frees');
wenzelm@32952
  1471
        val recs = map_filter
berghofe@20145
  1472
          (fn ((_, DtRec i), p) => SOME (i, p) | _ => NONE)
berghofe@19851
  1473
          (partition_cargs idxs cargs ~~ frees');
berghofe@19851
  1474
        val frees'' = map (fn i => "y" ^ string_of_int i) (1 upto length recs) ~~
berghofe@19851
  1475
          map (fn (i, _) => List.nth (rec_result_Ts, i)) recs;
berghofe@20145
  1476
        val prems1 = map (fn ((i, (_, x)), y) => HOLogic.mk_Trueprop
berghofe@21021
  1477
          (List.nth (rec_sets', i) $ Free x $ Free y)) (recs ~~ frees'');
berghofe@20145
  1478
        val prems2 =
berghofe@20145
  1479
          map (fn f => map (fn p as (_, T) => HOLogic.mk_Trueprop
berghofe@25823
  1480
            (fresh_const T (fastype_of f) $ Free p $ f)) binders) rec_fns;
berghofe@21088
  1481
        val prems3 = mk_fresh1 [] binders @ mk_fresh2 [] frees';
berghofe@20145
  1482
        val prems4 = map (fn ((i, _), y) =>
berghofe@20145
  1483
          HOLogic.mk_Trueprop (List.nth (rec_preds, i) $ Free y)) (recs ~~ frees'');
berghofe@20267
  1484
        val prems5 = mk_fresh3 (recs ~~ frees'') frees';
berghofe@20411
  1485
        val prems6 = maps (fn aT => map (fn y as (_, T) => HOLogic.mk_Trueprop
berghofe@22274
  1486
          (Const ("Finite_Set.finite", HOLogic.mk_setT aT --> HOLogic.boolT) $
berghofe@22274
  1487
             (Const ("Nominal.supp", T --> HOLogic.mk_setT aT) $ Free y)))
berghofe@20411
  1488
               frees'') atomTs;
berghofe@21088
  1489
        val prems7 = map (fn x as (_, T) => HOLogic.mk_Trueprop
berghofe@25823
  1490
          (fresh_const T fsT' $ Free x $ rec_ctxt)) binders;
berghofe@20145
  1491
        val result = list_comb (List.nth (rec_fns, l), map Free (frees @ frees''));
berghofe@20376
  1492
        val result_freshs = map (fn p as (_, T) =>
berghofe@25823
  1493
          fresh_const T (fastype_of result) $ Free p $ result) binders;
berghofe@20145
  1494
        val P = HOLogic.mk_Trueprop (p $ result)
berghofe@20145
  1495
      in
wenzelm@32952
  1496
        (rec_intr_ts @ [Logic.list_implies (flat prems2 @ prems3 @ prems1,
berghofe@21021
  1497
           HOLogic.mk_Trueprop (rec_set $
berghofe@21021
  1498
             list_comb (Const (cname, Ts ---> T), map Free frees) $ result))],
berghofe@20145
  1499
         rec_prems @ [list_all_free (frees @ frees'', Logic.list_implies (prems4, P))],
berghofe@21054
  1500
         rec_prems' @ map (fn fr => list_all_free (frees @ frees'',
berghofe@21088
  1501
           Logic.list_implies (List.nth (prems2, l) @ prems3 @ prems5 @ prems7 @ prems6 @ [P],
berghofe@21054
  1502
             HOLogic.mk_Trueprop fr))) result_freshs,
wenzelm@32952
  1503
         rec_eq_prems @ [flat prems2 @ prems3],
berghofe@20145
  1504
         l + 1)
berghofe@19251
  1505
      end;
berghofe@19251
  1506
berghofe@20397
  1507
    val (rec_intr_ts, rec_prems, rec_prems', rec_eq_prems, _) =
wenzelm@33244
  1508
      fold (fn ((((d, d'), T), p), rec_set) =>
wenzelm@33244
  1509
        fold (make_rec_intr T p rec_set) (#3 (snd d) ~~ snd d'))
wenzelm@33244
  1510
          (descr'' ~~ ndescr ~~ recTs ~~ rec_preds ~~ rec_sets')
wenzelm@33244
  1511
          ([], [], [], [], 0);
berghofe@19251
  1512
wenzelm@21365
  1513
    val ({intrs = rec_intrs, elims = rec_elims, raw_induct = rec_induct, ...}, thy11) =
wenzelm@33278
  1514
      thy10
wenzelm@33278
  1515
      |> Sign.map_naming Name_Space.conceal
wenzelm@33278
  1516
      |> Inductive.add_inductive_global (serial ())
haftmann@31671
  1517
          {quiet_mode = #quiet config, verbose = false, kind = Thm.internalK,
haftmann@28965
  1518
           alt_name = Binding.name big_rec_name, coind = false, no_elim = false, no_ind = false,
wenzelm@29389
  1519
           skip_mono = true, fork_mono = false}
haftmann@28965
  1520
          (map (fn (s, T) => ((Binding.name s, T), NoSyn)) (rec_set_names' ~~ rec_set_Ts))
wenzelm@26128
  1521
          (map dest_Free rec_fns)
wenzelm@33278
  1522
          (map (fn x => (Attrib.empty_binding, x)) rec_intr_ts) []
wenzelm@33278
  1523
      ||> PureThy.hide_fact true (Long_Name.append (Sign.full_bname thy10 big_rec_name) "induct")
wenzelm@33278
  1524
      ||> Sign.restore_naming thy10;
berghofe@19251
  1525
berghofe@19985
  1526
    (** equivariance **)
berghofe@19985
  1527
wenzelm@26343
  1528
    val fresh_bij = PureThy.get_thms thy11 "fresh_bij";
wenzelm@26343
  1529
    val perm_bij = PureThy.get_thms thy11 "perm_bij";
berghofe@19985
  1530
berghofe@19985
  1531
    val (rec_equiv_thms, rec_equiv_thms') = ListPair.unzip (map (fn aT =>
berghofe@19985
  1532
      let
berghofe@19985
  1533
        val permT = mk_permT aT;
berghofe@19985
  1534
        val pi = Free ("pi", permT);
berghofe@22311
  1535
        val rec_fns_pi = map (mk_perm [] pi o uncurry (mk_Free "f"))
berghofe@19985
  1536
          (rec_fn_Ts ~~ (1 upto (length rec_fn_Ts)));
berghofe@19985
  1537
        val rec_sets_pi = map (fn c => list_comb (Const c, rec_fns_pi))
berghofe@19985
  1538
          (rec_set_names ~~ rec_set_Ts);
berghofe@19985
  1539
        val ps = map (fn ((((T, U), R), R'), i) =>
berghofe@19985
  1540
          let
berghofe@19985
  1541
            val x = Free ("x" ^ string_of_int i, T);
berghofe@19985
  1542
            val y = Free ("y" ^ string_of_int i, U)
berghofe@19985
  1543
          in
berghofe@22311
  1544
            (R $ x $ y, R' $ mk_perm [] pi x $ mk_perm [] pi y)
berghofe@19985
  1545
          end) (recTs ~~ rec_result_Ts ~~ rec_sets ~~ rec_sets_pi ~~ (1 upto length recTs));
wenzelm@32957
  1546
        val ths = map (fn th => Drule.standard (th RS mp)) (split_conj_thm
wenzelm@20046
  1547
          (Goal.prove_global thy11 [] []
berghofe@28731
  1548
            (augment_sort thy1 pt_cp_sort
berghofe@28731
  1549
              (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map HOLogic.mk_imp ps))))
berghofe@19985
  1550
            (fn _ => rtac rec_induct 1 THEN REPEAT
berghofe@27450
  1551
               (simp_tac (Simplifier.theory_context thy11 HOL_basic_ss
berghofe@27450
  1552
                  addsimps flat perm_simps'
berghofe@27450
  1553
                  addsimprocs [NominalPermeq.perm_simproc_app]) 1 THEN
berghofe@19985
  1554
                (resolve_tac rec_intrs THEN_ALL_NEW
berghofe@19985
  1555
                 asm_simp_tac (HOL_ss addsimps (fresh_bij @ perm_bij))) 1))))
wenzelm@20046
  1556
        val ths' = map (fn ((P, Q), th) =>
wenzelm@20046
  1557
          Goal.prove_global thy11 [] []
berghofe@28731
  1558
            (augment_sort thy1 pt_cp_sort
berghofe@28731
  1559
              (Logic.mk_implies (HOLogic.mk_Trueprop Q, HOLogic.mk_Trueprop P)))
berghofe@19985
  1560
            (fn _ => dtac (Thm.instantiate ([],
berghofe@19985
  1561
                 [(cterm_of thy11 (Var (("pi", 0), permT)),
berghofe@19985
  1562
                   cterm_of thy11 (Const ("List.rev", permT --> permT) $ pi))]) th) 1 THEN
wenzelm@20046
  1563
               NominalPermeq.perm_simp_tac HOL_ss 1)) (ps ~~ ths)
berghofe@19985
  1564
      in (ths, ths') end) dt_atomTs);
berghofe@19985
  1565
berghofe@19985
  1566
    (** finite support **)
berghofe@19985
  1567
berghofe@19985
  1568
    val rec_fin_supp_thms = map (fn aT =>
berghofe@19985
  1569
      let
wenzelm@30364
  1570
        val name = Long_Name.base_name (fst (dest_Type aT));
wenzelm@26343
  1571
        val fs_name = PureThy.get_thm thy11 ("fs_" ^ name ^ "1");
berghofe@19985
  1572
        val aset = HOLogic.mk_setT aT;
berghofe@22274
  1573
        val finite = Const ("Finite_Set.finite", aset --> HOLogic.boolT);
berghofe@22274
  1574
        val fins = map (fn (f, T) => HOLogic.mk_Trueprop
berghofe@22274
  1575
          (finite $ (Const ("Nominal.supp", T --> aset) $ f)))
berghofe@19985
  1576
            (rec_fns ~~ rec_fn_Ts)
berghofe@19985
  1577
      in
wenzelm@32957
  1578
        map (fn th => Drule.standard (th RS mp)) (split_conj_thm
berghofe@28731
  1579
          (Goal.prove_global thy11 []
berghofe@28731
  1580
            (map (augment_sort thy11 fs_cp_sort) fins)
berghofe@28731
  1581
            (augment_sort thy11 fs_cp_sort
berghofe@28731
  1582
              (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@28731
  1583
                (map (fn (((T, U), R), i) =>
berghofe@28731
  1584
                   let
berghofe@28731
  1585
                     val x = Free ("x" ^ string_of_int i, T);
berghofe@28731
  1586
                     val y = Free ("y" ^ string_of_int i, U)
berghofe@28731
  1587
                   in
berghofe@28731
  1588
                     HOLogic.mk_imp (R $ x $ y,
berghofe@28731
  1589
                       finite $ (Const ("Nominal.supp", U --> aset) $ y))
berghofe@28731
  1590
                   end) (recTs ~~ rec_result_Ts ~~ rec_sets ~~
berghofe@28731
  1591
                     (1 upto length recTs))))))
wenzelm@26711
  1592
            (fn {prems = fins, ...} =>
wenzelm@26711
  1593
              (rtac rec_induct THEN_ALL_NEW cut_facts_tac fins) 1 THEN REPEAT
berghofe@19985
  1594
               (NominalPermeq.finite_guess_tac (HOL_ss addsimps [fs_name]) 1))))
berghofe@19985
  1595
      end) dt_atomTs;
berghofe@19985
  1596
berghofe@20376
  1597
    (** freshness **)
berghofe@20376
  1598
berghofe@20376
  1599
    val finite_premss = map (fn aT =>
berghofe@22274
  1600
      map (fn (f, T) => HOLogic.mk_Trueprop
berghofe@22274
  1601
        (Const ("Finite_Set.finite", HOLogic.mk_setT aT --> HOLogic.boolT) $
berghofe@22274
  1602
           (Const ("Nominal.supp", T --> HOLogic.mk_setT aT) $ f)))
berghofe@20376
  1603
           (rec_fns ~~ rec_fn_Ts)) dt_atomTs;
berghofe@20376
  1604
berghofe@28731
  1605
    val rec_fns' = map (augment_sort thy11 fs_cp_sort) rec_fns;
berghofe@28731
  1606
berghofe@20376
  1607
    val rec_fresh_thms = map (fn ((aT, eqvt_ths), finite_prems) =>
berghofe@20376
  1608
      let
wenzelm@30364
  1609
        val name = Long_Name.base_name (fst (dest_Type aT));
wenzelm@26343
  1610
        val fs_name = PureThy.get_thm thy11 ("fs_" ^ name ^ "1");
berghofe@20376
  1611
        val a = Free ("a", aT);
berghofe@20376
  1612
        val freshs = map (fn (f, fT) => HOLogic.mk_Trueprop
berghofe@25823
  1613
          (fresh_const aT fT $ a $ f)) (rec_fns ~~ rec_fn_Ts)
berghofe@20376
  1614
      in
berghofe@20376
  1615
        map (fn (((T, U), R), eqvt_th) =>
berghofe@20376
  1616
          let
berghofe@28731
  1617
            val x = Free ("x", augment_sort_typ thy11 fs_cp_sort T);
berghofe@20376
  1618
            val y = Free ("y", U);
berghofe@20376
  1619
            val y' = Free ("y'", U)
berghofe@20376
  1620
          in
wenzelm@32957
  1621
            Drule.standard (Goal.prove (ProofContext.init thy11) []
berghofe@28731
  1622
              (map (augment_sort thy11 fs_cp_sort)
berghofe@28731
  1623
                (finite_prems @
berghofe@28731
  1624
                   [HOLogic.mk_Trueprop (R $ x $ y),
berghofe@28731
  1625
                    HOLogic.mk_Trueprop (HOLogic.mk_all ("y'", U,
berghofe@28731
  1626
                      HOLogic.mk_imp (R $ x $ y', HOLogic.mk_eq (y', y)))),
berghofe@28731
  1627
                    HOLogic.mk_Trueprop (fresh_const aT T $ a $ x)] @
berghofe@28731
  1628
                 freshs))
berghofe@25823
  1629
              (HOLogic.mk_Trueprop (fresh_const aT U $ a $ y))
berghofe@20376
  1630
              (fn {prems, context} =>
berghofe@20376
  1631
                 let
berghofe@20376
  1632
                   val (finite_prems, rec_prem :: unique_prem ::
berghofe@20376
  1633
                     fresh_prems) = chop (length finite_prems) prems;
berghofe@20376
  1634
                   val unique_prem' = unique_prem RS spec RS mp;
berghofe@20376
  1635
                   val unique = [unique_prem', unique_prem' RS sym] MRS trans;
berghofe@20376
  1636
                   val _ $ (_ $ (_ $ S $ _)) $ _ = prop_of supports_fresh;
berghofe@28731
  1637
                   val tuple = foldr1 HOLogic.mk_prod (x :: rec_fns')
berghofe@20376
  1638
                 in EVERY
berghofe@20376
  1639
                   [rtac (Drule.cterm_instantiate
berghofe@20376
  1640
                      [(cterm_of thy11 S,
berghofe@20376
  1641
                        cterm_of thy11 (Const ("Nominal.supp",
berghofe@20376
  1642
                          fastype_of tuple --> HOLogic.mk_setT aT) $ tuple))]
berghofe@20376
  1643
                      supports_fresh) 1,
berghofe@20376
  1644
                    simp_tac (HOL_basic_ss addsimps
berghofe@20376
  1645
                      [supports_def, symmetric fresh_def, fresh_prod]) 1,
berghofe@20376
  1646
                    REPEAT_DETERM (resolve_tac [allI, impI] 1),
berghofe@20376
  1647
                    REPEAT_DETERM (etac conjE 1),
berghofe@20376
  1648
                    rtac unique 1,
wenzelm@32202
  1649
                    SUBPROOF (fn {prems = prems', params = [(_, a), (_, b)], ...} => EVERY
berghofe@20376
  1650
                      [cut_facts_tac [rec_prem] 1,
berghofe@20376
  1651
                       rtac (Thm.instantiate ([],
berghofe@20376
  1652
                         [(cterm_of thy11 (Var (("pi", 0), mk_permT aT)),
berghofe@20376
  1653
                           cterm_of thy11 (perm_of_pair (term_of a, term_of b)))]) eqvt_th) 1,
berghofe@20376
  1654
                       asm_simp_tac (HOL_ss addsimps
berghofe@20376
  1655
                         (prems' @ perm_swap @ perm_fresh_fresh)) 1]) context 1,
berghofe@20376
  1656
                    rtac rec_prem 1,
berghofe@20376
  1657
                    simp_tac (HOL_ss addsimps (fs_name ::
berghofe@20376
  1658
                      supp_prod :: finite_Un :: finite_prems)) 1,
berghofe@20376
  1659
                    simp_tac (HOL_ss addsimps (symmetric fresh_def ::
berghofe@20376
  1660
                      fresh_prod :: fresh_prems)) 1]
berghofe@20376
  1661
                 end))
berghofe@20376
  1662
          end) (recTs ~~ rec_result_Ts ~~ rec_sets ~~ eqvt_ths)
berghofe@20376
  1663
      end) (dt_atomTs ~~ rec_equiv_thms' ~~ finite_premss);
berghofe@20376
  1664
berghofe@20376
  1665
    (** uniqueness **)
berghofe@20376
  1666
berghofe@21088
  1667
    val fun_tuple = foldr1 HOLogic.mk_prod (rec_ctxt :: rec_fns);
berghofe@20145
  1668
    val fun_tupleT = fastype_of fun_tuple;
berghofe@20145
  1669
    val rec_unique_frees =
berghofe@20145
  1670
      DatatypeProp.indexify_names (replicate (length recTs) "x") ~~ recTs;
berghofe@20397
  1671
    val rec_unique_frees'' = map (fn (s, T) => (s ^ "'", T)) rec_unique_frees;
berghofe@20267
  1672
    val rec_unique_frees' =
berghofe@20267
  1673
      DatatypeProp.indexify_names (replicate (length recTs) "y") ~~ rec_result_Ts;
berghofe@21021
  1674
    val rec_unique_concls = map (fn ((x, U), R) =>
berghofe@20145
  1675
        Const ("Ex1", (U --> HOLogic.boolT) --> HOLogic.boolT) $
berghofe@21021
  1676
          Abs ("y", U, R $ Free x $ Bound 0))
berghofe@20145
  1677
      (rec_unique_frees ~~ rec_result_Ts ~~ rec_sets);
berghofe@20376
  1678
berghofe@20145
  1679
    val induct_aux_rec = Drule.cterm_instantiate
berghofe@28731
  1680
      (map (pairself (cterm_of thy11) o apsnd (augment_sort thy11 fs_cp_sort))
berghofe@20145
  1681
         (map (fn (aT, f) => (Logic.varify f, Abs ("z", HOLogic.unitT,
berghofe@20145
  1682
            Const ("Nominal.supp", fun_tupleT --> HOLogic.mk_setT aT) $ fun_tuple)))
berghofe@20145
  1683
              fresh_fs @
berghofe@20145
  1684
          map (fn (((P, T), (x, U)), Q) =>
berghofe@26067
  1685
           (Var ((P, 0), Logic.varifyT (fsT' --> T --> HOLogic.boolT)),
berghofe@20145
  1686
            Abs ("z", HOLogic.unitT, absfree (x, U, Q))))
berghofe@20145
  1687
              (pnames ~~ recTs ~~ rec_unique_frees ~~ rec_unique_concls) @
berghofe@20145
  1688
          map (fn (s, T) => (Var ((s, 0), Logic.varifyT T), Free (s, T)))
berghofe@20145
  1689
            rec_unique_frees)) induct_aux;
berghofe@20145
  1690
berghofe@20376
  1691
    fun obtain_fresh_name vs ths rec_fin_supp T (freshs1, freshs2, ctxt) =
berghofe@20376
  1692
      let
berghofe@20376
  1693
        val p = foldr1 HOLogic.mk_prod (vs @ freshs1);
berghofe@20376
  1694
        val ex = Goal.prove ctxt [] [] (HOLogic.mk_Trueprop
berghofe@20376
  1695
            (HOLogic.exists_const T $ Abs ("x", T,
berghofe@25823
  1696
              fresh_const T (fastype_of p) $ Bound 0 $ p)))
berghofe@20376
  1697
          (fn _ => EVERY
berghofe@20376
  1698
            [cut_facts_tac ths 1,
berghofe@20376
  1699
             REPEAT_DETERM (dresolve_tac (the (AList.lookup op = rec_fin_supp T)) 1),
urbanc@21377
  1700
             resolve_tac exists_fresh' 1,
berghofe@20376
  1701
             asm_simp_tac (HOL_ss addsimps (supp_prod :: finite_Un :: fs_atoms)) 1]);
wenzelm@32202
  1702
        val (([(_, cx)], ths), ctxt') = Obtain.result
berghofe@20376
  1703
          (fn _ => EVERY
berghofe@20376
  1704
            [etac exE 1,
berghofe@20376
  1705
             full_simp_tac (HOL_ss addsimps (fresh_prod :: fresh_atm)) 1,
berghofe@20376
  1706
             REPEAT (etac conjE 1)])
berghofe@20376
  1707
          [ex] ctxt
berghofe@20376
  1708
      in (freshs1 @ [term_of cx], freshs2 @ ths, ctxt') end;
berghofe@20376
  1709
berghofe@21088
  1710
    val finite_ctxt_prems = map (fn aT =>
berghofe@22274
  1711
      HOLogic.mk_Trueprop
berghofe@22274
  1712
        (Const ("Finite_Set.finite", HOLogic.mk_setT aT --> HOLogic.boolT) $
berghofe@22274
  1713
           (Const ("Nominal.supp", fsT' --> HOLogic.mk_setT aT) $ rec_ctxt))) dt_atomTs;
berghofe@21088
  1714
berghofe@20397
  1715
    val rec_unique_thms = split_conj_thm (Goal.prove
wenzelm@21516
  1716
      (ProofContext.init thy11) (map fst rec_unique_frees)
berghofe@28731
  1717
      (map (augment_sort thy11 fs_cp_sort)
wenzelm@32952
  1718
        (flat finite_premss @ finite_ctxt_prems @ rec_prems @ rec_prems'))
berghofe@28731
  1719
      (augment_sort thy11 fs_cp_sort
berghofe@28731
  1720
        (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj rec_unique_concls)))
berghofe@20376
  1721
      (fn {prems, context} =>
berghofe@20267
  1722
         let
berghofe@20267
  1723
           val k = length rec_fns;
berghofe@20376
  1724
           val (finite_thss, ths1) = fold_map (fn T => fn xs =>
berghofe@20376
  1725
             apfst (pair T) (chop k xs)) dt_atomTs prems;
berghofe@21088
  1726
           val (finite_ctxt_ths, ths2) = chop (length dt_atomTs) ths1;
berghofe@21088
  1727
           val (P_ind_ths, fcbs) = chop k ths2;
berghofe@20267
  1728
           val P_ths = map (fn th => th RS mp) (split_conj_thm
berghofe@20376
  1729
             (Goal.prove context
berghofe@20397
  1730
               (map fst (rec_unique_frees'' @ rec_unique_frees')) []
berghofe@28731
  1731
               (augment_sort thy11 fs_cp_sort
berghofe@28731
  1732
                 (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@28731
  1733
                    (map (fn (((x, y), S), P) => HOLogic.mk_imp
berghofe@28731
  1734
                      (S $ Free x $ Free y, P $ (Free y)))
berghofe@28731
  1735
                        (rec_unique_frees'' ~~ rec_unique_frees' ~~
berghofe@28731
  1736
                           rec_sets ~~ rec_preds)))))
berghofe@20267
  1737
               (fn _ =>
berghofe@20267
  1738
                  rtac rec_induct 1 THEN
berghofe@20376
  1739
                  REPEAT ((resolve_tac P_ind_ths THEN_ALL_NEW assume_tac) 1))));
berghofe@20376
  1740
           val rec_fin_supp_thms' = map
berghofe@20376
  1741
             (fn (ths, (T, fin_ths)) => (T, map (curry op MRS fin_ths) ths))
berghofe@20376
  1742
             (rec_fin_supp_thms ~~ finite_thss);
berghofe@20267
  1743
         in EVERY
berghofe@20267
  1744
           ([rtac induct_aux_rec 1] @
berghofe@21088
  1745
            maps (fn ((_, finite_ths), finite_th) =>
berghofe@21088
  1746
              [cut_facts_tac (finite_th :: finite_ths) 1,
berghofe@21088
  1747
               asm_simp_tac (HOL_ss addsimps [supp_prod, finite_Un]) 1])
berghofe@21088
  1748
                (finite_thss ~~ finite_ctxt_ths) @
berghofe@20397
  1749
            maps (fn ((_, idxss), elim) => maps (fn idxs =>
berghofe@20397
  1750
              [full_simp_tac (HOL_ss addsimps [symmetric fresh_def, supp_prod, Un_iff]) 1,
berghofe@20397
  1751
               REPEAT_DETERM (eresolve_tac [conjE, ex1E] 1),
berghofe@20397
  1752
               rtac ex1I 1,
berghofe@20397
  1753
               (resolve_tac rec_intrs THEN_ALL_NEW atac) 1,
berghofe@20397
  1754
               rotate_tac ~1 1,
berghofe@20397
  1755
               ((DETERM o etac elim) THEN_ALL_NEW full_simp_tac
wenzelm@32952
  1756
                  (HOL_ss addsimps flat distinct_thms)) 1] @
berghofe@21021
  1757
               (if null idxs then [] else [hyp_subst_tac 1,
berghofe@20397
  1758
                SUBPROOF (fn {asms, concl, prems = prems', params, context = context', ...} =>
berghofe@20376
  1759
                  let
berghofe@21021
  1760
                    val SOME prem = find_first (can (HOLogic.dest_eq o
berghofe@21021
  1761
                      HOLogic.dest_Trueprop o prop_of)) prems';
berghofe@20376
  1762
                    val _ $ (_ $ lhs $ rhs) = prop_of prem;
berghofe@20376
  1763
                    val _ $ (_ $ lhs' $ rhs') = term_of concl;
berghofe@20376
  1764
                    val rT = fastype_of lhs';
berghofe@20376
  1765
                    val (c, cargsl) = strip_comb lhs;
berghofe@20376
  1766
                    val cargsl' = partition_cargs idxs cargsl;
wenzelm@32952
  1767
                    val boundsl = maps fst cargsl';
berghofe@20376
  1768
                    val (_, cargsr) = strip_comb rhs;
berghofe@20376
  1769
                    val cargsr' = partition_cargs idxs cargsr;
wenzelm@32952
  1770
                    val boundsr = maps fst cargsr';
berghofe@20376
  1771
                    val (params1, _ :: params2) =
wenzelm@32202
  1772
                      chop (length params div 2) (map (term_of o #2) params);
berghofe@20376
  1773
                    val params' = params1 @ params2;
berghofe@20376
  1774
                    val rec_prems = filter (fn th => case prop_of th of
berghofe@28731
  1775
                        _ $ p => (case head_of p of
berghofe@28731
  1776
                          Const (s, _) => s mem rec_set_names
berghofe@28731
  1777
                        | _ => false)
berghofe@28731
  1778
                      | _ => false) prems';
berghofe@20376
  1779
                    val fresh_prems = filter (fn th => case prop_of th of
berghofe@20376
  1780
                        _ $ (Const ("Nominal.fresh", _) $ _ $ _) => true
berghofe@20376
  1781
                      | _ $ (Const ("Not", _) $ _) => true
berghofe@20376
  1782
                      | _ => false) prems';
berghofe@20376
  1783
                    val Ts = map fastype_of boundsl;
berghofe@20376
  1784
berghofe@20376
  1785
                    val _ = warning "step 1: obtaining fresh names";
berghofe@20376
  1786
                    val (freshs1, freshs2, context'') = fold
berghofe@28731
  1787
                      (obtain_fresh_name (rec_ctxt :: rec_fns' @ params')
wenzelm@32952
  1788
                         (maps snd finite_thss @ finite_ctxt_ths @ rec_prems)
berghofe@20376
  1789
                         rec_fin_supp_thms')
berghofe@20376
  1790
                      Ts ([], [], context');
berghofe@20376
  1791
                    val pi1 = map perm_of_pair (boundsl ~~ freshs1);
berghofe@20376
  1792
                    val rpi1 = rev pi1;
berghofe@20376
  1793
                    val pi2 = map perm_of_pair (boundsr ~~ freshs1);
berghofe@21073
  1794
                    val rpi2 = rev pi2;
berghofe@20376
  1795
berghofe@20376
  1796
                    val fresh_prems' = mk_not_sym fresh_prems;
berghofe@20376
  1797
                    val freshs2' = mk_not_sym freshs2;
berghofe@20376
  1798
berghofe@20376
  1799
                    (** as, bs, cs # K as ts, K bs us **)
berghofe@20376
  1800
                    val _ = warning "step 2: as, bs, cs # K as ts, K bs us";
berghofe@20376
  1801
                    val prove_fresh_ss = HOL_ss addsimps
wenzelm@32952
  1802
                      (finite_Diff :: flat fresh_thms @
berghofe@20376
  1803
                       fs_atoms @ abs_fresh @ abs_supp @ fresh_atm);
berghofe@20376
  1804
                    (* FIXME: avoid asm_full_simp_tac ? *)
berghofe@20376
  1805
                    fun prove_fresh ths y x = Goal.prove context'' [] []
berghofe@25823
  1806
                      (HOLogic.mk_Trueprop (fresh_const
berghofe@25823
  1807
                         (fastype_of x) (fastype_of y) $ x $ y))
berghofe@20376
  1808
                      (fn _ => cut_facts_tac ths 1 THEN asm_full_simp_tac prove_fresh_ss 1);
berghofe@20376
  1809
                    val constr_fresh_thms =
berghofe@20376
  1810
                      map (prove_fresh fresh_prems lhs) boundsl @
berghofe@20376
  1811
                      map (prove_fresh fresh_prems rhs) boundsr @
berghofe@20376
  1812
                      map (prove_fresh freshs2 lhs) freshs1 @
berghofe@20376
  1813
                      map (prove_fresh freshs2 rhs) freshs1;
berghofe@20376
  1814
berghofe@20376
  1815
                    (** pi1 o (K as ts) = pi2 o (K bs us) **)
berghofe@20376
  1816
                    val _ = warning "step 3: pi1 o (K as ts) = pi2 o (K bs us)";
berghofe@20376
  1817
                    val pi1_pi2_eq = Goal.prove context'' [] []
berghofe@20376
  1818
                      (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@22311
  1819
                        (fold_rev (mk_perm []) pi1 lhs, fold_rev (mk_perm []) pi2 rhs)))
berghofe@20376
  1820
                      (fn _ => EVERY
berghofe@20376
  1821
                         [cut_facts_tac constr_fresh_thms 1,
berghofe@20376
  1822
                          asm_simp_tac (HOL_basic_ss addsimps perm_fresh_fresh) 1,
berghofe@20376
  1823
                          rtac prem 1]);
berghofe@20376
  1824
berghofe@20376
  1825
                    (** pi1 o ts = pi2 o us **)
berghofe@20376
  1826
                    val _ = warning "step 4: pi1 o ts = pi2 o us";
berghofe@20376
  1827
                    val pi1_pi2_eqs = map (fn (t, u) =>
berghofe@20376
  1828
                      Goal.prove context'' [] []
berghofe@20376
  1829
                        (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@22311
  1830
                          (fold_rev (mk_perm []) pi1 t, fold_rev (mk_perm []) pi2 u)))
berghofe@20376
  1831
                        (fn _ => EVERY
berghofe@20376
  1832
                           [cut_facts_tac [pi1_pi2_eq] 1,
berghofe@20376
  1833
                            asm_full_simp_tac (HOL_ss addsimps
wenzelm@32952
  1834
                              (calc_atm @ flat perm_simps' @
berghofe@20376
  1835
                               fresh_prems' @ freshs2' @ abs_perm @
wenzelm@32952
  1836
                               alpha @ flat inject_thms)) 1]))
berghofe@20376
  1837
                        (map snd cargsl' ~~ map snd cargsr');
berghofe@20376
  1838
berghofe@20376
  1839
                    (** pi1^-1 o pi2 o us = ts **)
berghofe@20376
  1840
                    val _ = warning "step 5: pi1^-1 o pi2 o us = ts";
berghofe@20376
  1841
                    val rpi1_pi2_eqs = map (fn ((t, u), eq) =>
berghofe@20376
  1842
                      Goal.prove context'' [] []
berghofe@20376
  1843
                        (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@22311
  1844
                          (fold_rev (mk_perm []) (rpi1 @ pi2) u, t)))
berghofe@20376
  1845
                        (fn _ => simp_tac (HOL_ss addsimps
berghofe@20376
  1846
                           ((eq RS sym) :: perm_swap)) 1))
berghofe@20376
  1847
                        (map snd cargsl' ~~ map snd cargsr' ~~ pi1_pi2_eqs);
berghofe@20376
  1848
berghofe@20376
  1849
                    val (rec_prems1, rec_prems2) =
berghofe@20376
  1850
                      chop (length rec_prems div 2) rec_prems;
berghofe@20376
  1851
berghofe@20376
  1852
                    (** (ts, pi1^-1 o pi2 o vs) in rec_set **)
berghofe@20376
  1853
                    val _ = warning "step 6: (ts, pi1^-1 o pi2 o vs) in rec_set";
berghofe@20376
  1854
                    val rec_prems' = map (fn th =>
berghofe@20376
  1855
                      let
berghofe@21021
  1856
                        val _ $ (S $ x $ y) = prop_of th;
berghofe@28731
  1857
                        val Const (s, _) = head_of S;
berghofe@28731
  1858
                        val k = find_index (equal s) rec_set_names;
berghofe@20376
  1859
                        val pi = rpi1 @ pi2;
berghofe@22311
  1860
                        fun mk_pi z = fold_rev (mk_perm []) pi z;
berghofe@20376
  1861
                        fun eqvt_tac p =
berghofe@20376
  1862
                          let
berghofe@20376
  1863
                            val U as Type (_, [Type (_, [T, _])]) = fastype_of p;
berghofe@20376
  1864
                            val l = find_index (equal T) dt_atomTs;
berghofe@20376
  1865
                            val th = List.nth (List.nth (rec_equiv_thms', l), k);
berghofe@20376
  1866
                            val th' = Thm.instantiate ([],
berghofe@20376
  1867
                              [(cterm_of thy11 (Var (("pi", 0), U)),
berghofe@20376
  1868
                                cterm_of thy11 p)]) th;
berghofe@20376
  1869
                          in rtac th' 1 end;
berghofe@20376
  1870
                        val th' = Goal.prove context'' [] []
berghofe@21021
  1871
                          (HOLogic.mk_Trueprop (S $ mk_pi x $ mk_pi y))
berghofe@20376
  1872
                          (fn _ => EVERY
berghofe@20376
  1873
                             (map eqvt_tac pi @
berghofe@20376
  1874
                              [simp_tac (HOL_ss addsimps (fresh_prems' @ freshs2' @
berghofe@20376
  1875
                                 perm_swap @ perm_fresh_fresh)) 1,
berghofe@20376
  1876
                               rtac th 1]))
berghofe@20376
  1877
                      in
berghofe@20376
  1878
                        Simplifier.simplify
berghofe@20376
  1879
                          (HOL_basic_ss addsimps rpi1_pi2_eqs) th'
berghofe@20376
  1880
                      end) rec_prems2;
berghofe@20376
  1881
berghofe@20376
  1882
                    val ihs = filter (fn th => case prop_of th of
berghofe@20376
  1883
                      _ $ (Const ("All", _) $ _) => true | _ => false) prems';
berghofe@20376
  1884
berghofe@21073
  1885
                    (** pi1 o rs = pi2 o vs , rs = pi1^-1 o pi2 o vs **)
berghofe@21073
  1886
                    val _ = warning "step 7: pi1 o rs = pi2 o vs , rs = pi1^-1 o pi2 o vs";
berghofe@21073
  1887
                    val rec_eqns = map (fn (th, ih) =>
berghofe@20376
  1888
                      let
berghofe@20376
  1889
                        val th' = th RS (ih RS spec RS mp) RS sym;
berghofe@20376
  1890
                        val _ $ (_ $ lhs $ rhs) = prop_of th';
berghofe@20376
  1891
                        fun strip_perm (_ $ _ $ t) = strip_perm t
berghofe@20376
  1892
                          | strip_perm t = t;
berghofe@20376
  1893
                      in
berghofe@21073
  1894
                        Goal.prove context'' [] []
berghofe@20376
  1895
                           (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@22311
  1896
                              (fold_rev (mk_perm []) pi1 lhs,
berghofe@22311
  1897
                               fold_rev (mk_perm []) pi2 (strip_perm rhs))))
berghofe@20376
  1898
                           (fn _ => simp_tac (HOL_basic_ss addsimps
berghofe@21073
  1899
                              (th' :: perm_swap)) 1)
berghofe@21073
  1900
                      end) (rec_prems' ~~ ihs);
berghofe@20376
  1901
berghofe@21073
  1902
                    (** as # rs **)
berghofe@21073
  1903
                    val _ = warning "step 8: as # rs";
wenzelm@32952
  1904
                    val rec_freshs =
wenzelm@32952
  1905
                      maps (fn (rec_prem, ih) =>
berghofe@20376
  1906
                        let
berghofe@21021
  1907
                          val _ $ (S $ x $ (y as Free (_, T))) =
berghofe@20376
  1908
                            prop_of rec_prem;
berghofe@20376
  1909
                          val k = find_index (equal S) rec_sets;
wenzelm@32952
  1910
                          val atoms = flat (map_filter (fn (bs, z) =>
berghofe@21073
  1911
                            if z = x then NONE else SOME bs) cargsl')
berghofe@20376
  1912
                        in
berghofe@21073
  1913
                          map (fn a as Free (_, aT) =>
berghofe@21073
  1914
                            let val l = find_index (equal aT) dt_atomTs;
berghofe@21073
  1915
                            in
berghofe@21073
  1916
                              Goal.prove context'' [] []
berghofe@25823
  1917
                                (HOLogic.mk_Trueprop (fresh_const aT T $ a $ y))
berghofe@20376
  1918
                                (fn _ => EVERY
berghofe@20376
  1919
                                   (rtac (List.nth (List.nth (rec_fresh_thms, l), k)) 1 ::
berghofe@20376
  1920
                                    map (fn th => rtac th 1)
berghofe@20376
  1921
                                      (snd (List.nth (finite_thss, l))) @
berghofe@20376
  1922
                                    [rtac rec_prem 1, rtac ih 1,
berghofe@21073
  1923
                                     REPEAT_DETERM (resolve_tac fresh_prems 1)]))
berghofe@21073
  1924
                            end) atoms
wenzelm@32952
  1925
                        end) (rec_prems1 ~~ ihs);
berghofe@20376
  1926
berghofe@20376
  1927
                    (** as # fK as ts rs , bs # fK bs us vs **)
berghofe@20376
  1928
                    val _ = warning "step 9: as # fK as ts rs , bs # fK bs us vs";
berghofe@21073
  1929
                    fun prove_fresh_result (a as Free (_, aT)) =
berghofe@20376
  1930
                      Goal.prove context'' [] []
berghofe@25823
  1931
                        (HOLogic.mk_Trueprop (fresh_const aT rT $ a $ rhs'))
berghofe@20376
  1932
                        (fn _ => EVERY
berghofe@20376
  1933
                           [resolve_tac fcbs 1,
berghofe@20376
  1934
                            REPEAT_DETERM (resolve_tac
berghofe@21073
  1935
                              (fresh_prems @ rec_freshs) 1),
berghofe@20411
  1936
                            REPEAT_DETERM (resolve_tac (maps snd rec_fin_supp_thms') 1
berghofe@20411
  1937
                              THEN resolve_tac rec_prems 1),
berghofe@20376
  1938
                            resolve_tac P_ind_ths 1,
berghofe@20376
  1939
                            REPEAT_DETERM (resolve_tac (P_ths @ rec_prems) 1)]);
wenzelm@21365
  1940
berghofe@21073
  1941
                    val fresh_results'' = map prove_fresh_result boundsl;
berghofe@21073
  1942
berghofe@21073
  1943
                    fun prove_fresh_result'' ((a as Free (_, aT), b), th) =
berghofe@21073
  1944
                      let val th' = Goal.prove context'' [] []
berghofe@25823
  1945
                        (HOLogic.mk_Trueprop (fresh_const aT rT $
berghofe@22311
  1946
                            fold_rev (mk_perm []) (rpi2 @ pi1) a $
berghofe@22311
  1947
                            fold_rev (mk_perm []) (rpi2 @ pi1) rhs'))
berghofe@21073
  1948
                        (fn _ => simp_tac (HOL_ss addsimps fresh_bij) 1 THEN
berghofe@21073
  1949
                           rtac th 1)
berghofe@21073
  1950
                      in
berghofe@21073
  1951
                        Goal.prove context'' [] []
berghofe@25823
  1952
                          (HOLogic.mk_Trueprop (fresh_const aT rT $ b $ lhs'))
berghofe@21073
  1953
                          (fn _ => EVERY
berghofe@21073
  1954
                             [cut_facts_tac [th'] 1,
berghofe@25998
  1955
                              full_simp_tac (Simplifier.theory_context thy11 HOL_ss
berghofe@25998
  1956
                                addsimps rec_eqns @ pi1_pi2_eqs @ perm_swap
berghofe@25998
  1957
                                addsimprocs [NominalPermeq.perm_simproc_app]) 1,
berghofe@21073
  1958
                              full_simp_tac (HOL_ss addsimps (calc_atm @
berghofe@21073
  1959
                                fresh_prems' @ freshs2' @ perm_fresh_fresh)) 1])
berghofe@21073
  1960
                      end;
berghofe@21073
  1961
berghofe@21073
  1962
                    val fresh_results = fresh_results'' @ map prove_fresh_result''
berghofe@21073
  1963
                      (boundsl ~~ boundsr ~~ fresh_results'');
berghofe@20376
  1964
berghofe@20376
  1965
                    (** cs # fK as ts rs , cs # fK bs us vs **)
berghofe@20376
  1966
                    val _ = warning "step 10: cs # fK as ts rs , cs # fK bs us vs";
berghofe@20376
  1967
                    fun prove_fresh_result' recs t (a as Free (_, aT)) =
berghofe@20376
  1968
                      Goal.prove context'' [] []
berghofe@25823
  1969
                        (HOLogic.mk_Trueprop (fresh_const aT rT $ a $ t))
berghofe@20376
  1970
                        (fn _ => EVERY
berghofe@20376
  1971
                          [cut_facts_tac recs 1,
berghofe@20376
  1972
                           REPEAT_DETERM (dresolve_tac
berghofe@20376
  1973
                             (the (AList.lookup op = rec_fin_supp_thms' aT)) 1),
berghofe@20376
  1974
                           NominalPermeq.fresh_guess_tac
berghofe@20376
  1975
                             (HOL_ss addsimps (freshs2 @
berghofe@20376
  1976
                                fs_atoms @ fresh_atm @
wenzelm@32952
  1977
                                maps snd finite_thss)) 1]);
berghofe@20376
  1978
berghofe@20376
  1979
                    val fresh_results' =
berghofe@20376
  1980
                      map (prove_fresh_result' rec_prems1 rhs') freshs1 @
berghofe@20376
  1981
                      map (prove_fresh_result' rec_prems2 lhs') freshs1;
berghofe@20376
  1982
berghofe@20376
  1983
                    (** pi1 o (fK as ts rs) = pi2 o (fK bs us vs) **)
berghofe@20376
  1984
                    val _ = warning "step 11: pi1 o (fK as ts rs) = pi2 o (fK bs us vs)";
berghofe@20376
  1985
                    val pi1_pi2_result = Goal.prove context'' [] []
berghofe@20376
  1986
                      (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@22311
  1987
                        (fold_rev (mk_perm []) pi1 rhs', fold_rev (mk_perm []) pi2 lhs')))
berghofe@27450
  1988
                      (fn _ => simp_tac (Simplifier.context context'' HOL_ss
berghofe@27450
  1989
                           addsimps pi1_pi2_eqs @ rec_eqns
berghofe@27450
  1990
                           addsimprocs [NominalPermeq.perm_simproc_app]) 1 THEN
berghofe@20376
  1991
                         TRY (simp_tac (HOL_ss addsimps
berghofe@20376
  1992
                           (fresh_prems' @ freshs2' @ calc_atm @ perm_fresh_fresh)) 1));
berghofe@20376
  1993
berghofe@20376
  1994
                    val _ = warning "final result";
berghofe@20376
  1995
                    val final = Goal.prove context'' [] [] (term_of concl)
berghofe@20376
  1996
                      (fn _ => cut_facts_tac [pi1_pi2_result RS sym] 1 THEN
berghofe@20376
  1997
                        full_simp_tac (HOL_basic_ss addsimps perm_fresh_fresh @
berghofe@20376
  1998
                          fresh_results @ fresh_results') 1);
berghofe@20376
  1999
                    val final' = ProofContext.export context'' context' [final];
berghofe@20376
  2000
                    val _ = warning "finished!"
berghofe@20376
  2001
                  in
berghofe@20376
  2002
                    resolve_tac final' 1
berghofe@20397
  2003
                  end) context 1])) idxss) (ndescr ~~ rec_elims))
berghofe@20397
  2004
         end));
berghofe@20397
  2005
berghofe@20397
  2006
    val rec_total_thms = map (fn r => r RS theI') rec_unique_thms;
berghofe@20397
  2007
berghofe@20397
  2008
    (* define primrec combinators *)
berghofe@20397
  2009
berghofe@20397
  2010
    val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
haftmann@28965
  2011
    val reccomb_names = map (Sign.full_bname thy11)
berghofe@20397
  2012
      (if length descr'' = 1 then [big_reccomb_name] else
berghofe@20397
  2013
        (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
berghofe@20397
  2014
          (1 upto (length descr''))));
berghofe@20397
  2015
    val reccombs = map (fn ((name, T), T') => list_comb
berghofe@20397
  2016
      (Const (name, rec_fn_Ts @ [T] ---> T'), rec_fns))
berghofe@20397
  2017
        (reccomb_names ~~ recTs ~~ rec_result_Ts);
berghofe@20397
  2018
berghofe@20397
  2019
    val (reccomb_defs, thy12) =
berghofe@20397
  2020
      thy11
wenzelm@24712
  2021
      |> Sign.add_consts_i (map (fn ((name, T), T') =>
wenzelm@30364
  2022
          (Binding.name (Long_Name.base_name name), rec_fn_Ts @ [T] ---> T', NoSyn))
berghofe@20397
  2023
          (reccomb_names ~~ recTs ~~ rec_result_Ts))
haftmann@27691
  2024
      |> (PureThy.add_defs false o map Thm.no_attributes) (map (fn ((((name, comb), set), T), T') =>
wenzelm@30364
  2025
          (Binding.name (Long_Name.base_name name ^ "_def"), Logic.mk_equals (comb, absfree ("x", T,
berghofe@20397
  2026
           Const ("The", (T' --> HOLogic.boolT) --> T') $ absfree ("y", T',
berghofe@21021
  2027
             set $ Free ("x", T) $ Free ("y", T'))))))
berghofe@20397
  2028
               (reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts));
berghofe@20397
  2029
berghofe@20397
  2030
    (* prove characteristic equations for primrec combinators *)
berghofe@20397
  2031
berghofe@20397
  2032
    val rec_thms = map (fn (prems, concl) =>
berghofe@20397
  2033
      let
berghofe@20397
  2034
        val _ $ (_ $ (_ $ x) $ _) = concl;
berghofe@20397
  2035
        val (_, cargs) = strip_comb x;
berghofe@20397
  2036
        val ps = map (fn (x as Free (_, T), i) =>
berghofe@20397
  2037
          (Free ("x" ^ string_of_int i, T), x)) (cargs ~~ (1 upto length cargs));
berghofe@20397
  2038
        val concl' = subst_atomic_types (rec_result_Ts' ~~ rec_result_Ts) concl;
wenzelm@32952
  2039
        val prems' = flat finite_premss @ finite_ctxt_prems @
berghofe@21088
  2040
          rec_prems @ rec_prems' @ map (subst_atomic ps) prems;
berghofe@20397
  2041
        fun solve rules prems = resolve_tac rules THEN_ALL_NEW
berghofe@20397
  2042
          (resolve_tac prems THEN_ALL_NEW atac)
berghofe@20397
  2043
      in
berghofe@28731
  2044
        Goal.prove_global thy12 []
berghofe@28731
  2045
          (map (augment_sort thy12 fs_cp_sort) prems')
berghofe@28731
  2046
          (augment_sort thy12 fs_cp_sort concl')
wenzelm@26711
  2047
          (fn {prems, ...} => EVERY
berghofe@20397
  2048
            [rewrite_goals_tac reccomb_defs,
berghofe@20397
  2049
             rtac the1_equality 1,
berghofe@20397
  2050
             solve rec_unique_thms prems 1,
berghofe@20397
  2051
             resolve_tac rec_intrs 1,
berghofe@20397
  2052
             REPEAT (solve (prems @ rec_total_thms) prems 1)])
berghofe@20397
  2053
      end) (rec_eq_prems ~~
berghofe@28731
  2054
        DatatypeProp.make_primrecs new_type_names descr' sorts thy12);
wenzelm@21365
  2055
haftmann@33063
  2056
    val dt_infos = map_index (make_dt_info pdescr sorts induct reccomb_names rec_thms)
haftmann@33063
  2057
      (descr1 ~~ distinct_thms ~~ inject_thms);
berghofe@21540
  2058
berghofe@19985
  2059
    (* FIXME: theorems are stored in database for testing only *)
berghofe@20397
  2060
    val (_, thy13) = thy12 |>
berghofe@20145
  2061
      PureThy.add_thmss
wenzelm@32952
  2062
        [((Binding.name "rec_equiv", flat rec_equiv_thms), []),
wenzelm@32952
  2063
         ((Binding.name "rec_equiv'", flat rec_equiv_thms'), []),
wenzelm@32952
  2064
         ((Binding.name "rec_fin_supp", flat rec_fin_supp_thms), []),
wenzelm@32952
  2065
         ((Binding.name "rec_fresh", flat rec_fresh_thms), []),
wenzelm@32957
  2066
         ((Binding.name "rec_unique", map Drule.standard rec_unique_thms), []),
haftmann@29585
  2067
         ((Binding.name "recs", rec_thms), [])] ||>
wenzelm@24712
  2068
      Sign.parent_path ||>
berghofe@21540
  2069
      map_nominal_datatypes (fold Symtab.update dt_infos);
berghofe@19985
  2070
berghofe@17870
  2071
  in
berghofe@20397
  2072
    thy13
berghofe@17870
  2073
  end;
berghofe@17870
  2074
haftmann@31723
  2075
val add_nominal_datatype = gen_add_nominal_datatype Datatype.read_typ;
berghofe@17870
  2076
berghofe@17870
  2077
haftmann@31723
  2078
(* FIXME: The following stuff should be exported by Datatype *)
berghofe@17870
  2079
berghofe@17870
  2080
local structure P = OuterParse and K = OuterKeyword in
berghofe@17870
  2081
berghofe@17870
  2082
val datatype_decl =
berghofe@17870
  2083
  Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix --
berghofe@17870
  2084
    (P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix));
berghofe@17870
  2085
berghofe@17870
  2086
fun mk_datatype args =
berghofe@17870
  2087
  let
berghofe@17870
  2088
    val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args;
berghofe@17870
  2089
    val specs = map (fn ((((_, vs), t), mx), cons) =>
berghofe@17870
  2090
      (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args;
haftmann@31737
  2091
  in add_nominal_datatype Datatype.default_config names specs end;
berghofe@17870
  2092
wenzelm@24867
  2093
val _ =
berghofe@17870
  2094
  OuterSyntax.command "nominal_datatype" "define inductive datatypes" K.thy_decl
berghofe@17870
  2095
    (P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype));
berghofe@17870
  2096
berghofe@17870
  2097
end;
berghofe@17870
  2098
berghofe@18261
  2099
end