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