src/HOL/Codatatype/Tools/bnf_def.ML
author blanchet
Fri Sep 21 16:34:40 2012 +0200 (2012-09-21)
changeset 49509 163914705f8d
parent 49507 8826d5a4332b
permissions -rw-r--r--
renamed top-level theory from "Codatatype" to "BNF"
blanchet@49509
     1
(*  Title:      HOL/BNF/Tools/bnf_def.ML
blanchet@48975
     2
    Author:     Dmitriy Traytel, TU Muenchen
blanchet@48975
     3
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@48975
     4
    Copyright   2012
blanchet@48975
     5
blanchet@48975
     6
Definition of bounded natural functors.
blanchet@48975
     7
*)
blanchet@48975
     8
blanchet@48975
     9
signature BNF_DEF =
blanchet@48975
    10
sig
blanchet@48975
    11
  type BNF
blanchet@48975
    12
  type nonemptiness_witness = {I: int list, wit: term, prop: thm list}
blanchet@48975
    13
blanchet@48975
    14
  val bnf_of: Proof.context -> string -> BNF option
traytel@49434
    15
  val register_bnf: string -> (BNF * local_theory) -> (BNF * local_theory)
traytel@49434
    16
blanchet@48975
    17
  val name_of_bnf: BNF -> binding
blanchet@48975
    18
  val T_of_bnf: BNF -> typ
blanchet@48975
    19
  val live_of_bnf: BNF -> int
blanchet@48975
    20
  val lives_of_bnf: BNF -> typ list
blanchet@48975
    21
  val dead_of_bnf: BNF -> int
blanchet@48975
    22
  val deads_of_bnf: BNF -> typ list
blanchet@48975
    23
  val nwits_of_bnf: BNF -> int
blanchet@48975
    24
blanchet@48975
    25
  val mapN: string
blanchet@49507
    26
  val relN: string
blanchet@48975
    27
  val setN: string
blanchet@48975
    28
  val mk_setN: int -> string
blanchet@49506
    29
  val srelN: string
blanchet@48975
    30
blanchet@49214
    31
  val map_of_bnf: BNF -> term
blanchet@49214
    32
blanchet@48975
    33
  val mk_T_of_bnf: typ list -> typ list -> BNF -> typ
blanchet@48975
    34
  val mk_bd_of_bnf: typ list -> typ list -> BNF -> term
blanchet@48975
    35
  val mk_map_of_bnf: typ list -> typ list -> typ list -> BNF -> term
blanchet@49507
    36
  val mk_rel_of_bnf: typ list -> typ list -> typ list -> BNF -> term
blanchet@48975
    37
  val mk_sets_of_bnf: typ list list -> typ list list -> BNF -> term list
blanchet@49506
    38
  val mk_srel_of_bnf: typ list -> typ list -> typ list -> BNF -> term
blanchet@48975
    39
  val mk_wits_of_bnf: typ list list -> typ list list -> BNF -> (int list * term) list
blanchet@48975
    40
blanchet@48975
    41
  val bd_Card_order_of_bnf: BNF -> thm
blanchet@48975
    42
  val bd_Cinfinite_of_bnf: BNF -> thm
blanchet@48975
    43
  val bd_Cnotzero_of_bnf: BNF -> thm
blanchet@48975
    44
  val bd_card_order_of_bnf: BNF -> thm
blanchet@48975
    45
  val bd_cinfinite_of_bnf: BNF -> thm
blanchet@48975
    46
  val collect_set_natural_of_bnf: BNF -> thm
blanchet@48975
    47
  val in_bd_of_bnf: BNF -> thm
blanchet@48975
    48
  val in_cong_of_bnf: BNF -> thm
blanchet@48975
    49
  val in_mono_of_bnf: BNF -> thm
blanchet@49506
    50
  val in_srel_of_bnf: BNF -> thm
blanchet@48975
    51
  val map_comp'_of_bnf: BNF -> thm
blanchet@48975
    52
  val map_comp_of_bnf: BNF -> thm
blanchet@48975
    53
  val map_cong_of_bnf: BNF -> thm
blanchet@48975
    54
  val map_def_of_bnf: BNF -> thm
blanchet@48975
    55
  val map_id'_of_bnf: BNF -> thm
blanchet@48975
    56
  val map_id_of_bnf: BNF -> thm
blanchet@48975
    57
  val map_wppull_of_bnf: BNF -> thm
blanchet@48975
    58
  val map_wpull_of_bnf: BNF -> thm
blanchet@49507
    59
  val rel_def_of_bnf: BNF -> thm
blanchet@48975
    60
  val set_bd_of_bnf: BNF -> thm list
blanchet@48975
    61
  val set_defs_of_bnf: BNF -> thm list
blanchet@48975
    62
  val set_natural'_of_bnf: BNF -> thm list
blanchet@48975
    63
  val set_natural_of_bnf: BNF -> thm list
blanchet@48975
    64
  val sets_of_bnf: BNF -> term list
blanchet@49506
    65
  val srel_def_of_bnf: BNF -> thm
blanchet@49506
    66
  val srel_Gr_of_bnf: BNF -> thm
blanchet@49506
    67
  val srel_Id_of_bnf: BNF -> thm
blanchet@49506
    68
  val srel_O_of_bnf: BNF -> thm
blanchet@49506
    69
  val srel_O_Gr_of_bnf: BNF -> thm
blanchet@49506
    70
  val srel_cong_of_bnf: BNF -> thm
blanchet@49506
    71
  val srel_converse_of_bnf: BNF -> thm
blanchet@49506
    72
  val srel_mono_of_bnf: BNF -> thm
blanchet@48975
    73
  val wit_thms_of_bnf: BNF -> thm list
blanchet@48975
    74
  val wit_thmss_of_bnf: BNF -> thm list list
blanchet@48975
    75
blanchet@48975
    76
  val mk_witness: int list * term -> thm list -> nonemptiness_witness
traytel@49103
    77
  val minimize_wits: (''a list * 'b) list -> (''a list * 'b) list
blanchet@48975
    78
  val wits_of_bnf: BNF -> nonemptiness_witness list
blanchet@48975
    79
blanchet@49460
    80
  val zip_axioms: 'a -> 'a -> 'a -> 'a list -> 'a -> 'a -> 'a list -> 'a -> 'a -> 'a -> 'a list
blanchet@49456
    81
blanchet@48975
    82
  datatype const_policy = Dont_Inline | Hardly_Inline | Smart_Inline | Do_Inline
blanchet@48975
    83
  datatype fact_policy =
blanchet@49461
    84
    Derive_Few_Facts | Derive_All_Facts | Derive_All_Facts_Note_Most | Note_All_Facts_and_Axioms
blanchet@48975
    85
  val bnf_note_all: bool Config.T
traytel@49435
    86
  val user_policy: fact_policy -> Proof.context -> fact_policy
blanchet@48975
    87
blanchet@48975
    88
  val print_bnfs: Proof.context -> unit
blanchet@49018
    89
  val bnf_def: const_policy -> (Proof.context -> fact_policy) -> (binding -> binding) ->
blanchet@48975
    90
    ({prems: thm list, context: Proof.context} -> tactic) list ->
blanchet@48975
    91
    ({prems: thm list, context: Proof.context} -> tactic) -> typ list option ->
blanchet@49459
    92
    ((((binding * term) * term list) * term) * term list) * term option -> local_theory ->
blanchet@48975
    93
    BNF * local_theory
blanchet@48975
    94
end;
blanchet@48975
    95
blanchet@48975
    96
structure BNF_Def : BNF_DEF =
blanchet@48975
    97
struct
blanchet@48975
    98
blanchet@48975
    99
open BNF_Util
blanchet@49463
   100
open BNF_Tactics
blanchet@49284
   101
open BNF_Def_Tactics
blanchet@48975
   102
blanchet@48975
   103
type axioms = {
blanchet@48975
   104
  map_id: thm,
blanchet@48975
   105
  map_comp: thm,
blanchet@48975
   106
  map_cong: thm,
blanchet@48975
   107
  set_natural: thm list,
blanchet@48975
   108
  bd_card_order: thm,
blanchet@48975
   109
  bd_cinfinite: thm,
blanchet@48975
   110
  set_bd: thm list,
blanchet@48975
   111
  in_bd: thm,
blanchet@49453
   112
  map_wpull: thm,
blanchet@49506
   113
  srel_O_Gr: thm
blanchet@48975
   114
};
blanchet@48975
   115
blanchet@49506
   116
fun mk_axioms' (((((((((id, comp), cong), nat), c_o), cinf), set_bd), in_bd), wpull), srel) =
blanchet@48975
   117
  {map_id = id, map_comp = comp, map_cong = cong, set_natural = nat, bd_card_order = c_o,
blanchet@49506
   118
   bd_cinfinite = cinf, set_bd = set_bd, in_bd = in_bd, map_wpull = wpull, srel_O_Gr = srel};
blanchet@48975
   119
blanchet@48975
   120
fun dest_cons [] = raise Empty
blanchet@48975
   121
  | dest_cons (x :: xs) = (x, xs);
blanchet@48975
   122
blanchet@48975
   123
fun mk_axioms n thms = thms
blanchet@48975
   124
  |> map the_single
blanchet@48975
   125
  |> dest_cons
blanchet@48975
   126
  ||>> dest_cons
blanchet@48975
   127
  ||>> dest_cons
blanchet@48975
   128
  ||>> chop n
blanchet@48975
   129
  ||>> dest_cons
blanchet@48975
   130
  ||>> dest_cons
blanchet@48975
   131
  ||>> chop n
blanchet@48975
   132
  ||>> dest_cons
blanchet@49453
   133
  ||>> dest_cons
blanchet@48975
   134
  ||> the_single
blanchet@48975
   135
  |> mk_axioms';
blanchet@48975
   136
blanchet@49506
   137
fun zip_axioms mid mcomp mcong snat bdco bdinf sbd inbd wpull srel =
blanchet@49506
   138
  [mid, mcomp, mcong] @ snat @ [bdco, bdinf] @ sbd @ [inbd, wpull, srel];
blanchet@49460
   139
blanchet@49453
   140
fun dest_axioms {map_id, map_comp, map_cong, set_natural, bd_card_order, bd_cinfinite, set_bd,
blanchet@49506
   141
  in_bd, map_wpull, srel_O_Gr} =
blanchet@49460
   142
  zip_axioms map_id map_comp map_cong set_natural bd_card_order bd_cinfinite set_bd in_bd map_wpull
blanchet@49506
   143
    srel_O_Gr;
blanchet@48975
   144
blanchet@49463
   145
fun map_axioms f {map_id, map_comp, map_cong, set_natural, bd_card_order, bd_cinfinite, set_bd,
blanchet@49506
   146
  in_bd, map_wpull, srel_O_Gr} =
blanchet@48975
   147
  {map_id = f map_id,
blanchet@49463
   148
    map_comp = f map_comp,
blanchet@49463
   149
    map_cong = f map_cong,
blanchet@49463
   150
    set_natural = map f set_natural,
blanchet@49463
   151
    bd_card_order = f bd_card_order,
blanchet@49463
   152
    bd_cinfinite = f bd_cinfinite,
blanchet@49463
   153
    set_bd = map f set_bd,
blanchet@49463
   154
    in_bd = f in_bd,
blanchet@49463
   155
    map_wpull = f map_wpull,
blanchet@49506
   156
    srel_O_Gr = f srel_O_Gr};
blanchet@48975
   157
blanchet@48975
   158
val morph_axioms = map_axioms o Morphism.thm;
blanchet@48975
   159
blanchet@48975
   160
type defs = {
blanchet@48975
   161
  map_def: thm,
blanchet@48975
   162
  set_defs: thm list,
blanchet@49507
   163
  rel_def: thm,
blanchet@49506
   164
  srel_def: thm
blanchet@48975
   165
}
blanchet@48975
   166
blanchet@49507
   167
fun mk_defs map sets rel srel = {map_def = map, set_defs = sets, rel_def = rel, srel_def = srel};
blanchet@48975
   168
blanchet@49507
   169
fun map_defs f {map_def, set_defs, rel_def, srel_def} =
blanchet@49507
   170
  {map_def = f map_def, set_defs = map f set_defs, rel_def = f rel_def, srel_def = f srel_def};
blanchet@48975
   171
blanchet@48975
   172
val morph_defs = map_defs o Morphism.thm;
blanchet@48975
   173
blanchet@48975
   174
type facts = {
blanchet@48975
   175
  bd_Card_order: thm,
blanchet@48975
   176
  bd_Cinfinite: thm,
blanchet@48975
   177
  bd_Cnotzero: thm,
blanchet@48975
   178
  collect_set_natural: thm lazy,
blanchet@48975
   179
  in_cong: thm lazy,
blanchet@48975
   180
  in_mono: thm lazy,
blanchet@49506
   181
  in_srel: thm lazy,
blanchet@48975
   182
  map_comp': thm lazy,
blanchet@48975
   183
  map_id': thm lazy,
blanchet@48975
   184
  map_wppull: thm lazy,
blanchet@49506
   185
  set_natural': thm lazy list,
blanchet@49506
   186
  srel_cong: thm lazy,
blanchet@49506
   187
  srel_mono: thm lazy,
blanchet@49506
   188
  srel_Id: thm lazy,
blanchet@49506
   189
  srel_Gr: thm lazy,
blanchet@49506
   190
  srel_converse: thm lazy,
blanchet@49506
   191
  srel_O: thm lazy
blanchet@48975
   192
};
blanchet@48975
   193
blanchet@49506
   194
fun mk_facts bd_Card_order bd_Cinfinite bd_Cnotzero collect_set_natural in_cong in_mono in_srel
blanchet@49506
   195
    map_comp' map_id' map_wppull set_natural' srel_cong srel_mono srel_Id srel_Gr srel_converse
blanchet@49506
   196
    srel_O = {
blanchet@48975
   197
  bd_Card_order = bd_Card_order,
blanchet@48975
   198
  bd_Cinfinite = bd_Cinfinite,
blanchet@48975
   199
  bd_Cnotzero = bd_Cnotzero,
blanchet@48975
   200
  collect_set_natural = collect_set_natural,
blanchet@48975
   201
  in_cong = in_cong,
blanchet@48975
   202
  in_mono = in_mono,
blanchet@49506
   203
  in_srel = in_srel,
blanchet@48975
   204
  map_comp' = map_comp',
blanchet@48975
   205
  map_id' = map_id',
blanchet@48975
   206
  map_wppull = map_wppull,
blanchet@49506
   207
  set_natural' = set_natural',
blanchet@49506
   208
  srel_cong = srel_cong,
blanchet@49506
   209
  srel_mono = srel_mono,
blanchet@49506
   210
  srel_Id = srel_Id,
blanchet@49506
   211
  srel_Gr = srel_Gr,
blanchet@49506
   212
  srel_converse = srel_converse,
blanchet@49506
   213
  srel_O = srel_O};
blanchet@48975
   214
blanchet@48975
   215
fun map_facts f {
blanchet@48975
   216
  bd_Card_order,
blanchet@48975
   217
  bd_Cinfinite,
blanchet@48975
   218
  bd_Cnotzero,
blanchet@48975
   219
  collect_set_natural,
blanchet@48975
   220
  in_cong,
blanchet@48975
   221
  in_mono,
blanchet@49506
   222
  in_srel,
blanchet@48975
   223
  map_comp',
blanchet@48975
   224
  map_id',
blanchet@48975
   225
  map_wppull,
blanchet@49506
   226
  set_natural',
blanchet@49506
   227
  srel_cong,
blanchet@49506
   228
  srel_mono,
blanchet@49506
   229
  srel_Id,
blanchet@49506
   230
  srel_Gr,
blanchet@49506
   231
  srel_converse,
blanchet@49506
   232
  srel_O} =
blanchet@48975
   233
  {bd_Card_order = f bd_Card_order,
blanchet@48975
   234
    bd_Cinfinite = f bd_Cinfinite,
blanchet@48975
   235
    bd_Cnotzero = f bd_Cnotzero,
blanchet@48975
   236
    collect_set_natural = Lazy.map f collect_set_natural,
blanchet@48975
   237
    in_cong = Lazy.map f in_cong,
blanchet@48975
   238
    in_mono = Lazy.map f in_mono,
blanchet@49506
   239
    in_srel = Lazy.map f in_srel,
blanchet@48975
   240
    map_comp' = Lazy.map f map_comp',
blanchet@48975
   241
    map_id' = Lazy.map f map_id',
blanchet@48975
   242
    map_wppull = Lazy.map f map_wppull,
blanchet@49506
   243
    set_natural' = map (Lazy.map f) set_natural',
blanchet@49506
   244
    srel_cong = Lazy.map f srel_cong,
blanchet@49506
   245
    srel_mono = Lazy.map f srel_mono,
blanchet@49506
   246
    srel_Id = Lazy.map f srel_Id,
blanchet@49506
   247
    srel_Gr = Lazy.map f srel_Gr,
blanchet@49506
   248
    srel_converse = Lazy.map f srel_converse,
blanchet@49506
   249
    srel_O = Lazy.map f srel_O};
blanchet@48975
   250
blanchet@48975
   251
val morph_facts = map_facts o Morphism.thm;
blanchet@48975
   252
blanchet@48975
   253
type nonemptiness_witness = {
blanchet@48975
   254
  I: int list,
blanchet@48975
   255
  wit: term,
blanchet@48975
   256
  prop: thm list
blanchet@48975
   257
};
blanchet@48975
   258
blanchet@48975
   259
fun mk_witness (I, wit) prop = {I = I, wit = wit, prop = prop};
blanchet@48975
   260
fun map_witness f g {I, wit, prop} = {I = I, wit = f wit, prop = map g prop};
blanchet@48975
   261
fun morph_witness phi = map_witness (Morphism.term phi) (Morphism.thm phi);
blanchet@48975
   262
blanchet@48975
   263
datatype BNF = BNF of {
blanchet@48975
   264
  name: binding,
blanchet@48975
   265
  T: typ,
blanchet@48975
   266
  live: int,
blanchet@48975
   267
  lives: typ list, (*source type variables of map, only for composition*)
blanchet@48975
   268
  lives': typ list, (*target type variables of map, only for composition*)
blanchet@48975
   269
  dead: int,
blanchet@48975
   270
  deads: typ list, (*only for composition*)
blanchet@48975
   271
  map: term,
blanchet@48975
   272
  sets: term list,
blanchet@48975
   273
  bd: term,
blanchet@48975
   274
  axioms: axioms,
blanchet@48975
   275
  defs: defs,
blanchet@48975
   276
  facts: facts,
blanchet@48975
   277
  nwits: int,
blanchet@48975
   278
  wits: nonemptiness_witness list,
blanchet@49507
   279
  rel: term,
blanchet@49506
   280
  srel: term
blanchet@48975
   281
};
blanchet@48975
   282
blanchet@48975
   283
(* getters *)
blanchet@48975
   284
blanchet@48975
   285
fun rep_bnf (BNF bnf) = bnf;
blanchet@48975
   286
val name_of_bnf = #name o rep_bnf;
blanchet@48975
   287
val T_of_bnf = #T o rep_bnf;
blanchet@48975
   288
fun mk_T_of_bnf Ds Ts bnf =
blanchet@48975
   289
  let val bnf_rep = rep_bnf bnf
blanchet@48975
   290
  in Term.typ_subst_atomic ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts)) (#T bnf_rep) end;
blanchet@48975
   291
val live_of_bnf = #live o rep_bnf;
blanchet@48975
   292
val lives_of_bnf = #lives o rep_bnf;
blanchet@48975
   293
val dead_of_bnf = #dead o rep_bnf;
blanchet@48975
   294
val deads_of_bnf = #deads o rep_bnf;
blanchet@48975
   295
val axioms_of_bnf = #axioms o rep_bnf;
blanchet@48975
   296
val facts_of_bnf = #facts o rep_bnf;
blanchet@48975
   297
val nwits_of_bnf = #nwits o rep_bnf;
blanchet@48975
   298
val wits_of_bnf = #wits o rep_bnf;
blanchet@48975
   299
blanchet@48975
   300
(*terms*)
blanchet@48975
   301
val map_of_bnf = #map o rep_bnf;
blanchet@48975
   302
val sets_of_bnf = #sets o rep_bnf;
blanchet@48975
   303
fun mk_map_of_bnf Ds Ts Us bnf =
blanchet@48975
   304
  let val bnf_rep = rep_bnf bnf;
blanchet@48975
   305
  in
blanchet@48975
   306
    Term.subst_atomic_types
blanchet@48975
   307
      ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts) @ (#lives' bnf_rep ~~ Us)) (#map bnf_rep)
blanchet@48975
   308
  end;
blanchet@48975
   309
fun mk_sets_of_bnf Dss Tss bnf =
blanchet@48975
   310
  let val bnf_rep = rep_bnf bnf;
blanchet@48975
   311
  in
blanchet@48975
   312
    map2 (fn (Ds, Ts) => Term.subst_atomic_types
blanchet@48975
   313
      ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts))) (Dss ~~ Tss) (#sets bnf_rep)
blanchet@48975
   314
  end;
blanchet@48975
   315
val bd_of_bnf = #bd o rep_bnf;
blanchet@48975
   316
fun mk_bd_of_bnf Ds Ts bnf =
blanchet@48975
   317
  let val bnf_rep = rep_bnf bnf;
blanchet@48975
   318
  in Term.subst_atomic_types ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts)) (#bd bnf_rep) end;
blanchet@48975
   319
fun mk_wits_of_bnf Dss Tss bnf =
blanchet@48975
   320
  let
blanchet@48975
   321
    val bnf_rep = rep_bnf bnf;
blanchet@48975
   322
    val wits = map (fn x => (#I x, #wit x)) (#wits bnf_rep);
blanchet@48975
   323
  in
blanchet@48975
   324
    map2 (fn (Ds, Ts) => apsnd (Term.subst_atomic_types
blanchet@48975
   325
      ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts)))) (Dss ~~ Tss) wits
blanchet@48975
   326
  end;
blanchet@49507
   327
val rel_of_bnf = #rel o rep_bnf;
blanchet@49507
   328
fun mk_rel_of_bnf Ds Ts Us bnf =
blanchet@49462
   329
  let val bnf_rep = rep_bnf bnf;
blanchet@49462
   330
  in
blanchet@49462
   331
    Term.subst_atomic_types
blanchet@49507
   332
      ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts) @ (#lives' bnf_rep ~~ Us)) (#rel bnf_rep)
blanchet@49462
   333
  end;
blanchet@49506
   334
val srel_of_bnf = #srel o rep_bnf;
blanchet@49506
   335
fun mk_srel_of_bnf Ds Ts Us bnf =
blanchet@48975
   336
  let val bnf_rep = rep_bnf bnf;
blanchet@48975
   337
  in
blanchet@48975
   338
    Term.subst_atomic_types
blanchet@49506
   339
      ((#deads bnf_rep ~~ Ds) @ (#lives bnf_rep ~~ Ts) @ (#lives' bnf_rep ~~ Us)) (#srel bnf_rep)
blanchet@48975
   340
  end;
blanchet@48975
   341
blanchet@48975
   342
(*thms*)
blanchet@48975
   343
val bd_card_order_of_bnf = #bd_card_order o #axioms o rep_bnf;
blanchet@48975
   344
val bd_cinfinite_of_bnf = #bd_cinfinite o #axioms o rep_bnf;
blanchet@48975
   345
val bd_Card_order_of_bnf = #bd_Card_order o #facts o rep_bnf;
blanchet@48975
   346
val bd_Cinfinite_of_bnf = #bd_Cinfinite o #facts o rep_bnf;
blanchet@48975
   347
val bd_Cnotzero_of_bnf = #bd_Cnotzero o #facts o rep_bnf;
blanchet@48975
   348
val collect_set_natural_of_bnf = Lazy.force o #collect_set_natural o #facts o rep_bnf;
blanchet@48975
   349
val in_bd_of_bnf = #in_bd o #axioms o rep_bnf;
blanchet@48975
   350
val in_cong_of_bnf = Lazy.force o #in_cong o #facts o rep_bnf;
blanchet@48975
   351
val in_mono_of_bnf = Lazy.force o #in_mono o #facts o rep_bnf;
blanchet@49506
   352
val in_srel_of_bnf = Lazy.force o #in_srel o #facts o rep_bnf;
blanchet@48975
   353
val map_def_of_bnf = #map_def o #defs o rep_bnf;
blanchet@48975
   354
val map_id_of_bnf = #map_id o #axioms o rep_bnf;
blanchet@48975
   355
val map_id'_of_bnf = Lazy.force o #map_id' o #facts o rep_bnf;
blanchet@48975
   356
val map_comp_of_bnf = #map_comp o #axioms o rep_bnf;
blanchet@48975
   357
val map_comp'_of_bnf = Lazy.force o #map_comp' o #facts o rep_bnf;
blanchet@48975
   358
val map_cong_of_bnf = #map_cong o #axioms o rep_bnf;
blanchet@48975
   359
val map_wppull_of_bnf = Lazy.force o #map_wppull o #facts o rep_bnf;
blanchet@48975
   360
val map_wpull_of_bnf = #map_wpull o #axioms o rep_bnf;
blanchet@49507
   361
val rel_def_of_bnf = #rel_def o #defs o rep_bnf;
blanchet@48975
   362
val set_bd_of_bnf = #set_bd o #axioms o rep_bnf;
blanchet@48975
   363
val set_defs_of_bnf = #set_defs o #defs o rep_bnf;
blanchet@48975
   364
val set_natural_of_bnf = #set_natural o #axioms o rep_bnf;
blanchet@48975
   365
val set_natural'_of_bnf = map Lazy.force o #set_natural' o #facts o rep_bnf;
blanchet@49506
   366
val srel_cong_of_bnf = Lazy.force o #srel_cong o #facts o rep_bnf;
blanchet@49506
   367
val srel_mono_of_bnf = Lazy.force o #srel_mono o #facts o rep_bnf;
blanchet@49506
   368
val srel_def_of_bnf = #srel_def o #defs o rep_bnf;
blanchet@49506
   369
val srel_Id_of_bnf = Lazy.force o #srel_Id o #facts o rep_bnf;
blanchet@49506
   370
val srel_Gr_of_bnf = Lazy.force o #srel_Gr o #facts o rep_bnf;
blanchet@49506
   371
val srel_converse_of_bnf = Lazy.force o #srel_converse o #facts o rep_bnf;
blanchet@49506
   372
val srel_O_of_bnf = Lazy.force o #srel_O o #facts o rep_bnf;
blanchet@49506
   373
val srel_O_Gr_of_bnf = #srel_O_Gr o #axioms o rep_bnf;
blanchet@48975
   374
val wit_thms_of_bnf = maps #prop o wits_of_bnf;
blanchet@48975
   375
val wit_thmss_of_bnf = map #prop o wits_of_bnf;
blanchet@48975
   376
blanchet@49507
   377
fun mk_bnf name T live lives lives' dead deads map sets bd axioms defs facts wits rel srel =
blanchet@48975
   378
  BNF {name = name, T = T,
blanchet@48975
   379
       live = live, lives = lives, lives' = lives', dead = dead, deads = deads,
blanchet@48975
   380
       map = map, sets = sets, bd = bd,
blanchet@48975
   381
       axioms = axioms, defs = defs, facts = facts,
blanchet@49507
   382
       nwits = length wits, wits = wits, rel = rel, srel = srel};
blanchet@48975
   383
blanchet@48975
   384
fun morph_bnf phi (BNF {name = name, T = T, live = live, lives = lives, lives' = lives',
blanchet@48975
   385
  dead = dead, deads = deads, map = map, sets = sets, bd = bd,
blanchet@48975
   386
  axioms = axioms, defs = defs, facts = facts,
blanchet@49507
   387
  nwits = nwits, wits = wits, rel = rel, srel = srel}) =
blanchet@48975
   388
  BNF {name = Morphism.binding phi name, T = Morphism.typ phi T,
blanchet@48975
   389
    live = live, lives = List.map (Morphism.typ phi) lives,
blanchet@48975
   390
    lives' = List.map (Morphism.typ phi) lives',
blanchet@48975
   391
    dead = dead, deads = List.map (Morphism.typ phi) deads,
blanchet@48975
   392
    map = Morphism.term phi map, sets = List.map (Morphism.term phi) sets,
blanchet@48975
   393
    bd = Morphism.term phi bd,
blanchet@48975
   394
    axioms = morph_axioms phi axioms,
blanchet@48975
   395
    defs = morph_defs phi defs,
blanchet@48975
   396
    facts = morph_facts phi facts,
blanchet@48975
   397
    nwits = nwits,
blanchet@48975
   398
    wits = List.map (morph_witness phi) wits,
blanchet@49507
   399
    rel = Morphism.term phi rel, srel = Morphism.term phi srel};
blanchet@48975
   400
blanchet@48975
   401
fun eq_bnf (BNF {T = T1, live = live1, dead = dead1, ...},
blanchet@48975
   402
  BNF {T = T2, live = live2, dead = dead2, ...}) =
blanchet@48975
   403
  Type.could_unify (T1, T2) andalso live1 = live2 andalso dead1 = dead2;
blanchet@48975
   404
blanchet@48975
   405
structure Data = Generic_Data
blanchet@48975
   406
(
blanchet@48975
   407
  type T = BNF Symtab.table;
blanchet@48975
   408
  val empty = Symtab.empty;
blanchet@48975
   409
  val extend = I;
blanchet@49462
   410
  val merge = Symtab.merge eq_bnf;
blanchet@48975
   411
);
blanchet@48975
   412
blanchet@48975
   413
val bnf_of = Symtab.lookup o Data.get o Context.Proof;
blanchet@48975
   414
blanchet@48975
   415
blanchet@48975
   416
blanchet@48975
   417
(* Utilities *)
blanchet@48975
   418
blanchet@48975
   419
fun normalize_set insts instA set =
blanchet@48975
   420
  let
blanchet@48975
   421
    val (T, T') = dest_funT (fastype_of set);
blanchet@48975
   422
    val A = fst (Term.dest_TVar (HOLogic.dest_setT T'));
blanchet@48975
   423
    val params = Term.add_tvar_namesT T [];
blanchet@48975
   424
  in Term.subst_TVars ((A :: params) ~~ (instA :: insts)) set end;
blanchet@48975
   425
blanchet@49507
   426
fun normalize_rel ctxt instTs instA instB rel =
blanchet@49462
   427
  let
blanchet@49462
   428
    val thy = Proof_Context.theory_of ctxt;
blanchet@49462
   429
    val tyenv =
blanchet@49507
   430
      Sign.typ_match thy (fastype_of rel, Library.foldr (op -->) (instTs, mk_pred2T instA instB))
blanchet@49463
   431
        Vartab.empty;
blanchet@49507
   432
  in Envir.subst_term (tyenv, Vartab.empty) rel end
blanchet@49462
   433
  handle Type.TYPE_MATCH => error "Bad predicator";
blanchet@49462
   434
blanchet@49506
   435
fun normalize_srel ctxt instTs instA instB srel =
blanchet@48975
   436
  let
blanchet@48975
   437
    val thy = Proof_Context.theory_of ctxt;
blanchet@48975
   438
    val tyenv =
blanchet@49506
   439
      Sign.typ_match thy (fastype_of srel, Library.foldr (op -->) (instTs, mk_relT (instA, instB)))
blanchet@48975
   440
        Vartab.empty;
blanchet@49506
   441
  in Envir.subst_term (tyenv, Vartab.empty) srel end
blanchet@49453
   442
  handle Type.TYPE_MATCH => error "Bad relator";
blanchet@48975
   443
blanchet@48975
   444
fun normalize_wit insts CA As wit =
blanchet@48975
   445
  let
blanchet@48975
   446
    fun strip_param (Ts, T as Type (@{type_name fun}, [T1, T2])) =
blanchet@48975
   447
        if Type.raw_instance (CA, T) then (Ts, T) else strip_param (T1 :: Ts, T2)
blanchet@48975
   448
      | strip_param x = x;
blanchet@48975
   449
    val (Ts, T) = strip_param ([], fastype_of wit);
blanchet@48975
   450
    val subst = Term.add_tvar_namesT T [] ~~ insts;
blanchet@48975
   451
    fun find y = find_index (fn x => x = y) As;
blanchet@48975
   452
  in
blanchet@48975
   453
    (map (find o Term.typ_subst_TVars subst) (rev Ts), Term.subst_TVars subst wit)
blanchet@48975
   454
  end;
blanchet@48975
   455
blanchet@48975
   456
fun minimize_wits wits =
blanchet@48975
   457
 let
blanchet@48975
   458
   fun minimize done [] = done
traytel@49103
   459
     | minimize done ((I, wit) :: todo) =
blanchet@48975
   460
       if exists (fn (J, _) => subset (op =) (J, I)) (done @ todo)
blanchet@48975
   461
       then minimize done todo
blanchet@48975
   462
       else minimize ((I, wit) :: done) todo;
blanchet@48975
   463
 in minimize [] wits end;
blanchet@48975
   464
blanchet@48975
   465
blanchet@48975
   466
blanchet@48975
   467
(* Names *)
blanchet@48975
   468
blanchet@48975
   469
val mapN = "map";
blanchet@48975
   470
val setN = "set";
blanchet@48975
   471
fun mk_setN i = setN ^ nonzero_string_of_int i;
blanchet@48975
   472
val bdN = "bd";
blanchet@48975
   473
val witN = "wit";
blanchet@48975
   474
fun mk_witN i = witN ^ nonzero_string_of_int i;
blanchet@49507
   475
val relN = "rel";
blanchet@49506
   476
val srelN = "srel";
blanchet@48975
   477
blanchet@48975
   478
val bd_card_orderN = "bd_card_order";
blanchet@48975
   479
val bd_cinfiniteN = "bd_cinfinite";
blanchet@48975
   480
val bd_Card_orderN = "bd_Card_order";
blanchet@48975
   481
val bd_CinfiniteN = "bd_Cinfinite";
blanchet@48975
   482
val bd_CnotzeroN = "bd_Cnotzero";
blanchet@48975
   483
val collect_set_naturalN = "collect_set_natural";
blanchet@48975
   484
val in_bdN = "in_bd";
blanchet@48975
   485
val in_monoN = "in_mono";
blanchet@49506
   486
val in_srelN = "in_srel";
blanchet@48975
   487
val map_idN = "map_id";
blanchet@48975
   488
val map_id'N = "map_id'";
blanchet@48975
   489
val map_compN = "map_comp";
blanchet@48975
   490
val map_comp'N = "map_comp'";
blanchet@48975
   491
val map_congN = "map_cong";
blanchet@48975
   492
val map_wpullN = "map_wpull";
blanchet@49506
   493
val srel_IdN = "srel_Id";
blanchet@49506
   494
val srel_GrN = "srel_Gr";
blanchet@49506
   495
val srel_converseN = "srel_converse";
blanchet@49506
   496
val srel_monoN = "srel_mono"
blanchet@49506
   497
val srel_ON = "srel_comp";
blanchet@49506
   498
val srel_O_GrN = "srel_comp_Gr";
blanchet@48975
   499
val set_naturalN = "set_natural";
blanchet@48975
   500
val set_natural'N = "set_natural'";
blanchet@48975
   501
val set_bdN = "set_bd";
blanchet@48975
   502
blanchet@48975
   503
datatype const_policy = Dont_Inline | Hardly_Inline | Smart_Inline | Do_Inline;
blanchet@48975
   504
blanchet@48975
   505
datatype fact_policy =
blanchet@49461
   506
  Derive_Few_Facts | Derive_All_Facts | Derive_All_Facts_Note_Most | Note_All_Facts_and_Axioms;
blanchet@48975
   507
blanchet@48975
   508
val bnf_note_all = Attrib.setup_config_bool @{binding bnf_note_all} (K false);
blanchet@48975
   509
traytel@49435
   510
fun user_policy policy ctxt =
traytel@49435
   511
  if Config.get ctxt bnf_note_all then Note_All_Facts_and_Axioms else policy;
blanchet@48975
   512
blanchet@48975
   513
val smart_max_inline_size = 25; (*FUDGE*)
blanchet@48975
   514
blanchet@48975
   515
blanchet@48975
   516
(* Define new BNFs *)
blanchet@48975
   517
blanchet@49019
   518
fun prepare_def const_policy mk_fact_policy qualify prep_term Ds_opt
blanchet@49507
   519
  (((((raw_b, raw_map), raw_sets), raw_bd_Abs), raw_wits), raw_rel_opt) no_defs_lthy =
blanchet@48975
   520
  let
blanchet@48975
   521
    val fact_policy = mk_fact_policy no_defs_lthy;
blanchet@48975
   522
    val b = qualify raw_b;
blanchet@48975
   523
    val live = length raw_sets;
blanchet@48975
   524
    val nwits = length raw_wits;
blanchet@48975
   525
blanchet@48975
   526
    val map_rhs = prep_term no_defs_lthy raw_map;
blanchet@48975
   527
    val set_rhss = map (prep_term no_defs_lthy) raw_sets;
blanchet@48975
   528
    val (bd_rhsT, bd_rhs) = (case prep_term no_defs_lthy raw_bd_Abs of
blanchet@48975
   529
      Abs (_, T, t) => (T, t)
blanchet@48975
   530
    | _ => error "Bad bound constant");
blanchet@48975
   531
    val wit_rhss = map (prep_term no_defs_lthy) raw_wits;
blanchet@48975
   532
traytel@49434
   533
    fun err T =
traytel@49434
   534
      error ("Trying to register the type " ^ quote (Syntax.string_of_typ no_defs_lthy T) ^
traytel@49434
   535
        " as unnamed BNF");
traytel@49434
   536
traytel@49434
   537
    val (b, key) =
traytel@49434
   538
      if Binding.eq_name (b, Binding.empty) then
traytel@49434
   539
        (case bd_rhsT of
traytel@49434
   540
          Type (C, Ts) => if forall (is_some o try dest_TFree) Ts
traytel@49434
   541
            then (Binding.qualified_name C, C) else err bd_rhsT
traytel@49434
   542
        | T => err T)
traytel@49434
   543
      else (b, Local_Theory.full_name no_defs_lthy b);
traytel@49434
   544
blanchet@49463
   545
    fun maybe_define user_specified (b, rhs) lthy =
blanchet@48975
   546
      let
blanchet@48975
   547
        val inline =
blanchet@49463
   548
          (user_specified orelse fact_policy = Derive_Few_Facts) andalso
blanchet@48975
   549
          (case const_policy of
blanchet@48975
   550
            Dont_Inline => false
blanchet@48975
   551
          | Hardly_Inline => Term.is_Free rhs orelse Term.is_Const rhs
blanchet@48975
   552
          | Smart_Inline => Term.size_of_term rhs <= smart_max_inline_size
blanchet@48975
   553
          | Do_Inline => true)
blanchet@48975
   554
      in
blanchet@48975
   555
        if inline then
blanchet@49460
   556
          ((rhs, Drule.reflexive_thm), lthy)
blanchet@48975
   557
        else
blanchet@48975
   558
          let val b = b () in
blanchet@48975
   559
            apfst (apsnd snd) (Local_Theory.define ((b, NoSyn), ((Thm.def_binding b, []), rhs))
blanchet@48975
   560
              lthy)
blanchet@48975
   561
          end
blanchet@48975
   562
      end;
blanchet@49459
   563
blanchet@49459
   564
    fun maybe_restore lthy_old lthy =
blanchet@49459
   565
      lthy |> not (pointer_eq (lthy_old, lthy)) ? Local_Theory.restore;
blanchet@48975
   566
blanchet@49459
   567
    val map_bind_def = (fn () => Binding.suffix_name ("_" ^ mapN) b, map_rhs);
blanchet@49459
   568
    val set_binds_defs =
blanchet@49459
   569
      let
blanchet@49459
   570
        val bs = if live = 1 then [fn () => Binding.suffix_name ("_" ^ setN) b]
blanchet@49459
   571
          else map (fn i => fn () => Binding.suffix_name ("_" ^ mk_setN i) b) (1 upto live)
blanchet@49459
   572
      in map2 pair bs set_rhss end;
blanchet@49459
   573
    val bd_bind_def = (fn () => Binding.suffix_name ("_" ^ bdN) b, bd_rhs);
blanchet@49459
   574
    val wit_binds_defs =
blanchet@49459
   575
      let
blanchet@49459
   576
        val bs = if nwits = 1 then [fn () => Binding.suffix_name ("_" ^ witN) b]
blanchet@49459
   577
          else map (fn i => fn () => Binding.suffix_name ("_" ^ mk_witN i) b) (1 upto nwits);
blanchet@49459
   578
      in map2 pair bs wit_rhss end;
blanchet@49459
   579
blanchet@49459
   580
    val (((((bnf_map_term, raw_map_def),
blanchet@48975
   581
      (bnf_set_terms, raw_set_defs)),
blanchet@48975
   582
      (bnf_bd_term, raw_bd_def)),
blanchet@49459
   583
      (bnf_wit_terms, raw_wit_defs)), (lthy, lthy_old)) =
blanchet@48975
   584
        no_defs_lthy
blanchet@49463
   585
        |> maybe_define true map_bind_def
blanchet@49463
   586
        ||>> apfst split_list o fold_map (maybe_define true) set_binds_defs
blanchet@49463
   587
        ||>> maybe_define true bd_bind_def
blanchet@49463
   588
        ||>> apfst split_list o fold_map (maybe_define true) wit_binds_defs
blanchet@48975
   589
        ||> `(maybe_restore no_defs_lthy);
blanchet@48975
   590
blanchet@49459
   591
    val phi = Proof_Context.export_morphism lthy_old lthy;
blanchet@48975
   592
blanchet@48975
   593
    val bnf_map_def = Morphism.thm phi raw_map_def;
blanchet@48975
   594
    val bnf_set_defs = map (Morphism.thm phi) raw_set_defs;
blanchet@48975
   595
    val bnf_bd_def = Morphism.thm phi raw_bd_def;
blanchet@48975
   596
    val bnf_wit_defs = map (Morphism.thm phi) raw_wit_defs;
blanchet@48975
   597
blanchet@48975
   598
    val bnf_map = Morphism.term phi bnf_map_term;
blanchet@48975
   599
blanchet@48975
   600
    (*TODO: handle errors*)
blanchet@48975
   601
    (*simple shape analysis of a map function*)
traytel@49395
   602
    val ((alphas, betas), (CA, _)) =
traytel@49395
   603
      fastype_of bnf_map
traytel@49395
   604
      |> strip_typeN live
traytel@49395
   605
      |>> map_split dest_funT
traytel@49395
   606
      ||> dest_funT
traytel@49395
   607
      handle TYPE _ => error "Bad map function";
blanchet@48975
   608
blanchet@48975
   609
    val CA_params = map TVar (Term.add_tvarsT CA []);
blanchet@48975
   610
blanchet@48975
   611
    val bnf_sets = map2 (normalize_set CA_params) alphas (map (Morphism.term phi) bnf_set_terms);
blanchet@48975
   612
    val bdT = Morphism.typ phi bd_rhsT;
blanchet@48975
   613
    val bnf_bd =
blanchet@48975
   614
      Term.subst_TVars (Term.add_tvar_namesT bdT [] ~~ CA_params) (Morphism.term phi bnf_bd_term);
blanchet@48975
   615
    val bnf_wits = map (normalize_wit CA_params CA alphas o Morphism.term phi) bnf_wit_terms;
blanchet@48975
   616
blanchet@48975
   617
    (*TODO: assert Ds = (TVars of bnf_map) \ (alphas @ betas) as sets*)
blanchet@48975
   618
    val deads = (case Ds_opt of
blanchet@48975
   619
      NONE => subtract (op =) (alphas @ betas) (map TVar (Term.add_tvars bnf_map []))
blanchet@48975
   620
    | SOME Ds => map (Morphism.typ phi) Ds);
blanchet@48975
   621
    val dead = length deads;
blanchet@48975
   622
blanchet@48975
   623
    (*TODO: further checks of type of bnf_map*)
blanchet@48975
   624
    (*TODO: check types of bnf_sets*)
blanchet@48975
   625
    (*TODO: check type of bnf_bd*)
blanchet@49507
   626
    (*TODO: check type of bnf_rel*)
blanchet@48975
   627
blanchet@48975
   628
    val ((((((((((As', Bs'), Cs), Ds), B1Ts), B2Ts), domTs), ranTs), ranTs'), ranTs''),
blanchet@49459
   629
      (Ts, T)) = lthy
blanchet@48975
   630
      |> mk_TFrees live
blanchet@48975
   631
      ||>> mk_TFrees live
blanchet@48975
   632
      ||>> mk_TFrees live
blanchet@48975
   633
      ||>> mk_TFrees dead
blanchet@48975
   634
      ||>> mk_TFrees live
blanchet@48975
   635
      ||>> mk_TFrees live
blanchet@48975
   636
      ||>> mk_TFrees live
blanchet@48975
   637
      ||>> mk_TFrees live
blanchet@48975
   638
      ||>> mk_TFrees live
blanchet@48975
   639
      ||>> mk_TFrees live
blanchet@48975
   640
      ||> fst o mk_TFrees 1
blanchet@48975
   641
      ||> the_single
blanchet@48975
   642
      ||> `(replicate live);
blanchet@48975
   643
blanchet@48975
   644
    fun mk_bnf_map As' Bs' =
blanchet@48975
   645
      Term.subst_atomic_types ((deads ~~ Ds) @ (alphas ~~ As') @ (betas ~~ Bs')) bnf_map;
blanchet@49453
   646
    fun mk_bnf_t As' = Term.subst_atomic_types ((deads ~~ Ds) @ (alphas ~~ As'));
blanchet@49453
   647
    fun mk_bnf_T As' = Term.typ_subst_atomic ((deads ~~ Ds) @ (alphas ~~ As'));
blanchet@49453
   648
blanchet@48975
   649
    val (setRTs, RTs) = map_split (`HOLogic.mk_setT o HOLogic.mk_prodT) (As' ~~ Bs');
blanchet@48975
   650
    val setRTsAsCs = map (HOLogic.mk_setT o HOLogic.mk_prodT) (As' ~~ Cs);
blanchet@48975
   651
    val setRTsBsCs = map (HOLogic.mk_setT o HOLogic.mk_prodT) (Bs' ~~ Cs);
blanchet@48975
   652
    val setRT's = map (HOLogic.mk_setT o HOLogic.mk_prodT) (Bs' ~~ As');
blanchet@48975
   653
    val self_setRTs = map (HOLogic.mk_setT o HOLogic.mk_prodT) (As' ~~ As');
blanchet@49463
   654
    val QTs = map2 mk_pred2T As' Bs';
blanchet@48975
   655
blanchet@49453
   656
    val CA' = mk_bnf_T As' CA;
blanchet@49453
   657
    val CB' = mk_bnf_T Bs' CA;
blanchet@49453
   658
    val CC' = mk_bnf_T Cs CA;
blanchet@49453
   659
    val CRs' = mk_bnf_T RTs CA;
blanchet@49463
   660
    val CA'CB' = HOLogic.mk_prodT (CA', CB');
blanchet@49453
   661
blanchet@48975
   662
    val bnf_map_AsAs = mk_bnf_map As' As';
blanchet@48975
   663
    val bnf_map_AsBs = mk_bnf_map As' Bs';
blanchet@48975
   664
    val bnf_map_AsCs = mk_bnf_map As' Cs;
blanchet@48975
   665
    val bnf_map_BsCs = mk_bnf_map Bs' Cs;
blanchet@48975
   666
    val bnf_sets_As = map (mk_bnf_t As') bnf_sets;
blanchet@48975
   667
    val bnf_sets_Bs = map (mk_bnf_t Bs') bnf_sets;
blanchet@48975
   668
    val bnf_bd_As = mk_bnf_t As' bnf_bd;
blanchet@48975
   669
    val bnf_wit_As = map (apsnd (mk_bnf_t As')) bnf_wits;
blanchet@48975
   670
blanchet@49463
   671
    val (((((((((((((((((((((((((fs, fs_copy), gs), hs), p), (x, x')), (y, y')), (z, z')), zs), As),
blanchet@49459
   672
      As_copy), Xs), B1s), B2s), f1s), f2s), e1s), e2s), p1s), p2s), bs), (Rs, Rs')), Rs_copy), Ss),
blanchet@49459
   673
      (Qs, Qs')), _) = lthy
blanchet@48975
   674
      |> mk_Frees "f" (map2 (curry (op -->)) As' Bs')
blanchet@48975
   675
      ||>> mk_Frees "f" (map2 (curry (op -->)) As' Bs')
blanchet@48975
   676
      ||>> mk_Frees "g" (map2 (curry (op -->)) Bs' Cs)
blanchet@48975
   677
      ||>> mk_Frees "h" (map2 (curry (op -->)) As' Ts)
blanchet@49463
   678
      ||>> yield_singleton (mk_Frees "p") CA'CB'
blanchet@48975
   679
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "x") CA'
blanchet@48975
   680
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "y") CB'
blanchet@48975
   681
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "z") CRs'
blanchet@48975
   682
      ||>> mk_Frees "z" As'
blanchet@48975
   683
      ||>> mk_Frees "A" (map HOLogic.mk_setT As')
blanchet@48975
   684
      ||>> mk_Frees "A" (map HOLogic.mk_setT As')
blanchet@48975
   685
      ||>> mk_Frees "A" (map HOLogic.mk_setT domTs)
blanchet@48975
   686
      ||>> mk_Frees "B1" (map HOLogic.mk_setT B1Ts)
blanchet@48975
   687
      ||>> mk_Frees "B2" (map HOLogic.mk_setT B2Ts)
blanchet@48975
   688
      ||>> mk_Frees "f1" (map2 (curry (op -->)) B1Ts ranTs)
blanchet@48975
   689
      ||>> mk_Frees "f2" (map2 (curry (op -->)) B2Ts ranTs)
blanchet@48975
   690
      ||>> mk_Frees "e1" (map2 (curry (op -->)) B1Ts ranTs')
blanchet@48975
   691
      ||>> mk_Frees "e2" (map2 (curry (op -->)) B2Ts ranTs'')
blanchet@48975
   692
      ||>> mk_Frees "p1" (map2 (curry (op -->)) domTs B1Ts)
blanchet@48975
   693
      ||>> mk_Frees "p2" (map2 (curry (op -->)) domTs B2Ts)
blanchet@48975
   694
      ||>> mk_Frees "b" As'
blanchet@49459
   695
      ||>> mk_Frees' "R" setRTs
blanchet@48975
   696
      ||>> mk_Frees "R" setRTs
blanchet@48975
   697
      ||>> mk_Frees "S" setRTsBsCs
blanchet@48975
   698
      ||>> mk_Frees' "Q" QTs;
blanchet@48975
   699
blanchet@49459
   700
    (*Gr (in R1 .. Rn) (map fst .. fst)^-1 O Gr (in R1 .. Rn) (map snd .. snd)*)
blanchet@49463
   701
    val O_Gr =
blanchet@49459
   702
      let
blanchet@49459
   703
        val map1 = Term.list_comb (mk_bnf_map RTs As', map fst_const RTs);
blanchet@49459
   704
        val map2 = Term.list_comb (mk_bnf_map RTs Bs', map snd_const RTs);
blanchet@49459
   705
        val bnf_in = mk_in (map Free Rs') (map (mk_bnf_t RTs) bnf_sets) CRs';
blanchet@49459
   706
      in
blanchet@49459
   707
        mk_rel_comp (mk_converse (mk_Gr bnf_in map1), mk_Gr bnf_in map2)
blanchet@49459
   708
      end;
blanchet@49459
   709
blanchet@49463
   710
    fun mk_predicate_of_set x_name y_name t =
blanchet@49463
   711
      let
blanchet@49463
   712
        val (T, U) = HOLogic.dest_prodT (HOLogic.dest_setT (fastype_of t));
blanchet@49463
   713
        val x = Free (x_name, T);
blanchet@49463
   714
        val y = Free (y_name, U);
blanchet@49463
   715
      in fold_rev Term.lambda [x, y] (HOLogic.mk_mem (HOLogic.mk_prod (x, y), t)) end;
blanchet@49463
   716
blanchet@49507
   717
    val rel_rhs = (case raw_rel_opt of
blanchet@49463
   718
        NONE =>
blanchet@49463
   719
        fold_rev absfree Qs' (mk_predicate_of_set (fst x') (fst y')
blanchet@49463
   720
          (Term.list_comb (fold_rev Term.absfree Rs' O_Gr, map3 (fn Q => fn T => fn U =>
blanchet@49463
   721
          HOLogic.Collect_const (HOLogic.mk_prodT (T, U)) $ HOLogic.mk_split Q) Qs As' Bs')))
blanchet@49507
   722
      | SOME raw_rel => prep_term no_defs_lthy raw_rel);
blanchet@49463
   723
blanchet@49507
   724
    val rel_bind_def = (fn () => Binding.suffix_name ("_" ^ relN) b, rel_rhs);
blanchet@49463
   725
blanchet@49507
   726
    val ((bnf_rel_term, raw_rel_def), (lthy, lthy_old)) =
blanchet@49463
   727
      lthy
blanchet@49507
   728
      |> maybe_define (is_some raw_rel_opt) rel_bind_def
blanchet@49463
   729
      ||> `(maybe_restore lthy);
blanchet@49463
   730
blanchet@49463
   731
    val phi = Proof_Context.export_morphism lthy_old lthy;
blanchet@49507
   732
    val bnf_rel_def = Morphism.thm phi raw_rel_def;
blanchet@49507
   733
    val bnf_rel = Morphism.term phi bnf_rel_term;
blanchet@49463
   734
blanchet@49507
   735
    fun mk_bnf_rel QTs CA' CB' = normalize_rel lthy QTs CA' CB' bnf_rel;
blanchet@49463
   736
blanchet@49507
   737
    val rel = mk_bnf_rel QTs CA' CB';
blanchet@49463
   738
blanchet@49506
   739
    val srel_rhs =
blanchet@49463
   740
      fold_rev Term.absfree Rs' (HOLogic.Collect_const CA'CB' $
blanchet@49507
   741
        Term.lambda p (Term.list_comb (rel, map (mk_predicate_of_set (fst x') (fst y')) Rs) $
blanchet@49463
   742
        HOLogic.mk_fst p $ HOLogic.mk_snd p));
blanchet@49459
   743
blanchet@49506
   744
    val srel_bind_def = (fn () => Binding.suffix_name ("_" ^ srelN) b, srel_rhs);
blanchet@49459
   745
blanchet@49506
   746
    val ((bnf_srel_term, raw_srel_def), (lthy, lthy_old)) =
blanchet@49459
   747
      lthy
blanchet@49506
   748
      |> maybe_define false srel_bind_def
blanchet@49459
   749
      ||> `(maybe_restore lthy);
blanchet@49459
   750
blanchet@49459
   751
    val phi = Proof_Context.export_morphism lthy_old lthy;
blanchet@49506
   752
    val bnf_srel_def = Morphism.thm phi raw_srel_def;
blanchet@49506
   753
    val bnf_srel = Morphism.term phi bnf_srel_term;
blanchet@49459
   754
blanchet@49506
   755
    fun mk_bnf_srel setRTs CA' CB' = normalize_srel lthy setRTs CA' CB' bnf_srel;
blanchet@49459
   756
blanchet@49506
   757
    val srel = mk_bnf_srel setRTs CA' CB';
blanchet@49459
   758
blanchet@49460
   759
    val _ = case no_reflexive (raw_map_def :: raw_set_defs @ [raw_bd_def] @
blanchet@49507
   760
        raw_wit_defs @ [raw_rel_def, raw_srel_def]) of
blanchet@49459
   761
        [] => ()
blanchet@49459
   762
      | defs => Proof_Display.print_consts true lthy_old (K false)
blanchet@49459
   763
          (map (dest_Free o fst o Logic.dest_equals o prop_of) defs);
blanchet@49459
   764
blanchet@49458
   765
    val map_id_goal =
blanchet@48975
   766
      let
blanchet@49018
   767
        val bnf_map_app_id = Term.list_comb (bnf_map_AsAs, map HOLogic.id_const As');
blanchet@48975
   768
      in
blanchet@48975
   769
        HOLogic.mk_Trueprop
blanchet@48975
   770
          (HOLogic.mk_eq (bnf_map_app_id, HOLogic.id_const CA'))
blanchet@48975
   771
      end;
blanchet@48975
   772
blanchet@49458
   773
    val map_comp_goal =
blanchet@48975
   774
      let
blanchet@49018
   775
        val bnf_map_app_comp = Term.list_comb (bnf_map_AsCs, map2 (curry HOLogic.mk_comp) gs fs);
blanchet@48975
   776
        val comp_bnf_map_app = HOLogic.mk_comp
blanchet@48975
   777
          (Term.list_comb (bnf_map_BsCs, gs),
blanchet@48975
   778
           Term.list_comb (bnf_map_AsBs, fs));
blanchet@48975
   779
      in
blanchet@49123
   780
        fold_rev Logic.all (fs @ gs) (mk_Trueprop_eq (bnf_map_app_comp, comp_bnf_map_app))
blanchet@48975
   781
      end;
blanchet@48975
   782
blanchet@49458
   783
    val map_cong_goal =
blanchet@48975
   784
      let
blanchet@48975
   785
        fun mk_prem z set f f_copy =
blanchet@48975
   786
          Logic.all z (Logic.mk_implies
blanchet@48975
   787
            (HOLogic.mk_Trueprop (HOLogic.mk_mem (z, set $ x)),
blanchet@49123
   788
            mk_Trueprop_eq (f $ z, f_copy $ z)));
blanchet@48975
   789
        val prems = map4 mk_prem zs bnf_sets_As fs fs_copy;
blanchet@48975
   790
        val eq = HOLogic.mk_eq (Term.list_comb (bnf_map_AsBs, fs) $ x,
blanchet@48975
   791
          Term.list_comb (bnf_map_AsBs, fs_copy) $ x);
blanchet@48975
   792
      in
blanchet@48975
   793
        fold_rev Logic.all (x :: fs @ fs_copy)
blanchet@48975
   794
          (Logic.list_implies (prems, HOLogic.mk_Trueprop eq))
blanchet@48975
   795
      end;
blanchet@48975
   796
blanchet@49458
   797
    val set_naturals_goal =
blanchet@48975
   798
      let
blanchet@48975
   799
        fun mk_goal setA setB f =
blanchet@48975
   800
          let
blanchet@48975
   801
            val set_comp_map =
blanchet@48975
   802
              HOLogic.mk_comp (setB, Term.list_comb (bnf_map_AsBs, fs));
blanchet@48975
   803
            val image_comp_set = HOLogic.mk_comp (mk_image f, setA);
blanchet@48975
   804
          in
blanchet@49123
   805
            fold_rev Logic.all fs (mk_Trueprop_eq (set_comp_map, image_comp_set))
blanchet@48975
   806
          end;
blanchet@48975
   807
      in
blanchet@48975
   808
        map3 mk_goal bnf_sets_As bnf_sets_Bs fs
blanchet@48975
   809
      end;
blanchet@48975
   810
blanchet@49458
   811
    val card_order_bd_goal = HOLogic.mk_Trueprop (mk_card_order bnf_bd_As);
blanchet@48975
   812
blanchet@49458
   813
    val cinfinite_bd_goal = HOLogic.mk_Trueprop (mk_cinfinite bnf_bd_As);
blanchet@48975
   814
blanchet@49458
   815
    val set_bds_goal =
blanchet@48975
   816
      let
blanchet@48975
   817
        fun mk_goal set =
blanchet@48975
   818
          Logic.all x (HOLogic.mk_Trueprop (mk_ordLeq (mk_card_of (set $ x)) bnf_bd_As));
blanchet@48975
   819
      in
blanchet@48975
   820
        map mk_goal bnf_sets_As
blanchet@48975
   821
      end;
blanchet@48975
   822
blanchet@49458
   823
    val in_bd_goal =
blanchet@48975
   824
      let
blanchet@48975
   825
        val bd = mk_cexp
blanchet@48975
   826
          (if live = 0 then ctwo
blanchet@48975
   827
            else mk_csum (Library.foldr1 (uncurry mk_csum) (map mk_card_of As)) ctwo)
blanchet@48975
   828
          bnf_bd_As;
blanchet@48975
   829
      in
blanchet@48975
   830
        fold_rev Logic.all As
blanchet@48975
   831
          (HOLogic.mk_Trueprop (mk_ordLeq (mk_card_of (mk_in As bnf_sets_As CA')) bd))
blanchet@48975
   832
      end;
blanchet@48975
   833
blanchet@49458
   834
    val map_wpull_goal =
blanchet@48975
   835
      let
blanchet@48975
   836
        val prems = map HOLogic.mk_Trueprop
blanchet@48975
   837
          (map8 mk_wpull Xs B1s B2s f1s f2s (replicate live NONE) p1s p2s);
blanchet@48975
   838
        val CX = mk_bnf_T domTs CA;
blanchet@48975
   839
        val CB1 = mk_bnf_T B1Ts CA;
blanchet@48975
   840
        val CB2 = mk_bnf_T B2Ts CA;
blanchet@48975
   841
        val bnf_sets_CX = map2 (normalize_set (map (mk_bnf_T domTs) CA_params)) domTs bnf_sets;
blanchet@48975
   842
        val bnf_sets_CB1 = map2 (normalize_set (map (mk_bnf_T B1Ts) CA_params)) B1Ts bnf_sets;
blanchet@48975
   843
        val bnf_sets_CB2 = map2 (normalize_set (map (mk_bnf_T B2Ts) CA_params)) B2Ts bnf_sets;
blanchet@48975
   844
        val bnf_map_app_f1 = Term.list_comb (mk_bnf_map B1Ts ranTs, f1s);
blanchet@48975
   845
        val bnf_map_app_f2 = Term.list_comb (mk_bnf_map B2Ts ranTs, f2s);
blanchet@48975
   846
        val bnf_map_app_p1 = Term.list_comb (mk_bnf_map domTs B1Ts, p1s);
blanchet@48975
   847
        val bnf_map_app_p2 = Term.list_comb (mk_bnf_map domTs B2Ts, p2s);
blanchet@48975
   848
blanchet@48975
   849
        val map_wpull = mk_wpull (mk_in Xs bnf_sets_CX CX)
blanchet@48975
   850
          (mk_in B1s bnf_sets_CB1 CB1) (mk_in B2s bnf_sets_CB2 CB2)
blanchet@48975
   851
          bnf_map_app_f1 bnf_map_app_f2 NONE bnf_map_app_p1 bnf_map_app_p2;
blanchet@48975
   852
      in
blanchet@48975
   853
        fold_rev Logic.all (Xs @ B1s @ B2s @ f1s @ f2s @ p1s @ p2s)
blanchet@48975
   854
          (Logic.list_implies (prems, HOLogic.mk_Trueprop map_wpull))
blanchet@48975
   855
      end;
blanchet@48975
   856
blanchet@49506
   857
    val srel_O_Gr_goal = fold_rev Logic.all Rs (mk_Trueprop_eq (Term.list_comb (srel, Rs), O_Gr));
blanchet@49453
   858
blanchet@49460
   859
    val goals = zip_axioms map_id_goal map_comp_goal map_cong_goal set_naturals_goal
blanchet@49506
   860
      card_order_bd_goal cinfinite_bd_goal set_bds_goal in_bd_goal map_wpull_goal srel_O_Gr_goal;
blanchet@48975
   861
blanchet@48975
   862
    fun mk_wit_goals (I, wit) =
blanchet@48975
   863
      let
blanchet@48975
   864
        val xs = map (nth bs) I;
blanchet@48975
   865
        fun wit_goal i =
blanchet@48975
   866
          let
blanchet@48975
   867
            val z = nth zs i;
blanchet@48975
   868
            val set_wit = nth bnf_sets_As i $ Term.list_comb (wit, xs);
blanchet@48975
   869
            val concl = HOLogic.mk_Trueprop
blanchet@48975
   870
              (if member (op =) I i then HOLogic.mk_eq (z, nth bs i)
blanchet@48975
   871
              else @{term False});
blanchet@48975
   872
          in
blanchet@48975
   873
            fold_rev Logic.all (z :: xs)
blanchet@48975
   874
              (Logic.mk_implies (HOLogic.mk_Trueprop (HOLogic.mk_mem (z, set_wit)), concl))
blanchet@48975
   875
          end;
blanchet@48975
   876
      in
blanchet@48975
   877
        map wit_goal (0 upto live - 1)
blanchet@48975
   878
      end;
blanchet@48975
   879
blanchet@48975
   880
    val wit_goalss = map mk_wit_goals bnf_wit_As;
blanchet@48975
   881
blanchet@48975
   882
    fun after_qed thms lthy =
blanchet@48975
   883
      let
blanchet@48975
   884
        val (axioms, wit_thms) = apfst (mk_axioms live) (chop (length goals) thms);
blanchet@48975
   885
traytel@49109
   886
        val bd_Card_order = #bd_card_order axioms RS @{thm conjunct2[OF card_order_on_Card_order]};
blanchet@48975
   887
        val bd_Cinfinite = @{thm conjI} OF [#bd_cinfinite axioms, bd_Card_order];
blanchet@48975
   888
        val bd_Cnotzero = bd_Cinfinite RS @{thm Cinfinite_Cnotzero};
blanchet@48975
   889
blanchet@49461
   890
        fun mk_lazy f = if fact_policy <> Derive_Few_Facts then Lazy.value (f ()) else Lazy.lazy f;
blanchet@48975
   891
blanchet@48975
   892
        fun mk_collect_set_natural () =
blanchet@48975
   893
          let
blanchet@48975
   894
            val defT = mk_bnf_T Ts CA --> HOLogic.mk_setT T;
blanchet@48975
   895
            val collect_map = HOLogic.mk_comp
blanchet@48975
   896
              (mk_collect (map (mk_bnf_t Ts) bnf_sets) defT,
blanchet@48975
   897
              Term.list_comb (mk_bnf_map As' Ts, hs));
blanchet@48975
   898
            val image_collect = mk_collect
blanchet@48975
   899
              (map2 (fn h => fn set => HOLogic.mk_comp (mk_image h, set)) hs bnf_sets_As)
blanchet@48975
   900
              defT;
blanchet@48975
   901
            (*collect {set1 ... setm} o map f1 ... fm = collect {f1` o set1 ... fm` o setm}*)
blanchet@49123
   902
            val goal = fold_rev Logic.all hs (mk_Trueprop_eq (collect_map, image_collect));
blanchet@48975
   903
          in
blanchet@48975
   904
            Skip_Proof.prove lthy [] [] goal
blanchet@48975
   905
              (fn {context = ctxt, ...} => mk_collect_set_natural_tac ctxt (#set_natural axioms))
traytel@49109
   906
            |> Thm.close_derivation
blanchet@48975
   907
          end;
blanchet@48975
   908
blanchet@48975
   909
        val collect_set_natural = mk_lazy mk_collect_set_natural;
blanchet@48975
   910
blanchet@48975
   911
        fun mk_in_mono () =
blanchet@48975
   912
          let
blanchet@48975
   913
            val prems_mono = map2 (HOLogic.mk_Trueprop oo mk_subset) As As_copy;
blanchet@49458
   914
            val in_mono_goal =
blanchet@48975
   915
              fold_rev Logic.all (As @ As_copy)
blanchet@48975
   916
                (Logic.list_implies (prems_mono, HOLogic.mk_Trueprop
blanchet@48975
   917
                  (mk_subset (mk_in As bnf_sets_As CA') (mk_in As_copy bnf_sets_As CA'))));
blanchet@48975
   918
          in
blanchet@49458
   919
            Skip_Proof.prove lthy [] [] in_mono_goal (K (mk_in_mono_tac live))
traytel@49109
   920
            |> Thm.close_derivation
blanchet@48975
   921
          end;
blanchet@48975
   922
blanchet@48975
   923
        val in_mono = mk_lazy mk_in_mono;
blanchet@48975
   924
blanchet@48975
   925
        fun mk_in_cong () =
blanchet@48975
   926
          let
blanchet@48975
   927
            val prems_cong = map2 (HOLogic.mk_Trueprop oo curry HOLogic.mk_eq) As As_copy;
blanchet@49458
   928
            val in_cong_goal =
blanchet@48975
   929
              fold_rev Logic.all (As @ As_copy)
blanchet@48975
   930
                (Logic.list_implies (prems_cong, HOLogic.mk_Trueprop
blanchet@48975
   931
                  (HOLogic.mk_eq (mk_in As bnf_sets_As CA', mk_in As_copy bnf_sets_As CA'))));
blanchet@48975
   932
          in
blanchet@49458
   933
            Skip_Proof.prove lthy [] [] in_cong_goal (K ((TRY o hyp_subst_tac THEN' rtac refl) 1))
traytel@49109
   934
            |> Thm.close_derivation
blanchet@48975
   935
          end;
blanchet@48975
   936
blanchet@48975
   937
        val in_cong = mk_lazy mk_in_cong;
blanchet@48975
   938
blanchet@48975
   939
        val map_id' = mk_lazy (fn () => mk_id' (#map_id axioms));
blanchet@48975
   940
        val map_comp' = mk_lazy (fn () => mk_comp' (#map_comp axioms));
blanchet@48975
   941
blanchet@48975
   942
        val set_natural' =
blanchet@48975
   943
          map (fn thm => mk_lazy (fn () => mk_set_natural' thm)) (#set_natural axioms);
blanchet@48975
   944
blanchet@48975
   945
        fun mk_map_wppull () =
blanchet@48975
   946
          let
blanchet@48975
   947
            val prems = if live = 0 then [] else
blanchet@48975
   948
              [HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@48975
   949
                (map8 mk_wpull Xs B1s B2s f1s f2s (map SOME (e1s ~~ e2s)) p1s p2s))];
blanchet@48975
   950
            val CX = mk_bnf_T domTs CA;
blanchet@48975
   951
            val CB1 = mk_bnf_T B1Ts CA;
blanchet@48975
   952
            val CB2 = mk_bnf_T B2Ts CA;
blanchet@48975
   953
            val bnf_sets_CX =
blanchet@48975
   954
              map2 (normalize_set (map (mk_bnf_T domTs) CA_params)) domTs bnf_sets;
blanchet@48975
   955
            val bnf_sets_CB1 =
blanchet@48975
   956
              map2 (normalize_set (map (mk_bnf_T B1Ts) CA_params)) B1Ts bnf_sets;
blanchet@48975
   957
            val bnf_sets_CB2 =
blanchet@48975
   958
              map2 (normalize_set (map (mk_bnf_T B2Ts) CA_params)) B2Ts bnf_sets;
blanchet@48975
   959
            val bnf_map_app_f1 = Term.list_comb (mk_bnf_map B1Ts ranTs, f1s);
blanchet@48975
   960
            val bnf_map_app_f2 = Term.list_comb (mk_bnf_map B2Ts ranTs, f2s);
blanchet@48975
   961
            val bnf_map_app_e1 = Term.list_comb (mk_bnf_map B1Ts ranTs', e1s);
blanchet@48975
   962
            val bnf_map_app_e2 = Term.list_comb (mk_bnf_map B2Ts ranTs'', e2s);
blanchet@48975
   963
            val bnf_map_app_p1 = Term.list_comb (mk_bnf_map domTs B1Ts, p1s);
blanchet@48975
   964
            val bnf_map_app_p2 = Term.list_comb (mk_bnf_map domTs B2Ts, p2s);
blanchet@48975
   965
blanchet@48975
   966
            val concl = mk_wpull (mk_in Xs bnf_sets_CX CX)
blanchet@48975
   967
              (mk_in B1s bnf_sets_CB1 CB1) (mk_in B2s bnf_sets_CB2 CB2)
blanchet@48975
   968
              bnf_map_app_f1 bnf_map_app_f2 (SOME (bnf_map_app_e1, bnf_map_app_e2))
blanchet@48975
   969
              bnf_map_app_p1 bnf_map_app_p2;
blanchet@48975
   970
blanchet@48975
   971
            val goal =
blanchet@48975
   972
              fold_rev Logic.all (Xs @ B1s @ B2s @ f1s @ f2s @ e1s @ e2s @ p1s @ p2s)
blanchet@48975
   973
                (Logic.list_implies (prems, HOLogic.mk_Trueprop concl))
blanchet@48975
   974
          in
blanchet@48975
   975
            Skip_Proof.prove lthy [] [] goal
blanchet@48975
   976
              (fn _ => mk_map_wppull_tac (#map_id axioms) (#map_cong axioms)
blanchet@48975
   977
                (#map_wpull axioms) (Lazy.force map_comp') (map Lazy.force set_natural'))
traytel@49109
   978
            |> Thm.close_derivation
blanchet@48975
   979
          end;
blanchet@48975
   980
blanchet@49506
   981
        val srel_O_Grs = no_refl [#srel_O_Gr axioms];
blanchet@49453
   982
blanchet@48975
   983
        val map_wppull = mk_lazy mk_map_wppull;
blanchet@48975
   984
blanchet@49506
   985
        fun mk_srel_Gr () =
blanchet@48975
   986
          let
blanchet@49506
   987
            val lhs = Term.list_comb (srel, map2 mk_Gr As fs);
blanchet@48975
   988
            val rhs = mk_Gr (mk_in As bnf_sets_As CA') (Term.list_comb (bnf_map_AsBs, fs));
blanchet@49123
   989
            val goal = fold_rev Logic.all (As @ fs) (mk_Trueprop_eq (lhs, rhs));
blanchet@48975
   990
          in
blanchet@48975
   991
            Skip_Proof.prove lthy [] [] goal
blanchet@49506
   992
              (mk_srel_Gr_tac srel_O_Grs (#map_id axioms) (#map_cong axioms) (Lazy.force map_id')
blanchet@48975
   993
                (Lazy.force map_comp') (map Lazy.force set_natural'))
traytel@49109
   994
            |> Thm.close_derivation
blanchet@48975
   995
          end;
blanchet@48975
   996
blanchet@49506
   997
        val srel_Gr = mk_lazy mk_srel_Gr;
blanchet@48975
   998
blanchet@49506
   999
        fun mk_srel_prems f = map2 (HOLogic.mk_Trueprop oo f) Rs Rs_copy
blanchet@49506
  1000
        fun mk_srel_concl f = HOLogic.mk_Trueprop
blanchet@49506
  1001
          (f (Term.list_comb (srel, Rs), Term.list_comb (srel, Rs_copy)));
blanchet@48975
  1002
blanchet@49506
  1003
        fun mk_srel_mono () =
blanchet@48975
  1004
          let
blanchet@49506
  1005
            val mono_prems = mk_srel_prems mk_subset;
blanchet@49506
  1006
            val mono_concl = mk_srel_concl (uncurry mk_subset);
blanchet@48975
  1007
          in
blanchet@48975
  1008
            Skip_Proof.prove lthy [] []
blanchet@48975
  1009
              (fold_rev Logic.all (Rs @ Rs_copy) (Logic.list_implies (mono_prems, mono_concl)))
blanchet@49506
  1010
              (mk_srel_mono_tac srel_O_Grs (Lazy.force in_mono))
traytel@49109
  1011
            |> Thm.close_derivation
blanchet@48975
  1012
          end;
blanchet@48975
  1013
blanchet@49506
  1014
        fun mk_srel_cong () =
blanchet@48975
  1015
          let
blanchet@49506
  1016
            val cong_prems = mk_srel_prems (curry HOLogic.mk_eq);
blanchet@49506
  1017
            val cong_concl = mk_srel_concl HOLogic.mk_eq;
blanchet@48975
  1018
          in
blanchet@48975
  1019
            Skip_Proof.prove lthy [] []
blanchet@48975
  1020
              (fold_rev Logic.all (Rs @ Rs_copy) (Logic.list_implies (cong_prems, cong_concl)))
blanchet@48975
  1021
              (fn _ => (TRY o hyp_subst_tac THEN' rtac refl) 1)
traytel@49109
  1022
            |> Thm.close_derivation
blanchet@48975
  1023
          end;
blanchet@48975
  1024
blanchet@49506
  1025
        val srel_mono = mk_lazy mk_srel_mono;
blanchet@49506
  1026
        val srel_cong = mk_lazy mk_srel_cong;
blanchet@48975
  1027
blanchet@49506
  1028
        fun mk_srel_Id () =
blanchet@49506
  1029
          let val relAsAs = mk_bnf_srel self_setRTs CA' CA' in
blanchet@48975
  1030
            Skip_Proof.prove lthy [] []
blanchet@48975
  1031
              (HOLogic.mk_Trueprop
blanchet@48975
  1032
                (HOLogic.mk_eq (Term.list_comb (relAsAs, map Id_const As'), Id_const CA')))
blanchet@49506
  1033
              (mk_srel_Id_tac live (Lazy.force srel_Gr) (#map_id axioms))
traytel@49109
  1034
            |> Thm.close_derivation
blanchet@48975
  1035
          end;
blanchet@48975
  1036
blanchet@49506
  1037
        val srel_Id = mk_lazy mk_srel_Id;
blanchet@48975
  1038
blanchet@49506
  1039
        fun mk_srel_converse () =
blanchet@48975
  1040
          let
blanchet@49506
  1041
            val relBsAs = mk_bnf_srel setRT's CB' CA';
blanchet@48975
  1042
            val lhs = Term.list_comb (relBsAs, map mk_converse Rs);
blanchet@49506
  1043
            val rhs = mk_converse (Term.list_comb (srel, Rs));
blanchet@48975
  1044
            val le_goal = fold_rev Logic.all Rs (HOLogic.mk_Trueprop (mk_subset lhs rhs));
blanchet@48975
  1045
            val le_thm = Skip_Proof.prove lthy [] [] le_goal
blanchet@49506
  1046
              (mk_srel_converse_le_tac srel_O_Grs (Lazy.force srel_Id) (#map_cong axioms)
blanchet@48975
  1047
                (Lazy.force map_comp') (map Lazy.force set_natural'))
traytel@49109
  1048
              |> Thm.close_derivation
blanchet@49123
  1049
            val goal = fold_rev Logic.all Rs (mk_Trueprop_eq (lhs, rhs));
blanchet@48975
  1050
          in
blanchet@49506
  1051
            Skip_Proof.prove lthy [] [] goal (fn _ => mk_srel_converse_tac le_thm)
traytel@49109
  1052
            |> Thm.close_derivation
blanchet@48975
  1053
          end;
blanchet@48975
  1054
blanchet@49506
  1055
        val srel_converse = mk_lazy mk_srel_converse;
blanchet@48975
  1056
blanchet@49506
  1057
        fun mk_srel_O () =
blanchet@48975
  1058
          let
blanchet@49506
  1059
            val relAsCs = mk_bnf_srel setRTsAsCs CA' CC';
blanchet@49506
  1060
            val relBsCs = mk_bnf_srel setRTsBsCs CB' CC';
blanchet@48975
  1061
            val lhs = Term.list_comb (relAsCs, map2 (curry mk_rel_comp) Rs Ss);
blanchet@49506
  1062
            val rhs = mk_rel_comp (Term.list_comb (srel, Rs), Term.list_comb (relBsCs, Ss));
blanchet@49123
  1063
            val goal = fold_rev Logic.all (Rs @ Ss) (mk_Trueprop_eq (lhs, rhs));
blanchet@48975
  1064
          in
blanchet@48975
  1065
            Skip_Proof.prove lthy [] [] goal
blanchet@49506
  1066
              (mk_srel_O_tac srel_O_Grs (Lazy.force srel_Id) (#map_cong axioms)
blanchet@48975
  1067
                (Lazy.force map_wppull) (Lazy.force map_comp') (map Lazy.force set_natural'))
traytel@49109
  1068
            |> Thm.close_derivation
blanchet@48975
  1069
          end;
blanchet@48975
  1070
blanchet@49506
  1071
        val srel_O = mk_lazy mk_srel_O;
blanchet@48975
  1072
blanchet@49506
  1073
        fun mk_in_srel () =
blanchet@48975
  1074
          let
blanchet@48975
  1075
            val bnf_in = mk_in Rs (map (mk_bnf_t RTs) bnf_sets) CRs';
blanchet@48975
  1076
            val map1 = Term.list_comb (mk_bnf_map RTs As', map fst_const RTs);
blanchet@48975
  1077
            val map2 = Term.list_comb (mk_bnf_map RTs Bs', map snd_const RTs);
blanchet@48975
  1078
            val map_fst_eq = HOLogic.mk_eq (map1 $ z, x);
blanchet@48975
  1079
            val map_snd_eq = HOLogic.mk_eq (map2 $ z, y);
blanchet@49506
  1080
            val lhs = HOLogic.mk_mem (HOLogic.mk_prod (x, y), Term.list_comb (srel, Rs));
blanchet@48975
  1081
            val rhs =
blanchet@48975
  1082
              HOLogic.mk_exists (fst z', snd z', HOLogic.mk_conj (HOLogic.mk_mem (z, bnf_in),
blanchet@48975
  1083
                HOLogic.mk_conj (map_fst_eq, map_snd_eq)));
blanchet@48975
  1084
            val goal =
blanchet@49123
  1085
              fold_rev Logic.all (x :: y :: Rs) (mk_Trueprop_eq (lhs, rhs));
blanchet@48975
  1086
          in
blanchet@49506
  1087
            Skip_Proof.prove lthy [] [] goal (mk_in_srel_tac srel_O_Grs (length bnf_sets))
traytel@49109
  1088
            |> Thm.close_derivation
blanchet@48975
  1089
          end;
blanchet@48975
  1090
blanchet@49506
  1091
        val in_srel = mk_lazy mk_in_srel;
blanchet@48975
  1092
blanchet@49507
  1093
        val defs = mk_defs bnf_map_def bnf_set_defs bnf_rel_def bnf_srel_def;
blanchet@48975
  1094
blanchet@49506
  1095
        val facts = mk_facts bd_Card_order bd_Cinfinite bd_Cnotzero collect_set_natural in_cong
blanchet@49506
  1096
          in_mono in_srel map_comp' map_id' map_wppull set_natural' srel_cong srel_mono srel_Id
blanchet@49506
  1097
          srel_Gr srel_converse srel_O;
blanchet@48975
  1098
blanchet@48975
  1099
        val wits = map2 mk_witness bnf_wits wit_thms;
blanchet@48975
  1100
blanchet@49507
  1101
        val bnf_rel =
blanchet@49507
  1102
          Term.subst_atomic_types ((Ds ~~ deads) @ (As' ~~ alphas) @ (Bs' ~~ betas)) rel;
blanchet@49506
  1103
        val bnf_srel =
blanchet@49506
  1104
          Term.subst_atomic_types ((Ds ~~ deads) @ (As' ~~ alphas) @ (Bs' ~~ betas)) srel;
blanchet@48975
  1105
blanchet@48975
  1106
        val bnf = mk_bnf b CA live alphas betas dead deads bnf_map bnf_sets bnf_bd axioms defs facts
blanchet@49507
  1107
          wits bnf_rel bnf_srel;
blanchet@48975
  1108
      in
blanchet@48975
  1109
        (bnf, lthy
blanchet@48975
  1110
          |> (if fact_policy = Note_All_Facts_and_Axioms then
blanchet@48975
  1111
                let
blanchet@48975
  1112
                  val witNs = if length wits = 1 then [witN] else map mk_witN (1 upto length wits);
traytel@49109
  1113
                  val notes =
traytel@49109
  1114
                    [(bd_card_orderN, [#bd_card_order axioms]),
traytel@49109
  1115
                    (bd_cinfiniteN, [#bd_cinfinite axioms]),
traytel@49109
  1116
                    (bd_Card_orderN, [#bd_Card_order facts]),
traytel@49109
  1117
                    (bd_CinfiniteN, [#bd_Cinfinite facts]),
traytel@49109
  1118
                    (bd_CnotzeroN, [#bd_Cnotzero facts]),
traytel@49109
  1119
                    (collect_set_naturalN, [Lazy.force (#collect_set_natural facts)]),
traytel@49109
  1120
                    (in_bdN, [#in_bd axioms]),
traytel@49109
  1121
                    (in_monoN, [Lazy.force (#in_mono facts)]),
blanchet@49506
  1122
                    (in_srelN, [Lazy.force (#in_srel facts)]),
traytel@49109
  1123
                    (map_compN, [#map_comp axioms]),
traytel@49109
  1124
                    (map_idN, [#map_id axioms]),
traytel@49109
  1125
                    (map_wpullN, [#map_wpull axioms]),
traytel@49109
  1126
                    (set_naturalN, #set_natural axioms),
traytel@49109
  1127
                    (set_bdN, #set_bd axioms)] @
traytel@49109
  1128
                    map2 pair witNs wit_thms
traytel@49109
  1129
                    |> map (fn (thmN, thms) =>
traytel@49109
  1130
                      ((qualify (Binding.qualify true (Binding.name_of b) (Binding.name thmN)), []),
traytel@49109
  1131
                      [(thms, [])]));
blanchet@48975
  1132
                in
traytel@49109
  1133
                  Local_Theory.notes notes #> snd
blanchet@48975
  1134
                end
blanchet@48975
  1135
              else
blanchet@48975
  1136
                I)
blanchet@48975
  1137
          |> (if fact_policy = Note_All_Facts_and_Axioms orelse
blanchet@48975
  1138
                 fact_policy = Derive_All_Facts_Note_Most then
traytel@49109
  1139
                let
traytel@49109
  1140
                  val notes =
blanchet@49506
  1141
                    [(map_comp'N, [Lazy.force (#map_comp' facts)]),
blanchet@49506
  1142
                    (map_congN, [#map_cong axioms]),
traytel@49109
  1143
                    (map_id'N, [Lazy.force (#map_id' facts)]),
blanchet@49506
  1144
                    (set_natural'N, map Lazy.force (#set_natural' facts)),
blanchet@49506
  1145
                    (srel_O_GrN, srel_O_Grs),
blanchet@49506
  1146
                    (srel_IdN, [Lazy.force (#srel_Id facts)]),
blanchet@49506
  1147
                    (srel_GrN, [Lazy.force (#srel_Gr facts)]),
blanchet@49506
  1148
                    (srel_converseN, [Lazy.force (#srel_converse facts)]),
blanchet@49506
  1149
                    (srel_monoN, [Lazy.force (#srel_mono facts)]),
blanchet@49506
  1150
                    (srel_ON, [Lazy.force (#srel_O facts)])]
blanchet@49460
  1151
                    |> filter_out (null o #2)
traytel@49109
  1152
                    |> map (fn (thmN, thms) =>
traytel@49109
  1153
                      ((qualify (Binding.qualify true (Binding.name_of b) (Binding.name thmN)), []),
traytel@49109
  1154
                      [(thms, [])]));
traytel@49109
  1155
                in
traytel@49109
  1156
                  Local_Theory.notes notes #> snd
traytel@49109
  1157
                end
blanchet@48975
  1158
              else
blanchet@48975
  1159
                I))
blanchet@48975
  1160
      end;
blanchet@49459
  1161
blanchet@49459
  1162
    val one_step_defs =
blanchet@49507
  1163
      no_reflexive (bnf_map_def :: bnf_bd_def :: bnf_set_defs @ bnf_wit_defs @ [bnf_rel_def,
blanchet@49506
  1164
        bnf_srel_def]);
blanchet@48975
  1165
  in
blanchet@49459
  1166
    (key, goals, wit_goalss, after_qed, lthy, one_step_defs)
blanchet@48975
  1167
  end;
blanchet@48975
  1168
traytel@49434
  1169
fun register_bnf key (bnf, lthy) =
traytel@49434
  1170
  (bnf, Local_Theory.declaration {syntax = false, pervasive = true}
traytel@49434
  1171
    (fn phi => Data.map (Symtab.update_new (key, morph_bnf phi bnf))) lthy);
traytel@49434
  1172
blanchet@49456
  1173
(* TODO: Once the invariant "nwits > 0" holds, remove "mk_conjunction_balanced'" and "rtac TrueI"
blanchet@49456
  1174
   below *)
blanchet@49456
  1175
fun mk_conjunction_balanced' [] = @{prop True}
blanchet@49456
  1176
  | mk_conjunction_balanced' ts = Logic.mk_conjunction_balanced ts;
blanchet@49456
  1177
blanchet@49018
  1178
fun bnf_def const_policy fact_policy qualify tacs wit_tac Ds =
blanchet@49463
  1179
  (fn (_, goals, wit_goalss, after_qed, lthy, one_step_defs) =>
blanchet@48975
  1180
  let
blanchet@49456
  1181
    val wits_tac =
blanchet@49456
  1182
      K (TRYALL Goal.conjunction_tac) THEN' K (TRYALL (rtac TrueI)) THEN'
blanchet@49504
  1183
      mk_unfold_thms_then_tac lthy one_step_defs wit_tac;
blanchet@49456
  1184
    val wit_goals = map mk_conjunction_balanced' wit_goalss;
blanchet@48975
  1185
    val wit_thms =
blanchet@49456
  1186
      Skip_Proof.prove lthy [] [] (mk_conjunction_balanced' wit_goals) wits_tac
blanchet@48975
  1187
      |> Conjunction.elim_balanced (length wit_goals)
blanchet@48975
  1188
      |> map2 (Conjunction.elim_balanced o length) wit_goalss
blanchet@49456
  1189
      |> map (map (Thm.close_derivation o Thm.forall_elim_vars 0));
blanchet@48975
  1190
  in
blanchet@49111
  1191
    map2 (Thm.close_derivation oo Skip_Proof.prove lthy [] [])
blanchet@49504
  1192
      goals (map (mk_unfold_thms_then_tac lthy one_step_defs) tacs)
blanchet@48975
  1193
    |> (fn thms => after_qed (map single thms @ wit_thms) lthy)
blanchet@49279
  1194
  end) oo prepare_def const_policy fact_policy qualify (K I) Ds;
blanchet@48975
  1195
traytel@49434
  1196
val bnf_def_cmd = (fn (key, goals, wit_goals, after_qed, lthy, defs) =>
blanchet@48975
  1197
  Proof.unfolding ([[(defs, [])]])
traytel@49434
  1198
    (Proof.theorem NONE (snd o register_bnf key oo after_qed)
blanchet@48975
  1199
      (map (single o rpair []) goals @ map (map (rpair [])) wit_goals) lthy)) oo
traytel@49435
  1200
  prepare_def Do_Inline (user_policy Derive_All_Facts_Note_Most) I Syntax.read_term NONE;
blanchet@48975
  1201
blanchet@48975
  1202
fun print_bnfs ctxt =
blanchet@48975
  1203
  let
blanchet@48975
  1204
    fun pretty_set sets i = Pretty.block
blanchet@48975
  1205
      [Pretty.str (mk_setN (i + 1) ^ ":"), Pretty.brk 1,
blanchet@48975
  1206
          Pretty.quote (Syntax.pretty_term ctxt (nth sets i))];
blanchet@48975
  1207
blanchet@48975
  1208
    fun pretty_bnf (key, BNF {T = T, map = map, sets = sets, bd = bd,
blanchet@48975
  1209
      live = live, lives = lives, dead = dead, deads = deads, ...}) =
blanchet@48975
  1210
      Pretty.big_list
blanchet@48975
  1211
        (Pretty.string_of (Pretty.block [Pretty.str key, Pretty.str ":", Pretty.brk 1,
blanchet@48975
  1212
          Pretty.quote (Syntax.pretty_typ ctxt T)]))
blanchet@48975
  1213
        ([Pretty.block [Pretty.str "live:", Pretty.brk 1, Pretty.str (string_of_int live),
blanchet@48975
  1214
            Pretty.brk 3, Pretty.list "[" "]" (List.map (Syntax.pretty_typ ctxt) lives)],
blanchet@48975
  1215
          Pretty.block [Pretty.str "dead:", Pretty.brk 1, Pretty.str (string_of_int dead),
blanchet@48975
  1216
            Pretty.brk 3, Pretty.list "[" "]" (List.map (Syntax.pretty_typ ctxt) deads)],
blanchet@48975
  1217
          Pretty.block [Pretty.str (mapN ^ ":"), Pretty.brk 1,
blanchet@48975
  1218
            Pretty.quote (Syntax.pretty_term ctxt map)]] @
blanchet@48975
  1219
          List.map (pretty_set sets) (0 upto length sets - 1) @
blanchet@48975
  1220
          [Pretty.block [Pretty.str (bdN ^ ":"), Pretty.brk 1,
blanchet@48975
  1221
            Pretty.quote (Syntax.pretty_term ctxt bd)]]);
blanchet@48975
  1222
  in
blanchet@48975
  1223
    Pretty.big_list "BNFs:" (map pretty_bnf (Symtab.dest (Data.get (Context.Proof ctxt))))
blanchet@48975
  1224
    |> Pretty.writeln
blanchet@48975
  1225
  end;
blanchet@48975
  1226
blanchet@48975
  1227
val _ =
blanchet@48975
  1228
  Outer_Syntax.improper_command @{command_spec "print_bnfs"} "print all BNFs"
blanchet@48975
  1229
    (Scan.succeed (Toplevel.keep (print_bnfs o Toplevel.context_of)));
blanchet@48975
  1230
blanchet@48975
  1231
val _ =
blanchet@48975
  1232
  Outer_Syntax.local_theory_to_proof @{command_spec "bnf_def"} "define a BNF for an existing type"
traytel@49434
  1233
    ((parse_opt_binding_colon -- Parse.term --
blanchet@49277
  1234
       (@{keyword "["} |-- Parse.list Parse.term --| @{keyword "]"}) -- Parse.term --
blanchet@49459
  1235
       (@{keyword "["} |-- Parse.list Parse.term --| @{keyword "]"}) -- Scan.option Parse.term)
blanchet@49459
  1236
       >> bnf_def_cmd);
blanchet@48975
  1237
blanchet@48975
  1238
end;