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