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