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