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