src/HOL/Tools/datatype_rep_proofs.ML
author paulson
Wed Feb 03 13:26:07 1999 +0100 (1999-02-03)
changeset 6171 cd237a10cbf8
parent 6092 d9db67970c73
child 6394 3d9fd50fcc43
permissions -rw-r--r--
inj is now a translation of inj_on
berghofe@5177
     1
(*  Title:      HOL/Tools/datatype_rep_proofs.ML
berghofe@5177
     2
    ID:         $Id$
berghofe@5177
     3
    Author:     Stefan Berghofer
berghofe@5177
     4
    Copyright   1998  TU Muenchen
berghofe@5177
     5
berghofe@5177
     6
Definitional introduction of datatypes
berghofe@5177
     7
Proof of characteristic theorems:
berghofe@5177
     8
berghofe@5177
     9
 - injectivity of constructors
berghofe@5177
    10
 - distinctness of constructors (internal version)
berghofe@5177
    11
 - induction theorem
berghofe@5177
    12
berghofe@5177
    13
*)
berghofe@5177
    14
berghofe@5177
    15
signature DATATYPE_REP_PROOFS =
berghofe@5177
    16
sig
berghofe@5661
    17
  val representation_proofs : bool -> DatatypeAux.datatype_info Symtab.table ->
berghofe@5177
    18
    string list -> (int * (string * DatatypeAux.dtyp list *
berghofe@5177
    19
      (string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list ->
berghofe@5177
    20
        (string * mixfix) list -> (string * mixfix) list list -> theory ->
berghofe@5177
    21
          theory * thm list list * thm list list * thm
berghofe@5177
    22
end;
berghofe@5177
    23
berghofe@5177
    24
structure DatatypeRepProofs : DATATYPE_REP_PROOFS =
berghofe@5177
    25
struct
berghofe@5177
    26
berghofe@5177
    27
open DatatypeAux;
berghofe@5177
    28
berghofe@5177
    29
val (_ $ (_ $ (_ $ (distinct_f $ _) $ _))) = hd (prems_of distinct_lemma);
berghofe@5177
    30
berghofe@5177
    31
(* figure out internal names *)
berghofe@5177
    32
berghofe@5177
    33
val image_name = Sign.intern_const (sign_of Set.thy) "op ``";
berghofe@5177
    34
val UNIV_name = Sign.intern_const (sign_of Set.thy) "UNIV";
berghofe@5177
    35
val inj_on_name = Sign.intern_const (sign_of Fun.thy) "inj_on";
berghofe@5177
    36
val inv_name = Sign.intern_const (sign_of Fun.thy) "inv";
berghofe@5177
    37
berghofe@5177
    38
fun exh_thm_of (dt_info : datatype_info Symtab.table) tname =
berghofe@5177
    39
  #exhaustion (the (Symtab.lookup (dt_info, tname)));
berghofe@5177
    40
berghofe@5177
    41
(******************************************************************************)
berghofe@5177
    42
berghofe@5661
    43
fun representation_proofs flat_names (dt_info : datatype_info Symtab.table)
berghofe@5177
    44
      new_type_names descr sorts types_syntax constr_syntax thy =
berghofe@5177
    45
  let
berghofe@5177
    46
    val Univ_thy = the (get_thy "Univ" thy);
berghofe@5177
    47
    val node_name = Sign.intern_tycon (sign_of Univ_thy) "node";
berghofe@5177
    48
    val [In0_name, In1_name, Scons_name, Leaf_name, Numb_name] =
berghofe@5177
    49
      map (Sign.intern_const (sign_of Univ_thy))
berghofe@5177
    50
        ["In0", "In1", "Scons", "Leaf", "Numb"];
berghofe@5177
    51
    val [In0_inject, In1_inject, Scons_inject, Leaf_inject, In0_eq, In1_eq,
berghofe@5177
    52
      In0_not_In1, In1_not_In0] = map (get_thm Univ_thy)
berghofe@5177
    53
        ["In0_inject", "In1_inject", "Scons_inject", "Leaf_inject", "In0_eq",
berghofe@5177
    54
         "In1_eq", "In0_not_In1", "In1_not_In0"];
berghofe@5177
    55
berghofe@5177
    56
    val descr' = flat descr;
berghofe@5177
    57
berghofe@5661
    58
    val big_name = space_implode "_" new_type_names;
berghofe@5661
    59
    val thy1 = add_path flat_names big_name thy;
berghofe@5661
    60
    val big_rec_name = big_name ^ "_rep_set";
berghofe@5661
    61
    val rep_set_names = map (Sign.full_name (sign_of thy1))
berghofe@5177
    62
      (if length descr' = 1 then [big_rec_name] else
berghofe@5177
    63
        (map ((curry (op ^) (big_rec_name ^ "_")) o string_of_int)
berghofe@5177
    64
          (1 upto (length descr'))));
berghofe@5177
    65
berghofe@5661
    66
    val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr);
berghofe@5661
    67
    val leafTs' = get_nonrec_types descr' sorts;
berghofe@5661
    68
    val unneeded_vars = hd tyvars \\ foldr add_typ_tfree_names (leafTs', []);
berghofe@5661
    69
    val leafTs = leafTs' @ (map (fn n => TFree (n, the (assoc (sorts, n)))) unneeded_vars);
berghofe@5177
    70
    val recTs = get_rec_types descr' sorts;
berghofe@5177
    71
    val newTs = take (length (hd descr), recTs);
berghofe@5177
    72
    val oldTs = drop (length (hd descr), recTs);
berghofe@5177
    73
    val sumT = if null leafTs then HOLogic.unitT
berghofe@5177
    74
      else fold_bal (fn (T, U) => Type ("+", [T, U])) leafTs;
berghofe@5177
    75
    val Univ_elT = HOLogic.mk_setT (Type (node_name, [sumT]));
berghofe@5177
    76
    val UnivT = HOLogic.mk_setT Univ_elT;
berghofe@5177
    77
berghofe@5177
    78
    val In0 = Const (In0_name, Univ_elT --> Univ_elT);
berghofe@5177
    79
    val In1 = Const (In1_name, Univ_elT --> Univ_elT);
berghofe@5177
    80
    val Leaf = Const (Leaf_name, sumT --> Univ_elT);
berghofe@5177
    81
berghofe@5177
    82
    (* make injections needed for embedding types in leaves *)
berghofe@5177
    83
berghofe@5177
    84
    fun mk_inj T' x =
berghofe@5177
    85
      let
berghofe@5177
    86
        fun mk_inj' T n i =
berghofe@5177
    87
          if n = 1 then x else
berghofe@5177
    88
          let val n2 = n div 2;
berghofe@5177
    89
              val Type (_, [T1, T2]) = T
berghofe@5177
    90
          in
berghofe@5177
    91
            if i <= n2 then
berghofe@5177
    92
              Const ("Inl", T1 --> T) $ (mk_inj' T1 n2 i)
berghofe@5177
    93
            else
berghofe@5177
    94
              Const ("Inr", T2 --> T) $ (mk_inj' T2 (n - n2) (i - n2))
berghofe@5177
    95
          end
berghofe@5177
    96
      in mk_inj' sumT (length leafTs) (1 + find_index_eq T' leafTs)
berghofe@5177
    97
      end;
berghofe@5177
    98
berghofe@5177
    99
    (* make injections for constructors *)
berghofe@5177
   100
berghofe@5177
   101
    fun mk_univ_inj ts = access_bal (ap In0, ap In1, if ts = [] then
berghofe@5177
   102
        Const ("arbitrary", Univ_elT)
berghofe@5177
   103
      else
berghofe@5177
   104
        foldr1 (HOLogic.mk_binop Scons_name) ts);
berghofe@5177
   105
berghofe@5177
   106
    (************** generate introduction rules for representing set **********)
berghofe@5177
   107
berghofe@5661
   108
    val _ = message "Constructing representing sets...";
berghofe@5177
   109
berghofe@5177
   110
    (* make introduction rule for a single constructor *)
berghofe@5177
   111
berghofe@5177
   112
    fun make_intr s n (i, (_, cargs)) =
berghofe@5177
   113
      let
berghofe@5177
   114
        fun mk_prem (DtRec k, (j, prems, ts)) =
berghofe@5177
   115
              let val free_t = mk_Free "x" Univ_elT j
berghofe@5177
   116
              in (j + 1, (HOLogic.mk_mem (free_t,
berghofe@5177
   117
                Const (nth_elem (k, rep_set_names), UnivT)))::prems, free_t::ts)
berghofe@5177
   118
              end
berghofe@5177
   119
          | mk_prem (dt, (j, prems, ts)) =
berghofe@5177
   120
              let val T = typ_of_dtyp descr' sorts dt
berghofe@5177
   121
              in (j + 1, prems, (Leaf $ mk_inj T (mk_Free "x" T j))::ts)
berghofe@5177
   122
              end;
berghofe@5177
   123
berghofe@5177
   124
        val (_, prems, ts) = foldr mk_prem (cargs, (1, [], []));
berghofe@5177
   125
        val concl = HOLogic.mk_Trueprop (HOLogic.mk_mem
berghofe@5177
   126
          (mk_univ_inj ts n i, Const (s, UnivT)))
berghofe@5177
   127
      in Logic.list_implies (map HOLogic.mk_Trueprop prems, concl)
berghofe@5177
   128
      end;
berghofe@5177
   129
berghofe@5177
   130
    val consts = map (fn s => Const (s, UnivT)) rep_set_names;
berghofe@5177
   131
berghofe@5177
   132
    val intr_ts = flat (map (fn ((_, (_, _, constrs)), rep_set_name) =>
berghofe@5177
   133
      map (make_intr rep_set_name (length constrs))
berghofe@5177
   134
        ((1 upto (length constrs)) ~~ constrs)) (descr' ~~ rep_set_names));
berghofe@5177
   135
berghofe@5177
   136
    val (thy2, {raw_induct = rep_induct, intrs = rep_intrs, ...}) =
berghofe@5661
   137
      setmp InductivePackage.quiet_mode (!quiet_mode)
berghofe@5661
   138
        (InductivePackage.add_inductive_i false true big_rec_name false true false
berghofe@5661
   139
           consts intr_ts [] []) thy1;
berghofe@5177
   140
berghofe@5177
   141
    (********************************* typedef ********************************)
berghofe@5177
   142
berghofe@5661
   143
    val thy3 = add_path flat_names big_name (foldl (fn (thy, ((((name, mx), tvs), c), name')) =>
wenzelm@5696
   144
      setmp TypedefPackage.quiet_mode true
wenzelm@5696
   145
        (TypedefPackage.add_typedef_i_no_def name' (name, tvs, mx) c [] []
wenzelm@5696
   146
          (Some (QUIET_BREADTH_FIRST (has_fewer_prems 1) (resolve_tac rep_intrs 1)))) thy)
wenzelm@5696
   147
            (parent_path flat_names thy2, types_syntax ~~ tyvars ~~ (take (length newTs, consts)) ~~
wenzelm@5696
   148
              new_type_names));
berghofe@5177
   149
berghofe@5177
   150
    (*********************** definition of constructors ***********************)
berghofe@5177
   151
berghofe@5177
   152
    val big_rep_name = (space_implode "_" new_type_names) ^ "_Rep_";
berghofe@5177
   153
    val rep_names = map (curry op ^ "Rep_") new_type_names;
berghofe@5177
   154
    val rep_names' = map (fn i => big_rep_name ^ (string_of_int i))
berghofe@5177
   155
      (1 upto (length (flat (tl descr))));
berghofe@5661
   156
    val all_rep_names = map (Sign.intern_const (sign_of thy3)) rep_names @
berghofe@5661
   157
      map (Sign.full_name (sign_of thy3)) rep_names';
berghofe@5177
   158
berghofe@5177
   159
    (* isomorphism declarations *)
berghofe@5177
   160
berghofe@5177
   161
    val iso_decls = map (fn (T, s) => (s, T --> Univ_elT, NoSyn))
berghofe@5177
   162
      (oldTs ~~ rep_names');
berghofe@5177
   163
berghofe@5177
   164
    (* constructor definitions *)
berghofe@5177
   165
berghofe@5177
   166
    fun make_constr_def tname T n ((thy, defs, eqns, i), ((cname, cargs), (cname', mx))) =
berghofe@5177
   167
      let
berghofe@5177
   168
        fun constr_arg (dt, (j, l_args, r_args)) =
berghofe@5177
   169
          let val T = typ_of_dtyp descr' sorts dt;
berghofe@5177
   170
              val free_t = mk_Free "x" T j
berghofe@5177
   171
          in (case dt of
berghofe@5177
   172
              DtRec m => (j + 1, free_t::l_args, (Const (nth_elem (m, all_rep_names),
berghofe@5177
   173
                T --> Univ_elT) $ free_t)::r_args)
berghofe@5177
   174
            | _ => (j + 1, free_t::l_args, (Leaf $ mk_inj T free_t)::r_args))
berghofe@5177
   175
          end;
berghofe@5177
   176
berghofe@5177
   177
        val (_, l_args, r_args) = foldr constr_arg (cargs, (1, [], []));
berghofe@5177
   178
        val constrT = (map (typ_of_dtyp descr' sorts) cargs) ---> T;
berghofe@5177
   179
        val abs_name = Sign.intern_const (sign_of thy) ("Abs_" ^ tname);
berghofe@5177
   180
        val rep_name = Sign.intern_const (sign_of thy) ("Rep_" ^ tname);
berghofe@5177
   181
        val lhs = list_comb (Const (cname, constrT), l_args);
berghofe@5177
   182
        val rhs = mk_univ_inj r_args n i;
berghofe@5177
   183
        val def = equals T $ lhs $ (Const (abs_name, Univ_elT --> T) $ rhs);
berghofe@5177
   184
        val def_name = (Sign.base_name cname) ^ "_def";
berghofe@5177
   185
        val eqn = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@5177
   186
          (Const (rep_name, T --> Univ_elT) $ lhs, rhs));
berghofe@5177
   187
        val thy' = thy |>
berghofe@5177
   188
          Theory.add_consts_i [(cname', constrT, mx)] |>
berghofe@5177
   189
          Theory.add_defs_i [(def_name, def)];
berghofe@5177
   190
berghofe@5177
   191
      in (thy', defs @ [get_axiom thy' def_name], eqns @ [eqn], i + 1)
berghofe@5177
   192
      end;
berghofe@5177
   193
berghofe@5177
   194
    (* constructor definitions for datatype *)
berghofe@5177
   195
berghofe@5177
   196
    fun dt_constr_defs ((thy, defs, eqns, rep_congs, dist_lemmas),
berghofe@5177
   197
        ((((_, (_, _, constrs)), tname), T), constr_syntax)) =
berghofe@5177
   198
      let
berghofe@5177
   199
        val _ $ (_ $ (cong_f $ _) $ _) = concl_of arg_cong;
berghofe@5177
   200
        val sg = sign_of thy;
berghofe@5177
   201
        val rep_const = cterm_of sg
berghofe@5177
   202
          (Const (Sign.intern_const sg ("Rep_" ^ tname), T --> Univ_elT));
berghofe@5177
   203
        val cong' = cterm_instantiate [(cterm_of sg cong_f, rep_const)] arg_cong;
berghofe@5177
   204
        val dist = cterm_instantiate [(cterm_of sg distinct_f, rep_const)] distinct_lemma;
berghofe@5177
   205
        val (thy', defs', eqns', _) = foldl ((make_constr_def tname T) (length constrs))
berghofe@5661
   206
          ((add_path flat_names tname thy, defs, [], 1), constrs ~~ constr_syntax)
berghofe@5177
   207
      in
berghofe@5661
   208
        (parent_path flat_names thy', defs', eqns @ [eqns'],
berghofe@5177
   209
          rep_congs @ [cong'], dist_lemmas @ [dist])
berghofe@5177
   210
      end;
berghofe@5177
   211
berghofe@5177
   212
    val (thy4, constr_defs, constr_rep_eqns, rep_congs, dist_lemmas) = foldl dt_constr_defs
berghofe@5661
   213
      ((thy3 |> Theory.add_consts_i iso_decls |> parent_path flat_names, [], [], [], []),
berghofe@5177
   214
        hd descr ~~ new_type_names ~~ newTs ~~ constr_syntax);
berghofe@5177
   215
berghofe@5177
   216
    (*********** isomorphisms for new types (introduced by typedef) ***********)
berghofe@5177
   217
berghofe@5661
   218
    val _ = message "Proving isomorphism properties...";
berghofe@5177
   219
berghofe@5177
   220
    (* get axioms from theory *)
berghofe@5177
   221
berghofe@5177
   222
    val newT_iso_axms = map (fn s =>
berghofe@5177
   223
      (get_axiom thy4 ("Abs_" ^ s ^ "_inverse"),
berghofe@5177
   224
       get_axiom thy4 ("Rep_" ^ s ^ "_inverse"),
berghofe@5177
   225
       get_axiom thy4 ("Rep_" ^ s))) new_type_names;
berghofe@5177
   226
berghofe@5177
   227
    (*------------------------------------------------*)
berghofe@5177
   228
    (* prove additional theorems:                     *)
berghofe@5177
   229
    (*  inj_on dt_Abs_i rep_set_i  and  inj dt_Rep_i  *)
berghofe@5177
   230
    (*------------------------------------------------*)
berghofe@5177
   231
berghofe@5177
   232
    fun prove_newT_iso_inj_thm (((s, (thm1, thm2, _)), T), rep_set_name) =
berghofe@5177
   233
      let
berghofe@5177
   234
        val sg = sign_of thy4;
berghofe@5177
   235
        val RepT = T --> Univ_elT;
berghofe@5177
   236
        val Rep_name = Sign.intern_const sg ("Rep_" ^ s);
berghofe@5177
   237
        val AbsT = Univ_elT --> T;
berghofe@5177
   238
        val Abs_name = Sign.intern_const sg ("Abs_" ^ s);
berghofe@5177
   239
paulson@6171
   240
        val inj_Abs_thm = 
paulson@6171
   241
	    prove_goalw_cterm [] 
paulson@6171
   242
	      (cterm_of sg
paulson@6171
   243
	       (HOLogic.mk_Trueprop 
paulson@6171
   244
		(Const (inj_on_name, [AbsT, UnivT] ---> HOLogic.boolT) $
paulson@6171
   245
		 Const (Abs_name, AbsT) $ Const (rep_set_name, UnivT))))
berghofe@5177
   246
              (fn _ => [rtac inj_on_inverseI 1, etac thm1 1]);
berghofe@5177
   247
paulson@6171
   248
        val setT = HOLogic.mk_setT T
paulson@6171
   249
paulson@6171
   250
        val inj_Rep_thm =
paulson@6171
   251
	    prove_goalw_cterm []
paulson@6171
   252
	      (cterm_of sg
paulson@6171
   253
	       (HOLogic.mk_Trueprop
paulson@6171
   254
		(Const (inj_on_name, [RepT, setT] ---> HOLogic.boolT) $
paulson@6171
   255
		 Const (Rep_name, RepT) $ Const (UNIV_name, setT))))
berghofe@5177
   256
              (fn _ => [rtac inj_inverseI 1, rtac thm2 1])
berghofe@5177
   257
paulson@6171
   258
      in (inj_Abs_thm, inj_Rep_thm) end;
berghofe@5177
   259
berghofe@5177
   260
    val newT_iso_inj_thms = map prove_newT_iso_inj_thm
berghofe@5177
   261
      (new_type_names ~~ newT_iso_axms ~~ newTs ~~
berghofe@5177
   262
        take (length newTs, rep_set_names));
berghofe@5177
   263
berghofe@5177
   264
    (********* isomorphisms between existing types and "unfolded" types *******)
berghofe@5177
   265
berghofe@5177
   266
    (*---------------------------------------------------------------------*)
berghofe@5177
   267
    (* isomorphisms are defined using primrec-combinators:                 *)
berghofe@5177
   268
    (* generate appropriate functions for instantiating primrec-combinator *)
berghofe@5177
   269
    (*                                                                     *)
berghofe@5177
   270
    (*   e.g.  dt_Rep_i = list_rec ... (%h t y. In1 ((Leaf h) $ y))        *)
berghofe@5177
   271
    (*                                                                     *)
berghofe@5177
   272
    (* also generate characteristic equations for isomorphisms             *)
berghofe@5177
   273
    (*                                                                     *)
berghofe@5177
   274
    (*   e.g.  dt_Rep_i (cons h t) = In1 ((dt_Rep_j h) $ (dt_Rep_i t))     *)
berghofe@5177
   275
    (*---------------------------------------------------------------------*)
berghofe@5177
   276
berghofe@5177
   277
    fun make_iso_def k ks n ((fs, eqns, i), (cname, cargs)) =
berghofe@5177
   278
      let
berghofe@5177
   279
        val argTs = map (typ_of_dtyp descr' sorts) cargs;
berghofe@5177
   280
        val T = nth_elem (k, recTs);
berghofe@5177
   281
        val rep_name = nth_elem (k, all_rep_names);
berghofe@5177
   282
        val rep_const = Const (rep_name, T --> Univ_elT);
berghofe@5177
   283
        val constr = Const (cname, argTs ---> T);
berghofe@5177
   284
berghofe@5177
   285
        fun process_arg ks' ((i2, i2', ts), dt) =
berghofe@5177
   286
          let val T' = typ_of_dtyp descr' sorts dt
berghofe@5177
   287
          in (case dt of
berghofe@5177
   288
              DtRec j => if j mem ks' then
berghofe@5177
   289
                  (i2 + 1, i2' + 1, ts @ [mk_Free "y" Univ_elT i2'])
berghofe@5177
   290
                else
berghofe@5177
   291
                  (i2 + 1, i2', ts @ [Const (nth_elem (j, all_rep_names),
berghofe@5177
   292
                    T' --> Univ_elT) $ mk_Free "x" T' i2])
berghofe@5177
   293
            | _ => (i2 + 1, i2', ts @ [Leaf $ mk_inj T' (mk_Free "x" T' i2)]))
berghofe@5177
   294
          end;
berghofe@5177
   295
berghofe@5177
   296
        val (i2, i2', ts) = foldl (process_arg ks) ((1, 1, []), cargs);
berghofe@5177
   297
        val xs = map (uncurry (mk_Free "x")) (argTs ~~ (1 upto (i2 - 1)));
berghofe@5177
   298
        val ys = map (mk_Free "y" Univ_elT) (1 upto (i2' - 1));
berghofe@5177
   299
        val f = list_abs_free (map dest_Free (xs @ ys), mk_univ_inj ts n i);
berghofe@5177
   300
berghofe@5177
   301
        val (_, _, ts') = foldl (process_arg []) ((1, 1, []), cargs);
berghofe@5177
   302
        val eqn = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@5177
   303
          (rep_const $ list_comb (constr, xs), mk_univ_inj ts' n i))
berghofe@5177
   304
berghofe@5177
   305
      in (fs @ [f], eqns @ [eqn], i + 1) end;
berghofe@5177
   306
berghofe@5177
   307
    (* define isomorphisms for all mutually recursive datatypes in list ds *)
berghofe@5177
   308
berghofe@5177
   309
    fun make_iso_defs (ds, (thy, char_thms)) =
berghofe@5177
   310
      let
berghofe@5177
   311
        val ks = map fst ds;
berghofe@5177
   312
        val (_, (tname, _, _)) = hd ds;
berghofe@5177
   313
        val {rec_rewrites, rec_names, ...} = the (Symtab.lookup (dt_info, tname));
berghofe@5177
   314
berghofe@5177
   315
        fun process_dt ((fs, eqns, isos), (k, (tname, _, constrs))) =
berghofe@5177
   316
          let
berghofe@5177
   317
            val (fs', eqns', _) = foldl (make_iso_def k ks (length constrs))
berghofe@5177
   318
              ((fs, eqns, 1), constrs);
berghofe@5177
   319
            val iso = (nth_elem (k, recTs), nth_elem (k, all_rep_names))
berghofe@5177
   320
          in (fs', eqns', isos @ [iso]) end;
berghofe@5177
   321
        
berghofe@5177
   322
        val (fs, eqns, isos) = foldl process_dt (([], [], []), ds);
berghofe@5177
   323
        val fTs = map fastype_of fs;
berghofe@5177
   324
        val defs = map (fn (rec_name, (T, iso_name)) => ((Sign.base_name iso_name) ^ "_def",
berghofe@5177
   325
          equals (T --> Univ_elT) $ Const (iso_name, T --> Univ_elT) $
berghofe@5177
   326
            list_comb (Const (rec_name, fTs @ [T] ---> Univ_elT), fs))) (rec_names ~~ isos);
berghofe@5177
   327
        val thy' = Theory.add_defs_i defs thy;
berghofe@5177
   328
        val def_thms = map (get_axiom thy') (map fst defs);
berghofe@5177
   329
berghofe@5177
   330
        (* prove characteristic equations *)
berghofe@5177
   331
oheimb@5553
   332
        val rewrites = def_thms @ (map mk_meta_eq rec_rewrites);
berghofe@5177
   333
        val char_thms' = map (fn eqn => prove_goalw_cterm rewrites
berghofe@5177
   334
          (cterm_of (sign_of thy') eqn) (fn _ => [rtac refl 1])) eqns;
berghofe@5177
   335
berghofe@5177
   336
      in (thy', char_thms' @ char_thms) end;
berghofe@5177
   337
berghofe@5661
   338
    val (thy5, iso_char_thms) = foldr make_iso_defs
berghofe@5661
   339
      (tl descr, (add_path flat_names big_name thy4, []));
berghofe@5177
   340
berghofe@5177
   341
    (* prove isomorphism properties *)
berghofe@5177
   342
berghofe@5177
   343
    (* prove  x : dt_rep_set_i --> x : range dt_Rep_i *)
berghofe@5177
   344
berghofe@5177
   345
    fun mk_iso_t (((set_name, iso_name), i), T) =
berghofe@5177
   346
      let val isoT = T --> Univ_elT
berghofe@5177
   347
      in HOLogic.imp $ 
berghofe@5177
   348
        HOLogic.mk_mem (mk_Free "x" Univ_elT i, Const (set_name, UnivT)) $
berghofe@5177
   349
          (if i < length newTs then Const ("True", HOLogic.boolT)
berghofe@5177
   350
           else HOLogic.mk_mem (mk_Free "x" Univ_elT i,
berghofe@5177
   351
             Const (image_name, [isoT, HOLogic.mk_setT T] ---> UnivT) $
berghofe@5177
   352
               Const (iso_name, isoT) $ Const (UNIV_name, HOLogic.mk_setT T)))
berghofe@5177
   353
      end;
berghofe@5177
   354
berghofe@5177
   355
    val iso_t = HOLogic.mk_Trueprop (mk_conj (map mk_iso_t
berghofe@5177
   356
      (rep_set_names ~~ all_rep_names ~~ (0 upto (length descr' - 1)) ~~ recTs)));
berghofe@5177
   357
berghofe@5177
   358
    val newT_Abs_inverse_thms = map (fn (iso, _, _) => iso RS subst) newT_iso_axms;
berghofe@5177
   359
berghofe@5177
   360
    (* all the theorems are proved by one single simultaneous induction *)
berghofe@5177
   361
berghofe@5177
   362
    val iso_thms = if length descr = 1 then [] else
berghofe@5177
   363
      drop (length newTs, split_conj_thm
berghofe@5177
   364
        (prove_goalw_cterm [] (cterm_of (sign_of thy5) iso_t) (fn _ =>
berghofe@5177
   365
           [indtac rep_induct 1,
berghofe@5177
   366
            REPEAT (rtac TrueI 1),
berghofe@5177
   367
            REPEAT (EVERY
berghofe@5177
   368
              [REPEAT (etac rangeE 1),
berghofe@5177
   369
               REPEAT (eresolve_tac newT_Abs_inverse_thms 1),
berghofe@5177
   370
               TRY (hyp_subst_tac 1),
berghofe@5177
   371
               rtac (sym RS range_eqI) 1,
berghofe@5177
   372
               resolve_tac iso_char_thms 1])])));
berghofe@5177
   373
berghofe@5177
   374
    val Abs_inverse_thms = newT_Abs_inverse_thms @ (map (fn r =>
berghofe@5177
   375
      r RS mp RS f_inv_f RS subst) iso_thms);
berghofe@5177
   376
berghofe@5177
   377
    (* prove  inj dt_Rep_i  and  dt_Rep_i x : dt_rep_set_i *)
berghofe@5177
   378
berghofe@5177
   379
    fun prove_iso_thms (ds, (inj_thms, elem_thms)) =
berghofe@5177
   380
      let
berghofe@5177
   381
        val (_, (tname, _, _)) = hd ds;
berghofe@5177
   382
        val {induction, ...} = the (Symtab.lookup (dt_info, tname));
berghofe@5177
   383
berghofe@5177
   384
        fun mk_ind_concl (i, _) =
berghofe@5177
   385
          let
berghofe@5177
   386
            val T = nth_elem (i, recTs);
berghofe@5177
   387
            val Rep_t = Const (nth_elem (i, all_rep_names), T --> Univ_elT);
berghofe@5177
   388
            val rep_set_name = nth_elem (i, rep_set_names)
berghofe@5177
   389
          in (HOLogic.all_const T $ Abs ("y", T, HOLogic.imp $
berghofe@5177
   390
                HOLogic.mk_eq (Rep_t $ mk_Free "x" T i, Rep_t $ Bound 0) $
berghofe@5177
   391
                  HOLogic.mk_eq (mk_Free "x" T i, Bound 0)),
berghofe@5177
   392
              HOLogic.mk_mem (Rep_t $ mk_Free "x" T i, Const (rep_set_name, UnivT)))
berghofe@5177
   393
          end;
berghofe@5177
   394
berghofe@5177
   395
        val (ind_concl1, ind_concl2) = ListPair.unzip (map mk_ind_concl ds);
berghofe@5177
   396
oheimb@5553
   397
        val rewrites = map mk_meta_eq iso_char_thms;
berghofe@5177
   398
        val inj_thms' = map (fn r => r RS injD) inj_thms;
berghofe@5177
   399
berghofe@5177
   400
        val inj_thm = prove_goalw_cterm [] (cterm_of (sign_of thy5)
berghofe@5177
   401
          (HOLogic.mk_Trueprop (mk_conj ind_concl1))) (fn _ =>
berghofe@5177
   402
            [indtac induction 1,
berghofe@5177
   403
             REPEAT (EVERY
berghofe@5177
   404
               [rtac allI 1, rtac impI 1,
berghofe@5177
   405
                exh_tac (exh_thm_of dt_info) 1,
berghofe@5177
   406
                REPEAT (EVERY
berghofe@5177
   407
                  [hyp_subst_tac 1,
berghofe@5177
   408
                   rewrite_goals_tac rewrites,
berghofe@5177
   409
                   REPEAT (dresolve_tac [In0_inject, In1_inject] 1),
berghofe@5177
   410
                   (eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1)
berghofe@5177
   411
                   ORELSE (EVERY
berghofe@5177
   412
                     [REPEAT (etac Scons_inject 1),
berghofe@5177
   413
                      REPEAT (dresolve_tac
berghofe@5177
   414
                        (inj_thms' @ [Leaf_inject, Inl_inject, Inr_inject]) 1),
berghofe@5177
   415
                      REPEAT (EVERY [etac allE 1, dtac mp 1, atac 1]),
berghofe@5177
   416
                      TRY (hyp_subst_tac 1),
berghofe@5177
   417
                      rtac refl 1])])])]);
berghofe@5177
   418
paulson@6171
   419
        val inj_thms'' = map (fn r => r RS datatype_injI)
paulson@6171
   420
                             (split_conj_thm inj_thm);
berghofe@5177
   421
paulson@6171
   422
        val elem_thm = 
paulson@6171
   423
	    prove_goalw_cterm []
paulson@6171
   424
	      (cterm_of (sign_of thy5)
paulson@6171
   425
	       (HOLogic.mk_Trueprop (mk_conj ind_concl2)))
paulson@6171
   426
	      (fn _ =>
paulson@6171
   427
	       [indtac induction 1,
paulson@6171
   428
		rewrite_goals_tac rewrites,
paulson@6171
   429
		REPEAT (EVERY
paulson@6171
   430
			[resolve_tac rep_intrs 1,
paulson@6171
   431
			 REPEAT ((atac 1) ORELSE
paulson@6171
   432
				 (resolve_tac elem_thms 1))])]);
berghofe@5177
   433
berghofe@5177
   434
      in (inj_thms @ inj_thms'', elem_thms @ (split_conj_thm elem_thm))
berghofe@5177
   435
      end;
berghofe@5177
   436
berghofe@5177
   437
    val (iso_inj_thms, iso_elem_thms) = foldr prove_iso_thms
berghofe@5177
   438
      (tl descr, (map snd newT_iso_inj_thms, map #3 newT_iso_axms));
berghofe@5177
   439
berghofe@5177
   440
    (******************* freeness theorems for constructors *******************)
berghofe@5177
   441
berghofe@5661
   442
    val _ = message "Proving freeness of constructors...";
berghofe@5177
   443
berghofe@5177
   444
    (* prove theorem  Rep_i (Constr_j ...) = Inj_j ...  *)
berghofe@5177
   445
    
berghofe@5177
   446
    fun prove_constr_rep_thm eqn =
berghofe@5177
   447
      let
berghofe@5177
   448
        val inj_thms = map (fn (r, _) => r RS inj_onD) newT_iso_inj_thms;
oheimb@5553
   449
        val rewrites = constr_defs @ (map (mk_meta_eq o #2) newT_iso_axms)
berghofe@5177
   450
      in prove_goalw_cterm [] (cterm_of (sign_of thy5) eqn) (fn _ =>
berghofe@5177
   451
        [resolve_tac inj_thms 1,
berghofe@5177
   452
         rewrite_goals_tac rewrites,
berghofe@5177
   453
         rtac refl 1,
berghofe@5177
   454
         resolve_tac rep_intrs 2,
berghofe@5177
   455
         REPEAT (resolve_tac iso_elem_thms 1)])
berghofe@5177
   456
      end;
berghofe@5177
   457
berghofe@5177
   458
    (*--------------------------------------------------------------*)
berghofe@5177
   459
    (* constr_rep_thms and rep_congs are used to prove distinctness *)
berghofe@5177
   460
    (* of constructors internally.                                  *)
berghofe@5177
   461
    (* the external version uses dt_case which is not defined yet   *)
berghofe@5177
   462
    (*--------------------------------------------------------------*)
berghofe@5177
   463
berghofe@5177
   464
    val constr_rep_thms = map (map prove_constr_rep_thm) constr_rep_eqns;
berghofe@5177
   465
berghofe@5177
   466
    val dist_rewrites = map (fn (rep_thms, dist_lemma) =>
berghofe@5177
   467
      dist_lemma::(rep_thms @ [In0_eq, In1_eq, In0_not_In1, In1_not_In0]))
berghofe@5177
   468
        (constr_rep_thms ~~ dist_lemmas);
berghofe@5177
   469
berghofe@5177
   470
    (* prove injectivity of constructors *)
berghofe@5177
   471
berghofe@5177
   472
    fun prove_constr_inj_thm rep_thms t =
berghofe@5177
   473
      let val inj_thms = Scons_inject::(map make_elim
berghofe@5177
   474
        ((map (fn r => r RS injD) iso_inj_thms) @
berghofe@5177
   475
          [In0_inject, In1_inject, Leaf_inject, Inl_inject, Inr_inject]))
berghofe@5177
   476
      in prove_goalw_cterm [] (cterm_of (sign_of thy5) t) (fn _ =>
berghofe@5177
   477
        [rtac iffI 1,
berghofe@5177
   478
         REPEAT (etac conjE 2), hyp_subst_tac 2, rtac refl 2,
berghofe@5177
   479
         dresolve_tac rep_congs 1, dtac box_equals 1,
berghofe@5177
   480
         REPEAT (resolve_tac rep_thms 1),
berghofe@5177
   481
         REPEAT (eresolve_tac inj_thms 1),
berghofe@5177
   482
         hyp_subst_tac 1,
berghofe@5177
   483
         REPEAT (resolve_tac [conjI, refl] 1)])
berghofe@5177
   484
      end;
berghofe@5177
   485
berghofe@5177
   486
    val constr_inject = map (fn (ts, thms) => map (prove_constr_inj_thm thms) ts)
berghofe@5177
   487
      ((DatatypeProp.make_injs descr sorts) ~~ constr_rep_thms);
berghofe@5177
   488
berghofe@5661
   489
    val thy6 = store_thmss "inject" new_type_names
berghofe@5661
   490
      constr_inject (parent_path flat_names thy5);
berghofe@5177
   491
berghofe@5177
   492
    (*************************** induction theorem ****************************)
berghofe@5177
   493
berghofe@5661
   494
    val _ = message "Proving induction rule for datatypes...";
berghofe@5177
   495
berghofe@5177
   496
    val Rep_inverse_thms = (map (fn (_, iso, _) => iso RS subst) newT_iso_axms) @
berghofe@5177
   497
      (map (fn r => r RS inv_f_f RS subst) (drop (length newTs, iso_inj_thms)));
berghofe@5177
   498
    val Rep_inverse_thms' = map (fn r => r RS inv_f_f)
berghofe@5177
   499
      (drop (length newTs, iso_inj_thms));
berghofe@5177
   500
berghofe@5177
   501
    fun mk_indrule_lemma ((prems, concls), ((i, _), T)) =
berghofe@5177
   502
      let
berghofe@5177
   503
        val Rep_t = Const (nth_elem (i, all_rep_names), T --> Univ_elT) $
berghofe@5177
   504
          mk_Free "x" T i;
berghofe@5177
   505
berghofe@5177
   506
        val Abs_t = if i < length newTs then
berghofe@5177
   507
            Const (Sign.intern_const (sign_of thy6)
berghofe@5177
   508
              ("Abs_" ^ (nth_elem (i, new_type_names))), Univ_elT --> T)
berghofe@5177
   509
          else Const (inv_name, [T --> Univ_elT, Univ_elT] ---> T) $
berghofe@5177
   510
            Const (nth_elem (i, all_rep_names), T --> Univ_elT)
berghofe@5177
   511
berghofe@5177
   512
      in (prems @ [HOLogic.imp $ HOLogic.mk_mem (Rep_t,
berghofe@5177
   513
            Const (nth_elem (i, rep_set_names), UnivT)) $
berghofe@5177
   514
              (mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ (Abs_t $ Rep_t))],
berghofe@5177
   515
          concls @ [mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ mk_Free "x" T i])
berghofe@5177
   516
      end;
berghofe@5177
   517
berghofe@5177
   518
    val (indrule_lemma_prems, indrule_lemma_concls) =
berghofe@5177
   519
      foldl mk_indrule_lemma (([], []), (descr' ~~ recTs));
berghofe@5177
   520
berghofe@5177
   521
    val cert = cterm_of (sign_of thy6);
berghofe@5177
   522
berghofe@5177
   523
    val indrule_lemma = prove_goalw_cterm [] (cert
berghofe@5177
   524
      (Logic.mk_implies
berghofe@5177
   525
        (HOLogic.mk_Trueprop (mk_conj indrule_lemma_prems),
berghofe@5177
   526
         HOLogic.mk_Trueprop (mk_conj indrule_lemma_concls)))) (fn prems =>
berghofe@5177
   527
           [cut_facts_tac prems 1, REPEAT (etac conjE 1),
berghofe@5177
   528
            REPEAT (EVERY
berghofe@5177
   529
              [TRY (rtac conjI 1), resolve_tac Rep_inverse_thms 1,
berghofe@5177
   530
               etac mp 1, resolve_tac iso_elem_thms 1])]);
berghofe@5177
   531
berghofe@5177
   532
    val Ps = map head_of (dest_conj (HOLogic.dest_Trueprop (concl_of indrule_lemma)));
berghofe@5177
   533
    val frees = if length Ps = 1 then [Free ("P", snd (dest_Var (hd Ps)))] else
berghofe@5177
   534
      map (Free o apfst fst o dest_Var) Ps;
berghofe@5177
   535
    val indrule_lemma' = cterm_instantiate (map cert Ps ~~ map cert frees) indrule_lemma;
berghofe@5177
   536
berghofe@5177
   537
    val dt_induct = prove_goalw_cterm [] (cert
berghofe@5177
   538
      (DatatypeProp.make_ind descr sorts)) (fn prems =>
berghofe@5177
   539
        [rtac indrule_lemma' 1, indtac rep_induct 1,
berghofe@5177
   540
         EVERY (map (fn (prem, r) => (EVERY
berghofe@5177
   541
           [REPEAT (eresolve_tac Abs_inverse_thms 1),
berghofe@5177
   542
            simp_tac (HOL_basic_ss addsimps ((symmetric r)::Rep_inverse_thms')) 1,
berghofe@5177
   543
            DEPTH_SOLVE_1 (ares_tac [prem] 1)]))
oheimb@5553
   544
              (prems ~~ (constr_defs @ (map mk_meta_eq iso_char_thms))))]);
berghofe@5177
   545
berghofe@5661
   546
    val thy7 = thy6 |>
berghofe@5661
   547
      Theory.add_path big_name |>
wenzelm@6092
   548
      PureThy.add_thms [(("induct", dt_induct), [])] |>
berghofe@5661
   549
      Theory.parent_path;
berghofe@5177
   550
berghofe@5177
   551
  in (thy7, constr_inject, dist_rewrites, dt_induct)
berghofe@5177
   552
  end;
berghofe@5177
   553
berghofe@5177
   554
end;