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