src/Pure/Isar/proof.ML
author wenzelm
Fri Jan 27 19:03:14 2006 +0100 (2006-01-27)
changeset 18808 838fb803636e
parent 18784 2d93559db27e
child 18826 2a805b3dd9f0
permissions -rw-r--r--
swapped Toplevel.theory_context;
tuned;
wenzelm@5820
     1
(*  Title:      Pure/Isar/proof.ML
wenzelm@5820
     2
    ID:         $Id$
wenzelm@5820
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5820
     4
wenzelm@15757
     5
The Isar/VM proof language interpreter.
wenzelm@5820
     6
*)
wenzelm@5820
     7
wenzelm@5820
     8
signature PROOF =
wenzelm@5820
     9
sig
wenzelm@17756
    10
  type context (*= Context.proof*)
wenzelm@17756
    11
  type method (*= Method.method*)
wenzelm@5820
    12
  type state
wenzelm@17359
    13
  val init: context -> state
wenzelm@17359
    14
  val level: state -> int
wenzelm@17359
    15
  val assert_bottom: bool -> state -> state
wenzelm@5820
    16
  val context_of: state -> context
wenzelm@5820
    17
  val theory_of: state -> theory
wenzelm@16450
    18
  val sign_of: state -> theory    (*obsolete*)
wenzelm@13377
    19
  val map_context: (context -> context) -> state -> state
wenzelm@7924
    20
  val warn_extra_tfrees: state -> state -> state
wenzelm@17976
    21
  val add_binds_i: (indexname * term option) list -> state -> state
wenzelm@17359
    22
  val put_thms: string * thm list option -> state -> state
wenzelm@6091
    23
  val the_facts: state -> thm list
wenzelm@9469
    24
  val the_fact: state -> thm
wenzelm@17450
    25
  val put_facts: thm list option -> state -> state
wenzelm@6891
    26
  val assert_forward: state -> state
wenzelm@17359
    27
  val assert_chain: state -> state
wenzelm@9469
    28
  val assert_forward_or_chain: state -> state
wenzelm@5820
    29
  val assert_backward: state -> state
wenzelm@8206
    30
  val assert_no_chain: state -> state
wenzelm@5820
    31
  val enter_forward: state -> state
wenzelm@17359
    32
  val get_goal: state -> context * (thm list * thm)
wenzelm@16539
    33
  val show_main_goal: bool ref
wenzelm@6529
    34
  val verbose: bool ref
wenzelm@12423
    35
  val pretty_state: int -> state -> Pretty.T list
wenzelm@10360
    36
  val pretty_goals: bool -> state -> Pretty.T list
wenzelm@17112
    37
  val refine: Method.text -> state -> state Seq.seq
wenzelm@17112
    38
  val refine_end: Method.text -> state -> state Seq.seq
wenzelm@17359
    39
  val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq
wenzelm@5936
    40
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    41
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@8617
    42
  val let_bind: (string list * string) list -> state -> state
wenzelm@8617
    43
  val let_bind_i: (term list * term) list -> state -> state
wenzelm@18670
    44
  val fix: (string * string option) list -> state -> state
wenzelm@18670
    45
  val fix_i: (string * typ option) list -> state -> state
wenzelm@18670
    46
  val assm: ProofContext.export ->
wenzelm@17359
    47
    ((string * Attrib.src list) * (string * (string list * string list)) list) list ->
wenzelm@17359
    48
    state -> state
wenzelm@18670
    49
  val assm_i: ProofContext.export ->
wenzelm@18728
    50
    ((string * attribute list) * (term * (term list * term list)) list) list
wenzelm@17359
    51
    -> state -> state
wenzelm@17359
    52
  val assume: ((string * Attrib.src list) * (string * (string list * string list)) list) list ->
wenzelm@17359
    53
    state -> state
wenzelm@18728
    54
  val assume_i: ((string * attribute list) * (term * (term list * term list)) list) list
wenzelm@17359
    55
    -> state -> state
wenzelm@17359
    56
  val presume: ((string * Attrib.src list) * (string * (string list * string list)) list) list
wenzelm@17359
    57
    -> state -> state
wenzelm@18728
    58
  val presume_i: ((string * attribute list) * (term * (term list * term list)) list) list
wenzelm@17359
    59
    -> state -> state
wenzelm@18308
    60
  val def: ((string * Attrib.src list) * (string * (string * string list))) list ->
wenzelm@18308
    61
    state -> state
wenzelm@18728
    62
  val def_i: ((string * attribute list) * (string * (term * term list))) list ->
wenzelm@18308
    63
    state -> state
wenzelm@17359
    64
  val chain: state -> state
wenzelm@17359
    65
  val chain_facts: thm list -> state -> state
wenzelm@17359
    66
  val get_thmss: state -> (thmref * Attrib.src list) list -> thm list
wenzelm@14564
    67
  val simple_note_thms: string -> thm list -> state -> state
wenzelm@17359
    68
  val note_thmss: ((string * Attrib.src list) *
wenzelm@17112
    69
    (thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    70
  val note_thmss_i: ((string * attribute list) *
wenzelm@18728
    71
    (thm list * attribute list) list) list -> state -> state
wenzelm@17112
    72
  val from_thmss: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    73
  val from_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@17112
    74
  val with_thmss: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    75
  val with_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@18548
    76
  val using: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    77
  val using_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@18548
    78
  val unfolding: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    79
  val unfolding_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@17112
    80
  val invoke_case: string * string option list * Attrib.src list -> state -> state
wenzelm@18728
    81
  val invoke_case_i: string * string option list * attribute list -> state -> state
wenzelm@17359
    82
  val begin_block: state -> state
wenzelm@17359
    83
  val next_block: state -> state
wenzelm@17359
    84
  val end_block: state -> state Seq.seq
wenzelm@17112
    85
  val proof: Method.text option -> state -> state Seq.seq
wenzelm@17112
    86
  val defer: int option -> state -> state Seq.seq
wenzelm@17112
    87
  val prefer: int -> state -> state Seq.seq
wenzelm@17112
    88
  val apply: Method.text -> state -> state Seq.seq
wenzelm@17112
    89
  val apply_end: Method.text -> state -> state Seq.seq
wenzelm@17359
    90
  val goal_names: string option -> string -> string list -> string
wenzelm@17359
    91
  val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
wenzelm@18728
    92
    (theory -> 'a -> attribute) ->
wenzelm@17359
    93
    (context * 'b list -> context * (term list list * (context -> context))) ->
wenzelm@18124
    94
    string -> Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@17359
    95
    ((string * 'a list) * 'b) list -> state -> state
wenzelm@17359
    96
  val local_qed: Method.text option * bool -> state -> state Seq.seq
wenzelm@17359
    97
  val global_goal: (context -> (string * string) * (string * thm list) list -> unit) ->
wenzelm@18728
    98
    (theory -> 'a -> attribute) ->
wenzelm@17450
    99
    (context * 'b list -> context * (term list list * (context -> context))) ->
wenzelm@18124
   100
    string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@17859
   101
    string option -> string * 'a list -> ((string * 'a list) * 'b) list -> context -> state
wenzelm@18808
   102
  val global_qed: Method.text option * bool -> state -> context * theory
wenzelm@17359
   103
  val local_terminal_proof: Method.text * Method.text option -> state -> state Seq.seq
wenzelm@17359
   104
  val local_default_proof: state -> state Seq.seq
wenzelm@17359
   105
  val local_immediate_proof: state -> state Seq.seq
wenzelm@17359
   106
  val local_done_proof: state -> state Seq.seq
wenzelm@17359
   107
  val local_skip_proof: bool -> state -> state Seq.seq
wenzelm@18808
   108
  val global_terminal_proof: Method.text * Method.text option -> state -> context * theory
wenzelm@18808
   109
  val global_default_proof: state -> context * theory
wenzelm@18808
   110
  val global_immediate_proof: state -> context * theory
wenzelm@18808
   111
  val global_done_proof: state -> context * theory
wenzelm@18808
   112
  val global_skip_proof: bool -> state -> context * theory
wenzelm@18124
   113
  val have: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@17359
   114
    ((string * Attrib.src list) * (string * (string list * string list)) list) list ->
wenzelm@17359
   115
    bool -> state -> state
wenzelm@18124
   116
  val have_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@18728
   117
    ((string * attribute list) * (term * (term list * term list)) list) list ->
wenzelm@17359
   118
    bool -> state -> state
wenzelm@18124
   119
  val show: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@17359
   120
    ((string * Attrib.src list) * (string * (string list * string list)) list) list ->
wenzelm@17359
   121
    bool -> state -> state
wenzelm@18124
   122
  val show_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@18728
   123
    ((string * attribute list) * (term * (term list * term list)) list) list ->
wenzelm@17359
   124
    bool -> state -> state
wenzelm@18124
   125
  val theorem: string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@17359
   126
    string option -> string * Attrib.src list ->
wenzelm@17359
   127
    ((string * Attrib.src list) * (string * (string list * string list)) list) list ->
wenzelm@17359
   128
    context -> state
wenzelm@18124
   129
  val theorem_i: string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@18728
   130
    string option -> string * attribute list ->
wenzelm@18728
   131
    ((string * attribute list) * (term * (term list * term list)) list) list ->
wenzelm@17359
   132
    context -> state
wenzelm@5820
   133
end;
wenzelm@5820
   134
wenzelm@13377
   135
structure Proof: PROOF =
wenzelm@5820
   136
struct
wenzelm@5820
   137
wenzelm@16813
   138
type context = ProofContext.context;
wenzelm@17112
   139
type method = Method.method;
wenzelm@16813
   140
wenzelm@5820
   141
wenzelm@5820
   142
(** proof state **)
wenzelm@5820
   143
wenzelm@17359
   144
(* datatype state *)
wenzelm@5820
   145
wenzelm@17112
   146
datatype mode = Forward | Chain | Backward;
wenzelm@5820
   147
wenzelm@17359
   148
datatype state =
wenzelm@17359
   149
  State of node Stack.T
wenzelm@17359
   150
and node =
wenzelm@7176
   151
  Node of
wenzelm@7176
   152
   {context: context,
wenzelm@7176
   153
    facts: thm list option,
wenzelm@7176
   154
    mode: mode,
wenzelm@17359
   155
    goal: goal option}
wenzelm@17359
   156
and goal =
wenzelm@17359
   157
  Goal of
wenzelm@17359
   158
   {statement: string * term list list,     (*goal kind and statement*)
wenzelm@17359
   159
    using: thm list,                        (*goal facts*)
wenzelm@17359
   160
    goal: thm,                              (*subgoals ==> statement*)
wenzelm@17859
   161
    before_qed: Method.text option,
wenzelm@18124
   162
    after_qed:
wenzelm@18124
   163
      (thm list list -> state -> state Seq.seq) *
wenzelm@18124
   164
      (thm list list -> theory -> theory)};
wenzelm@17359
   165
wenzelm@17859
   166
fun make_goal (statement, using, goal, before_qed, after_qed) =
wenzelm@17859
   167
  Goal {statement = statement, using = using, goal = goal,
wenzelm@17859
   168
    before_qed = before_qed, after_qed = after_qed};
wenzelm@5820
   169
wenzelm@7176
   170
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   171
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   172
wenzelm@17359
   173
fun map_node f (Node {context, facts, mode, goal}) =
wenzelm@17359
   174
  make_node (f (context, facts, mode, goal));
wenzelm@5820
   175
wenzelm@17359
   176
fun init ctxt = State (Stack.init (make_node (ctxt, NONE, Forward, NONE)));
wenzelm@5820
   177
wenzelm@17359
   178
fun current (State st) = Stack.top st |> (fn Node node => node);
wenzelm@17359
   179
fun map_current f (State st) = State (Stack.map (map_node f) st);
wenzelm@12045
   180
wenzelm@5820
   181
wenzelm@5820
   182
wenzelm@5820
   183
(** basic proof state operations **)
wenzelm@5820
   184
wenzelm@17359
   185
(* block structure *)
wenzelm@17359
   186
wenzelm@17359
   187
fun open_block (State st) = State (Stack.push st);
wenzelm@17359
   188
wenzelm@18678
   189
fun close_block (State st) = State (Stack.pop st)
wenzelm@18678
   190
  handle Empty => error "Unbalanced block parentheses";
wenzelm@17359
   191
wenzelm@17359
   192
fun level (State st) = Stack.level st;
wenzelm@17359
   193
wenzelm@17359
   194
fun assert_bottom b state =
wenzelm@17359
   195
  let val b' = (level state <= 2) in
wenzelm@18678
   196
    if b andalso not b' then error "Not at bottom of proof!"
wenzelm@18678
   197
    else if not b andalso b' then error "Already at bottom of proof!"
wenzelm@17359
   198
    else state
wenzelm@17359
   199
  end;
wenzelm@17359
   200
wenzelm@17359
   201
wenzelm@5820
   202
(* context *)
wenzelm@5820
   203
wenzelm@17359
   204
val context_of = #context o current;
wenzelm@5820
   205
val theory_of = ProofContext.theory_of o context_of;
wenzelm@16450
   206
val sign_of = theory_of;
wenzelm@5820
   207
wenzelm@17359
   208
fun map_context f =
wenzelm@17359
   209
  map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   210
wenzelm@17359
   211
fun map_context_result f state =
wenzelm@17859
   212
  f (context_of state) ||> (fn ctxt => map_context (K ctxt) state);
wenzelm@5820
   213
wenzelm@7924
   214
val warn_extra_tfrees = map_context o ProofContext.warn_extra_tfrees o context_of;
wenzelm@10809
   215
val add_binds_i = map_context o ProofContext.add_binds_i;
wenzelm@6091
   216
val put_thms = map_context o ProofContext.put_thms;
wenzelm@8374
   217
val get_case = ProofContext.get_case o context_of;
wenzelm@5820
   218
wenzelm@5820
   219
wenzelm@5820
   220
(* facts *)
wenzelm@5820
   221
wenzelm@17359
   222
val get_facts = #facts o current;
wenzelm@17359
   223
wenzelm@17359
   224
fun the_facts state =
wenzelm@17359
   225
  (case get_facts state of SOME facts => facts
wenzelm@18678
   226
  | NONE => error "No current facts available");
wenzelm@5820
   227
wenzelm@9469
   228
fun the_fact state =
wenzelm@17359
   229
  (case the_facts state of [thm] => thm
wenzelm@18678
   230
  | _ => error "Single theorem expected");
wenzelm@7605
   231
wenzelm@17359
   232
fun put_facts facts =
wenzelm@17359
   233
  map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal))
wenzelm@17359
   234
  #> put_thms (AutoBind.thisN, facts);
wenzelm@5820
   235
wenzelm@17359
   236
fun these_factss more_facts (named_factss, state) =
wenzelm@17359
   237
  (named_factss, state |> put_facts (SOME (List.concat (map snd named_factss) @ more_facts)));
wenzelm@5820
   238
wenzelm@17359
   239
fun export_facts inner outer =
wenzelm@17359
   240
  (case get_facts inner of
wenzelm@17359
   241
    NONE => Seq.single (put_facts NONE outer)
wenzelm@17359
   242
  | SOME thms =>
wenzelm@17359
   243
      thms
wenzelm@18041
   244
      |> Seq.map_list (ProofContext.exports (context_of inner) (context_of outer))
wenzelm@17359
   245
      |> Seq.map (fn ths => put_facts (SOME ths) outer));
wenzelm@5820
   246
wenzelm@5820
   247
wenzelm@5820
   248
(* mode *)
wenzelm@5820
   249
wenzelm@17359
   250
val get_mode = #mode o current;
wenzelm@5820
   251
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   252
wenzelm@17359
   253
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove");
wenzelm@5820
   254
wenzelm@5820
   255
fun assert_mode pred state =
wenzelm@5820
   256
  let val mode = get_mode state in
wenzelm@5820
   257
    if pred mode then state
wenzelm@18678
   258
    else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode")
wenzelm@5820
   259
  end;
wenzelm@5820
   260
wenzelm@5820
   261
val assert_forward = assert_mode (equal Forward);
wenzelm@17359
   262
val assert_chain = assert_mode (equal Chain);
wenzelm@17112
   263
val assert_forward_or_chain = assert_mode (equal Forward orf equal Chain);
wenzelm@5820
   264
val assert_backward = assert_mode (equal Backward);
wenzelm@17112
   265
val assert_no_chain = assert_mode (not_equal Chain);
wenzelm@5820
   266
wenzelm@17359
   267
val enter_forward = put_mode Forward;
wenzelm@17359
   268
val enter_chain = put_mode Chain;
wenzelm@17359
   269
val enter_backward = put_mode Backward;
wenzelm@5820
   270
wenzelm@17359
   271
wenzelm@17359
   272
(* current goal *)
wenzelm@17359
   273
wenzelm@17359
   274
fun current_goal state =
wenzelm@17359
   275
  (case current state of
wenzelm@17359
   276
    {context, goal = SOME (Goal goal), ...} => (context, goal)
wenzelm@18678
   277
  | _ => error "No current goal!");
wenzelm@5820
   278
wenzelm@17359
   279
fun assert_current_goal g state =
wenzelm@17359
   280
  let val g' = can current_goal state in
wenzelm@18678
   281
    if g andalso not g' then error "No goal in this block!"
wenzelm@18678
   282
    else if not g andalso g' then error "Goal present in this block!"
wenzelm@17359
   283
    else state
wenzelm@17359
   284
  end;
wenzelm@6776
   285
wenzelm@17359
   286
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal));
wenzelm@17359
   287
wenzelm@17859
   288
val before_qed = #before_qed o #2 o current_goal;
wenzelm@17859
   289
wenzelm@17359
   290
wenzelm@17359
   291
(* nested goal *)
wenzelm@5820
   292
wenzelm@17359
   293
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) =
wenzelm@17359
   294
      let
wenzelm@17859
   295
        val Goal {statement, using, goal, before_qed, after_qed} = goal;
wenzelm@17859
   296
        val goal' = make_goal (g (statement, using, goal, before_qed, after_qed));
wenzelm@17359
   297
      in State (make_node (f context, facts, mode, SOME goal'), nodes) end
wenzelm@17359
   298
  | map_goal f g (State (nd, node :: nodes)) =
wenzelm@17359
   299
      let val State (node', nodes') = map_goal f g (State (node, nodes))
wenzelm@17359
   300
      in map_context f (State (nd, node' :: nodes')) end
wenzelm@17359
   301
  | map_goal _ _ state = state;
wenzelm@5820
   302
wenzelm@17859
   303
fun using_facts using = map_goal I (fn (statement, _, goal, before_qed, after_qed) =>
wenzelm@17859
   304
  (statement, using, goal, before_qed, after_qed));
wenzelm@17359
   305
wenzelm@17359
   306
local
wenzelm@17359
   307
  fun find i state =
wenzelm@17359
   308
    (case try current_goal state of
wenzelm@17359
   309
      SOME (ctxt, goal) => (ctxt, (i, goal))
wenzelm@18678
   310
    | NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present"));
wenzelm@17359
   311
in val find_goal = find 0 end;
wenzelm@17359
   312
wenzelm@17359
   313
fun get_goal state =
wenzelm@17359
   314
  let val (ctxt, (_, {using, goal, ...})) = find_goal state
wenzelm@17359
   315
  in (ctxt, (using, goal)) end;
wenzelm@5820
   316
wenzelm@5820
   317
wenzelm@5820
   318
wenzelm@12423
   319
(** pretty_state **)
wenzelm@5820
   320
nipkow@13869
   321
val show_main_goal = ref false;
wenzelm@16539
   322
val verbose = ProofContext.verbose;
nipkow@13698
   323
wenzelm@14876
   324
val pretty_goals_local = Display.pretty_goals_aux o ProofContext.pp;
wenzelm@12085
   325
skalberg@15531
   326
fun pretty_facts _ _ NONE = []
skalberg@15531
   327
  | pretty_facts s ctxt (SOME ths) =
wenzelm@12055
   328
      [Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""];
wenzelm@6756
   329
wenzelm@17359
   330
fun pretty_state nr state =
wenzelm@5820
   331
  let
wenzelm@17359
   332
    val {context, facts, mode, goal = _} = current state;
wenzelm@17359
   333
    val ref (_, _, bg) = Display.current_goals_markers;
wenzelm@5820
   334
wenzelm@5820
   335
    fun levels_up 0 = ""
wenzelm@17359
   336
      | levels_up 1 = "1 level up"
wenzelm@17359
   337
      | levels_up i = string_of_int i ^ " levels up";
wenzelm@5820
   338
wenzelm@11556
   339
    fun subgoals 0 = ""
wenzelm@17359
   340
      | subgoals 1 = "1 subgoal"
wenzelm@17359
   341
      | subgoals n = string_of_int n ^ " subgoals";
wenzelm@17359
   342
wenzelm@17359
   343
    fun description strs =
wenzelm@17359
   344
      (case filter_out (equal "") strs of [] => ""
wenzelm@17359
   345
      | strs' => enclose " (" ")" (commas strs'));
wenzelm@12146
   346
wenzelm@17859
   347
    fun prt_goal (SOME (ctxt, (i, {statement = (kind, _), using, goal, before_qed, after_qed}))) =
wenzelm@17359
   348
          pretty_facts "using " ctxt
wenzelm@17359
   349
            (if mode <> Backward orelse null using then NONE else SOME using) @
wenzelm@17359
   350
          [Pretty.str ("goal" ^ description [kind, levels_up (i div 2),
wenzelm@17359
   351
              subgoals (Thm.nprems_of goal)] ^ ":")] @
wenzelm@17359
   352
          pretty_goals_local ctxt bg (true, ! show_main_goal) (! Display.goals_limit) goal
wenzelm@17359
   353
      | prt_goal NONE = [];
wenzelm@6848
   354
wenzelm@17359
   355
    val prt_ctxt =
wenzelm@17359
   356
      if ! verbose orelse mode = Forward then ProofContext.pretty_context context
wenzelm@18670
   357
      else if mode = Backward then ProofContext.pretty_ctxt context
wenzelm@7575
   358
      else [];
wenzelm@17359
   359
  in
wenzelm@17359
   360
    [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
wenzelm@17359
   361
      (if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")),
wenzelm@17359
   362
      Pretty.str ""] @
wenzelm@17359
   363
    (if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @
wenzelm@17359
   364
    (if ! verbose orelse mode = Forward then
wenzelm@17359
   365
       pretty_facts "" context facts @ prt_goal (try find_goal state)
wenzelm@17359
   366
     else if mode = Chain then pretty_facts "picking " context facts
wenzelm@17359
   367
     else prt_goal (try find_goal state))
wenzelm@17359
   368
  end;
wenzelm@5820
   369
wenzelm@12085
   370
fun pretty_goals main state =
wenzelm@17359
   371
  let val (ctxt, (_, {goal, ...})) = find_goal state
wenzelm@17359
   372
  in pretty_goals_local ctxt "" (false, main) (! Display.goals_limit) goal end;
wenzelm@10320
   373
wenzelm@5820
   374
wenzelm@5820
   375
wenzelm@5820
   376
(** proof steps **)
wenzelm@5820
   377
wenzelm@17359
   378
(* refine via method *)
wenzelm@5820
   379
wenzelm@8234
   380
local
wenzelm@8234
   381
wenzelm@16146
   382
fun goalN i = "goal" ^ string_of_int i;
wenzelm@16146
   383
fun goals st = map goalN (1 upto Thm.nprems_of st);
wenzelm@16146
   384
wenzelm@16146
   385
fun no_goal_cases st = map (rpair NONE) (goals st);
wenzelm@16146
   386
wenzelm@16146
   387
fun goal_cases st =
wenzelm@18607
   388
  RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st));
wenzelm@16146
   389
wenzelm@16450
   390
fun check_theory thy state =
wenzelm@16450
   391
  if subthy (thy, theory_of state) then state
wenzelm@18678
   392
  else error ("Bad theory of method result: " ^ Context.str_of_thy thy);
wenzelm@5820
   393
wenzelm@17112
   394
fun apply_method current_context meth_fun state =
wenzelm@6848
   395
  let
wenzelm@17859
   396
    val (goal_ctxt, (_, {statement, using, goal, before_qed, after_qed})) = find_goal state;
wenzelm@17112
   397
    val meth = meth_fun (if current_context then context_of state else goal_ctxt);
wenzelm@16146
   398
  in
wenzelm@18228
   399
    Method.apply meth using goal |> Seq.map (fn (meth_cases, goal') =>
wenzelm@6848
   400
      state
wenzelm@17359
   401
      |> check_theory (Thm.theory_of_thm goal')
wenzelm@16146
   402
      |> map_goal
wenzelm@18475
   403
          (ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #>
wenzelm@18475
   404
           ProofContext.add_cases true meth_cases)
wenzelm@17859
   405
          (K (statement, using, goal', before_qed, after_qed)))
wenzelm@16146
   406
  end;
wenzelm@5820
   407
wenzelm@17112
   408
fun apply_text cc text state =
wenzelm@17112
   409
  let
wenzelm@17112
   410
    val thy = theory_of state;
wenzelm@17112
   411
wenzelm@17112
   412
    fun eval (Method.Basic m) = apply_method cc m
wenzelm@17112
   413
      | eval (Method.Source src) = apply_method cc (Method.method thy src)
wenzelm@17112
   414
      | eval (Method.Then txts) = Seq.EVERY (map eval txts)
wenzelm@17112
   415
      | eval (Method.Orelse txts) = Seq.FIRST (map eval txts)
wenzelm@17112
   416
      | eval (Method.Try txt) = Seq.TRY (eval txt)
wenzelm@17112
   417
      | eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt);
wenzelm@17112
   418
  in eval text state end;
wenzelm@17112
   419
wenzelm@8234
   420
in
wenzelm@8234
   421
wenzelm@17112
   422
val refine = apply_text true;
wenzelm@17112
   423
val refine_end = apply_text false;
wenzelm@8234
   424
wenzelm@8234
   425
end;
wenzelm@8234
   426
wenzelm@5820
   427
wenzelm@17359
   428
(* refine via sub-proof *)
wenzelm@17359
   429
wenzelm@17359
   430
local
wenzelm@9469
   431
wenzelm@11816
   432
fun refine_tac rule =
wenzelm@18186
   433
  Tactic.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW
wenzelm@18186
   434
    (Tactic.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) =>
wenzelm@18186
   435
      if can Logic.unprotect (Logic.strip_assums_concl goal) then
wenzelm@18186
   436
        Tactic.etac Drule.protectI i
wenzelm@18186
   437
      else all_tac)));
wenzelm@11816
   438
wenzelm@17359
   439
fun refine_goal print_rule inner raw_rule state =
wenzelm@17859
   440
  let val (outer, (_, {statement, using, goal, before_qed, after_qed})) = find_goal state in
wenzelm@17359
   441
    raw_rule
wenzelm@18041
   442
    |> ProofContext.goal_exports inner outer
wenzelm@17359
   443
    |> Seq.maps (fn rule =>
wenzelm@17359
   444
      (print_rule outer rule;
wenzelm@17359
   445
        goal
wenzelm@17359
   446
        |> FINDGOAL (refine_tac rule)
wenzelm@17859
   447
        |> Seq.map (fn goal' =>
wenzelm@17859
   448
          map_goal I (K (statement, using, goal', before_qed, after_qed)) state)))
wenzelm@17359
   449
  end;
wenzelm@6932
   450
wenzelm@17359
   451
in
wenzelm@12146
   452
wenzelm@17359
   453
fun refine_goals print_rule inner raw_rules =
wenzelm@17359
   454
  Seq.EVERY (map (refine_goal print_rule inner) raw_rules);
wenzelm@17359
   455
wenzelm@17359
   456
end;
wenzelm@6932
   457
wenzelm@6932
   458
wenzelm@17359
   459
(* conclude_goal *)
wenzelm@6932
   460
wenzelm@18503
   461
fun conclude_goal state goal propss =
wenzelm@5820
   462
  let
wenzelm@5820
   463
    val ctxt = context_of state;
wenzelm@5820
   464
wenzelm@17359
   465
    val ngoals = Thm.nprems_of goal;
wenzelm@17359
   466
    val _ = conditional (ngoals > 0) (fn () =>
wenzelm@18678
   467
      error (Pretty.string_of (Pretty.chunks
wenzelm@17359
   468
        (pretty_goals_local ctxt "" (true, ! show_main_goal) (! Display.goals_limit) goal @
wenzelm@12085
   469
          [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))));
wenzelm@5820
   470
wenzelm@17359
   471
    val {hyps, thy, ...} = Thm.rep_thm goal;
wenzelm@17450
   472
    val bad_hyps = fold (remove (op aconv)) (ProofContext.assms_of ctxt) hyps;
wenzelm@18678
   473
    val _ = conditional (not (null bad_hyps)) (fn () => error ("Additional hypotheses:\n" ^
wenzelm@18503
   474
        cat_lines (map (ProofContext.string_of_term ctxt) bad_hyps)));
wenzelm@12146
   475
wenzelm@17976
   476
    val th = Goal.conclude goal;
wenzelm@18503
   477
    val _ = conditional (not (Pattern.matches thy
wenzelm@18503
   478
        (Logic.mk_conjunction_list2 propss, Thm.prop_of th))) (fn () =>
wenzelm@18678
   479
      error ("Proved a different theorem:\n" ^ ProofContext.string_of_thm ctxt th));
wenzelm@18503
   480
  in Drule.conj_elim_precise (map length propss) th end;
wenzelm@5820
   481
wenzelm@5820
   482
wenzelm@5820
   483
wenzelm@5820
   484
(*** structured proof commands ***)
wenzelm@5820
   485
wenzelm@17112
   486
(** context elements **)
wenzelm@5820
   487
wenzelm@17112
   488
(* bindings *)
wenzelm@5820
   489
wenzelm@16813
   490
local
wenzelm@16813
   491
wenzelm@17359
   492
fun gen_bind bind args state =
wenzelm@5820
   493
  state
wenzelm@5820
   494
  |> assert_forward
wenzelm@18308
   495
  |> map_context (bind args #> snd)
wenzelm@17359
   496
  |> put_facts NONE;
wenzelm@5820
   497
wenzelm@16813
   498
in
wenzelm@16813
   499
wenzelm@8617
   500
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   501
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   502
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   503
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   504
wenzelm@16813
   505
end;
wenzelm@16813
   506
wenzelm@5820
   507
wenzelm@17359
   508
(* fix *)
wenzelm@9196
   509
wenzelm@12714
   510
local
wenzelm@12714
   511
wenzelm@18670
   512
fun gen_fix add_fixes args =
wenzelm@17359
   513
  assert_forward
wenzelm@18670
   514
  #> map_context (snd o add_fixes (map Syntax.no_syn args))
wenzelm@17359
   515
  #> put_facts NONE;
wenzelm@5820
   516
wenzelm@16813
   517
in
wenzelm@16813
   518
wenzelm@18670
   519
val fix = gen_fix ProofContext.add_fixes;
wenzelm@18670
   520
val fix_i = gen_fix ProofContext.add_fixes_i;
wenzelm@5820
   521
wenzelm@16813
   522
end;
wenzelm@16813
   523
wenzelm@5820
   524
wenzelm@17359
   525
(* assume etc. *)
wenzelm@5820
   526
wenzelm@16813
   527
local
wenzelm@16813
   528
wenzelm@17112
   529
fun gen_assume asm prep_att exp args state =
wenzelm@5820
   530
  state
wenzelm@5820
   531
  |> assert_forward
wenzelm@17112
   532
  |> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args))
wenzelm@17359
   533
  |> these_factss [] |> #2;
wenzelm@6932
   534
wenzelm@16813
   535
in
wenzelm@16813
   536
wenzelm@18728
   537
val assm      = gen_assume ProofContext.add_assms Attrib.attribute;
wenzelm@18670
   538
val assm_i    = gen_assume ProofContext.add_assms_i (K I);
wenzelm@18670
   539
val assume    = assm ProofContext.assume_export;
wenzelm@18670
   540
val assume_i  = assm_i ProofContext.assume_export;
wenzelm@18670
   541
val presume   = assm ProofContext.presume_export;
wenzelm@18670
   542
val presume_i = assm_i ProofContext.presume_export;
wenzelm@5820
   543
wenzelm@16813
   544
end;
wenzelm@16813
   545
wenzelm@7271
   546
wenzelm@17359
   547
(* def *)
wenzelm@11891
   548
wenzelm@16813
   549
local
wenzelm@16813
   550
wenzelm@18308
   551
fun gen_def fix prep_att prep_binds args state =
wenzelm@11891
   552
  let
wenzelm@11891
   553
    val _ = assert_forward state;
wenzelm@17112
   554
    val thy = theory_of state;
wenzelm@11891
   555
wenzelm@18308
   556
    val ((raw_names, raw_atts), (xs, raw_rhss)) = args |> split_list |>> split_list ||> split_list;
wenzelm@18308
   557
    val names = map (fn ("", x) => Thm.def_name x | (name, _) => name) (raw_names ~~ xs);
wenzelm@18308
   558
    val atts = map (map (prep_att thy)) raw_atts;
wenzelm@18308
   559
    val (rhss, state') = state |> map_context_result (prep_binds false (map swap raw_rhss));
wenzelm@18308
   560
    val eqs = ProofContext.mk_def (context_of state') (xs ~~ rhss);
wenzelm@11891
   561
  in
wenzelm@18308
   562
    state'
wenzelm@18670
   563
    |> fix (map (rpair NONE) xs)
wenzelm@18670
   564
    |> assm_i ProofContext.def_export ((names ~~ atts) ~~ map (fn eq => [(eq, ([], []))]) eqs)
wenzelm@11891
   565
  end;
wenzelm@11891
   566
wenzelm@16813
   567
in
wenzelm@16813
   568
wenzelm@18728
   569
val def = gen_def fix Attrib.attribute ProofContext.match_bind;
wenzelm@18308
   570
val def_i = gen_def fix_i (K I) ProofContext.match_bind_i;
wenzelm@11891
   571
wenzelm@16813
   572
end;
wenzelm@16813
   573
wenzelm@11891
   574
wenzelm@8374
   575
wenzelm@17112
   576
(** facts **)
wenzelm@5820
   577
wenzelm@17359
   578
(* chain *)
wenzelm@5820
   579
wenzelm@17359
   580
val chain =
wenzelm@17359
   581
  assert_forward
wenzelm@17359
   582
  #> tap the_facts
wenzelm@17359
   583
  #> enter_chain;
wenzelm@5820
   584
wenzelm@17359
   585
fun chain_facts facts =
wenzelm@17359
   586
  put_facts (SOME facts)
wenzelm@17359
   587
  #> chain;
wenzelm@5820
   588
wenzelm@5820
   589
wenzelm@17359
   590
(* note etc. *)
wenzelm@17112
   591
wenzelm@17166
   592
fun no_binding args = map (pair ("", [])) args;
wenzelm@17112
   593
wenzelm@17112
   594
local
wenzelm@17112
   595
wenzelm@17359
   596
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state =
wenzelm@17112
   597
  state
wenzelm@17112
   598
  |> assert_forward
wenzelm@17112
   599
  |> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args))
wenzelm@17112
   600
  |> these_factss (more_facts state)
wenzelm@17359
   601
  ||> opt_chain
wenzelm@17359
   602
  |> opt_result;
wenzelm@17112
   603
wenzelm@17112
   604
in
wenzelm@17112
   605
wenzelm@18728
   606
val note_thmss = gen_thmss ProofContext.note_thmss (K []) I #2 Attrib.attribute;
wenzelm@17359
   607
val note_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) I #2 (K I);
wenzelm@17112
   608
wenzelm@17112
   609
val from_thmss =
wenzelm@18728
   610
  gen_thmss ProofContext.note_thmss (K []) chain #2 Attrib.attribute o no_binding;
wenzelm@17359
   611
val from_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) chain #2 (K I) o no_binding;
wenzelm@17112
   612
wenzelm@17112
   613
val with_thmss =
wenzelm@18728
   614
  gen_thmss ProofContext.note_thmss the_facts chain #2 Attrib.attribute o no_binding;
wenzelm@17359
   615
val with_thmss_i = gen_thmss ProofContext.note_thmss_i the_facts chain #2 (K I) o no_binding;
wenzelm@17359
   616
wenzelm@18808
   617
val local_results =
wenzelm@18808
   618
  gen_thmss ProofContext.note_thmss_i (K []) I I (K I) o map (apsnd Thm.simple_fact);
wenzelm@18808
   619
fun global_results kind = PureThy.note_thmss_i kind o map (apsnd Thm.simple_fact);
wenzelm@17359
   620
wenzelm@17359
   621
fun get_thmss state srcs = the_facts (note_thmss [(("", []), srcs)] state);
wenzelm@17359
   622
fun simple_note_thms name thms = note_thmss_i [((name, []), [(thms, [])])];
wenzelm@17112
   623
wenzelm@17112
   624
end;
wenzelm@17112
   625
wenzelm@17112
   626
wenzelm@18548
   627
(* using/unfolding *)
wenzelm@17112
   628
wenzelm@17112
   629
local
wenzelm@17112
   630
wenzelm@18548
   631
fun gen_using f g note prep_atts args state =
wenzelm@17112
   632
  state
wenzelm@17112
   633
  |> assert_backward
wenzelm@17166
   634
  |> map_context_result (note (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args)))
wenzelm@17859
   635
  |-> (fn named_facts => map_goal I (fn (statement, using, goal, before_qed, after_qed) =>
wenzelm@18548
   636
    let val ths = List.concat (map snd named_facts)
wenzelm@18548
   637
    in (statement, f ths using, g ths goal, before_qed, after_qed) end));
wenzelm@18548
   638
wenzelm@18548
   639
fun append_using ths using = using @ ths;
wenzelm@18548
   640
fun unfold_using ths = map (Tactic.rewrite_rule ths);
wenzelm@18548
   641
val unfold_goal = Tactic.rewrite_goals_rule;
wenzelm@17112
   642
wenzelm@17112
   643
in
wenzelm@17112
   644
wenzelm@18728
   645
val using = gen_using append_using (K I) ProofContext.note_thmss Attrib.attribute;
wenzelm@18548
   646
val using_i = gen_using append_using (K I) ProofContext.note_thmss_i (K I);
wenzelm@18728
   647
val unfolding = gen_using unfold_using unfold_goal ProofContext.note_thmss Attrib.attribute;
wenzelm@18548
   648
val unfolding_i = gen_using unfold_using unfold_goal ProofContext.note_thmss_i (K I);
wenzelm@17112
   649
wenzelm@17112
   650
end;
wenzelm@17112
   651
wenzelm@17112
   652
wenzelm@17112
   653
(* case *)
wenzelm@17112
   654
wenzelm@17112
   655
local
wenzelm@17112
   656
wenzelm@17112
   657
fun gen_invoke_case prep_att (name, xs, raw_atts) state =
wenzelm@17112
   658
  let
wenzelm@17112
   659
    val atts = map (prep_att (theory_of state)) raw_atts;
wenzelm@18607
   660
    val (asms, state') =
wenzelm@17112
   661
      map_context_result (ProofContext.apply_case (get_case state name xs)) state;
wenzelm@18607
   662
    val assumptions = asms |> map (fn (a, ts) => ((a, atts), map (rpair ([], [])) ts));
wenzelm@17112
   663
  in
wenzelm@17112
   664
    state'
wenzelm@17359
   665
    |> map_context (ProofContext.qualified_names #> ProofContext.no_base_names)
wenzelm@17112
   666
    |> assume_i assumptions
wenzelm@17976
   667
    |> add_binds_i AutoBind.no_facts
wenzelm@17112
   668
    |> map_context (ProofContext.restore_naming (context_of state))
wenzelm@17112
   669
    |> `the_facts |-> simple_note_thms name
wenzelm@17112
   670
  end;
wenzelm@17112
   671
wenzelm@17112
   672
in
wenzelm@17112
   673
wenzelm@18728
   674
val invoke_case = gen_invoke_case Attrib.attribute;
wenzelm@17112
   675
val invoke_case_i = gen_invoke_case (K I);
wenzelm@17112
   676
wenzelm@17112
   677
end;
wenzelm@17112
   678
wenzelm@17112
   679
wenzelm@17112
   680
wenzelm@17359
   681
(** proof structure **)
wenzelm@17359
   682
wenzelm@17359
   683
(* blocks *)
wenzelm@17359
   684
wenzelm@17359
   685
val begin_block =
wenzelm@17359
   686
  assert_forward
wenzelm@17359
   687
  #> open_block
wenzelm@17359
   688
  #> put_goal NONE
wenzelm@17359
   689
  #> open_block;
wenzelm@17359
   690
wenzelm@17359
   691
val next_block =
wenzelm@17359
   692
  assert_forward
wenzelm@17359
   693
  #> close_block
wenzelm@17359
   694
  #> open_block
wenzelm@17359
   695
  #> put_goal NONE
wenzelm@17359
   696
  #> put_facts NONE;
wenzelm@17359
   697
wenzelm@17359
   698
fun end_block state =
wenzelm@17359
   699
  state
wenzelm@17359
   700
  |> assert_forward
wenzelm@17359
   701
  |> close_block
wenzelm@17359
   702
  |> assert_current_goal false
wenzelm@17359
   703
  |> close_block
wenzelm@17359
   704
  |> export_facts state;
wenzelm@17359
   705
wenzelm@17359
   706
wenzelm@17359
   707
(* sub-proofs *)
wenzelm@17359
   708
wenzelm@17359
   709
fun proof opt_text =
wenzelm@17359
   710
  assert_backward
wenzelm@17859
   711
  #> refine (the_default Method.default_text opt_text)
wenzelm@17359
   712
  #> Seq.map (using_facts [] #> enter_forward);
wenzelm@17359
   713
wenzelm@17359
   714
fun end_proof bot txt =
wenzelm@17359
   715
  assert_forward
wenzelm@17359
   716
  #> assert_bottom bot
wenzelm@17359
   717
  #> close_block
wenzelm@17359
   718
  #> assert_current_goal true
wenzelm@17359
   719
  #> using_facts []
wenzelm@17859
   720
  #> `before_qed #-> (refine o the_default Method.succeed_text)
wenzelm@17859
   721
  #> Seq.maps (refine (Method.finish_text txt));
wenzelm@17359
   722
wenzelm@17359
   723
wenzelm@17359
   724
(* unstructured refinement *)
wenzelm@17359
   725
wenzelm@17359
   726
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i)));
wenzelm@17359
   727
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i)));
wenzelm@17359
   728
wenzelm@17359
   729
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
wenzelm@17359
   730
fun apply_end text = assert_forward #> refine_end text;
wenzelm@17359
   731
wenzelm@17359
   732
wenzelm@17359
   733
wenzelm@17112
   734
(** goals **)
wenzelm@17112
   735
wenzelm@17359
   736
(* goal names *)
wenzelm@17359
   737
wenzelm@17359
   738
fun prep_names prep_att stmt =
wenzelm@17359
   739
  let
wenzelm@17359
   740
    val (names_attss, propp) = split_list (Attrib.map_specs prep_att stmt);
wenzelm@17359
   741
    val (names, attss) = split_list names_attss;
wenzelm@17359
   742
  in ((names, attss), propp) end;
wenzelm@5820
   743
wenzelm@17359
   744
fun goal_names target name names =
wenzelm@17450
   745
  (case target of NONE => "" | SOME "" => "" | SOME loc => " (in " ^ loc ^ ")") ^
wenzelm@17359
   746
  (if name = "" then "" else " " ^ name) ^
wenzelm@17359
   747
  (case filter_out (equal "") names of [] => ""
wenzelm@17359
   748
  | nms => " " ^ enclose "(" ")" (space_implode " and " (Library.take (7, nms) @
wenzelm@17359
   749
      (if length nms > 7 then ["..."] else []))));
wenzelm@17359
   750
wenzelm@16813
   751
wenzelm@17359
   752
(* generic goals *)
wenzelm@17359
   753
wenzelm@17359
   754
fun check_tvars props state =
wenzelm@17359
   755
  (case fold Term.add_tvars props [] of [] => ()
wenzelm@18678
   756
  | tvars => error ("Goal statement contains illegal schematic type variable(s): " ^
wenzelm@18678
   757
      commas (map (ProofContext.string_of_typ (context_of state) o TVar) tvars)));
wenzelm@8991
   758
wenzelm@17359
   759
fun check_vars props state =
wenzelm@17359
   760
  (case fold Term.add_vars props [] of [] => ()
wenzelm@17359
   761
  | vars => warning ("Goal statement contains unbound schematic variable(s): " ^
wenzelm@17359
   762
      commas (map (ProofContext.string_of_term (context_of state) o Var) vars)));
wenzelm@17359
   763
wenzelm@17859
   764
fun generic_goal prepp kind before_qed after_qed raw_propp state =
wenzelm@5820
   765
  let
wenzelm@17359
   766
    val thy = theory_of state;
wenzelm@17359
   767
    val chaining = can assert_chain state;
wenzelm@17359
   768
wenzelm@17359
   769
    val ((propss, after_ctxt), goal_state) =
wenzelm@5936
   770
      state
wenzelm@5936
   771
      |> assert_forward_or_chain
wenzelm@5936
   772
      |> enter_forward
wenzelm@17359
   773
      |> open_block
wenzelm@17859
   774
      |> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp)));
wenzelm@18503
   775
    val props = List.concat propss;
wenzelm@15703
   776
wenzelm@18503
   777
    val goal = Goal.init (Thm.cterm_of thy (Logic.mk_conjunction_list2 propss));
wenzelm@18124
   778
    val after_qed' = after_qed |>> (fn after_local =>
wenzelm@18124
   779
      fn results => map_context after_ctxt #> after_local results);
wenzelm@5820
   780
  in
wenzelm@17359
   781
    goal_state
wenzelm@17359
   782
    |> tap (check_tvars props)
wenzelm@17359
   783
    |> tap (check_vars props)
wenzelm@18670
   784
    |> map_context (ProofContext.set_body true)
wenzelm@17859
   785
    |> put_goal (SOME (make_goal ((kind, propss), [], goal, before_qed, after_qed')))
wenzelm@18475
   786
    |> map_context (ProofContext.add_cases false (AutoBind.cases thy props))
wenzelm@17359
   787
    |> map_context (ProofContext.auto_bind_goal props)
wenzelm@17359
   788
    |> K chaining ? (`the_facts #-> using_facts)
wenzelm@17359
   789
    |> put_facts NONE
wenzelm@17359
   790
    |> open_block
wenzelm@17359
   791
    |> put_goal NONE
wenzelm@5820
   792
    |> enter_backward
wenzelm@17450
   793
    |> K (null props) ? (refine (Method.Basic Method.assumption) #> Seq.hd)
wenzelm@5820
   794
  end;
wenzelm@5820
   795
wenzelm@17359
   796
fun generic_qed state =
wenzelm@12503
   797
  let
wenzelm@18548
   798
    val (goal_ctxt, {statement = (_, stmt), using = _, goal, before_qed = _, after_qed}) =
wenzelm@17859
   799
      current_goal state;
wenzelm@8617
   800
    val outer_state = state |> close_block;
wenzelm@8617
   801
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   802
wenzelm@18503
   803
    val props =
wenzelm@18503
   804
      List.concat stmt
wenzelm@18503
   805
      |> ProofContext.generalize goal_ctxt outer_ctxt;
wenzelm@17359
   806
    val results =
haftmann@18450
   807
      stmt
wenzelm@18503
   808
      |> conclude_goal state goal
haftmann@18450
   809
      |> (Seq.map_list o Seq.map_list) (ProofContext.exports goal_ctxt outer_ctxt);
wenzelm@17359
   810
  in
wenzelm@17359
   811
    outer_state
wenzelm@17359
   812
    |> map_context (ProofContext.auto_bind_facts props)
wenzelm@18124
   813
    |> pair (after_qed, results)
wenzelm@17359
   814
  end;
wenzelm@17359
   815
wenzelm@9469
   816
wenzelm@17359
   817
(* local goals *)
wenzelm@17359
   818
wenzelm@17859
   819
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state =
wenzelm@17359
   820
  let
wenzelm@17359
   821
    val ((names, attss), propp) = prep_names (prep_att (theory_of state)) stmt;
wenzelm@17359
   822
wenzelm@18124
   823
    fun after_qed' results =
wenzelm@18808
   824
      local_results ((names ~~ attss) ~~ results)
wenzelm@17359
   825
      #-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
wenzelm@18124
   826
      #> after_qed results;
wenzelm@5820
   827
  in
wenzelm@17359
   828
    state
wenzelm@18124
   829
    |> generic_goal prepp (kind ^ goal_names NONE "" names) before_qed (after_qed', K I) propp
wenzelm@17359
   830
    |> warn_extra_tfrees state
wenzelm@5820
   831
  end;
wenzelm@5820
   832
wenzelm@17359
   833
fun local_qed txt =
wenzelm@17359
   834
  end_proof false txt
wenzelm@17359
   835
  #> Seq.map generic_qed
wenzelm@18124
   836
  #> Seq.maps (uncurry (fn ((after_qed, _), results) => Seq.lifts after_qed results));
wenzelm@5820
   837
wenzelm@5820
   838
wenzelm@17359
   839
(* global goals *)
wenzelm@17359
   840
wenzelm@17359
   841
fun global_goal print_results prep_att prepp
wenzelm@17859
   842
    kind before_qed after_qed target (name, raw_atts) stmt ctxt =
wenzelm@17359
   843
  let
wenzelm@17359
   844
    val thy = ProofContext.theory_of ctxt;
wenzelm@17359
   845
    val thy_ctxt = ProofContext.init thy;
wenzelm@17359
   846
wenzelm@17359
   847
    val atts = map (prep_att thy) raw_atts;
wenzelm@17359
   848
    val ((names, attss), propp) = prep_names (prep_att thy) stmt;
wenzelm@17359
   849
wenzelm@17450
   850
    fun store_results prfx res =
wenzelm@17450
   851
      K (prfx <> "") ? (Sign.add_path prfx #> Sign.no_base_names)
wenzelm@17450
   852
      #> global_results kind ((names ~~ attss) ~~ res)
wenzelm@17359
   853
      #-> (fn res' =>
wenzelm@17359
   854
        (print_results thy_ctxt ((kind, name), res') : unit;
wenzelm@17359
   855
          #2 o global_results kind [((name, atts), List.concat (map #2 res'))]))
wenzelm@17450
   856
      #> Sign.restore_naming thy;
wenzelm@17359
   857
wenzelm@18124
   858
    fun after_qed' results =
wenzelm@17450
   859
      (case target of NONE => I
wenzelm@17450
   860
      | SOME prfx => store_results (NameSpace.base prfx)
wenzelm@18784
   861
          (map (map (ProofContext.export_standard ctxt thy_ctxt
wenzelm@17450
   862
            #> Drule.strip_shyps_warning)) results))
wenzelm@18124
   863
      #> after_qed results;
wenzelm@17359
   864
  in
wenzelm@17359
   865
    init ctxt
wenzelm@18670
   866
    |> generic_goal (prepp #> ProofContext.auto_fixes) (kind ^ goal_names target name names)
wenzelm@18124
   867
      before_qed (K Seq.single, after_qed') propp
wenzelm@17359
   868
  end;
wenzelm@12065
   869
wenzelm@18678
   870
fun check_result msg sq =
wenzelm@17112
   871
  (case Seq.pull sq of
wenzelm@18678
   872
    NONE => error msg
wenzelm@17112
   873
  | SOME res => Seq.cons res);
wenzelm@17112
   874
wenzelm@17359
   875
fun global_qeds txt =
wenzelm@17359
   876
  end_proof true txt
wenzelm@17359
   877
  #> Seq.map generic_qed
wenzelm@18124
   878
  #> Seq.maps (fn (((_, after_qed), results), state) =>
wenzelm@18124
   879
    Seq.lift after_qed results (theory_of state)
wenzelm@18808
   880
    |> Seq.map (pair (context_of state)))
wenzelm@17112
   881
  |> Seq.DETERM;   (*backtracking may destroy theory!*)
wenzelm@17112
   882
wenzelm@18678
   883
fun global_qed txt =
wenzelm@18678
   884
  global_qeds txt
wenzelm@18678
   885
  #> check_result "Failed to finish proof"
wenzelm@18678
   886
  #> Seq.hd;
wenzelm@12959
   887
wenzelm@5820
   888
wenzelm@17359
   889
(* concluding steps *)
wenzelm@17112
   890
wenzelm@17359
   891
fun local_terminal_proof (text, opt_text) =
wenzelm@17359
   892
  proof (SOME text) #> Seq.maps (local_qed (opt_text, true));
wenzelm@17112
   893
wenzelm@17112
   894
val local_default_proof = local_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   895
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE);
wenzelm@17359
   896
val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false));
wenzelm@17359
   897
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE);
wenzelm@17112
   898
wenzelm@18678
   899
fun global_term_proof immed (text, opt_text) =
wenzelm@18678
   900
  proof (SOME text)
wenzelm@18678
   901
  #> check_result "Terminal proof method failed"
wenzelm@18678
   902
  #> Seq.maps (global_qeds (opt_text, immed))
wenzelm@18678
   903
  #> check_result "Failed to finish proof (after successful terminal method)"
wenzelm@18678
   904
  #> Seq.hd;
wenzelm@17112
   905
wenzelm@17112
   906
val global_terminal_proof = global_term_proof true;
wenzelm@17112
   907
val global_default_proof = global_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   908
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE);
wenzelm@17112
   909
val global_done_proof = global_term_proof false (Method.done_text, NONE);
wenzelm@17359
   910
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE);
wenzelm@5820
   911
wenzelm@6896
   912
wenzelm@17359
   913
(* common goal statements *)
wenzelm@17359
   914
wenzelm@17359
   915
local
wenzelm@17359
   916
wenzelm@17859
   917
fun gen_have prep_att prepp before_qed after_qed stmt int =
wenzelm@17859
   918
  local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt;
wenzelm@6896
   919
wenzelm@17859
   920
fun gen_show prep_att prepp before_qed after_qed stmt int state =
wenzelm@17359
   921
  let
wenzelm@17359
   922
    val testing = ref false;
wenzelm@17359
   923
    val rule = ref (NONE: thm option);
wenzelm@17359
   924
    fun fail_msg ctxt =
wenzelm@17359
   925
      "Local statement will fail to solve any pending goal" ::
wenzelm@17359
   926
      (case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th])
wenzelm@17359
   927
      |> cat_lines;
wenzelm@6896
   928
wenzelm@17359
   929
    fun print_results ctxt res =
wenzelm@17359
   930
      if ! testing then () else ProofDisplay.print_results int ctxt res;
wenzelm@17359
   931
    fun print_rule ctxt th =
wenzelm@17359
   932
      if ! testing then rule := SOME th
wenzelm@17359
   933
      else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th)
wenzelm@17359
   934
      else ();
wenzelm@17359
   935
    val test_proof =
wenzelm@17359
   936
      (Seq.pull oo local_skip_proof) true
wenzelm@17359
   937
      |> setmp testing true
wenzelm@17359
   938
      |> setmp proofs 0
wenzelm@17359
   939
      |> capture;
wenzelm@6896
   940
wenzelm@18124
   941
    fun after_qed' results =
wenzelm@17359
   942
      refine_goals print_rule (context_of state) (List.concat results)
wenzelm@18124
   943
      #> Seq.maps (after_qed results);
wenzelm@17359
   944
  in
wenzelm@17359
   945
    state
wenzelm@17859
   946
    |> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt
wenzelm@17359
   947
    |> K int ? (fn goal_state =>
wenzelm@17359
   948
      (case test_proof goal_state of
wenzelm@17359
   949
        Result (SOME _) => goal_state
wenzelm@18678
   950
      | Result NONE => error (fail_msg (context_of goal_state))
wenzelm@17359
   951
      | Exn Interrupt => raise Interrupt
wenzelm@17359
   952
      | Exn exn => raise EXCEPTION (exn, fail_msg (context_of goal_state))))
wenzelm@17359
   953
  end;
wenzelm@17359
   954
wenzelm@17859
   955
fun gen_theorem prep_att prepp kind before_qed after_qed target a =
wenzelm@17859
   956
  global_goal ProofDisplay.present_results prep_att prepp kind before_qed after_qed target a;
wenzelm@17359
   957
wenzelm@17359
   958
in
wenzelm@17359
   959
wenzelm@18728
   960
val have = gen_have Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   961
val have_i = gen_have (K I) ProofContext.bind_propp_i;
wenzelm@18728
   962
val show = gen_show Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   963
val show_i = gen_show (K I) ProofContext.bind_propp_i;
wenzelm@18728
   964
val theorem = gen_theorem Attrib.attribute ProofContext.bind_propp_schematic;
wenzelm@17359
   965
val theorem_i = gen_theorem (K I) ProofContext.bind_propp_schematic_i;
wenzelm@6896
   966
wenzelm@5820
   967
end;
wenzelm@17359
   968
wenzelm@17359
   969
end;