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