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