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