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