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