src/Pure/Isar/specification.ML
author haftmann
Wed Jan 21 16:47:32 2009 +0100 (2009-01-21)
changeset 29581 b3b33e0298eb
parent 29249 4dc278c8dc59
child 29606 fedb8be05f24
permissions -rw-r--r--
binding is alias for Binding.T
wenzelm@18620
     1
(*  Title:      Pure/Isar/specification.ML
wenzelm@18620
     2
    ID:         $Id$
wenzelm@18620
     3
    Author:     Makarius
wenzelm@18620
     4
wenzelm@21036
     5
Derived local theory specifications --- with type-inference and
wenzelm@18810
     6
toplevel polymorphism.
wenzelm@18620
     7
*)
wenzelm@18620
     8
wenzelm@18620
     9
signature SPECIFICATION =
wenzelm@18620
    10
sig
wenzelm@20890
    11
  val print_consts: local_theory -> (string * typ -> bool) -> (string * typ) list -> unit
haftmann@29581
    12
  val check_specification: (binding * typ option * mixfix) list ->
wenzelm@28084
    13
    (Attrib.binding * term list) list list -> Proof.context ->
haftmann@29581
    14
    (((binding * typ) * mixfix) list * (Attrib.binding * term list) list) * Proof.context
haftmann@29581
    15
  val read_specification: (binding * string option * mixfix) list ->
wenzelm@28084
    16
    (Attrib.binding * string list) list list -> Proof.context ->
haftmann@29581
    17
    (((binding * typ) * mixfix) list * (Attrib.binding * term list) list) * Proof.context
haftmann@29581
    18
  val check_free_specification: (binding * typ option * mixfix) list ->
wenzelm@28084
    19
    (Attrib.binding * term list) list -> Proof.context ->
haftmann@29581
    20
    (((binding * typ) * mixfix) list * (Attrib.binding * term list) list) * Proof.context
haftmann@29581
    21
  val read_free_specification: (binding * string option * mixfix) list ->
wenzelm@28084
    22
    (Attrib.binding * string list) list -> Proof.context ->
haftmann@29581
    23
    (((binding * typ) * mixfix) list * (Attrib.binding * term list) list) * Proof.context
haftmann@29581
    24
  val axiomatization: (binding * typ option * mixfix) list ->
wenzelm@28114
    25
    (Attrib.binding * term list) list -> theory ->
wenzelm@28114
    26
    (term list * (string * thm list) list) * theory
haftmann@29581
    27
  val axiomatization_cmd: (binding * string option * mixfix) list ->
wenzelm@28114
    28
    (Attrib.binding * string list) list -> theory ->
wenzelm@28114
    29
    (term list * (string * thm list) list) * theory
wenzelm@18954
    30
  val definition:
haftmann@29581
    31
    (binding * typ option * mixfix) option * (Attrib.binding * term) ->
wenzelm@28080
    32
    local_theory -> (term * (string * thm)) * local_theory
wenzelm@24927
    33
  val definition_cmd:
haftmann@29581
    34
    (binding * string option * mixfix) option * (Attrib.binding * string) ->
wenzelm@28080
    35
    local_theory -> (term * (string * thm)) * local_theory
haftmann@29581
    36
  val abbreviation: Syntax.mode -> (binding * typ option * mixfix) option * term ->
wenzelm@21532
    37
    local_theory -> local_theory
haftmann@29581
    38
  val abbreviation_cmd: Syntax.mode -> (binding * string option * mixfix) option * string ->
wenzelm@24927
    39
    local_theory -> local_theory
wenzelm@24949
    40
  val notation: bool -> Syntax.mode -> (term * mixfix) list -> local_theory -> local_theory
wenzelm@24949
    41
  val notation_cmd: bool -> Syntax.mode -> (string * mixfix) list -> local_theory -> local_theory
wenzelm@28080
    42
  val theorems: string ->
wenzelm@28084
    43
    (Attrib.binding * (thm list * Attrib.src list) list) list ->
wenzelm@28080
    44
    local_theory -> (string * thm list) list * local_theory
wenzelm@26336
    45
  val theorems_cmd: string ->
wenzelm@28084
    46
    (Attrib.binding * (Facts.ref * Attrib.src list) list) list ->
wenzelm@28080
    47
    local_theory -> (string * thm list) list * local_theory
wenzelm@24986
    48
  val theorem: string -> Method.text option ->
wenzelm@28084
    49
    (thm list list -> local_theory -> local_theory) -> Attrib.binding ->
ballarin@28710
    50
    Element.context_i list -> Element.statement_i ->
berghofe@24452
    51
    bool -> local_theory -> Proof.state
wenzelm@24986
    52
  val theorem_cmd: string -> Method.text option ->
wenzelm@28084
    53
    (thm list list -> local_theory -> local_theory) -> Attrib.binding ->
ballarin@28710
    54
    Element.context list -> Element.statement ->
berghofe@24452
    55
    bool -> local_theory -> Proof.state
berghofe@24452
    56
  val add_theorem_hook: (bool -> Proof.state -> Proof.state) -> Context.generic -> Context.generic
wenzelm@18620
    57
end;
wenzelm@18620
    58
wenzelm@18620
    59
structure Specification: SPECIFICATION =
wenzelm@18620
    60
struct
wenzelm@18620
    61
wenzelm@20890
    62
(* diagnostics *)
wenzelm@20890
    63
wenzelm@20890
    64
fun print_consts _ _ [] = ()
wenzelm@24986
    65
  | print_consts ctxt pred cs = Pretty.writeln (ProofDisplay.pretty_consts ctxt pred cs);
wenzelm@20914
    66
wenzelm@19664
    67
wenzelm@18620
    68
(* prepare specification *)
wenzelm@18620
    69
wenzelm@24724
    70
local
wenzelm@24724
    71
wenzelm@24724
    72
fun close_forms ctxt i xs As =
wenzelm@24724
    73
  let
wenzelm@24724
    74
    fun add_free (Free (x, _)) = if Variable.is_fixed ctxt x then I else insert (op =) x
wenzelm@24724
    75
      | add_free _ = I;
wenzelm@24724
    76
wenzelm@24724
    77
    val commons = map #1 xs;
wenzelm@24724
    78
    val _ =
wenzelm@24724
    79
      (case duplicates (op =) commons of [] => ()
wenzelm@24724
    80
      | dups => error ("Duplicate local variables " ^ commas_quote dups));
wenzelm@24724
    81
    val frees = rev ((fold o fold_aterms) add_free As (rev commons));
wenzelm@24848
    82
    val types = map (TypeInfer.param i o rpair []) (Name.invents Name.context Name.aT (length frees));
wenzelm@24724
    83
    val uniform_typing = the o AList.lookup (op =) (frees ~~ types);
wenzelm@24724
    84
wenzelm@24724
    85
    fun abs_body lev y (Abs (x, T, b)) = Abs (x, T, abs_body (lev + 1) y b)
wenzelm@24724
    86
      | abs_body lev y (t $ u) = abs_body lev y t $ abs_body lev y u
wenzelm@24724
    87
      | abs_body lev y (t as Free (x, T)) =
wenzelm@24724
    88
          if x = y then TypeInfer.constrain (uniform_typing x) (TypeInfer.constrain T (Bound lev))
wenzelm@24724
    89
          else t
wenzelm@24724
    90
      | abs_body _ _ a = a;
wenzelm@24724
    91
    fun close (y, U) B =
wenzelm@24724
    92
      let val B' = abs_body 0 y (Term.incr_boundvars 1 B)
wenzelm@24724
    93
      in if Term.loose_bvar1 (B', 0) then Term.all dummyT $ Abs (y, U, B') else B end;
wenzelm@24724
    94
    fun close_form A =
wenzelm@24724
    95
      let
wenzelm@24724
    96
        val occ_frees = rev (fold_aterms add_free A []);
wenzelm@24724
    97
        val bounds = xs @ map (rpair dummyT) (subtract (op =) commons occ_frees);
wenzelm@24724
    98
      in fold_rev close bounds A end;
wenzelm@24724
    99
  in map close_form As end;
wenzelm@24724
   100
wenzelm@24724
   101
fun prep_spec prep_vars parse_prop prep_att do_close raw_vars raw_specss ctxt =
wenzelm@18620
   102
  let
wenzelm@18670
   103
    val thy = ProofContext.theory_of ctxt;
wenzelm@18620
   104
wenzelm@18670
   105
    val (vars, vars_ctxt) = ctxt |> prep_vars raw_vars;
wenzelm@18670
   106
    val (xs, params_ctxt) = vars_ctxt |> ProofContext.add_fixes_i vars;
wenzelm@18620
   107
wenzelm@24724
   108
    val Asss = (map o map) (map (parse_prop params_ctxt) o snd) raw_specss;
wenzelm@24734
   109
    val names = Variable.names_of (params_ctxt |> (fold o fold o fold) Variable.declare_term Asss)
wenzelm@24734
   110
      |> fold Name.declare xs;
wenzelm@24734
   111
    val Asss' = #1 ((fold_map o fold_map o fold_map) Term.free_dummy_patterns Asss names);
wenzelm@24734
   112
    val idx = (fold o fold o fold) Term.maxidx_term Asss' ~1 + 1;
wenzelm@24724
   113
    val specs =
wenzelm@24724
   114
      (if do_close then
wenzelm@24734
   115
        #1 (fold_map
wenzelm@24734
   116
            (fn Ass => fn i => (burrow (close_forms params_ctxt i []) Ass, i + 1)) Asss' idx)
wenzelm@24734
   117
      else Asss')
wenzelm@24724
   118
      |> flat |> burrow (Syntax.check_props params_ctxt);
wenzelm@24724
   119
    val specs_ctxt = params_ctxt |> (fold o fold) Variable.declare_term specs;
wenzelm@24724
   120
wenzelm@28080
   121
    val Ts = specs_ctxt |> fold_map ProofContext.inferred_param xs |> fst;
wenzelm@28080
   122
    val params = map2 (fn (b, _, mx) => fn T => ((b, T), mx)) vars Ts;
wenzelm@24724
   123
    val name_atts = map (fn ((name, atts), _) => (name, map (prep_att thy) atts)) (flat raw_specss);
wenzelm@24724
   124
  in ((params, name_atts ~~ specs), specs_ctxt) end;
wenzelm@24724
   125
wenzelm@24724
   126
fun read_spec x = prep_spec ProofContext.read_vars Syntax.parse_prop Attrib.intern_src x;
wenzelm@24724
   127
fun check_spec x = prep_spec ProofContext.cert_vars (K I) (K I) x;
wenzelm@18620
   128
wenzelm@24724
   129
in
wenzelm@21370
   130
wenzelm@24724
   131
fun read_specification x = read_spec true x;
wenzelm@24724
   132
fun check_specification x = check_spec true x;
wenzelm@24724
   133
fun read_free_specification vars specs = read_spec false vars [specs];
wenzelm@24724
   134
fun check_free_specification vars specs = check_spec false vars [specs];
wenzelm@24724
   135
wenzelm@24724
   136
end;
wenzelm@18620
   137
wenzelm@18620
   138
wenzelm@28114
   139
(* axiomatization -- within global theory *)
wenzelm@18620
   140
wenzelm@28114
   141
fun gen_axioms do_print prep raw_vars raw_specs thy =
wenzelm@18620
   142
  let
wenzelm@28114
   143
    val ((vars, specs), _) = prep raw_vars [raw_specs] (ProofContext.init thy);
haftmann@29006
   144
    val xs = map (fn ((b, T), _) => (Binding.base_name b, T)) vars;
wenzelm@28114
   145
wenzelm@28114
   146
    (*consts*)
wenzelm@28114
   147
    val (consts, consts_thy) = thy |> fold_map (Theory.specify_const []) vars;
wenzelm@28114
   148
    val subst = Term.subst_atomic (map Free xs ~~ consts);
wenzelm@28114
   149
wenzelm@28114
   150
    (*axioms*)
wenzelm@28114
   151
    val (axioms, axioms_thy) = consts_thy |> fold_map (fn ((b, atts), props) =>
haftmann@29581
   152
        fold_map Thm.add_axiom
haftmann@29581
   153
          ((map o apfst) Binding.name (PureThy.name_multi (Binding.base_name b) (map subst props)))
wenzelm@28114
   154
        #>> (fn ths => ((b, atts), [(map Drule.standard' ths, [])]))) specs;
wenzelm@28114
   155
    val (facts, thy') = axioms_thy |> PureThy.note_thmss Thm.axiomK
wenzelm@28114
   156
      (Attrib.map_facts (Attrib.attribute_i axioms_thy) axioms);
wenzelm@26595
   157
    val _ =
wenzelm@26595
   158
      if not do_print then ()
wenzelm@28114
   159
      else print_consts (ProofContext.init thy') (K false) xs;
wenzelm@28114
   160
  in ((consts, facts), thy') end;
wenzelm@18786
   161
wenzelm@26595
   162
val axiomatization = gen_axioms false check_specification;
wenzelm@26595
   163
val axiomatization_cmd = gen_axioms true read_specification;
wenzelm@18620
   164
wenzelm@18786
   165
wenzelm@18786
   166
(* definition *)
wenzelm@18786
   167
wenzelm@26595
   168
fun gen_def do_print prep (raw_var, (raw_a, raw_prop)) lthy =
wenzelm@18786
   169
  let
wenzelm@21705
   170
    val (vars, [((raw_name, atts), [prop])]) =
wenzelm@21705
   171
      fst (prep (the_list raw_var) [(raw_a, [raw_prop])] lthy);
wenzelm@21705
   172
    val (((x, T), rhs), prove) = LocalDefs.derived_def lthy true prop;
haftmann@28965
   173
    val name = Binding.map_base (Thm.def_name_optional x) raw_name;
wenzelm@28080
   174
    val var =
wenzelm@28080
   175
      (case vars of
haftmann@28965
   176
        [] => (Binding.name x, NoSyn)
wenzelm@28080
   177
      | [((b, _), mx)] =>
wenzelm@28080
   178
          let
haftmann@29006
   179
            val y = Binding.base_name b;
wenzelm@28080
   180
            val _ = x = y orelse
wenzelm@28080
   181
              error ("Head of definition " ^ quote x ^ " differs from declaration " ^ quote y ^
haftmann@28941
   182
                Position.str_of (Binding.pos_of b));
wenzelm@28080
   183
          in (b, mx) end);
wenzelm@28080
   184
    val ((lhs, (_, th)), lthy2) = lthy |> LocalTheory.define Thm.definitionK
haftmann@28965
   185
        (var, ((Binding.map_base (suffix "_raw") name, []), rhs));
wenzelm@28080
   186
    val ((def_name, [th']), lthy3) = lthy2 |> LocalTheory.note Thm.definitionK
haftmann@28703
   187
        ((name, Code.add_default_eqn_attrib :: atts), [prove lthy2 th]);
wenzelm@18786
   188
wenzelm@21705
   189
    val lhs' = Morphism.term (LocalTheory.target_morphism lthy3) lhs;
wenzelm@26595
   190
    val _ =
wenzelm@26595
   191
      if not do_print then ()
wenzelm@26595
   192
      else print_consts lthy3 (member (op =) (Term.add_frees lhs' [])) [(x, T)];
wenzelm@28080
   193
  in ((lhs, (def_name, th')), lthy3) end;
wenzelm@18786
   194
wenzelm@26595
   195
val definition = gen_def false check_free_specification;
wenzelm@26595
   196
val definition_cmd = gen_def true read_free_specification;
wenzelm@18786
   197
wenzelm@19080
   198
wenzelm@19080
   199
(* abbreviation *)
wenzelm@19080
   200
wenzelm@26595
   201
fun gen_abbrev do_print prep mode (raw_var, raw_prop) lthy =
wenzelm@19080
   202
  let
wenzelm@21705
   203
    val ((vars, [(_, [prop])]), _) =
wenzelm@21705
   204
      prep (the_list raw_var) [(("", []), [raw_prop])]
wenzelm@24676
   205
        (lthy |> ProofContext.set_mode ProofContext.mode_abbrev);
wenzelm@21705
   206
    val ((x, T), rhs) = LocalDefs.abs_def (#2 (LocalDefs.cert_def lthy prop));
wenzelm@28080
   207
    val var =
wenzelm@28080
   208
      (case vars of
haftmann@28965
   209
        [] => (Binding.name x, NoSyn)
wenzelm@28080
   210
      | [((b, _), mx)] =>
wenzelm@28080
   211
          let
haftmann@29006
   212
            val y = Binding.base_name b;
wenzelm@28080
   213
            val _ = x = y orelse
wenzelm@28080
   214
              error ("Head of abbreviation " ^ quote x ^ " differs from declaration " ^ quote y ^
haftmann@28941
   215
                Position.str_of (Binding.pos_of b));
wenzelm@28080
   216
          in (b, mx) end);
wenzelm@21705
   217
    val lthy' = lthy
wenzelm@24986
   218
      |> ProofContext.set_syntax_mode mode    (* FIXME ?!? *)
wenzelm@28080
   219
      |> LocalTheory.abbrev mode (var, rhs) |> snd
wenzelm@21705
   220
      |> ProofContext.restore_syntax_mode lthy;
wenzelm@24724
   221
wenzelm@26595
   222
    val _ = if not do_print then () else print_consts lthy' (K false) [(x, T)];
wenzelm@21532
   223
  in lthy' end;
wenzelm@19080
   224
wenzelm@26595
   225
val abbreviation = gen_abbrev false check_free_specification;
wenzelm@26595
   226
val abbreviation_cmd = gen_abbrev true read_free_specification;
wenzelm@19080
   227
wenzelm@19664
   228
wenzelm@21230
   229
(* notation *)
wenzelm@19664
   230
wenzelm@24949
   231
fun gen_notation prep_const add mode args lthy =
wenzelm@25371
   232
  lthy |> LocalTheory.notation add mode (map (apfst (prep_const lthy)) args);
wenzelm@19664
   233
wenzelm@24927
   234
val notation = gen_notation (K I);
wenzelm@24927
   235
val notation_cmd = gen_notation ProofContext.read_const;
wenzelm@19664
   236
wenzelm@20914
   237
wenzelm@21036
   238
(* fact statements *)
wenzelm@20914
   239
wenzelm@26345
   240
fun gen_theorems prep_fact prep_att kind raw_facts lthy =
wenzelm@20914
   241
  let
wenzelm@20914
   242
    val attrib = prep_att (ProofContext.theory_of lthy);
wenzelm@20914
   243
    val facts = raw_facts |> map (fn ((name, atts), bs) =>
wenzelm@20914
   244
      ((name, map attrib atts),
wenzelm@26345
   245
        bs |> map (fn (b, more_atts) => (prep_fact lthy b, map attrib more_atts))));
wenzelm@21435
   246
    val (res, lthy') = lthy |> LocalTheory.notes kind facts;
wenzelm@28093
   247
    val _ = ProofDisplay.print_results true lthy' ((kind, ""), res);
wenzelm@20914
   248
  in (res, lthy') end;
wenzelm@20914
   249
wenzelm@24927
   250
val theorems = gen_theorems (K I) (K I);
wenzelm@26345
   251
val theorems_cmd = gen_theorems ProofContext.get_fact Attrib.intern_src;
wenzelm@20914
   252
wenzelm@21036
   253
wenzelm@21230
   254
(* complex goal statements *)
wenzelm@21036
   255
wenzelm@21036
   256
local
wenzelm@21036
   257
wenzelm@21450
   258
fun subtract_prems ctxt1 ctxt2 =
wenzelm@21450
   259
  Library.drop (length (Assumption.prems_of ctxt1), Assumption.prems_of ctxt2);
wenzelm@21450
   260
wenzelm@21236
   261
fun prep_statement prep_att prep_stmt elems concl ctxt =
wenzelm@21236
   262
  (case concl of
wenzelm@21236
   263
    Element.Shows shows =>
wenzelm@21230
   264
      let
ballarin@28880
   265
        val (propp, elems_ctxt) = prep_stmt elems (map snd shows) ctxt;
ballarin@28877
   266
        val prems = subtract_prems ctxt elems_ctxt;
wenzelm@21450
   267
        val stmt = Attrib.map_specs prep_att (map fst shows ~~ propp);
wenzelm@21370
   268
        val goal_ctxt = fold (fold (Variable.auto_fixes o fst)) propp elems_ctxt;
wenzelm@21450
   269
      in ((prems, stmt, []), goal_ctxt) end
wenzelm@21236
   270
  | Element.Obtains obtains =>
wenzelm@21230
   271
      let
haftmann@28862
   272
        val case_names = obtains |> map_index (fn (i, (b, _)) =>
haftmann@29006
   273
          let val name = Binding.base_name b
wenzelm@28080
   274
          in if name = "" then string_of_int (i + 1) else name end);
wenzelm@21236
   275
        val constraints = obtains |> map (fn (_, (vars, _)) =>
ballarin@28710
   276
          Element.Constrains
haftmann@29006
   277
            (vars |> map_filter (fn (x, SOME T) => SOME (Binding.base_name x, T) | _ => NONE)));
wenzelm@21036
   278
wenzelm@21236
   279
        val raw_propp = obtains |> map (fn (_, (_, props)) => map (rpair []) props);
ballarin@28880
   280
        val (propp, elems_ctxt) = prep_stmt (elems @ constraints) raw_propp ctxt;
wenzelm@21236
   281
wenzelm@21236
   282
        val thesis = ObjectLogic.fixed_judgment (ProofContext.theory_of ctxt) AutoBind.thesisN;
wenzelm@21036
   283
wenzelm@21236
   284
        fun assume_case ((name, (vars, _)), asms) ctxt' =
wenzelm@21236
   285
          let
wenzelm@28080
   286
            val bs = map fst vars;
haftmann@29006
   287
            val xs = map Binding.base_name bs;
wenzelm@21236
   288
            val props = map fst asms;
wenzelm@28080
   289
            val (Ts, _) = ctxt'
wenzelm@21236
   290
              |> fold Variable.declare_term props
wenzelm@21236
   291
              |> fold_map ProofContext.inferred_param xs;
wenzelm@28080
   292
            val asm = Term.list_all_free (xs ~~ Ts, Logic.list_implies (props, thesis));
wenzelm@21236
   293
          in
wenzelm@28080
   294
            ctxt' |> (snd o ProofContext.add_fixes_i (map (fn b => (b, NONE, NoSyn)) bs));
wenzelm@21370
   295
            ctxt' |> Variable.auto_fixes asm
wenzelm@21236
   296
            |> ProofContext.add_assms_i Assumption.assume_export
wenzelm@21236
   297
              [((name, [ContextRules.intro_query NONE]), [(asm, [])])]
wenzelm@21236
   298
            |>> (fn [(_, [th])] => th)
wenzelm@21236
   299
          end;
wenzelm@21236
   300
wenzelm@21658
   301
        val atts = map (Attrib.internal o K)
wenzelm@21236
   302
          [RuleCases.consumes (~ (length obtains)), RuleCases.case_names case_names];
ballarin@28877
   303
        val prems = subtract_prems ctxt elems_ctxt;
haftmann@28965
   304
        val stmt = [((Binding.empty, atts), [(thesis, [])])];
wenzelm@21236
   305
wenzelm@21236
   306
        val (facts, goal_ctxt) = elems_ctxt
haftmann@28965
   307
          |> (snd o ProofContext.add_fixes_i [(Binding.name AutoBind.thesisN, NONE, NoSyn)])
wenzelm@21236
   308
          |> fold_map assume_case (obtains ~~ propp)
wenzelm@21435
   309
          |-> (fn ths => ProofContext.note_thmss_i Thm.assumptionK
haftmann@28965
   310
                [((Binding.name Obtain.thatN, []), [(ths, [])])] #> #2 #> pair ths);
wenzelm@21450
   311
      in ((prems, stmt, facts), goal_ctxt) end);
wenzelm@21036
   312
berghofe@24452
   313
structure TheoremHook = GenericDataFun
berghofe@24452
   314
(
berghofe@24452
   315
  type T = ((bool -> Proof.state -> Proof.state) * stamp) list;
berghofe@24452
   316
  val empty = [];
berghofe@24452
   317
  val extend = I;
wenzelm@24464
   318
  fun merge _ hooks : T = Library.merge (eq_snd op =) hooks;
berghofe@24452
   319
);
berghofe@24452
   320
wenzelm@21036
   321
fun gen_theorem prep_att prep_stmt
wenzelm@28858
   322
    kind before_qed after_qed (name, raw_atts) raw_elems raw_concl int lthy =
wenzelm@21036
   323
  let
wenzelm@28858
   324
    val _ = LocalTheory.affirm lthy;
wenzelm@28858
   325
    val thy = ProofContext.theory_of lthy;
wenzelm@21036
   326
wenzelm@21435
   327
    val attrib = prep_att thy;
wenzelm@21435
   328
    val atts = map attrib raw_atts;
ballarin@28710
   329
    val elems = raw_elems |> map (Element.map_ctxt_attrib attrib);
wenzelm@21450
   330
    val ((prems, stmt, facts), goal_ctxt) =
ballarin@28880
   331
      prep_statement attrib prep_stmt elems raw_concl lthy;
wenzelm@21036
   332
wenzelm@21036
   333
    fun after_qed' results goal_ctxt' =
wenzelm@21602
   334
      let val results' =
wenzelm@21602
   335
        burrow (map Goal.norm_result o ProofContext.export goal_ctxt' lthy) results
wenzelm@21602
   336
      in
wenzelm@21036
   337
        lthy
wenzelm@21435
   338
        |> LocalTheory.notes kind (map2 (fn (a, _) => fn ths => (a, [(ths, [])])) stmt results')
wenzelm@21036
   339
        |> (fn (res, lthy') =>
haftmann@28965
   340
          if Binding.is_empty name andalso null atts then
wenzelm@28093
   341
            (ProofDisplay.print_results true lthy' ((kind, ""), res); lthy')
wenzelm@28080
   342
          else
wenzelm@28080
   343
            let
wenzelm@28080
   344
              val ([(res_name, _)], lthy'') = lthy'
wenzelm@28080
   345
                |> LocalTheory.notes kind [((name, atts), [(maps #2 res, [])])];
wenzelm@28093
   346
              val _ = ProofDisplay.print_results true lthy' ((kind, res_name), res);
wenzelm@28080
   347
            in lthy'' end)
wenzelm@21036
   348
        |> after_qed results'
wenzelm@21036
   349
      end;
wenzelm@21036
   350
  in
wenzelm@21036
   351
    goal_ctxt
wenzelm@28080
   352
    |> ProofContext.note_thmss_i Thm.assumptionK
haftmann@28965
   353
      [((Binding.name AutoBind.assmsN, []), [(prems, [])])]
wenzelm@21450
   354
    |> snd
wenzelm@21435
   355
    |> Proof.theorem_i before_qed after_qed' (map snd stmt)
wenzelm@24557
   356
    |> Proof.refine_insert facts
wenzelm@24542
   357
    |> Library.apply (map (fn (f, _) => f int) (rev (TheoremHook.get (Context.Proof goal_ctxt))))
wenzelm@21036
   358
  end;
wenzelm@21036
   359
wenzelm@21230
   360
in
wenzelm@21230
   361
ballarin@29249
   362
val theorem = gen_theorem (K I) Expression.cert_statement;
ballarin@29249
   363
val theorem_cmd = gen_theorem Attrib.intern_src Expression.read_statement;
wenzelm@21036
   364
berghofe@24452
   365
fun add_theorem_hook f = TheoremHook.map (cons (f, stamp ()));
berghofe@24452
   366
wenzelm@18620
   367
end;
wenzelm@21036
   368
wenzelm@21036
   369
end;