src/HOLCF/Tools/Domain/domain_take_proofs.ML
author huffman
Tue Apr 20 13:44:28 2010 -0700 (2010-04-20)
changeset 36241 2a4cec6bcae2
parent 35773 cae4f840d15d
child 36692 54b64d4ad524
permissions -rw-r--r--
replace many uses of Drule.export_without_context with Drule.zero_var_indexes
huffman@35514
     1
(*  Title:      HOLCF/Tools/domain/domain_take_proofs.ML
huffman@35514
     2
    Author:     Brian Huffman
huffman@35514
     3
huffman@35514
     4
Defines take functions for the given domain equation
huffman@35514
     5
and proves related theorems.
huffman@35514
     6
*)
huffman@35514
     7
huffman@35514
     8
signature DOMAIN_TAKE_PROOFS =
huffman@35514
     9
sig
huffman@35514
    10
  type iso_info =
huffman@35514
    11
    {
huffman@35514
    12
      absT : typ,
huffman@35514
    13
      repT : typ,
huffman@35514
    14
      abs_const : term,
huffman@35514
    15
      rep_const : term,
huffman@35514
    16
      abs_inverse : thm,
huffman@35514
    17
      rep_inverse : thm
huffman@35514
    18
    }
huffman@35651
    19
  type take_info =
huffman@35659
    20
    {
huffman@35659
    21
      take_consts : term list,
huffman@35514
    22
      take_defs : thm list,
huffman@35514
    23
      chain_take_thms : thm list,
huffman@35514
    24
      take_0_thms : thm list,
huffman@35514
    25
      take_Suc_thms : thm list,
huffman@35515
    26
      deflation_take_thms : thm list,
huffman@35515
    27
      finite_consts : term list,
huffman@35515
    28
      finite_defs : thm list
huffman@35651
    29
    }
huffman@35656
    30
  type take_induct_info =
huffman@35656
    31
    {
huffman@35659
    32
      take_consts         : term list,
huffman@35659
    33
      take_defs           : thm list,
huffman@35659
    34
      chain_take_thms     : thm list,
huffman@35659
    35
      take_0_thms         : thm list,
huffman@35659
    36
      take_Suc_thms       : thm list,
huffman@35659
    37
      deflation_take_thms : thm list,
huffman@35659
    38
      finite_consts       : term list,
huffman@35659
    39
      finite_defs         : thm list,
huffman@35659
    40
      lub_take_thms       : thm list,
huffman@35659
    41
      reach_thms          : thm list,
huffman@35659
    42
      take_lemma_thms     : thm list,
huffman@35659
    43
      is_finite           : bool,
huffman@35659
    44
      take_induct_thms    : thm list
huffman@35656
    45
    }
huffman@35651
    46
  val define_take_functions :
huffman@35651
    47
    (binding * iso_info) list -> theory -> take_info * theory
huffman@35514
    48
huffman@35654
    49
  val add_lub_take_theorems :
huffman@35654
    50
    (binding * iso_info) list -> take_info -> thm list ->
huffman@35656
    51
    theory -> take_induct_info * theory
huffman@35654
    52
huffman@35514
    53
  val map_of_typ :
huffman@35514
    54
    theory -> (typ * term) list -> typ -> term
huffman@35514
    55
huffman@35514
    56
  val add_map_function :
huffman@35514
    57
    (string * string * thm) -> theory -> theory
huffman@35514
    58
huffman@35514
    59
  val get_map_tab : theory -> string Symtab.table
huffman@35514
    60
  val get_deflation_thms : theory -> thm list
huffman@35514
    61
end;
huffman@35514
    62
huffman@35514
    63
structure Domain_Take_Proofs : DOMAIN_TAKE_PROOFS =
huffman@35514
    64
struct
huffman@35514
    65
huffman@35514
    66
type iso_info =
huffman@35514
    67
  {
huffman@35514
    68
    absT : typ,
huffman@35514
    69
    repT : typ,
huffman@35514
    70
    abs_const : term,
huffman@35514
    71
    rep_const : term,
huffman@35514
    72
    abs_inverse : thm,
huffman@35514
    73
    rep_inverse : thm
huffman@35514
    74
  };
huffman@35514
    75
huffman@35651
    76
type take_info =
huffman@35651
    77
  { take_consts : term list,
huffman@35651
    78
    take_defs : thm list,
huffman@35651
    79
    chain_take_thms : thm list,
huffman@35651
    80
    take_0_thms : thm list,
huffman@35651
    81
    take_Suc_thms : thm list,
huffman@35651
    82
    deflation_take_thms : thm list,
huffman@35651
    83
    finite_consts : term list,
huffman@35651
    84
    finite_defs : thm list
huffman@35651
    85
  };
huffman@35651
    86
huffman@35656
    87
type take_induct_info =
huffman@35656
    88
  {
huffman@35659
    89
    take_consts         : term list,
huffman@35659
    90
    take_defs           : thm list,
huffman@35659
    91
    chain_take_thms     : thm list,
huffman@35659
    92
    take_0_thms         : thm list,
huffman@35659
    93
    take_Suc_thms       : thm list,
huffman@35659
    94
    deflation_take_thms : thm list,
huffman@35659
    95
    finite_consts       : term list,
huffman@35659
    96
    finite_defs         : thm list,
huffman@35659
    97
    lub_take_thms       : thm list,
huffman@35659
    98
    reach_thms          : thm list,
huffman@35659
    99
    take_lemma_thms     : thm list,
huffman@35659
   100
    is_finite           : bool,
huffman@35659
   101
    take_induct_thms    : thm list
huffman@35656
   102
  };
huffman@35656
   103
huffman@35514
   104
val beta_ss =
huffman@35514
   105
  HOL_basic_ss
huffman@35514
   106
    addsimps simp_thms
huffman@35514
   107
    addsimps [@{thm beta_cfun}]
huffman@35514
   108
    addsimprocs [@{simproc cont_proc}];
huffman@35514
   109
huffman@35514
   110
val beta_tac = simp_tac beta_ss;
huffman@35514
   111
huffman@35514
   112
(******************************************************************************)
huffman@35514
   113
(******************************** theory data *********************************)
huffman@35514
   114
(******************************************************************************)
huffman@35514
   115
huffman@35514
   116
structure MapData = Theory_Data
huffman@35514
   117
(
huffman@35514
   118
  (* constant names like "foo_map" *)
huffman@35514
   119
  type T = string Symtab.table;
huffman@35514
   120
  val empty = Symtab.empty;
huffman@35514
   121
  val extend = I;
huffman@35514
   122
  fun merge data = Symtab.merge (K true) data;
huffman@35514
   123
);
huffman@35514
   124
huffman@35514
   125
structure DeflMapData = Theory_Data
huffman@35514
   126
(
huffman@35514
   127
  (* theorems like "deflation a ==> deflation (foo_map$a)" *)
huffman@35514
   128
  type T = thm list;
huffman@35514
   129
  val empty = [];
huffman@35514
   130
  val extend = I;
huffman@35514
   131
  val merge = Thm.merge_thms;
huffman@35514
   132
);
huffman@35514
   133
huffman@35514
   134
fun add_map_function (tname, map_name, deflation_map_thm) =
huffman@35514
   135
    MapData.map (Symtab.insert (K true) (tname, map_name))
huffman@35514
   136
    #> DeflMapData.map (Thm.add_thm deflation_map_thm);
huffman@35514
   137
huffman@35514
   138
val get_map_tab = MapData.get;
huffman@35514
   139
val get_deflation_thms = DeflMapData.get;
huffman@35514
   140
huffman@35514
   141
(******************************************************************************)
huffman@35514
   142
(************************** building types and terms **************************)
huffman@35514
   143
(******************************************************************************)
huffman@35514
   144
huffman@35514
   145
open HOLCF_Library;
huffman@35514
   146
huffman@35514
   147
infixr 6 ->>;
huffman@35514
   148
infix -->>;
huffman@35515
   149
infix 9 `;
huffman@35514
   150
huffman@35514
   151
fun mapT (T as Type (_, Ts)) =
huffman@35514
   152
    (map (fn T => T ->> T) Ts) -->> (T ->> T)
huffman@35514
   153
  | mapT T = T ->> T;
huffman@35514
   154
huffman@35514
   155
fun mk_deflation t =
huffman@35514
   156
  Const (@{const_name deflation}, Term.fastype_of t --> boolT) $ t;
huffman@35514
   157
huffman@35514
   158
fun mk_eqs (t, u) = HOLogic.mk_Trueprop (HOLogic.mk_eq (t, u));
huffman@35514
   159
huffman@35514
   160
(******************************************************************************)
huffman@35514
   161
(****************************** isomorphism info ******************************)
huffman@35514
   162
(******************************************************************************)
huffman@35514
   163
huffman@35514
   164
fun deflation_abs_rep (info : iso_info) : thm =
huffman@35514
   165
  let
huffman@35514
   166
    val abs_iso = #abs_inverse info;
huffman@35514
   167
    val rep_iso = #rep_inverse info;
huffman@35514
   168
    val thm = @{thm deflation_abs_rep} OF [abs_iso, rep_iso];
huffman@35514
   169
  in
huffman@36241
   170
    Drule.zero_var_indexes thm
huffman@35514
   171
  end
huffman@35514
   172
huffman@35514
   173
(******************************************************************************)
huffman@35514
   174
(********************* building map functions over types **********************)
huffman@35514
   175
(******************************************************************************)
huffman@35514
   176
huffman@35514
   177
fun map_of_typ (thy : theory) (sub : (typ * term) list) (T : typ) : term =
huffman@35514
   178
  let
huffman@35514
   179
    val map_tab = get_map_tab thy;
huffman@35514
   180
    fun auto T = T ->> T;
huffman@35514
   181
    fun map_of T =
huffman@35514
   182
        case AList.lookup (op =) sub T of
huffman@35514
   183
          SOME m => (m, true) | NONE => map_of' T
huffman@35514
   184
    and map_of' (T as (Type (c, Ts))) =
huffman@35514
   185
        (case Symtab.lookup map_tab c of
huffman@35514
   186
          SOME map_name =>
huffman@35514
   187
          let
huffman@35514
   188
            val map_type = map auto Ts -->> auto T;
huffman@35514
   189
            val (ms, bs) = map_split map_of Ts;
huffman@35514
   190
          in
huffman@35514
   191
            if exists I bs
huffman@35514
   192
            then (list_ccomb (Const (map_name, map_type), ms), true)
huffman@35514
   193
            else (mk_ID T, false)
huffman@35514
   194
          end
huffman@35514
   195
        | NONE => (mk_ID T, false))
huffman@35514
   196
      | map_of' T = (mk_ID T, false);
huffman@35514
   197
  in
huffman@35514
   198
    fst (map_of T)
huffman@35514
   199
  end;
huffman@35514
   200
huffman@35514
   201
huffman@35514
   202
(******************************************************************************)
huffman@35514
   203
(********************* declaring definitions and theorems *********************)
huffman@35514
   204
(******************************************************************************)
huffman@35514
   205
huffman@35773
   206
fun add_qualified_def name (dbind, eqn) =
huffman@35773
   207
    yield_singleton (PureThy.add_defs false)
huffman@35773
   208
     ((Binding.qualified true name dbind, eqn), []);
huffman@35514
   209
huffman@35773
   210
fun add_qualified_thm name (dbind, thm) =
huffman@35773
   211
    yield_singleton PureThy.add_thms
huffman@35773
   212
      ((Binding.qualified true name dbind, thm), []);
huffman@35650
   213
huffman@35773
   214
fun add_qualified_simp_thm name (dbind, thm) =
huffman@35773
   215
    yield_singleton PureThy.add_thms
huffman@35773
   216
      ((Binding.qualified true name dbind, thm), [Simplifier.simp_add]);
huffman@35573
   217
huffman@35514
   218
(******************************************************************************)
huffman@35514
   219
(************************** defining take functions ***************************)
huffman@35514
   220
(******************************************************************************)
huffman@35514
   221
huffman@35514
   222
fun define_take_functions
huffman@35514
   223
    (spec : (binding * iso_info) list)
huffman@35514
   224
    (thy : theory) =
huffman@35514
   225
  let
huffman@35514
   226
huffman@35514
   227
    (* retrieve components of spec *)
huffman@35773
   228
    val dbinds = map fst spec;
huffman@35514
   229
    val iso_infos = map snd spec;
huffman@35514
   230
    val dom_eqns = map (fn x => (#absT x, #repT x)) iso_infos;
huffman@35514
   231
    val rep_abs_consts = map (fn x => (#rep_const x, #abs_const x)) iso_infos;
huffman@35514
   232
huffman@35514
   233
    (* get table of map functions *)
huffman@35514
   234
    val map_tab = MapData.get thy;
huffman@35514
   235
huffman@35514
   236
    fun mk_projs []      t = []
huffman@35514
   237
      | mk_projs (x::[]) t = [(x, t)]
huffman@35514
   238
      | mk_projs (x::xs) t = (x, mk_fst t) :: mk_projs xs (mk_snd t);
huffman@35514
   239
huffman@35514
   240
    fun mk_cfcomp2 ((rep_const, abs_const), f) =
huffman@35514
   241
        mk_cfcomp (abs_const, mk_cfcomp (f, rep_const));
huffman@35514
   242
huffman@35514
   243
    (* define take functional *)
huffman@35514
   244
    val newTs : typ list = map fst dom_eqns;
huffman@35514
   245
    val copy_arg_type = mk_tupleT (map (fn T => T ->> T) newTs);
huffman@35514
   246
    val copy_arg = Free ("f", copy_arg_type);
huffman@35773
   247
    val copy_args = map snd (mk_projs dbinds copy_arg);
huffman@35514
   248
    fun one_copy_rhs (rep_abs, (lhsT, rhsT)) =
huffman@35514
   249
      let
huffman@35514
   250
        val body = map_of_typ thy (newTs ~~ copy_args) rhsT;
huffman@35514
   251
      in
huffman@35514
   252
        mk_cfcomp2 (rep_abs, body)
huffman@35514
   253
      end;
huffman@35514
   254
    val take_functional =
huffman@35514
   255
        big_lambda copy_arg
huffman@35514
   256
          (mk_tuple (map one_copy_rhs (rep_abs_consts ~~ dom_eqns)));
huffman@35514
   257
    val take_rhss =
huffman@35514
   258
      let
huffman@35557
   259
        val n = Free ("n", HOLogic.natT);
huffman@35557
   260
        val rhs = mk_iterate (n, take_functional);
huffman@35514
   261
      in
huffman@35773
   262
        map (lambda n o snd) (mk_projs dbinds rhs)
huffman@35514
   263
      end;
huffman@35514
   264
huffman@35514
   265
    (* define take constants *)
huffman@35773
   266
    fun define_take_const ((dbind, take_rhs), (lhsT, rhsT)) thy =
huffman@35514
   267
      let
huffman@35514
   268
        val take_type = HOLogic.natT --> lhsT ->> lhsT;
huffman@35773
   269
        val take_bind = Binding.suffix_name "_take" dbind;
huffman@35514
   270
        val (take_const, thy) =
huffman@35514
   271
          Sign.declare_const ((take_bind, take_type), NoSyn) thy;
huffman@35514
   272
        val take_eqn = Logic.mk_equals (take_const, take_rhs);
huffman@35514
   273
        val (take_def_thm, thy) =
huffman@35773
   274
            add_qualified_def "take_def" (dbind, take_eqn) thy;
huffman@35514
   275
      in ((take_const, take_def_thm), thy) end;
huffman@35514
   276
    val ((take_consts, take_defs), thy) = thy
huffman@35773
   277
      |> fold_map define_take_const (dbinds ~~ take_rhss ~~ dom_eqns)
huffman@35514
   278
      |>> ListPair.unzip;
huffman@35514
   279
huffman@35514
   280
    (* prove chain_take lemmas *)
huffman@35773
   281
    fun prove_chain_take (take_const, dbind) thy =
huffman@35514
   282
      let
huffman@35514
   283
        val goal = mk_trp (mk_chain take_const);
huffman@35514
   284
        val rules = take_defs @ @{thms chain_iterate ch2ch_fst ch2ch_snd};
huffman@35514
   285
        val tac = simp_tac (HOL_basic_ss addsimps rules) 1;
huffman@35572
   286
        val thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   287
      in
huffman@35773
   288
        add_qualified_simp_thm "chain_take" (dbind, thm) thy
huffman@35514
   289
      end;
huffman@35514
   290
    val (chain_take_thms, thy) =
huffman@35773
   291
      fold_map prove_chain_take (take_consts ~~ dbinds) thy;
huffman@35514
   292
huffman@35514
   293
    (* prove take_0 lemmas *)
huffman@35773
   294
    fun prove_take_0 ((take_const, dbind), (lhsT, rhsT)) thy =
huffman@35514
   295
      let
huffman@35514
   296
        val lhs = take_const $ @{term "0::nat"};
huffman@35514
   297
        val goal = mk_eqs (lhs, mk_bottom (lhsT ->> lhsT));
huffman@35514
   298
        val rules = take_defs @ @{thms iterate_0 fst_strict snd_strict};
huffman@35514
   299
        val tac = simp_tac (HOL_basic_ss addsimps rules) 1;
huffman@35514
   300
        val take_0_thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   301
      in
huffman@35773
   302
        add_qualified_thm "take_0" (dbind, take_0_thm) thy
huffman@35514
   303
      end;
huffman@35514
   304
    val (take_0_thms, thy) =
huffman@35773
   305
      fold_map prove_take_0 (take_consts ~~ dbinds ~~ dom_eqns) thy;
huffman@35514
   306
huffman@35514
   307
    (* prove take_Suc lemmas *)
huffman@35557
   308
    val n = Free ("n", natT);
huffman@35557
   309
    val take_is = map (fn t => t $ n) take_consts;
huffman@35514
   310
    fun prove_take_Suc
huffman@35773
   311
          (((take_const, rep_abs), dbind), (lhsT, rhsT)) thy =
huffman@35514
   312
      let
huffman@35557
   313
        val lhs = take_const $ (@{term Suc} $ n);
huffman@35514
   314
        val body = map_of_typ thy (newTs ~~ take_is) rhsT;
huffman@35514
   315
        val rhs = mk_cfcomp2 (rep_abs, body);
huffman@35514
   316
        val goal = mk_eqs (lhs, rhs);
huffman@35514
   317
        val simps = @{thms iterate_Suc fst_conv snd_conv}
huffman@35514
   318
        val rules = take_defs @ simps;
huffman@35514
   319
        val tac = simp_tac (beta_ss addsimps rules) 1;
huffman@35514
   320
        val take_Suc_thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   321
      in
huffman@35773
   322
        add_qualified_thm "take_Suc" (dbind, take_Suc_thm) thy
huffman@35514
   323
      end;
huffman@35514
   324
    val (take_Suc_thms, thy) =
huffman@35514
   325
      fold_map prove_take_Suc
huffman@35773
   326
        (take_consts ~~ rep_abs_consts ~~ dbinds ~~ dom_eqns) thy;
huffman@35514
   327
huffman@35514
   328
    (* prove deflation theorems for take functions *)
huffman@35514
   329
    val deflation_abs_rep_thms = map deflation_abs_rep iso_infos;
huffman@35514
   330
    val deflation_take_thm =
huffman@35514
   331
      let
huffman@35557
   332
        val n = Free ("n", natT);
huffman@35557
   333
        fun mk_goal take_const = mk_deflation (take_const $ n);
huffman@35514
   334
        val goal = mk_trp (foldr1 mk_conj (map mk_goal take_consts));
huffman@35514
   335
        val adm_rules =
huffman@35514
   336
          @{thms adm_conj adm_subst [OF _ adm_deflation]
huffman@35514
   337
                 cont2cont_fst cont2cont_snd cont_id};
huffman@35514
   338
        val bottom_rules =
huffman@35514
   339
          take_0_thms @ @{thms deflation_UU simp_thms};
huffman@35514
   340
        val deflation_rules =
huffman@35514
   341
          @{thms conjI deflation_ID}
huffman@35514
   342
          @ deflation_abs_rep_thms
huffman@35514
   343
          @ DeflMapData.get thy;
huffman@35514
   344
      in
huffman@35514
   345
        Goal.prove_global thy [] [] goal (fn _ =>
huffman@35514
   346
         EVERY
huffman@35514
   347
          [rtac @{thm nat.induct} 1,
huffman@35514
   348
           simp_tac (HOL_basic_ss addsimps bottom_rules) 1,
huffman@35514
   349
           asm_simp_tac (HOL_basic_ss addsimps take_Suc_thms) 1,
huffman@35514
   350
           REPEAT (etac @{thm conjE} 1
huffman@35514
   351
                   ORELSE resolve_tac deflation_rules 1
huffman@35514
   352
                   ORELSE atac 1)])
huffman@35514
   353
      end;
huffman@35514
   354
    fun conjuncts [] thm = []
huffman@35514
   355
      | conjuncts (n::[]) thm = [(n, thm)]
huffman@35514
   356
      | conjuncts (n::ns) thm = let
huffman@35514
   357
          val thmL = thm RS @{thm conjunct1};
huffman@35514
   358
          val thmR = thm RS @{thm conjunct2};
huffman@35514
   359
        in (n, thmL):: conjuncts ns thmR end;
huffman@35514
   360
    val (deflation_take_thms, thy) =
huffman@35514
   361
      fold_map (add_qualified_thm "deflation_take")
huffman@36241
   362
        (map (apsnd Drule.zero_var_indexes)
huffman@35773
   363
          (conjuncts dbinds deflation_take_thm)) thy;
huffman@35514
   364
huffman@35514
   365
    (* prove strictness of take functions *)
huffman@35773
   366
    fun prove_take_strict (deflation_take, dbind) thy =
huffman@35514
   367
      let
huffman@35572
   368
        val take_strict_thm =
huffman@36241
   369
            Drule.zero_var_indexes
huffman@36241
   370
              (@{thm deflation_strict} OF [deflation_take]);
huffman@35514
   371
      in
huffman@35773
   372
        add_qualified_thm "take_strict" (dbind, take_strict_thm) thy
huffman@35514
   373
      end;
huffman@35514
   374
    val (take_strict_thms, thy) =
huffman@35572
   375
      fold_map prove_take_strict
huffman@35773
   376
        (deflation_take_thms ~~ dbinds) thy;
huffman@35514
   377
huffman@35514
   378
    (* prove take/take rules *)
huffman@35773
   379
    fun prove_take_take ((chain_take, deflation_take), dbind) thy =
huffman@35514
   380
      let
huffman@35514
   381
        val take_take_thm =
huffman@36241
   382
            Drule.zero_var_indexes
huffman@36241
   383
              (@{thm deflation_chain_min} OF [chain_take, deflation_take]);
huffman@35514
   384
      in
huffman@35773
   385
        add_qualified_thm "take_take" (dbind, take_take_thm) thy
huffman@35514
   386
      end;
huffman@35514
   387
    val (take_take_thms, thy) =
huffman@35514
   388
      fold_map prove_take_take
huffman@35773
   389
        (chain_take_thms ~~ deflation_take_thms ~~ dbinds) thy;
huffman@35514
   390
huffman@35572
   391
    (* prove take_below rules *)
huffman@35773
   392
    fun prove_take_below (deflation_take, dbind) thy =
huffman@35572
   393
      let
huffman@35572
   394
        val take_below_thm =
huffman@36241
   395
            Drule.zero_var_indexes
huffman@36241
   396
              (@{thm deflation.below} OF [deflation_take]);
huffman@35572
   397
      in
huffman@35773
   398
        add_qualified_thm "take_below" (dbind, take_below_thm) thy
huffman@35572
   399
      end;
huffman@35572
   400
    val (take_below_thms, thy) =
huffman@35572
   401
      fold_map prove_take_below
huffman@35773
   402
        (deflation_take_thms ~~ dbinds) thy;
huffman@35572
   403
huffman@35515
   404
    (* define finiteness predicates *)
huffman@35773
   405
    fun define_finite_const ((dbind, take_const), (lhsT, rhsT)) thy =
huffman@35515
   406
      let
huffman@35515
   407
        val finite_type = lhsT --> boolT;
huffman@35773
   408
        val finite_bind = Binding.suffix_name "_finite" dbind;
huffman@35515
   409
        val (finite_const, thy) =
huffman@35515
   410
          Sign.declare_const ((finite_bind, finite_type), NoSyn) thy;
huffman@35515
   411
        val x = Free ("x", lhsT);
huffman@35557
   412
        val n = Free ("n", natT);
huffman@35515
   413
        val finite_rhs =
huffman@35515
   414
          lambda x (HOLogic.exists_const natT $
huffman@35557
   415
            (lambda n (mk_eq (mk_capply (take_const $ n, x), x))));
huffman@35515
   416
        val finite_eqn = Logic.mk_equals (finite_const, finite_rhs);
huffman@35515
   417
        val (finite_def_thm, thy) =
huffman@35773
   418
            add_qualified_def "finite_def" (dbind, finite_eqn) thy;
huffman@35515
   419
      in ((finite_const, finite_def_thm), thy) end;
huffman@35515
   420
    val ((finite_consts, finite_defs), thy) = thy
huffman@35773
   421
      |> fold_map define_finite_const (dbinds ~~ take_consts ~~ dom_eqns)
huffman@35515
   422
      |>> ListPair.unzip;
huffman@35515
   423
huffman@35514
   424
    val result =
huffman@35514
   425
      {
huffman@35514
   426
        take_consts = take_consts,
huffman@35514
   427
        take_defs = take_defs,
huffman@35514
   428
        chain_take_thms = chain_take_thms,
huffman@35514
   429
        take_0_thms = take_0_thms,
huffman@35514
   430
        take_Suc_thms = take_Suc_thms,
huffman@35515
   431
        deflation_take_thms = deflation_take_thms,
huffman@35515
   432
        finite_consts = finite_consts,
huffman@35515
   433
        finite_defs = finite_defs
huffman@35514
   434
      };
huffman@35514
   435
huffman@35514
   436
  in
huffman@35514
   437
    (result, thy)
huffman@35514
   438
  end;
huffman@35514
   439
huffman@35655
   440
fun prove_finite_take_induct
huffman@35655
   441
    (spec : (binding * iso_info) list)
huffman@35655
   442
    (take_info : take_info)
huffman@35655
   443
    (lub_take_thms : thm list)
huffman@35655
   444
    (thy : theory) =
huffman@35655
   445
  let
huffman@35773
   446
    val dbinds = map fst spec;
huffman@35655
   447
    val iso_infos = map snd spec;
huffman@35655
   448
    val absTs = map #absT iso_infos;
huffman@35655
   449
    val {take_consts, ...} = take_info;
huffman@35655
   450
    val {chain_take_thms, take_0_thms, take_Suc_thms, ...} = take_info;
huffman@35655
   451
    val {finite_consts, finite_defs, ...} = take_info;
huffman@35655
   452
huffman@35655
   453
    val decisive_lemma =
huffman@35655
   454
      let
huffman@35655
   455
        fun iso_locale info =
huffman@35655
   456
            @{thm iso.intro} OF [#abs_inverse info, #rep_inverse info];
huffman@35655
   457
        val iso_locale_thms = map iso_locale iso_infos;
huffman@35655
   458
        val decisive_abs_rep_thms =
huffman@35655
   459
            map (fn x => @{thm decisive_abs_rep} OF [x]) iso_locale_thms;
huffman@35655
   460
        val n = Free ("n", @{typ nat});
huffman@35655
   461
        fun mk_decisive t =
huffman@35655
   462
            Const (@{const_name decisive}, fastype_of t --> boolT) $ t;
huffman@35655
   463
        fun f take_const = mk_decisive (take_const $ n);
huffman@35655
   464
        val goal = mk_trp (foldr1 mk_conj (map f take_consts));
huffman@35655
   465
        val rules0 = @{thm decisive_bottom} :: take_0_thms;
huffman@35655
   466
        val rules1 =
huffman@35655
   467
            take_Suc_thms @ decisive_abs_rep_thms
huffman@35655
   468
            @ @{thms decisive_ID decisive_ssum_map decisive_sprod_map};
huffman@35655
   469
        val tac = EVERY [
huffman@35655
   470
            rtac @{thm nat.induct} 1,
huffman@35655
   471
            simp_tac (HOL_ss addsimps rules0) 1,
huffman@35655
   472
            asm_simp_tac (HOL_ss addsimps rules1) 1];
huffman@35655
   473
      in Goal.prove_global thy [] [] goal (K tac) end;
huffman@35655
   474
    fun conjuncts 1 thm = [thm]
huffman@35655
   475
      | conjuncts n thm = let
huffman@35655
   476
          val thmL = thm RS @{thm conjunct1};
huffman@35655
   477
          val thmR = thm RS @{thm conjunct2};
huffman@35655
   478
        in thmL :: conjuncts (n-1) thmR end;
huffman@35655
   479
    val decisive_thms = conjuncts (length spec) decisive_lemma;
huffman@35655
   480
huffman@35655
   481
    fun prove_finite_thm (absT, finite_const) =
huffman@35655
   482
      let
huffman@35655
   483
        val goal = mk_trp (finite_const $ Free ("x", absT));
huffman@35655
   484
        val tac =
huffman@35655
   485
            EVERY [
huffman@35655
   486
            rewrite_goals_tac finite_defs,
huffman@35655
   487
            rtac @{thm lub_ID_finite} 1,
huffman@35655
   488
            resolve_tac chain_take_thms 1,
huffman@35655
   489
            resolve_tac lub_take_thms 1,
huffman@35655
   490
            resolve_tac decisive_thms 1];
huffman@35655
   491
      in
huffman@35655
   492
        Goal.prove_global thy [] [] goal (K tac)
huffman@35655
   493
      end;
huffman@35655
   494
    val finite_thms =
huffman@35655
   495
        map prove_finite_thm (absTs ~~ finite_consts);
huffman@35655
   496
huffman@35655
   497
    fun prove_take_induct ((ch_take, lub_take), decisive) =
huffman@35655
   498
        Drule.export_without_context
huffman@35655
   499
          (@{thm lub_ID_finite_take_induct} OF [ch_take, lub_take, decisive]);
huffman@35655
   500
    val take_induct_thms =
huffman@35655
   501
        map prove_take_induct
huffman@35655
   502
          (chain_take_thms ~~ lub_take_thms ~~ decisive_thms);
huffman@35655
   503
huffman@35655
   504
    val thy = thy
huffman@35655
   505
        |> fold (snd oo add_qualified_thm "finite")
huffman@35773
   506
            (dbinds ~~ finite_thms)
huffman@35655
   507
        |> fold (snd oo add_qualified_thm "take_induct")
huffman@35773
   508
            (dbinds ~~ take_induct_thms);
huffman@35655
   509
  in
huffman@35655
   510
    ((finite_thms, take_induct_thms), thy)
huffman@35655
   511
  end;
huffman@35655
   512
huffman@35654
   513
fun add_lub_take_theorems
huffman@35654
   514
    (spec : (binding * iso_info) list)
huffman@35654
   515
    (take_info : take_info)
huffman@35654
   516
    (lub_take_thms : thm list)
huffman@35654
   517
    (thy : theory) =
huffman@35654
   518
  let
huffman@35654
   519
huffman@35654
   520
    (* retrieve components of spec *)
huffman@35773
   521
    val dbinds = map fst spec;
huffman@35654
   522
    val iso_infos = map snd spec;
huffman@35655
   523
    val absTs = map #absT iso_infos;
huffman@35655
   524
    val repTs = map #repT iso_infos;
huffman@35655
   525
    val {take_consts, take_0_thms, take_Suc_thms, ...} = take_info;
huffman@35654
   526
    val {chain_take_thms, deflation_take_thms, ...} = take_info;
huffman@35654
   527
huffman@35654
   528
    (* prove take lemmas *)
huffman@35773
   529
    fun prove_take_lemma ((chain_take, lub_take), dbind) thy =
huffman@35654
   530
      let
huffman@35654
   531
        val take_lemma =
huffman@35654
   532
            Drule.export_without_context
huffman@35654
   533
              (@{thm lub_ID_take_lemma} OF [chain_take, lub_take]);
huffman@35654
   534
      in
huffman@35773
   535
        add_qualified_thm "take_lemma" (dbind, take_lemma) thy
huffman@35654
   536
      end;
huffman@35654
   537
    val (take_lemma_thms, thy) =
huffman@35654
   538
      fold_map prove_take_lemma
huffman@35773
   539
        (chain_take_thms ~~ lub_take_thms ~~ dbinds) thy;
huffman@35654
   540
huffman@35654
   541
    (* prove reach lemmas *)
huffman@35773
   542
    fun prove_reach_lemma ((chain_take, lub_take), dbind) thy =
huffman@35654
   543
      let
huffman@35654
   544
        val thm =
huffman@36241
   545
            Drule.zero_var_indexes
huffman@35654
   546
              (@{thm lub_ID_reach} OF [chain_take, lub_take]);
huffman@35654
   547
      in
huffman@35773
   548
        add_qualified_thm "reach" (dbind, thm) thy
huffman@35654
   549
      end;
huffman@35654
   550
    val (reach_thms, thy) =
huffman@35654
   551
      fold_map prove_reach_lemma
huffman@35773
   552
        (chain_take_thms ~~ lub_take_thms ~~ dbinds) thy;
huffman@35654
   553
huffman@35655
   554
    (* test for finiteness of domain definitions *)
huffman@35655
   555
    local
huffman@35655
   556
      val types = [@{type_name ssum}, @{type_name sprod}];
huffman@35655
   557
      fun finite d T = if T mem absTs then d else finite' d T
huffman@35655
   558
      and finite' d (Type (c, Ts)) =
huffman@35655
   559
          let val d' = d andalso c mem types;
huffman@35655
   560
          in forall (finite d') Ts end
huffman@35655
   561
        | finite' d _ = true;
huffman@35655
   562
    in
huffman@35655
   563
      val is_finite = forall (finite true) repTs;
huffman@35655
   564
    end;
huffman@35654
   565
huffman@35655
   566
    val ((finite_thms, take_induct_thms), thy) =
huffman@35655
   567
      if is_finite
huffman@35655
   568
      then
huffman@35655
   569
        let
huffman@35655
   570
          val ((finites, take_inducts), thy) =
huffman@35655
   571
              prove_finite_take_induct spec take_info lub_take_thms thy;
huffman@35655
   572
        in
huffman@35655
   573
          ((SOME finites, take_inducts), thy)
huffman@35655
   574
        end
huffman@35655
   575
      else
huffman@35655
   576
        let
huffman@35655
   577
          fun prove_take_induct (chain_take, lub_take) =
huffman@36241
   578
              Drule.zero_var_indexes
huffman@35655
   579
                (@{thm lub_ID_take_induct} OF [chain_take, lub_take]);
huffman@35655
   580
          val take_inducts =
huffman@35655
   581
              map prove_take_induct (chain_take_thms ~~ lub_take_thms);
huffman@35655
   582
          val thy = fold (snd oo add_qualified_thm "take_induct")
huffman@35773
   583
                         (dbinds ~~ take_inducts) thy;
huffman@35655
   584
        in
huffman@35655
   585
          ((NONE, take_inducts), thy)
huffman@35655
   586
        end;
huffman@35655
   587
huffman@35656
   588
    val result =
huffman@35656
   589
      {
huffman@35659
   590
        take_consts         = #take_consts take_info,
huffman@35659
   591
        take_defs           = #take_defs take_info,
huffman@35659
   592
        chain_take_thms     = #chain_take_thms take_info,
huffman@35659
   593
        take_0_thms         = #take_0_thms take_info,
huffman@35659
   594
        take_Suc_thms       = #take_Suc_thms take_info,
huffman@35659
   595
        deflation_take_thms = #deflation_take_thms take_info,
huffman@35659
   596
        finite_consts       = #finite_consts take_info,
huffman@35659
   597
        finite_defs         = #finite_defs take_info,
huffman@35659
   598
        lub_take_thms       = lub_take_thms,
huffman@35659
   599
        reach_thms          = reach_thms,
huffman@35659
   600
        take_lemma_thms     = take_lemma_thms,
huffman@35659
   601
        is_finite           = is_finite,
huffman@35659
   602
        take_induct_thms    = take_induct_thms
huffman@35656
   603
      };
huffman@35654
   604
  in
huffman@35654
   605
    (result, thy)
huffman@35654
   606
  end;
huffman@35654
   607
huffman@35514
   608
end;