src/Pure/Isar/proof.ML
author wenzelm
Thu Jan 17 21:06:23 2002 +0100 (2002-01-17)
changeset 12808 a529b4b91888
parent 12760 2356740225ce
child 12930 c1f3ff5feff1
permissions -rw-r--r--
RuleCases.make interface based on term instead of thm;
tuned;
wenzelm@5820
     1
(*  Title:      Pure/Isar/proof.ML
wenzelm@5820
     2
    ID:         $Id$
wenzelm@5820
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8807
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@5820
     5
wenzelm@5820
     6
Proof states and methods.
wenzelm@5820
     7
*)
wenzelm@5820
     8
wenzelm@8152
     9
signature BASIC_PROOF =
wenzelm@8152
    10
sig
wenzelm@8374
    11
  val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@8374
    12
  val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@8152
    13
end;
wenzelm@8152
    14
wenzelm@5820
    15
signature PROOF =
wenzelm@5820
    16
sig
wenzelm@8152
    17
  include BASIC_PROOF
wenzelm@5820
    18
  type context
wenzelm@5820
    19
  type state
wenzelm@5820
    20
  exception STATE of string * state
wenzelm@6871
    21
  val check_result: string -> state -> 'a Seq.seq -> 'a Seq.seq
wenzelm@12045
    22
  val init_state: theory -> state
wenzelm@5820
    23
  val context_of: state -> context
wenzelm@5820
    24
  val theory_of: state -> theory
wenzelm@5820
    25
  val sign_of: state -> Sign.sg
wenzelm@7924
    26
  val warn_extra_tfrees: state -> state -> state
wenzelm@7605
    27
  val reset_thms: string -> state -> state
wenzelm@6091
    28
  val the_facts: state -> thm list
wenzelm@9469
    29
  val the_fact: state -> thm
wenzelm@11079
    30
  val get_goal: state -> context * (thm list * thm)
wenzelm@6091
    31
  val goal_facts: (state -> thm list) -> state -> state
wenzelm@5820
    32
  val use_facts: state -> state
wenzelm@5820
    33
  val reset_facts: state -> state
wenzelm@9469
    34
  val is_chain: state -> bool
wenzelm@6891
    35
  val assert_forward: state -> state
wenzelm@9469
    36
  val assert_forward_or_chain: state -> state
wenzelm@5820
    37
  val assert_backward: state -> state
wenzelm@8206
    38
  val assert_no_chain: state -> state
wenzelm@5820
    39
  val enter_forward: state -> state
wenzelm@6529
    40
  val verbose: bool ref
wenzelm@12423
    41
  val pretty_state: int -> state -> Pretty.T list
wenzelm@10360
    42
  val pretty_goals: bool -> state -> Pretty.T list
wenzelm@6776
    43
  val level: state -> int
wenzelm@5820
    44
  type method
wenzelm@6848
    45
  val method: (thm list -> tactic) -> method
wenzelm@8374
    46
  val method_cases: (thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq) -> method
wenzelm@5820
    47
  val refine: (context -> method) -> state -> state Seq.seq
wenzelm@8234
    48
  val refine_end: (context -> method) -> state -> state Seq.seq
wenzelm@5936
    49
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    50
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@8617
    51
  val let_bind: (string list * string) list -> state -> state
wenzelm@8617
    52
  val let_bind_i: (term list * term) list -> state -> state
wenzelm@6876
    53
  val simple_have_thms: string -> thm list -> state -> state
wenzelm@12714
    54
  val have_thmss: ((bstring * context attribute list) *
wenzelm@12714
    55
    (xstring * context attribute list) list) list -> state -> state
wenzelm@12714
    56
  val have_thmss_i: ((bstring * context attribute list) *
wenzelm@9196
    57
    (thm list * context attribute list) list) list -> state -> state
wenzelm@12714
    58
  val with_thmss: ((bstring * context attribute list) *
wenzelm@12714
    59
    (xstring * context attribute list) list) list -> state -> state
wenzelm@12714
    60
  val with_thmss_i: ((bstring * context attribute list) *
wenzelm@9196
    61
    (thm list * context attribute list) list) list -> state -> state
wenzelm@7412
    62
  val fix: (string list * string option) list -> state -> state
wenzelm@7665
    63
  val fix_i: (string list * typ option) list -> state -> state
wenzelm@9469
    64
  val assm: ProofContext.exporter
wenzelm@10464
    65
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7271
    66
    -> state -> state
wenzelm@9469
    67
  val assm_i: ProofContext.exporter
wenzelm@10464
    68
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    69
    -> state -> state
wenzelm@10464
    70
  val assume:
wenzelm@10464
    71
    ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7271
    72
    -> state -> state
wenzelm@10464
    73
  val assume_i: ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    74
    -> state -> state
wenzelm@10464
    75
  val presume:
wenzelm@10464
    76
    ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@6932
    77
    -> state -> state
wenzelm@10464
    78
  val presume_i: ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    79
    -> state -> state
wenzelm@11891
    80
  val def: string -> context attribute list -> string *  (string * string list) -> state -> state
wenzelm@11891
    81
  val def_i: string -> context attribute list -> string * (term * term list) -> state -> state
wenzelm@11793
    82
  val invoke_case: string * string option list * context attribute list -> state -> state
wenzelm@12242
    83
  val multi_theorem: string -> bstring * theory attribute list
wenzelm@12698
    84
    -> (xstring * context attribute list list) option -> context attribute Locale.element list
wenzelm@12146
    85
    -> ((bstring * theory attribute list) * (string * (string list * string list)) list) list
wenzelm@12146
    86
    -> theory -> state
wenzelm@12242
    87
  val multi_theorem_i: string -> bstring * theory attribute list
wenzelm@12698
    88
    -> (string * context attribute list list) option -> context attribute Locale.element_i list
wenzelm@12146
    89
    -> ((bstring * theory attribute list) * (term * (term list * term list)) list) list
wenzelm@12146
    90
    -> theory -> state
wenzelm@5820
    91
  val chain: state -> state
wenzelm@6091
    92
  val from_facts: thm list -> state -> state
wenzelm@12146
    93
  val show: (bool -> state -> state) -> (state -> state Seq.seq)
wenzelm@12146
    94
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@12146
    95
    -> bool -> state -> state
wenzelm@12146
    96
  val show_i: (bool -> state -> state) -> (state -> state Seq.seq)
wenzelm@12146
    97
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@12146
    98
    -> bool -> state -> state
wenzelm@12146
    99
  val have: (state -> state Seq.seq)
wenzelm@12146
   100
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@12146
   101
    -> state -> state
wenzelm@12146
   102
  val have_i: (state -> state Seq.seq)
wenzelm@12146
   103
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@12146
   104
    -> state -> state
wenzelm@6404
   105
  val at_bottom: state -> bool
wenzelm@6982
   106
  val local_qed: (state -> state Seq.seq)
wenzelm@12146
   107
    -> (context -> string * (string * thm list) list -> unit) * (context -> thm -> unit)
wenzelm@12146
   108
    -> state -> state Seq.seq
wenzelm@6950
   109
  val global_qed: (state -> state Seq.seq) -> state
wenzelm@12244
   110
    -> (theory * ((string * string) * (string * thm list) list)) Seq.seq
wenzelm@6896
   111
  val begin_block: state -> state
wenzelm@6932
   112
  val end_block: state -> state Seq.seq
wenzelm@6896
   113
  val next_block: state -> state
wenzelm@5820
   114
end;
wenzelm@5820
   115
wenzelm@8152
   116
signature PRIVATE_PROOF =
wenzelm@5820
   117
sig
wenzelm@5820
   118
  include PROOF
wenzelm@5820
   119
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> state -> state
wenzelm@5820
   120
end;
wenzelm@5820
   121
wenzelm@8152
   122
structure Proof: PRIVATE_PROOF =
wenzelm@5820
   123
struct
wenzelm@5820
   124
wenzelm@5820
   125
wenzelm@5820
   126
(** proof state **)
wenzelm@5820
   127
wenzelm@5820
   128
type context = ProofContext.context;
wenzelm@5820
   129
wenzelm@5820
   130
wenzelm@5820
   131
(* type goal *)
wenzelm@5820
   132
wenzelm@5820
   133
datatype kind =
wenzelm@12698
   134
  Theorem of string *                                (*theorem kind*)
wenzelm@12698
   135
    (bstring * theory attribute list) *              (*common result binding*)
wenzelm@12698
   136
    (string * context attribute list list) option *  (*target locale and attributes*)
wenzelm@12698
   137
    theory attribute list list |                     (*attributes of individual result binding*)
wenzelm@12698
   138
  Show of context attribute list list |              (*intermediate result, solving subgoal*)
wenzelm@12698
   139
  Have of context attribute list list;               (*intermediate result*)
wenzelm@5820
   140
wenzelm@12242
   141
fun common_name "" = "" | common_name a = " " ^ a;
wenzelm@12242
   142
wenzelm@12242
   143
fun kind_name _ (Theorem (s, (a, _), None, _)) = s ^ common_name a
wenzelm@12242
   144
  | kind_name sg (Theorem (s, (a, _), Some (name, _), _)) =
wenzelm@12242
   145
      s ^ common_name a ^ " (in " ^ Locale.cond_extern sg name ^ ")"
wenzelm@12015
   146
  | kind_name _ (Show _) = "show"
wenzelm@12015
   147
  | kind_name _ (Have _) = "have";
wenzelm@5820
   148
wenzelm@5820
   149
type goal =
wenzelm@12146
   150
 (kind *             (*result kind*)
wenzelm@12146
   151
  string list *      (*result names*)
wenzelm@12146
   152
  term list list) *  (*result statements*)
wenzelm@12146
   153
 (thm list *         (*use facts*)
wenzelm@12146
   154
  thm);              (*goal: subgoals ==> statement*)
wenzelm@5820
   155
wenzelm@5820
   156
wenzelm@5820
   157
(* type mode *)
wenzelm@5820
   158
wenzelm@5820
   159
datatype mode = Forward | ForwardChain | Backward;
wenzelm@7201
   160
val mode_name = (fn Forward => "state" | ForwardChain => "chain" | Backward => "prove");
wenzelm@5820
   161
wenzelm@5820
   162
wenzelm@5820
   163
(* datatype state *)
wenzelm@5820
   164
wenzelm@7176
   165
datatype node =
wenzelm@7176
   166
  Node of
wenzelm@7176
   167
   {context: context,
wenzelm@7176
   168
    facts: thm list option,
wenzelm@7176
   169
    mode: mode,
wenzelm@7176
   170
    goal: (goal * (state -> state Seq.seq)) option}
wenzelm@7176
   171
and state =
wenzelm@5820
   172
  State of
wenzelm@5820
   173
    node *              (*current*)
wenzelm@5820
   174
    node list;          (*parents wrt. block structure*)
wenzelm@5820
   175
wenzelm@7176
   176
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   177
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   178
wenzelm@7176
   179
wenzelm@5820
   180
exception STATE of string * state;
wenzelm@5820
   181
wenzelm@5820
   182
fun err_malformed name state =
wenzelm@5820
   183
  raise STATE (name ^ ": internal error -- malformed proof state", state);
wenzelm@5820
   184
wenzelm@6871
   185
fun check_result msg state sq =
wenzelm@6871
   186
  (case Seq.pull sq of
wenzelm@6871
   187
    None => raise STATE (msg, state)
wenzelm@6871
   188
  | Some s_sq => Seq.cons s_sq);
wenzelm@6871
   189
wenzelm@5820
   190
wenzelm@7176
   191
fun map_current f (State (Node {context, facts, mode, goal}, nodes)) =
wenzelm@5820
   192
  State (make_node (f (context, facts, mode, goal)), nodes);
wenzelm@5820
   193
wenzelm@12045
   194
fun init_state thy =
wenzelm@12045
   195
  State (make_node (ProofContext.init thy, None, Forward, None), []);
wenzelm@12045
   196
wenzelm@5820
   197
wenzelm@5820
   198
wenzelm@5820
   199
(** basic proof state operations **)
wenzelm@5820
   200
wenzelm@5820
   201
(* context *)
wenzelm@5820
   202
wenzelm@7176
   203
fun context_of (State (Node {context, ...}, _)) = context;
wenzelm@5820
   204
val theory_of = ProofContext.theory_of o context_of;
wenzelm@5820
   205
val sign_of = ProofContext.sign_of o context_of;
wenzelm@5820
   206
wenzelm@5820
   207
fun map_context f = map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   208
wenzelm@7176
   209
fun map_context_result f (state as State (Node {context, facts, mode, goal}, nodes)) =
wenzelm@5820
   210
  let val (context', result) = f context
wenzelm@5820
   211
  in (State (make_node (context', facts, mode, goal), nodes), result) end;
wenzelm@5820
   212
wenzelm@5820
   213
wenzelm@5820
   214
fun put_data kind f = map_context o ProofContext.put_data kind f;
wenzelm@7924
   215
val warn_extra_tfrees = map_context o ProofContext.warn_extra_tfrees o context_of;
wenzelm@10809
   216
val add_binds_i = map_context o ProofContext.add_binds_i;
wenzelm@6790
   217
val auto_bind_goal = map_context o ProofContext.auto_bind_goal;
wenzelm@12146
   218
val auto_bind_facts = map_context o ProofContext.auto_bind_facts;
wenzelm@6091
   219
val put_thms = map_context o ProofContext.put_thms;
wenzelm@6091
   220
val put_thmss = map_context o ProofContext.put_thmss;
wenzelm@7605
   221
val reset_thms = map_context o ProofContext.reset_thms;
wenzelm@8374
   222
val get_case = ProofContext.get_case o context_of;
wenzelm@5820
   223
wenzelm@5820
   224
wenzelm@5820
   225
(* facts *)
wenzelm@5820
   226
wenzelm@7176
   227
fun the_facts (State (Node {facts = Some facts, ...}, _)) = facts
wenzelm@5820
   228
  | the_facts state = raise STATE ("No current facts available", state);
wenzelm@5820
   229
wenzelm@9469
   230
fun the_fact state =
wenzelm@9469
   231
  (case the_facts state of
wenzelm@9469
   232
    [thm] => thm
wenzelm@9469
   233
  | _ => raise STATE ("Single fact expected", state));
wenzelm@9469
   234
wenzelm@6848
   235
fun assert_facts state = (the_facts state; state);
wenzelm@7176
   236
fun get_facts (State (Node {facts, ...}, _)) = facts;
wenzelm@6848
   237
wenzelm@7605
   238
wenzelm@7605
   239
val thisN = "this";
wenzelm@7605
   240
wenzelm@5820
   241
fun put_facts facts state =
wenzelm@5820
   242
  state
wenzelm@5820
   243
  |> map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal))
wenzelm@7605
   244
  |> (case facts of None => reset_thms thisN | Some ths => put_thms (thisN, ths));
wenzelm@5820
   245
wenzelm@5820
   246
val reset_facts = put_facts None;
wenzelm@5820
   247
wenzelm@9196
   248
fun these_factss (state, named_factss) =
wenzelm@5820
   249
  state
wenzelm@9196
   250
  |> put_thmss named_factss
wenzelm@9196
   251
  |> put_facts (Some (flat (map #2 named_factss)));
wenzelm@5820
   252
wenzelm@5820
   253
wenzelm@5820
   254
(* goal *)
wenzelm@5820
   255
wenzelm@10553
   256
local
wenzelm@10553
   257
  fun find i (state as State (Node {goal = Some goal, ...}, _)) = (context_of state, (i, goal))
wenzelm@10553
   258
    | find i (State (Node {goal = None, ...}, node :: nodes)) = find (i + 1) (State (node, nodes))
wenzelm@10553
   259
    | find _ (state as State (_, [])) = err_malformed "find_goal" state;
wenzelm@10553
   260
in val find_goal = find 0 end;
wenzelm@7176
   261
wenzelm@11079
   262
fun get_goal state =
wenzelm@11079
   263
  let val (ctxt, (_, ((_, x), _))) = find_goal state
wenzelm@11079
   264
  in (ctxt, x) end;
wenzelm@11079
   265
wenzelm@5820
   266
fun put_goal goal = map_current (fn (ctxt, facts, mode, _) => (ctxt, facts, mode, goal));
wenzelm@5820
   267
wenzelm@8374
   268
fun map_goal f g (State (Node {context, facts, mode, goal = Some goal}, nodes)) =
wenzelm@8374
   269
      State (make_node (f context, facts, mode, Some (g goal)), nodes)
wenzelm@8374
   270
  | map_goal f g (State (nd, node :: nodes)) =
wenzelm@8374
   271
      let val State (node', nodes') = map_goal f g (State (node, nodes))
wenzelm@8374
   272
      in map_context f (State (nd, node' :: nodes')) end
wenzelm@8374
   273
  | map_goal _ _ state = state;
wenzelm@5820
   274
wenzelm@5820
   275
fun goal_facts get state =
wenzelm@5820
   276
  state
wenzelm@8374
   277
  |> map_goal I (fn ((result, (_, thm)), f) => ((result, (get state, thm)), f));
wenzelm@5820
   278
wenzelm@5820
   279
fun use_facts state =
wenzelm@5820
   280
  state
wenzelm@5820
   281
  |> goal_facts the_facts
wenzelm@5820
   282
  |> reset_facts;
wenzelm@5820
   283
wenzelm@5820
   284
wenzelm@5820
   285
(* mode *)
wenzelm@5820
   286
wenzelm@7176
   287
fun get_mode (State (Node {mode, ...}, _)) = mode;
wenzelm@5820
   288
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   289
wenzelm@5820
   290
val enter_forward = put_mode Forward;
wenzelm@5820
   291
val enter_forward_chain = put_mode ForwardChain;
wenzelm@5820
   292
val enter_backward = put_mode Backward;
wenzelm@5820
   293
wenzelm@5820
   294
fun assert_mode pred state =
wenzelm@5820
   295
  let val mode = get_mode state in
wenzelm@5820
   296
    if pred mode then state
wenzelm@12010
   297
    else raise STATE ("Illegal application of proof command in "
wenzelm@12010
   298
      ^ quote (mode_name mode) ^ " mode", state)
wenzelm@5820
   299
  end;
wenzelm@5820
   300
wenzelm@5820
   301
fun is_chain state = get_mode state = ForwardChain;
wenzelm@5820
   302
val assert_forward = assert_mode (equal Forward);
wenzelm@5820
   303
val assert_forward_or_chain = assert_mode (equal Forward orf equal ForwardChain);
wenzelm@5820
   304
val assert_backward = assert_mode (equal Backward);
wenzelm@8206
   305
val assert_no_chain = assert_mode (not_equal ForwardChain);
wenzelm@5820
   306
wenzelm@5820
   307
wenzelm@5820
   308
(* blocks *)
wenzelm@5820
   309
wenzelm@6776
   310
fun level (State (_, nodes)) = length nodes;
wenzelm@6776
   311
wenzelm@5820
   312
fun open_block (State (node, nodes)) = State (node, node :: nodes);
wenzelm@5820
   313
wenzelm@5820
   314
fun new_block state =
wenzelm@5820
   315
  state
wenzelm@5820
   316
  |> open_block
wenzelm@5820
   317
  |> put_goal None;
wenzelm@5820
   318
wenzelm@7487
   319
fun close_block (state as State (_, node :: nodes)) = State (node, nodes)
wenzelm@5820
   320
  | close_block state = raise STATE ("Unbalanced block parentheses", state);
wenzelm@5820
   321
wenzelm@5820
   322
wenzelm@5820
   323
wenzelm@12423
   324
(** pretty_state **)
wenzelm@5820
   325
wenzelm@6529
   326
val verbose = ProofContext.verbose;
wenzelm@6529
   327
wenzelm@12085
   328
fun pretty_goals_local ctxt = Display.pretty_goals_aux
wenzelm@12085
   329
  (ProofContext.pretty_sort ctxt, ProofContext.pretty_typ ctxt, ProofContext.pretty_term ctxt);
wenzelm@12085
   330
wenzelm@12055
   331
fun pretty_facts _ _ None = []
wenzelm@12055
   332
  | pretty_facts s ctxt (Some ths) =
wenzelm@12055
   333
      [Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""];
wenzelm@6756
   334
wenzelm@12423
   335
fun pretty_state nr (state as State (Node {context = ctxt, facts, mode, goal = _}, nodes)) =
wenzelm@5820
   336
  let
wenzelm@11891
   337
    val ref (_, _, begin_goal) = Display.current_goals_markers;
wenzelm@5820
   338
wenzelm@5820
   339
    fun levels_up 0 = ""
wenzelm@7575
   340
      | levels_up 1 = ", 1 level up"
wenzelm@7575
   341
      | levels_up i = ", " ^ string_of_int i ^ " levels up";
wenzelm@5820
   342
wenzelm@11556
   343
    fun subgoals 0 = ""
wenzelm@11556
   344
      | subgoals 1 = ", 1 subgoal"
wenzelm@11556
   345
      | subgoals n = ", " ^ string_of_int n ^ " subgoals";
wenzelm@12146
   346
wenzelm@12146
   347
    fun prt_names names =
wenzelm@12242
   348
      (case filter_out (equal "") names of [] => ""
wenzelm@12308
   349
      | nms => " " ^ enclose "(" ")" (space_implode " and " (take (7, nms) @
wenzelm@12308
   350
          (if length nms > 7 then ["..."] else []))));
wenzelm@12146
   351
wenzelm@12146
   352
    fun prt_goal (_, (i, (((kind, names, _), (goal_facts, thm)), _))) =
wenzelm@12085
   353
      pretty_facts "using " ctxt
wenzelm@8462
   354
        (if mode <> Backward orelse null goal_facts then None else Some goal_facts) @
wenzelm@12146
   355
      [Pretty.str ("goal (" ^ kind_name (sign_of state) kind ^ prt_names names ^
wenzelm@12146
   356
          levels_up (i div 2) ^ subgoals (Thm.nprems_of thm) ^ "):")] @
wenzelm@12085
   357
      pretty_goals_local ctxt begin_goal (true, true) (! Display.goals_limit) thm;
wenzelm@6848
   358
wenzelm@8462
   359
    val ctxt_prts =
wenzelm@12085
   360
      if ! verbose orelse mode = Forward then ProofContext.pretty_context ctxt
wenzelm@12085
   361
      else if mode = Backward then ProofContext.pretty_asms ctxt
wenzelm@7575
   362
      else [];
wenzelm@8462
   363
wenzelm@8462
   364
    val prts =
wenzelm@8582
   365
     [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
wenzelm@12010
   366
        (if ! verbose then ", depth " ^ string_of_int (length nodes div 2 - 1)
wenzelm@8561
   367
        else "")), Pretty.str ""] @
wenzelm@8462
   368
     (if null ctxt_prts then [] else ctxt_prts @ [Pretty.str ""]) @
wenzelm@8462
   369
     (if ! verbose orelse mode = Forward then
wenzelm@12146
   370
       (pretty_facts "" ctxt facts @ prt_goal (find_goal state))
wenzelm@12085
   371
      else if mode = ForwardChain then pretty_facts "picking " ctxt facts
wenzelm@12146
   372
      else prt_goal (find_goal state))
wenzelm@12423
   373
  in prts end;
wenzelm@5820
   374
wenzelm@12085
   375
fun pretty_goals main state =
wenzelm@12085
   376
  let val (ctxt, (_, ((_, (_, thm)), _))) = find_goal state
wenzelm@12085
   377
  in pretty_goals_local ctxt "" (false, main) (! Display.goals_limit) thm end;
wenzelm@10320
   378
wenzelm@5820
   379
wenzelm@5820
   380
wenzelm@5820
   381
(** proof steps **)
wenzelm@5820
   382
wenzelm@5820
   383
(* datatype method *)
wenzelm@5820
   384
wenzelm@8374
   385
datatype method =
wenzelm@8374
   386
  Method of thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq;
wenzelm@8374
   387
wenzelm@8374
   388
fun method tac = Method (fn facts => fn st => Seq.map (rpair []) (tac facts st));
wenzelm@8374
   389
val method_cases = Method;
wenzelm@5820
   390
wenzelm@5820
   391
wenzelm@5820
   392
(* refine goal *)
wenzelm@5820
   393
wenzelm@8234
   394
local
wenzelm@8234
   395
wenzelm@5820
   396
fun check_sign sg state =
wenzelm@5820
   397
  if Sign.subsig (sg, sign_of state) then state
wenzelm@5820
   398
  else raise STATE ("Bad signature of result: " ^ Sign.str_of_sg sg, state);
wenzelm@5820
   399
wenzelm@8234
   400
fun gen_refine current_context meth_fun state =
wenzelm@6848
   401
  let
wenzelm@10553
   402
    val (goal_ctxt, (_, ((result, (facts, thm)), f))) = find_goal state;
wenzelm@8234
   403
    val Method meth = meth_fun (if current_context then context_of state else goal_ctxt);
wenzelm@5820
   404
wenzelm@8374
   405
    fun refn (thm', cases) =
wenzelm@6848
   406
      state
wenzelm@6848
   407
      |> check_sign (Thm.sign_of_thm thm')
wenzelm@8374
   408
      |> map_goal (ProofContext.add_cases cases) (K ((result, (facts, thm')), f));
wenzelm@6848
   409
  in Seq.map refn (meth facts thm) end;
wenzelm@5820
   410
wenzelm@8234
   411
in
wenzelm@8234
   412
wenzelm@8234
   413
val refine = gen_refine true;
wenzelm@8234
   414
val refine_end = gen_refine false;
wenzelm@8234
   415
wenzelm@8234
   416
end;
wenzelm@8234
   417
wenzelm@5820
   418
wenzelm@11917
   419
(* goal addressing *)
wenzelm@6932
   420
wenzelm@8152
   421
fun FINDGOAL tac st =
wenzelm@8374
   422
  let fun find (i, n) = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1, n))
wenzelm@8374
   423
  in find (1, Thm.nprems_of st) st end;
wenzelm@8152
   424
wenzelm@8166
   425
fun HEADGOAL tac = tac 1;
wenzelm@8166
   426
wenzelm@9469
   427
wenzelm@9469
   428
(* export results *)
wenzelm@9469
   429
wenzelm@11816
   430
fun refine_tac rule =
wenzelm@12703
   431
  Tactic.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW (SUBGOAL (fn (goal, i) =>
wenzelm@11816
   432
    if can Logic.dest_goal (Logic.strip_assums_concl goal) then
wenzelm@11816
   433
      Tactic.etac Drule.triv_goal i
wenzelm@11816
   434
    else all_tac));
wenzelm@11816
   435
wenzelm@12146
   436
fun export_goal inner print_rule raw_rule state =
wenzelm@6932
   437
  let
wenzelm@10553
   438
    val (outer, (_, ((result, (facts, thm)), f))) = find_goal state;
wenzelm@12010
   439
    val exp_tac = ProofContext.export true inner outer;
wenzelm@9469
   440
    fun exp_rule rule =
wenzelm@9469
   441
      let
wenzelm@12055
   442
        val _ = print_rule outer rule;
wenzelm@11816
   443
        val thmq = FINDGOAL (refine_tac rule) thm;
wenzelm@9469
   444
      in Seq.map (fn th => map_goal I (K ((result, (facts, th)), f)) state) thmq end;
wenzelm@9469
   445
  in raw_rule |> exp_tac |> (Seq.flat o Seq.map exp_rule) end;
wenzelm@6932
   446
wenzelm@12146
   447
fun export_goals inner print_rule raw_rules =
wenzelm@12146
   448
  Seq.EVERY (map (export_goal inner print_rule) raw_rules);
wenzelm@12146
   449
wenzelm@6932
   450
fun transfer_facts inner_state state =
wenzelm@6932
   451
  (case get_facts inner_state of
wenzelm@6932
   452
    None => Seq.single (reset_facts state)
wenzelm@8617
   453
  | Some thms =>
wenzelm@8617
   454
      let
wenzelm@12010
   455
        val exp_tac = ProofContext.export false (context_of inner_state) (context_of state);
wenzelm@11816
   456
        val thmqs = map exp_tac thms;
wenzelm@8617
   457
      in Seq.map (fn ths => put_facts (Some ths) state) (Seq.commute thmqs) end);
wenzelm@6932
   458
wenzelm@6932
   459
wenzelm@6932
   460
(* prepare result *)
wenzelm@6932
   461
wenzelm@12146
   462
fun prep_result state ts raw_th =
wenzelm@5820
   463
  let
wenzelm@5820
   464
    val ctxt = context_of state;
wenzelm@5820
   465
    fun err msg = raise STATE (msg, state);
wenzelm@5820
   466
wenzelm@12146
   467
    val ngoals = Thm.nprems_of raw_th;
wenzelm@5820
   468
    val _ =
wenzelm@5820
   469
      if ngoals = 0 then ()
wenzelm@12085
   470
      else (err (Pretty.string_of (Pretty.chunks (pretty_goals_local ctxt "" (true, true)
wenzelm@12146
   471
            (! Display.goals_limit) raw_th @
wenzelm@12085
   472
          [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))));
wenzelm@5820
   473
wenzelm@12146
   474
    val {hyps, sign, ...} = Thm.rep_thm raw_th;
wenzelm@5820
   475
    val tsig = Sign.tsig_of sign;
wenzelm@12055
   476
    val casms = flat (map #1 (ProofContext.assumptions_of (context_of state)));
wenzelm@11816
   477
    val bad_hyps = Library.gen_rems Term.aconv (hyps, map Thm.term_of casms);
wenzelm@12146
   478
wenzelm@12146
   479
    val th = raw_th RS Drule.rev_triv_goal;
wenzelm@12146
   480
    val ths = Drule.conj_elim_precise (length ts) th
wenzelm@12146
   481
      handle THM _ => err "Main goal structure corrupted";
wenzelm@5820
   482
  in
wenzelm@12146
   483
    conditional (not (null bad_hyps)) (fn () => err ("Additional hypotheses:\n" ^
wenzelm@12146
   484
        cat_lines (map (ProofContext.string_of_term ctxt) bad_hyps)));
wenzelm@12808
   485
    conditional (exists (not o Pattern.matches tsig) (ts ~~ map Thm.prop_of ths)) (fn () =>
wenzelm@12146
   486
      err ("Proved a different theorem: " ^ Pretty.string_of (ProofContext.pretty_thm ctxt th)));
wenzelm@12146
   487
    ths
wenzelm@5820
   488
  end;
wenzelm@5820
   489
wenzelm@5820
   490
wenzelm@5820
   491
wenzelm@5820
   492
(*** structured proof commands ***)
wenzelm@5820
   493
wenzelm@5820
   494
(** context **)
wenzelm@5820
   495
wenzelm@5820
   496
(* bind *)
wenzelm@5820
   497
wenzelm@5820
   498
fun gen_bind f x state =
wenzelm@5820
   499
  state
wenzelm@5820
   500
  |> assert_forward
wenzelm@5820
   501
  |> map_context (f x)
wenzelm@5820
   502
  |> reset_facts;
wenzelm@5820
   503
wenzelm@8617
   504
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   505
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   506
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   507
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   508
wenzelm@5820
   509
wenzelm@12714
   510
(* have_thmss *)
wenzelm@5820
   511
wenzelm@12714
   512
local
wenzelm@12714
   513
wenzelm@12714
   514
fun gen_have_thmss f args state =
wenzelm@5820
   515
  state
wenzelm@5820
   516
  |> assert_forward
wenzelm@12714
   517
  |> map_context_result (f args)
wenzelm@9196
   518
  |> these_factss;
wenzelm@5820
   519
wenzelm@12714
   520
in
wenzelm@12714
   521
wenzelm@12714
   522
val have_thmss = gen_have_thmss ProofContext.have_thmss;
wenzelm@12714
   523
val have_thmss_i = gen_have_thmss ProofContext.have_thmss_i;
wenzelm@12714
   524
wenzelm@12714
   525
fun simple_have_thms name thms = have_thmss_i [((name, []), [(thms, [])])];
wenzelm@12714
   526
wenzelm@12714
   527
end;
wenzelm@12714
   528
wenzelm@12714
   529
wenzelm@12714
   530
(* with_thmss *)
wenzelm@9196
   531
wenzelm@12714
   532
local
wenzelm@12714
   533
wenzelm@12714
   534
fun gen_with_thmss f args state =
wenzelm@12714
   535
  let val state' = state |> f args
wenzelm@9196
   536
  in state' |> simple_have_thms "" (the_facts state' @ the_facts state) end;
wenzelm@6876
   537
wenzelm@12714
   538
in
wenzelm@12714
   539
wenzelm@12714
   540
val with_thmss = gen_with_thmss have_thmss;
wenzelm@12714
   541
val with_thmss_i = gen_with_thmss have_thmss_i;
wenzelm@12714
   542
wenzelm@12714
   543
end;
wenzelm@12714
   544
wenzelm@5820
   545
wenzelm@5820
   546
(* fix *)
wenzelm@5820
   547
wenzelm@5820
   548
fun gen_fix f xs state =
wenzelm@5820
   549
  state
wenzelm@5820
   550
  |> assert_forward
wenzelm@5820
   551
  |> map_context (f xs)
wenzelm@5820
   552
  |> reset_facts;
wenzelm@5820
   553
wenzelm@5820
   554
val fix = gen_fix ProofContext.fix;
wenzelm@5820
   555
val fix_i = gen_fix ProofContext.fix_i;
wenzelm@5820
   556
wenzelm@5820
   557
wenzelm@11891
   558
(* assume and presume *)
wenzelm@5820
   559
wenzelm@9469
   560
fun gen_assume f exp args state =
wenzelm@5820
   561
  state
wenzelm@5820
   562
  |> assert_forward
wenzelm@9469
   563
  |> map_context_result (f exp args)
wenzelm@11924
   564
  |> these_factss;
wenzelm@6932
   565
wenzelm@7271
   566
val assm = gen_assume ProofContext.assume;
wenzelm@7271
   567
val assm_i = gen_assume ProofContext.assume_i;
wenzelm@11917
   568
val assume = assm ProofContext.export_assume;
wenzelm@11917
   569
val assume_i = assm_i ProofContext.export_assume;
wenzelm@11917
   570
val presume = assm ProofContext.export_presume;
wenzelm@11917
   571
val presume_i = assm_i ProofContext.export_presume;
wenzelm@5820
   572
wenzelm@7271
   573
wenzelm@5820
   574
wenzelm@11891
   575
(** local definitions **)
wenzelm@11891
   576
wenzelm@11891
   577
fun gen_def fix prep_term prep_pats raw_name atts (x, (raw_rhs, raw_pats)) state =
wenzelm@11891
   578
  let
wenzelm@11891
   579
    val _ = assert_forward state;
wenzelm@11891
   580
    val ctxt = context_of state;
wenzelm@11891
   581
wenzelm@11891
   582
    (*rhs*)
wenzelm@11891
   583
    val name = if raw_name = "" then Thm.def_name x else raw_name;
wenzelm@11891
   584
    val rhs = prep_term ctxt raw_rhs;
wenzelm@11891
   585
    val T = Term.fastype_of rhs;
wenzelm@11891
   586
    val pats = prep_pats T (ProofContext.declare_term rhs ctxt) raw_pats;
wenzelm@11891
   587
wenzelm@11891
   588
    (*lhs*)
wenzelm@11891
   589
    val lhs = ProofContext.bind_skolem ctxt [x] (Free (x, T));
wenzelm@11891
   590
  in
wenzelm@11891
   591
    state
wenzelm@11891
   592
    |> fix [([x], None)]
wenzelm@11891
   593
    |> match_bind_i [(pats, rhs)]
wenzelm@11917
   594
    |> assm_i ProofContext.export_def [((name, atts), [(Logic.mk_equals (lhs, rhs), ([], []))])]
wenzelm@11891
   595
  end;
wenzelm@11891
   596
wenzelm@11891
   597
val def = gen_def fix ProofContext.read_term ProofContext.read_term_pats;
wenzelm@11891
   598
val def_i = gen_def fix_i ProofContext.cert_term ProofContext.cert_term_pats;
wenzelm@11891
   599
wenzelm@11891
   600
wenzelm@8374
   601
(* invoke_case *)
wenzelm@8374
   602
wenzelm@11793
   603
fun invoke_case (name, xs, atts) state =
wenzelm@9292
   604
  let
wenzelm@10830
   605
    val (state', (lets, asms)) =
wenzelm@11793
   606
      map_context_result (ProofContext.apply_case (get_case state name xs)) state;
wenzelm@9292
   607
  in
wenzelm@10830
   608
    state'
wenzelm@10809
   609
    |> add_binds_i lets
wenzelm@10830
   610
    |> assume_i [((name, atts), map (rpair ([], [])) asms)]
wenzelm@8374
   611
  end;
wenzelm@8374
   612
wenzelm@8374
   613
wenzelm@5820
   614
wenzelm@5820
   615
(** goals **)
wenzelm@5820
   616
wenzelm@5820
   617
(* forward chaining *)
wenzelm@5820
   618
wenzelm@5820
   619
fun chain state =
wenzelm@5820
   620
  state
wenzelm@5820
   621
  |> assert_forward
wenzelm@6848
   622
  |> assert_facts
wenzelm@5820
   623
  |> enter_forward_chain;
wenzelm@5820
   624
wenzelm@5820
   625
fun from_facts facts state =
wenzelm@5820
   626
  state
wenzelm@5820
   627
  |> put_facts (Some facts)
wenzelm@5820
   628
  |> chain;
wenzelm@5820
   629
wenzelm@5820
   630
wenzelm@5820
   631
(* setup goals *)
wenzelm@5820
   632
wenzelm@11549
   633
val rule_contextN = "rule_context";
wenzelm@8991
   634
wenzelm@12534
   635
fun setup_goal opt_block prepp autofix kind after_qed names raw_propp state =
wenzelm@5820
   636
  let
wenzelm@12146
   637
    val (state', (propss, gen_binds)) =
wenzelm@5936
   638
      state
wenzelm@5936
   639
      |> assert_forward_or_chain
wenzelm@5936
   640
      |> enter_forward
wenzelm@8617
   641
      |> opt_block
wenzelm@12534
   642
      |> map_context_result (fn ctxt => prepp (ctxt, raw_propp));
wenzelm@12808
   643
    val sign' = sign_of state';
wenzelm@12146
   644
wenzelm@12146
   645
    val props = flat propss;
wenzelm@12808
   646
    val cprop = Thm.cterm_of sign' (Logic.mk_conjunction_list props);
wenzelm@7556
   647
    val goal = Drule.mk_triv_goal cprop;
wenzelm@10553
   648
wenzelm@12146
   649
    val tvars = foldr Term.add_term_tvars (props, []);
wenzelm@12146
   650
    val vars = foldr Term.add_term_vars (props, []);
wenzelm@5820
   651
  in
wenzelm@10553
   652
    if null tvars then ()
wenzelm@10553
   653
    else raise STATE ("Goal statement contains illegal schematic type variable(s): " ^
wenzelm@10553
   654
      commas (map (Syntax.string_of_vname o #1) tvars), state);
wenzelm@10553
   655
    if null vars then ()
wenzelm@10553
   656
    else warning ("Goal statement contains unbound schematic variable(s): " ^
wenzelm@12055
   657
      commas (map (ProofContext.string_of_term (context_of state')) vars));
wenzelm@5936
   658
    state'
wenzelm@12146
   659
    |> map_context (autofix props)
wenzelm@12146
   660
    |> put_goal (Some (((kind, names, propss), ([], goal)), after_qed o map_context gen_binds))
wenzelm@12167
   661
    |> map_context (ProofContext.add_cases
wenzelm@12808
   662
     (if length props = 1 then
wenzelm@12808
   663
      RuleCases.make true (Thm.sign_of_thm goal, Thm.prop_of goal) [rule_contextN]
wenzelm@12167
   664
      else [(rule_contextN, RuleCases.empty)]))
wenzelm@12146
   665
    |> auto_bind_goal props
wenzelm@5820
   666
    |> (if is_chain state then use_facts else reset_facts)
wenzelm@5820
   667
    |> new_block
wenzelm@5820
   668
    |> enter_backward
wenzelm@5820
   669
  end;
wenzelm@5820
   670
wenzelm@5820
   671
(*global goals*)
wenzelm@12534
   672
fun global_goal prep kind a raw_locale elems args thy =
wenzelm@12503
   673
  let
wenzelm@12549
   674
    val init = init_state thy;
wenzelm@12534
   675
    val (opt_name, locale_ctxt, elems_ctxt, propp) =
wenzelm@12549
   676
      prep (apsome fst raw_locale) elems (map snd args) (context_of init);
wenzelm@12534
   677
    val locale = (case raw_locale of None => None | Some (_, atts) => Some (the opt_name, atts));
wenzelm@12503
   678
  in
wenzelm@12549
   679
    init
wenzelm@12549
   680
    |> open_block
wenzelm@12511
   681
    |> map_context (K locale_ctxt)
wenzelm@12065
   682
    |> open_block
wenzelm@12511
   683
    |> map_context (K elems_ctxt)
wenzelm@12534
   684
    |> setup_goal I ProofContext.bind_propp_schematic_i
wenzelm@12534
   685
      ProofContext.fix_frees (Theorem (kind, a, locale, map (snd o fst) args))
wenzelm@12534
   686
      Seq.single (map (fst o fst) args) propp
wenzelm@12065
   687
  end;
wenzelm@5820
   688
wenzelm@12534
   689
val multi_theorem = global_goal Locale.read_context_statement;
wenzelm@12534
   690
val multi_theorem_i = global_goal Locale.cert_context_statement;
wenzelm@12146
   691
wenzelm@5820
   692
wenzelm@5820
   693
(*local goals*)
wenzelm@12146
   694
fun local_goal' prepp kind (check: bool -> state -> state) f args int state =
wenzelm@7928
   695
  state
wenzelm@12146
   696
  |> setup_goal open_block prepp (K I) (kind (map (snd o fst) args))
wenzelm@12146
   697
    f (map (fst o fst) args) (map snd args)
wenzelm@10936
   698
  |> warn_extra_tfrees state
wenzelm@10936
   699
  |> check int;
wenzelm@5820
   700
wenzelm@12146
   701
fun local_goal prepp kind f args = local_goal' prepp kind (K I) f args false;
wenzelm@10936
   702
wenzelm@10936
   703
val show = local_goal' ProofContext.bind_propp Show;
wenzelm@10936
   704
val show_i = local_goal' ProofContext.bind_propp_i Show;
wenzelm@10936
   705
val have = local_goal ProofContext.bind_propp Have;
wenzelm@10380
   706
val have_i = local_goal ProofContext.bind_propp_i Have;
wenzelm@5820
   707
wenzelm@5820
   708
wenzelm@5820
   709
wenzelm@5820
   710
(** conclusions **)
wenzelm@5820
   711
wenzelm@5820
   712
(* current goal *)
wenzelm@5820
   713
wenzelm@7176
   714
fun current_goal (State (Node {context, goal = Some goal, ...}, _)) = (context, goal)
wenzelm@5820
   715
  | current_goal state = raise STATE ("No current goal!", state);
wenzelm@5820
   716
wenzelm@7176
   717
fun assert_current_goal true (state as State (Node {goal = None, ...}, _)) =
wenzelm@6404
   718
      raise STATE ("No goal in this block!", state)
wenzelm@7176
   719
  | assert_current_goal false (state as State (Node {goal = Some _, ...}, _)) =
wenzelm@6404
   720
      raise STATE ("Goal present in this block!", state)
wenzelm@6404
   721
  | assert_current_goal _ state = state;
wenzelm@5820
   722
wenzelm@12010
   723
fun assert_bottom b (state as State (_, nodes)) =
wenzelm@12010
   724
  let val bot = (length nodes <= 2) in
wenzelm@12010
   725
    if b andalso not bot then raise STATE ("Not at bottom of proof!", state)
wenzelm@12010
   726
    else if not b andalso bot then raise STATE ("Already at bottom of proof!", state)
wenzelm@12010
   727
    else state
wenzelm@12010
   728
  end;
wenzelm@5820
   729
wenzelm@6404
   730
val at_bottom = can (assert_bottom true o close_block);
wenzelm@6404
   731
wenzelm@6932
   732
fun end_proof bot state =
wenzelm@5820
   733
  state
wenzelm@5820
   734
  |> assert_forward
wenzelm@5820
   735
  |> close_block
wenzelm@5820
   736
  |> assert_bottom bot
wenzelm@7011
   737
  |> assert_current_goal true
wenzelm@7011
   738
  |> goal_facts (K []);
wenzelm@5820
   739
wenzelm@5820
   740
wenzelm@6404
   741
(* local_qed *)
wenzelm@5820
   742
wenzelm@6982
   743
fun finish_local (print_result, print_rule) state =
wenzelm@5820
   744
  let
wenzelm@12146
   745
    val (goal_ctxt, (((kind, names, tss), (_, raw_thm)), after_qed)) = current_goal state;
wenzelm@8617
   746
    val outer_state = state |> close_block;
wenzelm@8617
   747
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   748
wenzelm@12146
   749
    val ts = flat tss;
wenzelm@12146
   750
    val results = prep_result state ts raw_thm;
wenzelm@12146
   751
    val resultq =
wenzelm@12146
   752
      results |> map (ProofContext.export false goal_ctxt outer_ctxt)
wenzelm@12146
   753
      |> Seq.commute |> Seq.map (Library.unflat tss);
wenzelm@9469
   754
wenzelm@12146
   755
    val (attss, opt_solve) =
wenzelm@5820
   756
      (case kind of
wenzelm@12146
   757
        Show attss => (attss, export_goals goal_ctxt print_rule results)
wenzelm@12146
   758
      | Have attss => (attss, Seq.single)
wenzelm@6932
   759
      | _ => err_malformed "finish_local" state);
wenzelm@5820
   760
  in
wenzelm@12146
   761
    print_result goal_ctxt (kind_name (sign_of state) kind, names ~~ Library.unflat tss results);
wenzelm@8617
   762
    outer_state
wenzelm@12549
   763
    |> auto_bind_facts (ProofContext.generalize goal_ctxt outer_ctxt ts)
wenzelm@9469
   764
    |> (fn st => Seq.map (fn res =>
wenzelm@12714
   765
      have_thmss_i ((names ~~ attss) ~~ map (single o Thm.no_attributes) res) st) resultq)
wenzelm@9469
   766
    |> (Seq.flat o Seq.map opt_solve)
wenzelm@7176
   767
    |> (Seq.flat o Seq.map after_qed)
wenzelm@5820
   768
  end;
wenzelm@5820
   769
wenzelm@6982
   770
fun local_qed finalize print state =
wenzelm@6404
   771
  state
wenzelm@6932
   772
  |> end_proof false
wenzelm@6871
   773
  |> finalize
wenzelm@6982
   774
  |> (Seq.flat o Seq.map (finish_local print));
wenzelm@5820
   775
wenzelm@5820
   776
wenzelm@12703
   777
(* global_qed *)
wenzelm@12065
   778
wenzelm@6950
   779
fun finish_global state =
wenzelm@5820
   780
  let
wenzelm@12703
   781
    val export = Drule.local_standard ooo ProofContext.export_single;
wenzelm@12146
   782
    val (goal_ctxt, (((kind, names, tss), (_, raw_thm)), _)) = current_goal state;
wenzelm@12065
   783
    val locale_ctxt = context_of (state |> close_block);
wenzelm@12065
   784
    val theory_ctxt = context_of (state |> close_block |> close_block);
wenzelm@5820
   785
wenzelm@12146
   786
    val ts = flat tss;
wenzelm@12703
   787
    val locale_results = map (export goal_ctxt locale_ctxt) (prep_result state ts raw_thm);
wenzelm@12703
   788
    val results = map (Drule.strip_shyps_warning o export locale_ctxt theory_ctxt) locale_results;
wenzelm@12242
   789
    val (k, (cname, catts), locale, attss) =
wenzelm@12146
   790
      (case kind of Theorem x => x | _ => err_malformed "finish_global" state);
wenzelm@12703
   791
wenzelm@12242
   792
    val (thy1, res') =
wenzelm@12703
   793
      theory_of state |> Locale.add_thmss_hybrid k
wenzelm@12703
   794
        ((names ~~ attss) ~~ map (single o Thm.no_attributes) (Library.unflat tss results))
wenzelm@12703
   795
        locale (Library.unflat tss locale_results);
wenzelm@12242
   796
    val thy2 = thy1 |> PureThy.add_thmss [((cname, flat (map #2 res')), catts)] |> #1;
wenzelm@12244
   797
  in (thy2, ((k, cname), res')) end;
wenzelm@5820
   798
wenzelm@10553
   799
(*note: clients should inspect first result only, as backtracking may destroy theory*)
wenzelm@6950
   800
fun global_qed finalize state =
wenzelm@5820
   801
  state
wenzelm@6932
   802
  |> end_proof true
wenzelm@6871
   803
  |> finalize
wenzelm@12065
   804
  |> Seq.map finish_global;
wenzelm@5820
   805
wenzelm@5820
   806
wenzelm@6896
   807
wenzelm@6896
   808
(** blocks **)
wenzelm@6896
   809
wenzelm@6896
   810
(* begin_block *)
wenzelm@6896
   811
wenzelm@6896
   812
fun begin_block state =
wenzelm@6896
   813
  state
wenzelm@6896
   814
  |> assert_forward
wenzelm@6896
   815
  |> new_block
wenzelm@6896
   816
  |> open_block;
wenzelm@6896
   817
wenzelm@6896
   818
wenzelm@6896
   819
(* end_block *)
wenzelm@6896
   820
wenzelm@6896
   821
fun end_block state =
wenzelm@6896
   822
  state
wenzelm@6896
   823
  |> assert_forward
wenzelm@6896
   824
  |> close_block
wenzelm@6896
   825
  |> assert_current_goal false
wenzelm@6896
   826
  |> close_block
wenzelm@6932
   827
  |> transfer_facts state;
wenzelm@6896
   828
wenzelm@6896
   829
wenzelm@6896
   830
(* next_block *)
wenzelm@6896
   831
wenzelm@6896
   832
fun next_block state =
wenzelm@6896
   833
  state
wenzelm@6896
   834
  |> assert_forward
wenzelm@6896
   835
  |> close_block
wenzelm@8718
   836
  |> new_block
wenzelm@8718
   837
  |> reset_facts;
wenzelm@6896
   838
wenzelm@6896
   839
wenzelm@5820
   840
end;
wenzelm@8152
   841
wenzelm@8152
   842
structure BasicProof: BASIC_PROOF = Proof;
wenzelm@8152
   843
open BasicProof;