src/Pure/Isar/proof.ML
author wenzelm
Tue Jun 09 11:51:05 2015 +0200 (2015-06-09)
changeset 60401 16cf5090d3a6
parent 60388 0c9d2a4f589d
child 60402 2cfd1ead74c3
permissions -rw-r--r--
clarified term bindings;
wenzelm@5820
     1
(*  Title:      Pure/Isar/proof.ML
wenzelm@5820
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5820
     3
wenzelm@19000
     4
The Isar/VM proof language interpreter: maintains a structured flow of
wenzelm@19000
     5
context elements, goals, refinements, and facts.
wenzelm@5820
     6
*)
wenzelm@5820
     7
wenzelm@5820
     8
signature PROOF =
wenzelm@5820
     9
sig
wenzelm@33031
    10
  type context = Proof.context
wenzelm@23639
    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@13377
    18
  val map_context: (context -> context) -> state -> state
bulwahn@40642
    19
  val map_context_result : (context -> 'a * context) -> state -> 'a * state
wenzelm@28278
    20
  val map_contexts: (context -> context) -> state -> state
wenzelm@37949
    21
  val propagate_ml_env: state -> state
wenzelm@26251
    22
  val put_thms: bool -> string * thm list option -> state -> state
wenzelm@6091
    23
  val the_facts: state -> thm list
wenzelm@9469
    24
  val the_fact: state -> thm
wenzelm@47068
    25
  val set_facts: thm list -> state -> state
wenzelm@47068
    26
  val reset_facts: 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@60369
    33
  val enter_chain: state -> state
wenzelm@60369
    34
  val enter_backward: state -> state
wenzelm@58798
    35
  val has_bottom_goal: state -> bool
wenzelm@12423
    36
  val pretty_state: int -> 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@33288
    41
  val raw_goal: state -> {context: context, facts: thm list, goal: thm}
wenzelm@33288
    42
  val goal: state -> {context: context, facts: thm list, goal: thm}
wenzelm@33288
    43
  val simple_goal: state -> {context: context, goal: thm}
wenzelm@38721
    44
  val status_markup: state -> Markup.T
wenzelm@36323
    45
  val let_bind: (term list * term) list -> state -> state
wenzelm@36323
    46
  val let_bind_cmd: (string list * string) list -> state -> state
wenzelm@36505
    47
  val write: Syntax.mode -> (term * mixfix) list -> state -> state
wenzelm@36505
    48
  val write_cmd: Syntax.mode -> (string * mixfix) list -> state -> state
wenzelm@36323
    49
  val fix: (binding * typ option * mixfix) list -> state -> state
wenzelm@36323
    50
  val fix_cmd: (binding * string option * mixfix) list -> state -> state
wenzelm@20224
    51
  val assm: Assumption.export ->
wenzelm@36323
    52
    (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@36323
    53
  val assm_cmd: Assumption.export ->
wenzelm@28084
    54
    (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@36323
    55
  val assume: (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@36323
    56
  val assume_cmd: (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@36323
    57
  val presume: (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@36323
    58
  val presume_cmd: (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@36323
    59
  val def: (Thm.binding * ((binding * mixfix) * (term * term list))) list -> state -> state
wenzelm@36323
    60
  val def_cmd: (Attrib.binding * ((binding * mixfix) * (string * string list))) list -> state -> state
wenzelm@17359
    61
  val chain: state -> state
wenzelm@17359
    62
  val chain_facts: thm list -> state -> state
wenzelm@36323
    63
  val note_thmss: (Thm.binding * (thm list * attribute list) list) list -> state -> state
wenzelm@58011
    64
  val note_thmss_cmd: (Attrib.binding * (Facts.ref * Token.src list) list) list -> state -> state
wenzelm@36323
    65
  val from_thmss: ((thm list * attribute list) list) list -> state -> state
wenzelm@58011
    66
  val from_thmss_cmd: ((Facts.ref * Token.src list) list) list -> state -> state
wenzelm@36323
    67
  val with_thmss: ((thm list * attribute list) list) list -> state -> state
wenzelm@58011
    68
  val with_thmss_cmd: ((Facts.ref * Token.src list) list) list -> state -> state
wenzelm@60371
    69
  val supply: (Thm.binding * (thm list * attribute list) list) list -> state -> state
wenzelm@60371
    70
  val supply_cmd: (Attrib.binding * (Facts.ref * Token.src list) list) list -> state -> state
wenzelm@36323
    71
  val using: ((thm list * attribute list) list) list -> state -> state
wenzelm@58011
    72
  val using_cmd: ((Facts.ref * Token.src list) list) list -> state -> state
wenzelm@36323
    73
  val unfolding: ((thm list * attribute list) list) list -> state -> state
wenzelm@58011
    74
  val unfolding_cmd: ((Facts.ref * Token.src list) list) list -> state -> state
wenzelm@53378
    75
  val invoke_case: (string * Position.T) * binding option list * attribute list ->
wenzelm@53378
    76
    state -> state
wenzelm@58011
    77
  val invoke_case_cmd: (string * Position.T) * binding option list * Token.src list ->
wenzelm@53378
    78
    state -> state
wenzelm@17359
    79
  val begin_block: state -> state
wenzelm@17359
    80
  val next_block: state -> state
wenzelm@20309
    81
  val end_block: state -> state
wenzelm@49042
    82
  val begin_notepad: context -> state
wenzelm@49042
    83
  val end_notepad: state -> context
wenzelm@17112
    84
  val proof: Method.text option -> state -> state Seq.seq
wenzelm@49889
    85
  val proof_results: Method.text_range option -> state -> state Seq.result Seq.seq
wenzelm@49865
    86
  val defer: int -> state -> state
wenzelm@49865
    87
  val prefer: int -> state -> state
wenzelm@17112
    88
  val apply: Method.text -> state -> state Seq.seq
wenzelm@17112
    89
  val apply_end: Method.text -> state -> state Seq.seq
wenzelm@49889
    90
  val apply_results: Method.text_range -> state -> state Seq.result Seq.seq
wenzelm@49889
    91
  val apply_end_results: Method.text_range -> state -> state Seq.result Seq.seq
wenzelm@17359
    92
  val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
wenzelm@49042
    93
    (context -> 'a -> attribute) ->
wenzelm@60388
    94
    (context -> 'b list -> (term list list * (indexname * term) list)) ->
wenzelm@29383
    95
    string -> Method.text option -> (thm list list -> state -> state) ->
haftmann@29581
    96
    ((binding * 'a list) * 'b) list -> state -> state
wenzelm@49889
    97
  val local_qed: Method.text_range option * bool -> state -> state
wenzelm@21442
    98
  val theorem: Method.text option -> (thm list list -> context -> context) ->
wenzelm@36323
    99
    (term * term list) list list -> context -> state
wenzelm@36323
   100
  val theorem_cmd: Method.text option -> (thm list list -> context -> context) ->
wenzelm@21362
   101
    (string * string list) list list -> context -> state
wenzelm@49889
   102
  val global_qed: Method.text_range option * bool -> state -> context
wenzelm@49889
   103
  val local_terminal_proof: Method.text_range * Method.text_range option -> state -> state
wenzelm@29383
   104
  val local_default_proof: state -> state
wenzelm@29383
   105
  val local_immediate_proof: state -> state
wenzelm@29383
   106
  val local_skip_proof: bool -> state -> state
wenzelm@29383
   107
  val local_done_proof: state -> state
wenzelm@49889
   108
  val global_terminal_proof: Method.text_range * Method.text_range option -> state -> context
wenzelm@20363
   109
  val global_default_proof: state -> context
wenzelm@20363
   110
  val global_immediate_proof: state -> context
wenzelm@29383
   111
  val global_skip_proof: bool -> state -> context
wenzelm@20363
   112
  val global_done_proof: state -> context
wenzelm@29383
   113
  val have: Method.text option -> (thm list list -> state -> state) ->
wenzelm@36323
   114
    (Thm.binding * (term * term list) list) list -> bool -> state -> state
wenzelm@36323
   115
  val have_cmd: Method.text option -> (thm list list -> state -> state) ->
wenzelm@28084
   116
    (Attrib.binding * (string * string list) list) list -> bool -> state -> state
wenzelm@29383
   117
  val show: Method.text option -> (thm list list -> state -> state) ->
wenzelm@36323
   118
    (Thm.binding * (term * term list) list) list -> bool -> state -> state
wenzelm@36323
   119
  val show_cmd: Method.text option -> (thm list list -> state -> state) ->
wenzelm@28084
   120
    (Attrib.binding * (string * string list) list) list -> bool -> state -> state
wenzelm@29385
   121
  val schematic_goal: state -> bool
wenzelm@51226
   122
  val is_relevant: state -> bool
wenzelm@51318
   123
  val future_proof: (state -> ('a * context) future) -> state -> 'a future * state
wenzelm@49889
   124
  val local_future_terminal_proof: Method.text_range * Method.text_range option -> bool ->
wenzelm@49866
   125
    state -> state
wenzelm@49889
   126
  val global_future_terminal_proof: Method.text_range * Method.text_range option -> bool ->
wenzelm@49866
   127
    state -> context
wenzelm@5820
   128
end;
wenzelm@5820
   129
wenzelm@13377
   130
structure Proof: PROOF =
wenzelm@5820
   131
struct
wenzelm@5820
   132
wenzelm@33031
   133
type context = Proof.context;
wenzelm@17112
   134
type method = Method.method;
wenzelm@16813
   135
wenzelm@5820
   136
wenzelm@5820
   137
(** proof state **)
wenzelm@5820
   138
wenzelm@17359
   139
(* datatype state *)
wenzelm@5820
   140
wenzelm@17112
   141
datatype mode = Forward | Chain | Backward;
wenzelm@5820
   142
wenzelm@17359
   143
datatype state =
wenzelm@17359
   144
  State of node Stack.T
wenzelm@17359
   145
and node =
wenzelm@7176
   146
  Node of
wenzelm@7176
   147
   {context: context,
wenzelm@7176
   148
    facts: thm list option,
wenzelm@7176
   149
    mode: mode,
wenzelm@17359
   150
    goal: goal option}
wenzelm@17359
   151
and goal =
wenzelm@17359
   152
  Goal of
wenzelm@29346
   153
   {statement: (string * Position.T) * term list list * term,
wenzelm@28410
   154
      (*goal kind and statement (starting with vars), initial proposition*)
wenzelm@25958
   155
    using: thm list,                      (*goal facts*)
wenzelm@25958
   156
    goal: thm,                            (*subgoals ==> statement*)
wenzelm@17859
   157
    before_qed: Method.text option,
wenzelm@18124
   158
    after_qed:
wenzelm@29383
   159
      (thm list list -> state -> state) *
wenzelm@20363
   160
      (thm list list -> context -> context)};
wenzelm@17359
   161
wenzelm@58892
   162
fun make_goal (statement, using, goal, before_qed, after_qed) =
wenzelm@58892
   163
  Goal {statement = statement, using = using, goal = goal,
wenzelm@17859
   164
    before_qed = before_qed, after_qed = after_qed};
wenzelm@5820
   165
wenzelm@7176
   166
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   167
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   168
wenzelm@17359
   169
fun map_node f (Node {context, facts, mode, goal}) =
wenzelm@17359
   170
  make_node (f (context, facts, mode, goal));
wenzelm@5820
   171
wenzelm@21727
   172
val init_context =
wenzelm@42360
   173
  Proof_Context.set_stmt true #>
wenzelm@47005
   174
  Proof_Context.map_naming (K Name_Space.local_naming);
wenzelm@21727
   175
wenzelm@21466
   176
fun init ctxt =
wenzelm@21727
   177
  State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE)));
wenzelm@5820
   178
wenzelm@58796
   179
fun top (State stack) = Stack.top stack |> (fn Node node => node);
wenzelm@58796
   180
fun map_top f (State stack) = State (Stack.map_top (map_node f) stack);
wenzelm@58796
   181
fun map_all f (State stack) = State (Stack.map_all (map_node f) stack);
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@58796
   189
fun open_block (State stack) = State (Stack.push stack);
wenzelm@17359
   190
wenzelm@58796
   191
fun close_block (State stack) = State (Stack.pop stack)
wenzelm@47060
   192
  handle List.Empty => error "Unbalanced block parentheses";
wenzelm@17359
   193
wenzelm@58796
   194
fun level (State stack) = Stack.level stack;
wenzelm@17359
   195
wenzelm@17359
   196
fun assert_bottom b state =
wenzelm@47065
   197
  let val b' = level state <= 2 in
wenzelm@47065
   198
    if b andalso not b' then error "Not at bottom of proof"
wenzelm@47065
   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@49011
   206
val context_of = #context o top;
wenzelm@42360
   207
val theory_of = Proof_Context.theory_of o context_of;
wenzelm@5820
   208
wenzelm@47431
   209
fun map_node_context f =
wenzelm@47431
   210
  map_node (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@47431
   211
wenzelm@17359
   212
fun map_context f =
wenzelm@49011
   213
  map_top (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   214
wenzelm@17359
   215
fun map_context_result f state =
wenzelm@17859
   216
  f (context_of state) ||> (fn ctxt => map_context (K ctxt) state);
wenzelm@5820
   217
wenzelm@28278
   218
fun map_contexts f = map_all (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@28278
   219
wenzelm@37949
   220
fun propagate_ml_env state = map_contexts
wenzelm@37949
   221
  (Context.proof_map (ML_Env.inherit (Context.Proof (context_of state)))) state;
wenzelm@37949
   222
wenzelm@42360
   223
val put_thms = map_context oo Proof_Context.put_thms;
wenzelm@5820
   224
wenzelm@5820
   225
wenzelm@5820
   226
(* facts *)
wenzelm@5820
   227
wenzelm@49011
   228
val get_facts = #facts o top;
wenzelm@17359
   229
wenzelm@17359
   230
fun the_facts state =
wenzelm@17359
   231
  (case get_facts state of SOME facts => facts
wenzelm@18678
   232
  | NONE => error "No current facts available");
wenzelm@5820
   233
wenzelm@9469
   234
fun the_fact state =
wenzelm@17359
   235
  (case the_facts state of [thm] => thm
wenzelm@18678
   236
  | _ => error "Single theorem expected");
wenzelm@7605
   237
wenzelm@17359
   238
fun put_facts facts =
wenzelm@49011
   239
  map_top (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #>
wenzelm@33386
   240
  put_thms true (Auto_Bind.thisN, facts);
wenzelm@5820
   241
wenzelm@47068
   242
val set_facts = put_facts o SOME;
wenzelm@47068
   243
val reset_facts = put_facts NONE;
wenzelm@47068
   244
wenzelm@17359
   245
fun these_factss more_facts (named_factss, state) =
wenzelm@47068
   246
  (named_factss, state |> set_facts (maps snd named_factss @ more_facts));
wenzelm@5820
   247
wenzelm@17359
   248
fun export_facts inner outer =
wenzelm@17359
   249
  (case get_facts inner of
wenzelm@47068
   250
    NONE => reset_facts outer
wenzelm@17359
   251
  | SOME thms =>
wenzelm@17359
   252
      thms
wenzelm@42360
   253
      |> Proof_Context.export (context_of inner) (context_of outer)
wenzelm@47068
   254
      |> (fn ths => set_facts ths outer));
wenzelm@5820
   255
wenzelm@5820
   256
wenzelm@5820
   257
(* mode *)
wenzelm@5820
   258
wenzelm@49011
   259
val get_mode = #mode o top;
wenzelm@49011
   260
fun put_mode mode = map_top (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   261
wenzelm@17359
   262
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove");
wenzelm@5820
   263
wenzelm@5820
   264
fun assert_mode pred state =
wenzelm@5820
   265
  let val mode = get_mode state in
wenzelm@5820
   266
    if pred mode then state
wenzelm@18678
   267
    else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode")
wenzelm@5820
   268
  end;
wenzelm@5820
   269
wenzelm@19308
   270
val assert_forward = assert_mode (fn mode => mode = Forward);
wenzelm@19308
   271
val assert_chain = assert_mode (fn mode => mode = Chain);
wenzelm@19308
   272
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain);
wenzelm@19308
   273
val assert_backward = assert_mode (fn mode => mode = Backward);
wenzelm@19308
   274
val assert_no_chain = assert_mode (fn mode => mode <> Chain);
wenzelm@5820
   275
wenzelm@17359
   276
val enter_forward = put_mode Forward;
wenzelm@17359
   277
val enter_chain = put_mode Chain;
wenzelm@17359
   278
val enter_backward = put_mode Backward;
wenzelm@5820
   279
wenzelm@17359
   280
wenzelm@17359
   281
(* current goal *)
wenzelm@17359
   282
wenzelm@17359
   283
fun current_goal state =
wenzelm@49011
   284
  (case top state of
wenzelm@17359
   285
    {context, goal = SOME (Goal goal), ...} => (context, goal)
wenzelm@47065
   286
  | _ => error "No current goal");
wenzelm@5820
   287
wenzelm@17359
   288
fun assert_current_goal g state =
wenzelm@17359
   289
  let val g' = can current_goal state in
wenzelm@47065
   290
    if g andalso not g' then error "No goal in this block"
wenzelm@47065
   291
    else if not g andalso g' then error "Goal present in this block"
wenzelm@17359
   292
    else state
wenzelm@17359
   293
  end;
wenzelm@6776
   294
wenzelm@49011
   295
fun put_goal goal = map_top (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal));
wenzelm@17359
   296
wenzelm@47068
   297
val set_goal = put_goal o SOME;
wenzelm@47068
   298
val reset_goal = put_goal NONE;
wenzelm@47068
   299
wenzelm@17859
   300
val before_qed = #before_qed o #2 o current_goal;
wenzelm@17859
   301
wenzelm@17359
   302
wenzelm@58798
   303
(* bottom goal *)
wenzelm@58798
   304
wenzelm@58798
   305
fun has_bottom_goal (State stack) =
wenzelm@58798
   306
  let
wenzelm@58798
   307
    fun bottom [Node {goal = SOME _, ...}, Node {goal = NONE, ...}] = true
wenzelm@58798
   308
      | bottom [Node {goal, ...}] = is_some goal
wenzelm@58798
   309
      | bottom [] = false
wenzelm@58798
   310
      | bottom (_ :: rest) = bottom rest;
wenzelm@58798
   311
  in bottom (op :: (Stack.dest stack)) end;
wenzelm@58798
   312
wenzelm@58798
   313
wenzelm@17359
   314
(* nested goal *)
wenzelm@5820
   315
wenzelm@58797
   316
fun map_goal f g h (State stack) =
wenzelm@58797
   317
  (case Stack.dest stack of
wenzelm@58797
   318
    (Node {context, facts, mode, goal = SOME goal}, node :: nodes) =>
wenzelm@17359
   319
      let
wenzelm@58892
   320
        val Goal {statement, using, goal, before_qed, after_qed} = goal;
wenzelm@58892
   321
        val goal' = make_goal (g (statement, using, goal, before_qed, after_qed));
wenzelm@47431
   322
        val node' = map_node_context h node;
wenzelm@58797
   323
        val stack' = Stack.make (make_node (f context, facts, mode, SOME goal')) (node' :: nodes);
wenzelm@58797
   324
      in State stack' end
wenzelm@58797
   325
  | (nd, node :: nodes) =>
wenzelm@47431
   326
      let
wenzelm@47431
   327
        val nd' = map_node_context f nd;
wenzelm@58797
   328
        val State stack' = map_goal f g h (State (Stack.make node nodes));
wenzelm@58797
   329
        val (node', nodes') = Stack.dest stack';
wenzelm@58797
   330
      in State (Stack.make nd' (node' :: nodes')) end
wenzelm@58797
   331
  | _ => State stack);
wenzelm@5820
   332
wenzelm@58892
   333
fun provide_goal goal = map_goal I (fn (statement, using, _, before_qed, after_qed) =>
wenzelm@58892
   334
  (statement, using, goal, before_qed, after_qed)) I;
wenzelm@19188
   335
wenzelm@58892
   336
fun using_facts using = map_goal I (fn (statement, _, goal, before_qed, after_qed) =>
wenzelm@58892
   337
  (statement, using, goal, before_qed, after_qed)) I;
wenzelm@17359
   338
wenzelm@17359
   339
local
wenzelm@17359
   340
  fun find i state =
wenzelm@17359
   341
    (case try current_goal state of
wenzelm@17359
   342
      SOME (ctxt, goal) => (ctxt, (i, goal))
wenzelm@60094
   343
    | NONE => find (i + 1) (close_block state handle ERROR _ => error "No proof goal"));
wenzelm@17359
   344
in val find_goal = find 0 end;
wenzelm@17359
   345
wenzelm@17359
   346
fun get_goal state =
wenzelm@17359
   347
  let val (ctxt, (_, {using, goal, ...})) = find_goal state
wenzelm@17359
   348
  in (ctxt, (using, goal)) end;
wenzelm@5820
   349
wenzelm@5820
   350
wenzelm@5820
   351
wenzelm@12423
   352
(** pretty_state **)
wenzelm@5820
   353
wenzelm@59185
   354
local
wenzelm@59185
   355
skalberg@15531
   356
fun pretty_facts _ _ NONE = []
wenzelm@59185
   357
  | pretty_facts ctxt s (SOME ths) = [Proof_Display.pretty_goal_facts ctxt s ths];
wenzelm@59185
   358
wenzelm@59185
   359
fun pretty_sep prts [] = prts
wenzelm@59185
   360
  | pretty_sep [] prts = prts
wenzelm@59185
   361
  | pretty_sep prts1 prts2 = prts1 @ [Pretty.str ""] @ prts2;
wenzelm@59185
   362
wenzelm@59185
   363
in
wenzelm@6756
   364
wenzelm@17359
   365
fun pretty_state nr state =
wenzelm@5820
   366
  let
wenzelm@49011
   367
    val {context = ctxt, facts, mode, goal = _} = top state;
wenzelm@42717
   368
    val verbose = Config.get ctxt Proof_Context.verbose;
wenzelm@5820
   369
wenzelm@49860
   370
    fun prt_goal (SOME (_, (_,
wenzelm@58892
   371
      {statement = ((_, pos), _, _), using, goal, before_qed = _, after_qed = _}))) =
wenzelm@59185
   372
          pretty_sep
wenzelm@59185
   373
            (pretty_facts ctxt "using"
wenzelm@59185
   374
              (if mode <> Backward orelse null using then NONE else SOME using))
wenzelm@59185
   375
            ([Proof_Display.pretty_goal_header goal] @ Goal_Display.pretty_goals ctxt goal)
wenzelm@17359
   376
      | prt_goal NONE = [];
wenzelm@6848
   377
wenzelm@17359
   378
    val prt_ctxt =
wenzelm@42717
   379
      if verbose orelse mode = Forward then Proof_Context.pretty_context ctxt
wenzelm@42360
   380
      else if mode = Backward then Proof_Context.pretty_ctxt ctxt
wenzelm@7575
   381
      else [];
wenzelm@56912
   382
wenzelm@56912
   383
    val position_markup = Position.markup (Position.thread_data ()) Markup.position;
wenzelm@17359
   384
  in
wenzelm@56912
   385
    [Pretty.block
wenzelm@56912
   386
      [Pretty.mark_str (position_markup, "proof"),
wenzelm@56912
   387
        Pretty.str (" (" ^ mode_name mode ^ "): depth " ^ string_of_int (level state div 2 - 1))],
wenzelm@17359
   388
      Pretty.str ""] @
wenzelm@17359
   389
    (if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @
wenzelm@42717
   390
    (if verbose orelse mode = Forward then
wenzelm@59185
   391
       pretty_sep (pretty_facts ctxt "" facts) (prt_goal (try find_goal state))
wenzelm@51584
   392
     else if mode = Chain then pretty_facts ctxt "picking" facts
wenzelm@17359
   393
     else prt_goal (try find_goal state))
wenzelm@17359
   394
  end;
wenzelm@5820
   395
wenzelm@59185
   396
end;
wenzelm@59185
   397
wenzelm@5820
   398
wenzelm@5820
   399
wenzelm@5820
   400
(** proof steps **)
wenzelm@5820
   401
wenzelm@17359
   402
(* refine via method *)
wenzelm@5820
   403
wenzelm@8234
   404
local
wenzelm@8234
   405
wenzelm@16146
   406
fun goalN i = "goal" ^ string_of_int i;
wenzelm@16146
   407
fun goals st = map goalN (1 upto Thm.nprems_of st);
wenzelm@16146
   408
wenzelm@16146
   409
fun no_goal_cases st = map (rpair NONE) (goals st);
wenzelm@16146
   410
wenzelm@59970
   411
fun goal_cases ctxt st =
wenzelm@59970
   412
  Rule_Cases.make_common ctxt (Thm.prop_of st) (map (rpair [] o rpair []) (goals st));
wenzelm@16146
   413
wenzelm@58007
   414
fun apply_method text ctxt state =
wenzelm@58892
   415
  #2 (#2 (find_goal state)) |> (fn {statement, using, goal, before_qed, after_qed} =>
wenzelm@58007
   416
    Method.evaluate text ctxt using goal
wenzelm@58004
   417
    |> Seq.map (fn (meth_cases, goal') =>
wenzelm@6848
   418
      state
wenzelm@16146
   419
      |> map_goal
wenzelm@59970
   420
          (Proof_Context.update_cases false (no_goal_cases goal @ goal_cases ctxt goal') #>
wenzelm@53378
   421
           Proof_Context.update_cases true meth_cases)
wenzelm@58892
   422
          (K (statement, using, goal', before_qed, after_qed)) I));
wenzelm@5820
   423
wenzelm@8234
   424
in
wenzelm@8234
   425
wenzelm@58007
   426
fun refine text state = apply_method text (context_of state) state;
wenzelm@58007
   427
fun refine_end text state = apply_method text (#1 (find_goal state)) state;
wenzelm@58004
   428
wenzelm@58004
   429
fun refine_insert ths =
wenzelm@58004
   430
  Seq.hd o refine (Method.Basic (K (Method.insert ths)));
wenzelm@18908
   431
wenzelm@8234
   432
end;
wenzelm@8234
   433
wenzelm@5820
   434
wenzelm@17359
   435
(* refine via sub-proof *)
wenzelm@17359
   436
wenzelm@46466
   437
local
wenzelm@46466
   438
wenzelm@54742
   439
fun finish_tac _ 0 = K all_tac
wenzelm@54742
   440
  | finish_tac ctxt n =
wenzelm@54742
   441
      Goal.norm_hhf_tac ctxt THEN'
wenzelm@30557
   442
      SUBGOAL (fn (goal, i) =>
wenzelm@30557
   443
        if can Logic.unprotect (Logic.strip_assums_concl goal) then
wenzelm@59498
   444
          eresolve_tac ctxt [Drule.protectI] i THEN finish_tac ctxt (n - 1) i
wenzelm@54742
   445
        else finish_tac ctxt (n - 1) (i + 1));
wenzelm@30557
   446
wenzelm@54742
   447
fun goal_tac ctxt rule =
wenzelm@54742
   448
  Goal.norm_hhf_tac ctxt THEN'
wenzelm@59498
   449
  resolve_tac ctxt [rule] THEN'
wenzelm@54742
   450
  finish_tac ctxt (Thm.nprems_of rule);
wenzelm@11816
   451
wenzelm@46466
   452
fun FINDGOAL tac st =
wenzelm@46466
   453
  let fun find i n = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1) n)
wenzelm@46466
   454
  in find 1 (Thm.nprems_of st) st end;
wenzelm@46466
   455
wenzelm@46466
   456
in
wenzelm@46466
   457
wenzelm@19915
   458
fun refine_goals print_rule inner raw_rules state =
wenzelm@19915
   459
  let
wenzelm@19915
   460
    val (outer, (_, goal)) = get_goal state;
wenzelm@54742
   461
    fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac outer rule) st);
wenzelm@19915
   462
  in
wenzelm@19915
   463
    raw_rules
wenzelm@42360
   464
    |> Proof_Context.goal_export inner outer
wenzelm@47068
   465
    |> (fn rules => Seq.lift provide_goal (EVERY (map refine rules) goal) state)
wenzelm@19915
   466
  end;
wenzelm@17359
   467
wenzelm@46466
   468
end;
wenzelm@46466
   469
wenzelm@6932
   470
wenzelm@49846
   471
(* conclude goal *)
wenzelm@49846
   472
wenzelm@28627
   473
fun conclude_goal ctxt goal propss =
wenzelm@5820
   474
  let
wenzelm@42360
   475
    val thy = Proof_Context.theory_of ctxt;
wenzelm@5820
   476
wenzelm@54981
   477
    val _ =
wenzelm@59582
   478
      Theory.subthy (Thm.theory_of_thm goal, thy) orelse
wenzelm@59582
   479
        error "Bad background theory of goal state";
wenzelm@49860
   480
    val _ = Thm.no_prems goal orelse error (Proof_Display.string_of_goal ctxt goal);
wenzelm@20224
   481
wenzelm@54567
   482
    fun lost_structure () = error ("Lost goal structure:\n" ^ Display.string_of_thm ctxt goal);
wenzelm@5820
   483
wenzelm@54567
   484
    val th =
wenzelm@54567
   485
      (Goal.conclude (if length (flat propss) > 1 then Thm.norm_proof goal else goal)
wenzelm@54567
   486
        handle THM _ => lost_structure ())
wenzelm@58950
   487
      |> Drule.flexflex_unique (SOME ctxt)
wenzelm@54567
   488
      |> Thm.check_shyps (Variable.sorts_of ctxt)
wenzelm@54993
   489
      |> Thm.check_hyps (Context.Proof ctxt);
wenzelm@23418
   490
wenzelm@23418
   491
    val goal_propss = filter_out null propss;
wenzelm@23418
   492
    val results =
wenzelm@23418
   493
      Conjunction.elim_balanced (length goal_propss) th
wenzelm@23418
   494
      |> map2 Conjunction.elim_balanced (map length goal_propss)
wenzelm@23418
   495
      handle THM _ => lost_structure ();
wenzelm@58950
   496
    val _ =
wenzelm@58950
   497
      Unify.matches_list (Context.Proof ctxt) (flat goal_propss) (map Thm.prop_of (flat results))
wenzelm@58950
   498
        orelse error ("Proved a different theorem:\n" ^ Display.string_of_thm ctxt th);
wenzelm@23418
   499
wenzelm@23418
   500
    fun recover_result ([] :: pss) thss = [] :: recover_result pss thss
wenzelm@23418
   501
      | recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss
wenzelm@23418
   502
      | recover_result [] [] = []
wenzelm@23418
   503
      | recover_result _ _ = lost_structure ();
wenzelm@23418
   504
  in recover_result propss results end;
wenzelm@5820
   505
wenzelm@49859
   506
val finished_goal_error = "Failed to finish proof";
wenzelm@49859
   507
wenzelm@49889
   508
fun finished_goal pos state =
wenzelm@49859
   509
  let val (ctxt, (_, goal)) = get_goal state in
wenzelm@49859
   510
    if Thm.no_prems goal then Seq.Result state
wenzelm@49889
   511
    else
wenzelm@49889
   512
      Seq.Error (fn () =>
wenzelm@49889
   513
        finished_goal_error ^ Position.here pos ^ ":\n" ^
wenzelm@49889
   514
          Proof_Display.string_of_goal ctxt goal)
wenzelm@49859
   515
  end;
wenzelm@49846
   516
wenzelm@5820
   517
wenzelm@33288
   518
(* goal views -- corresponding to methods *)
wenzelm@33288
   519
wenzelm@33288
   520
fun raw_goal state =
wenzelm@33288
   521
  let val (ctxt, (facts, goal)) = get_goal state
wenzelm@33288
   522
  in {context = ctxt, facts = facts, goal = goal} end;
wenzelm@33288
   523
wenzelm@33288
   524
val goal = raw_goal o refine_insert [];
wenzelm@33288
   525
wenzelm@33288
   526
fun simple_goal state =
wenzelm@33288
   527
  let
wenzelm@33288
   528
    val (_, (facts, _)) = get_goal state;
wenzelm@33288
   529
    val (ctxt, (_, goal)) = get_goal (refine_insert facts state);
wenzelm@33288
   530
  in {context = ctxt, goal = goal} end;
wenzelm@33288
   531
wenzelm@38721
   532
fun status_markup state =
wenzelm@38721
   533
  (case try goal state of
wenzelm@50201
   534
    SOME {goal, ...} => Markup.proof_state (Thm.nprems_of goal)
wenzelm@38721
   535
  | NONE => Markup.empty);
wenzelm@38721
   536
wenzelm@49866
   537
fun method_error kind pos state =
wenzelm@49866
   538
  Seq.single (Proof_Display.method_error kind pos (raw_goal state));
wenzelm@49861
   539
wenzelm@33288
   540
wenzelm@5820
   541
wenzelm@5820
   542
(*** structured proof commands ***)
wenzelm@5820
   543
wenzelm@17112
   544
(** context elements **)
wenzelm@5820
   545
wenzelm@36324
   546
(* let bindings *)
wenzelm@5820
   547
wenzelm@16813
   548
local
wenzelm@16813
   549
wenzelm@17359
   550
fun gen_bind bind args state =
wenzelm@5820
   551
  state
wenzelm@5820
   552
  |> assert_forward
wenzelm@36324
   553
  |> map_context (bind true args #> snd)
wenzelm@47068
   554
  |> reset_facts;
wenzelm@5820
   555
wenzelm@16813
   556
in
wenzelm@16813
   557
wenzelm@60377
   558
val let_bind = gen_bind Proof_Context.match_bind;
wenzelm@60377
   559
val let_bind_cmd = gen_bind Proof_Context.match_bind_cmd;
wenzelm@5820
   560
wenzelm@16813
   561
end;
wenzelm@16813
   562
wenzelm@5820
   563
wenzelm@36505
   564
(* concrete syntax *)
wenzelm@36505
   565
wenzelm@36505
   566
local
wenzelm@36505
   567
wenzelm@36507
   568
fun gen_write prep_arg mode args =
wenzelm@36507
   569
  assert_forward
wenzelm@42360
   570
  #> map_context (fn ctxt => ctxt |> Proof_Context.notation true mode (map (prep_arg ctxt) args))
wenzelm@47068
   571
  #> reset_facts;
wenzelm@36505
   572
wenzelm@55955
   573
fun read_arg ctxt (c, mx) =
wenzelm@56002
   574
  (case Proof_Context.read_const {proper = false, strict = false} ctxt c of
wenzelm@55955
   575
    Free (x, _) =>
wenzelm@55955
   576
      let val T = Proof_Context.infer_type ctxt (x, Mixfix.mixfixT mx)
wenzelm@55955
   577
      in (Free (x, T), mx) end
wenzelm@55955
   578
  | t => (t, mx));
wenzelm@55955
   579
wenzelm@36505
   580
in
wenzelm@36505
   581
wenzelm@36505
   582
val write = gen_write (K I);
wenzelm@55955
   583
val write_cmd = gen_write read_arg;
wenzelm@36505
   584
wenzelm@36505
   585
end;
wenzelm@36505
   586
wenzelm@36505
   587
wenzelm@17359
   588
(* fix *)
wenzelm@9196
   589
wenzelm@12714
   590
local
wenzelm@12714
   591
wenzelm@60379
   592
fun gen_fix prep_var args =
wenzelm@17359
   593
  assert_forward
wenzelm@60379
   594
  #> map_context (fn ctxt => snd (Proof_Context.add_fixes (fst (fold_map prep_var args ctxt)) ctxt))
wenzelm@47068
   595
  #> reset_facts;
wenzelm@5820
   596
wenzelm@16813
   597
in
wenzelm@16813
   598
wenzelm@60379
   599
val fix = gen_fix Proof_Context.cert_var;
wenzelm@60379
   600
val fix_cmd = gen_fix Proof_Context.read_var;
wenzelm@5820
   601
wenzelm@16813
   602
end;
wenzelm@16813
   603
wenzelm@5820
   604
wenzelm@17359
   605
(* assume etc. *)
wenzelm@5820
   606
wenzelm@16813
   607
local
wenzelm@16813
   608
wenzelm@17112
   609
fun gen_assume asm prep_att exp args state =
wenzelm@5820
   610
  state
wenzelm@5820
   611
  |> assert_forward
wenzelm@47815
   612
  |> map_context_result (asm exp (Attrib.map_specs (map (prep_att (context_of state))) args))
wenzelm@17359
   613
  |> these_factss [] |> #2;
wenzelm@6932
   614
wenzelm@16813
   615
in
wenzelm@16813
   616
wenzelm@60377
   617
val assm = gen_assume Proof_Context.add_assms (K I);
wenzelm@60377
   618
val assm_cmd = gen_assume Proof_Context.add_assms_cmd Attrib.attribute_cmd;
wenzelm@36323
   619
val assume = assm Assumption.assume_export;
wenzelm@36323
   620
val assume_cmd = assm_cmd Assumption.assume_export;
wenzelm@36323
   621
val presume = assm Assumption.presume_export;
wenzelm@36323
   622
val presume_cmd = assm_cmd Assumption.presume_export;
wenzelm@5820
   623
wenzelm@16813
   624
end;
wenzelm@16813
   625
wenzelm@7271
   626
wenzelm@17359
   627
(* def *)
wenzelm@11891
   628
wenzelm@16813
   629
local
wenzelm@16813
   630
wenzelm@60379
   631
fun gen_def prep_att prep_var prep_binds args state =
wenzelm@11891
   632
  let
wenzelm@11891
   633
    val _ = assert_forward state;
wenzelm@20913
   634
    val (raw_name_atts, (raw_vars, raw_rhss)) = args |> split_list ||> split_list;
wenzelm@47815
   635
    val name_atts = map (apsnd (map (prep_att (context_of state)))) raw_name_atts;
wenzelm@11891
   636
  in
wenzelm@20913
   637
    state
wenzelm@60379
   638
    |> map_context_result (fold_map (fn (x, mx) => prep_var (x, NONE, mx)) raw_vars)
wenzelm@20913
   639
    |>> map (fn (x, _, mx) => (x, mx))
wenzelm@20913
   640
    |-> (fn vars =>
wenzelm@20913
   641
      map_context_result (prep_binds false (map swap raw_rhss))
wenzelm@49748
   642
      #-> (fn rhss =>
wenzelm@49748
   643
        let
wenzelm@49748
   644
          val defs = (vars ~~ (name_atts ~~ rhss)) |> map (fn ((x, mx), ((a, atts), rhs)) =>
wenzelm@49748
   645
            ((x, mx), ((Thm.def_binding_optional x a, atts), rhs)));
wenzelm@49748
   646
        in map_context_result (Local_Defs.add_defs defs) end))
wenzelm@47068
   647
    |-> (set_facts o map (#2 o #2))
wenzelm@11891
   648
  end;
wenzelm@11891
   649
wenzelm@16813
   650
in
wenzelm@16813
   651
wenzelm@60379
   652
val def = gen_def (K I) Proof_Context.cert_var Proof_Context.match_bind;
wenzelm@60379
   653
val def_cmd = gen_def Attrib.attribute_cmd Proof_Context.read_var Proof_Context.match_bind_cmd;
wenzelm@11891
   654
wenzelm@16813
   655
end;
wenzelm@16813
   656
wenzelm@11891
   657
wenzelm@8374
   658
wenzelm@17112
   659
(** facts **)
wenzelm@5820
   660
wenzelm@17359
   661
(* chain *)
wenzelm@5820
   662
wenzelm@24011
   663
fun clean_facts ctxt =
wenzelm@47068
   664
  set_facts (filter_out Thm.is_dummy (the_facts ctxt)) ctxt;
wenzelm@24011
   665
wenzelm@17359
   666
val chain =
wenzelm@17359
   667
  assert_forward
wenzelm@24011
   668
  #> clean_facts
wenzelm@17359
   669
  #> enter_chain;
wenzelm@5820
   670
wenzelm@17359
   671
fun chain_facts facts =
wenzelm@47068
   672
  set_facts facts
wenzelm@17359
   673
  #> chain;
wenzelm@5820
   674
wenzelm@5820
   675
wenzelm@17359
   676
(* note etc. *)
wenzelm@17112
   677
haftmann@28965
   678
fun no_binding args = map (pair (Binding.empty, [])) args;
wenzelm@17112
   679
wenzelm@17112
   680
local
wenzelm@17112
   681
wenzelm@30760
   682
fun gen_thmss more_facts opt_chain opt_result prep_atts prep_fact args state =
wenzelm@17112
   683
  state
wenzelm@17112
   684
  |> assert_forward
wenzelm@47815
   685
  |> map_context_result (fn ctxt => ctxt |> Proof_Context.note_thmss ""
wenzelm@47815
   686
    (Attrib.map_facts_refs (map (prep_atts ctxt)) (prep_fact ctxt) args))
wenzelm@17112
   687
  |> these_factss (more_facts state)
wenzelm@17359
   688
  ||> opt_chain
wenzelm@17359
   689
  |> opt_result;
wenzelm@17112
   690
wenzelm@17112
   691
in
wenzelm@17112
   692
wenzelm@36323
   693
val note_thmss = gen_thmss (K []) I #2 (K I) (K I);
wenzelm@47815
   694
val note_thmss_cmd = gen_thmss (K []) I #2 Attrib.attribute_cmd Proof_Context.get_fact;
wenzelm@17112
   695
wenzelm@36323
   696
val from_thmss = gen_thmss (K []) chain #2 (K I) (K I) o no_binding;
wenzelm@47815
   697
val from_thmss_cmd =
wenzelm@47815
   698
  gen_thmss (K []) chain #2 Attrib.attribute_cmd Proof_Context.get_fact o no_binding;
wenzelm@17359
   699
wenzelm@36323
   700
val with_thmss = gen_thmss the_facts chain #2 (K I) (K I) o no_binding;
wenzelm@47815
   701
val with_thmss_cmd =
wenzelm@47815
   702
  gen_thmss the_facts chain #2 Attrib.attribute_cmd Proof_Context.get_fact o no_binding;
wenzelm@30760
   703
wenzelm@30760
   704
val local_results = gen_thmss (K []) I I (K I) (K I) o map (apsnd Thm.simple_fact);
wenzelm@17359
   705
wenzelm@17112
   706
end;
wenzelm@17112
   707
wenzelm@17112
   708
wenzelm@60371
   709
(* facts during goal refinement *)
wenzelm@60371
   710
wenzelm@60371
   711
local
wenzelm@60371
   712
wenzelm@60371
   713
fun gen_supply prep_att prep_fact args state =
wenzelm@60371
   714
  state
wenzelm@60371
   715
  |> assert_backward
wenzelm@60371
   716
  |> map_context (fn ctxt => ctxt |> Proof_Context.note_thmss ""
wenzelm@60371
   717
       (Attrib.map_facts_refs (map (prep_att ctxt)) (prep_fact ctxt) args) |> snd);
wenzelm@60371
   718
wenzelm@60371
   719
in
wenzelm@60371
   720
wenzelm@60371
   721
val supply = gen_supply (K I) (K I);
wenzelm@60371
   722
val supply_cmd = gen_supply Attrib.attribute_cmd Proof_Context.get_fact;
wenzelm@60371
   723
wenzelm@60371
   724
end;
wenzelm@60371
   725
wenzelm@60371
   726
wenzelm@18548
   727
(* using/unfolding *)
wenzelm@17112
   728
wenzelm@17112
   729
local
wenzelm@17112
   730
wenzelm@45390
   731
fun gen_using f g prep_att prep_fact args state =
wenzelm@17112
   732
  state
wenzelm@17112
   733
  |> assert_backward
wenzelm@21442
   734
  |> map_context_result
wenzelm@47815
   735
    (fn ctxt => ctxt |> Proof_Context.note_thmss ""
wenzelm@47815
   736
      (Attrib.map_facts_refs (map (prep_att ctxt)) (prep_fact ctxt) (no_binding args)))
wenzelm@18843
   737
  |> (fn (named_facts, state') =>
wenzelm@58892
   738
    state' |> map_goal I (fn (statement, using, goal, before_qed, after_qed) =>
wenzelm@18843
   739
      let
wenzelm@18843
   740
        val ctxt = context_of state';
wenzelm@19482
   741
        val ths = maps snd named_facts;
wenzelm@58892
   742
      in (statement, f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end) I);
wenzelm@18548
   743
wenzelm@24050
   744
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths;
wenzelm@35624
   745
fun unfold_using ctxt ths = map (Local_Defs.unfold ctxt ths);
wenzelm@35624
   746
val unfold_goals = Local_Defs.unfold_goals;
wenzelm@17112
   747
wenzelm@17112
   748
in
wenzelm@17112
   749
wenzelm@36323
   750
val using = gen_using append_using (K (K I)) (K I) (K I);
wenzelm@47815
   751
val using_cmd = gen_using append_using (K (K I)) Attrib.attribute_cmd Proof_Context.get_fact;
wenzelm@36323
   752
val unfolding = gen_using unfold_using unfold_goals (K I) (K I);
wenzelm@47815
   753
val unfolding_cmd = gen_using unfold_using unfold_goals Attrib.attribute_cmd Proof_Context.get_fact;
wenzelm@17112
   754
wenzelm@17112
   755
end;
wenzelm@17112
   756
wenzelm@17112
   757
wenzelm@17112
   758
(* case *)
wenzelm@17112
   759
wenzelm@17112
   760
local
wenzelm@17112
   761
wenzelm@57486
   762
fun gen_invoke_case internal prep_att ((name, pos), xs, raw_atts) state =
wenzelm@17112
   763
  let
wenzelm@47815
   764
    val atts = map (prep_att (context_of state)) raw_atts;
wenzelm@19078
   765
    val (asms, state') = state |> map_context_result (fn ctxt =>
wenzelm@57486
   766
      ctxt |> Proof_Context.apply_case (Proof_Context.check_case ctxt internal (name, pos) xs));
wenzelm@53380
   767
    val assumptions =
wenzelm@53380
   768
      asms |> map (fn (b, ts) => ((Binding.set_pos pos b, atts), map (rpair []) ts));
wenzelm@17112
   769
  in
wenzelm@17112
   770
    state'
wenzelm@36323
   771
    |> assume assumptions
wenzelm@60401
   772
    |> map_context (fold Variable.unbind_term Auto_Bind.no_facts)
wenzelm@53378
   773
    |> `the_facts |-> (fn thms => note_thmss [((Binding.make (name, pos), []), [(thms, [])])])
wenzelm@17112
   774
  end;
wenzelm@17112
   775
wenzelm@17112
   776
in
wenzelm@17112
   777
wenzelm@57486
   778
val invoke_case = gen_invoke_case true (K I);
wenzelm@57486
   779
val invoke_case_cmd = gen_invoke_case false Attrib.attribute_cmd;
wenzelm@17112
   780
wenzelm@17112
   781
end;
wenzelm@17112
   782
wenzelm@17112
   783
wenzelm@17112
   784
wenzelm@17359
   785
(** proof structure **)
wenzelm@17359
   786
wenzelm@17359
   787
(* blocks *)
wenzelm@17359
   788
wenzelm@17359
   789
val begin_block =
wenzelm@17359
   790
  assert_forward
wenzelm@17359
   791
  #> open_block
wenzelm@47068
   792
  #> reset_goal
wenzelm@17359
   793
  #> open_block;
wenzelm@17359
   794
wenzelm@17359
   795
val next_block =
wenzelm@17359
   796
  assert_forward
wenzelm@17359
   797
  #> close_block
wenzelm@17359
   798
  #> open_block
wenzelm@47068
   799
  #> reset_goal
wenzelm@47068
   800
  #> reset_facts;
wenzelm@17359
   801
wenzelm@17359
   802
fun end_block state =
wenzelm@17359
   803
  state
wenzelm@17359
   804
  |> assert_forward
wenzelm@40960
   805
  |> assert_bottom false
wenzelm@17359
   806
  |> close_block
wenzelm@17359
   807
  |> assert_current_goal false
wenzelm@17359
   808
  |> close_block
wenzelm@17359
   809
  |> export_facts state;
wenzelm@17359
   810
wenzelm@17359
   811
wenzelm@40960
   812
(* global notepad *)
wenzelm@40960
   813
wenzelm@40960
   814
val begin_notepad =
wenzelm@40960
   815
  init
wenzelm@40960
   816
  #> open_block
wenzelm@40960
   817
  #> map_context (Variable.set_body true)
wenzelm@40960
   818
  #> open_block;
wenzelm@40960
   819
wenzelm@40960
   820
val end_notepad =
wenzelm@40960
   821
  assert_forward
wenzelm@40960
   822
  #> assert_bottom true
wenzelm@40960
   823
  #> close_block
wenzelm@40960
   824
  #> assert_current_goal false
wenzelm@40960
   825
  #> close_block
wenzelm@40960
   826
  #> context_of;
wenzelm@40960
   827
wenzelm@40960
   828
wenzelm@17359
   829
(* sub-proofs *)
wenzelm@17359
   830
wenzelm@17359
   831
fun proof opt_text =
wenzelm@17359
   832
  assert_backward
wenzelm@17859
   833
  #> refine (the_default Method.default_text opt_text)
wenzelm@17359
   834
  #> Seq.map (using_facts [] #> enter_forward);
wenzelm@17359
   835
wenzelm@49866
   836
fun proof_results arg =
wenzelm@49866
   837
  Seq.APPEND (proof (Method.text arg) #> Seq.make_results,
wenzelm@49866
   838
    method_error "initial" (Method.position arg));
wenzelm@49863
   839
wenzelm@49889
   840
fun end_proof bot (prev_pos, (opt_text, immed)) =
wenzelm@49889
   841
  let
wenzelm@49889
   842
    val (finish_text, terminal_pos, finished_pos) =
wenzelm@49889
   843
      (case opt_text of
wenzelm@49889
   844
        NONE => (Method.finish_text (NONE, immed), Position.none, prev_pos)
wenzelm@55709
   845
      | SOME (text, (pos, end_pos)) => (Method.finish_text (SOME text, immed), pos, end_pos));
wenzelm@49889
   846
  in
wenzelm@49889
   847
    Seq.APPEND (fn state =>
wenzelm@49889
   848
      state
wenzelm@49889
   849
      |> assert_forward
wenzelm@49889
   850
      |> assert_bottom bot
wenzelm@49889
   851
      |> close_block
wenzelm@49889
   852
      |> assert_current_goal true
wenzelm@49889
   853
      |> using_facts []
wenzelm@49889
   854
      |> `before_qed |-> (refine o the_default Method.succeed_text)
wenzelm@49889
   855
      |> Seq.maps (refine finish_text)
wenzelm@49889
   856
      |> Seq.make_results, method_error "terminal" terminal_pos)
wenzelm@49889
   857
    #> Seq.maps_results (Seq.single o finished_goal finished_pos)
wenzelm@49889
   858
  end;
wenzelm@17359
   859
wenzelm@29383
   860
fun check_result msg sq =
wenzelm@29383
   861
  (case Seq.pull sq of
wenzelm@29383
   862
    NONE => error msg
wenzelm@29383
   863
  | SOME (s, _) => s);
wenzelm@29383
   864
wenzelm@17359
   865
wenzelm@17359
   866
(* unstructured refinement *)
wenzelm@17359
   867
wenzelm@49865
   868
fun defer i =
wenzelm@49865
   869
  assert_no_chain #>
wenzelm@49865
   870
  refine (Method.Basic (fn _ => METHOD (fn _ => ASSERT_SUBGOAL defer_tac i))) #> Seq.hd;
wenzelm@49865
   871
wenzelm@49865
   872
fun prefer i =
wenzelm@49865
   873
  assert_no_chain #>
wenzelm@49865
   874
  refine (Method.Basic (fn _ => METHOD (fn _ => ASSERT_SUBGOAL prefer_tac i))) #> Seq.hd;
wenzelm@17359
   875
wenzelm@17359
   876
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
wenzelm@49866
   877
wenzelm@17359
   878
fun apply_end text = assert_forward #> refine_end text;
wenzelm@17359
   879
wenzelm@55709
   880
fun apply_results (text, (pos, _)) =
wenzelm@55709
   881
  Seq.APPEND (apply text #> Seq.make_results, method_error "" pos);
wenzelm@49866
   882
wenzelm@55709
   883
fun apply_end_results (text, (pos, _)) =
wenzelm@55709
   884
  Seq.APPEND (apply_end text #> Seq.make_results, method_error "" pos);
wenzelm@49863
   885
wenzelm@17359
   886
wenzelm@17359
   887
wenzelm@17112
   888
(** goals **)
wenzelm@17112
   889
wenzelm@17359
   890
(* generic goals *)
wenzelm@17359
   891
wenzelm@19774
   892
local
wenzelm@19774
   893
wenzelm@36322
   894
val is_var =
wenzelm@36322
   895
  can (dest_TVar o Logic.dest_type o Logic.dest_term) orf
wenzelm@36322
   896
  can (dest_Var o Logic.dest_term);
wenzelm@36322
   897
wenzelm@36322
   898
fun implicit_vars props =
wenzelm@19846
   899
  let
wenzelm@36354
   900
    val (var_props, _) = take_prefix is_var props;
wenzelm@36322
   901
    val explicit_vars = fold Term.add_vars var_props [];
wenzelm@36322
   902
    val vars = filter_out (member (op =) explicit_vars) (fold Term.add_vars props []);
wenzelm@36322
   903
  in map (Logic.mk_term o Var) vars end;
wenzelm@19774
   904
wenzelm@19774
   905
fun refine_terms n =
wenzelm@59953
   906
  refine (Method.Basic (fn ctxt => EMPTY_CASES o
wenzelm@58002
   907
    K (HEADGOAL (PRECISE_CONJUNCTS n
wenzelm@59498
   908
      (HEADGOAL (CONJUNCTS (ALLGOALS (resolve_tac ctxt [Drule.termI]))))))))
wenzelm@19774
   909
  #> Seq.hd;
wenzelm@19774
   910
wenzelm@19774
   911
in
wenzelm@17359
   912
wenzelm@60388
   913
fun generic_goal prep_propp kind before_qed after_qed propp state =
wenzelm@5820
   914
  let
wenzelm@59573
   915
    val ctxt = context_of state;
wenzelm@17359
   916
    val chaining = can assert_chain state;
wenzelm@25958
   917
    val pos = Position.thread_data ();
wenzelm@17359
   918
wenzelm@60388
   919
    val (propss, binds) = prep_propp ctxt propp;
wenzelm@60388
   920
    val props = flat propss;
wenzelm@60388
   921
wenzelm@60388
   922
    val goal_state =
wenzelm@5936
   923
      state
wenzelm@5936
   924
      |> assert_forward_or_chain
wenzelm@5936
   925
      |> enter_forward
wenzelm@17359
   926
      |> open_block
wenzelm@60388
   927
      |> map_context (fold Variable.auto_fixes props #> Proof_Context.bind_terms binds);
wenzelm@60383
   928
    val goal_ctxt = context_of goal_state;
wenzelm@15703
   929
wenzelm@36322
   930
    val vars = implicit_vars props;
wenzelm@36322
   931
    val propss' = vars :: propss;
wenzelm@23418
   932
    val goal_propss = filter_out null propss';
wenzelm@29346
   933
    val goal =
wenzelm@59616
   934
      Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss)
wenzelm@59621
   935
      |> Thm.cterm_of ctxt
wenzelm@60383
   936
      |> Thm.weaken_sorts (Variable.sorts_of goal_ctxt);
wenzelm@29346
   937
    val statement = ((kind, pos), propss', Thm.term_of goal);
wenzelm@60401
   938
    val binds' = map #1 binds ~~ Variable.export_terms goal_ctxt ctxt (map #2 binds);
wenzelm@60383
   939
    val after_qed' = after_qed |>> (fn after_local => fn results =>
wenzelm@60401
   940
      map_context (fold Variable.bind_term binds') #> after_local results);
wenzelm@5820
   941
  in
wenzelm@17359
   942
    goal_state
wenzelm@21727
   943
    |> map_context (init_context #> Variable.set_body true)
wenzelm@58892
   944
    |> set_goal (make_goal (statement, [], Goal.init goal, before_qed, after_qed'))
wenzelm@42360
   945
    |> map_context (Proof_Context.auto_bind_goal props)
wenzelm@21565
   946
    |> chaining ? (`the_facts #-> using_facts)
wenzelm@47068
   947
    |> reset_facts
wenzelm@17359
   948
    |> open_block
wenzelm@47068
   949
    |> reset_goal
wenzelm@5820
   950
    |> enter_backward
wenzelm@23418
   951
    |> not (null vars) ? refine_terms (length goal_propss)
wenzelm@32193
   952
    |> null props ? (refine (Method.Basic Method.assumption) #> Seq.hd)
wenzelm@5820
   953
  end;
wenzelm@5820
   954
wenzelm@29090
   955
fun generic_qed after_ctxt state =
wenzelm@12503
   956
  let
wenzelm@36354
   957
    val (goal_ctxt, {statement = (_, stmt, _), goal, after_qed, ...}) = current_goal state;
wenzelm@8617
   958
    val outer_state = state |> close_block;
wenzelm@8617
   959
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   960
wenzelm@18503
   961
    val props =
wenzelm@19774
   962
      flat (tl stmt)
wenzelm@19915
   963
      |> Variable.exportT_terms goal_ctxt outer_ctxt;
wenzelm@17359
   964
    val results =
wenzelm@28627
   965
      tl (conclude_goal goal_ctxt goal stmt)
wenzelm@42360
   966
      |> burrow (Proof_Context.export goal_ctxt outer_ctxt);
wenzelm@17359
   967
  in
wenzelm@17359
   968
    outer_state
wenzelm@29090
   969
    |> map_context (after_ctxt props)
wenzelm@34239
   970
    |> pair (after_qed, results)
wenzelm@17359
   971
  end;
wenzelm@17359
   972
wenzelm@19774
   973
end;
wenzelm@19774
   974
wenzelm@9469
   975
wenzelm@17359
   976
(* local goals *)
wenzelm@17359
   977
wenzelm@60388
   978
fun local_goal print_results prep_att prep_propp kind before_qed after_qed stmt state =
wenzelm@17359
   979
  let
wenzelm@21362
   980
    val ((names, attss), propp) =
wenzelm@47815
   981
      Attrib.map_specs (map (prep_att (context_of state))) stmt |> split_list |>> split_list;
wenzelm@17359
   982
wenzelm@18124
   983
    fun after_qed' results =
wenzelm@18808
   984
      local_results ((names ~~ attss) ~~ results)
wenzelm@17359
   985
      #-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
wenzelm@18124
   986
      #> after_qed results;
wenzelm@5820
   987
  in
wenzelm@17359
   988
    state
wenzelm@60388
   989
    |> map_context (Variable.set_body true)
wenzelm@60388
   990
    |> generic_goal prep_propp kind before_qed (after_qed', K I) propp
wenzelm@19900
   991
    |> tap (Variable.warn_extra_tfrees (context_of state) o context_of)
wenzelm@5820
   992
  end;
wenzelm@5820
   993
wenzelm@49866
   994
fun local_qeds arg =
wenzelm@49866
   995
  end_proof false arg
wenzelm@49859
   996
  #> Seq.map_result (generic_qed Proof_Context.auto_bind_facts #->
wenzelm@49859
   997
    (fn ((after_qed, _), results) => after_qed results));
wenzelm@5820
   998
wenzelm@49889
   999
fun local_qed arg =
wenzelm@49889
  1000
  local_qeds (Position.none, arg) #> Seq.the_result finished_goal_error;
wenzelm@29383
  1001
wenzelm@5820
  1002
wenzelm@17359
  1003
(* global goals *)
wenzelm@17359
  1004
wenzelm@60388
  1005
fun global_goal prep_propp before_qed after_qed propp =
wenzelm@60388
  1006
  init
wenzelm@60388
  1007
  #> generic_goal (prep_propp o Proof_Context.set_mode Proof_Context.mode_schematic) ""
wenzelm@60388
  1008
    before_qed (K I, after_qed) propp;
wenzelm@45327
  1009
wenzelm@60388
  1010
val theorem = global_goal Proof_Context.cert_propp;
wenzelm@60388
  1011
val theorem_cmd = global_goal Proof_Context.read_propp;
wenzelm@12065
  1012
wenzelm@49866
  1013
fun global_qeds arg =
wenzelm@49866
  1014
  end_proof true arg
wenzelm@49859
  1015
  #> Seq.map_result (generic_qed (K I) #> (fn (((_, after_qed), results), state) =>
wenzelm@49859
  1016
    after_qed results (context_of state)));
wenzelm@17112
  1017
wenzelm@49889
  1018
fun global_qed arg =
wenzelm@49889
  1019
  global_qeds (Position.none, arg) #> Seq.the_result finished_goal_error;
wenzelm@12959
  1020
wenzelm@5820
  1021
wenzelm@49907
  1022
(* terminal proof steps *)
wenzelm@17112
  1023
wenzelm@49890
  1024
local
wenzelm@49890
  1025
wenzelm@49846
  1026
fun terminal_proof qeds initial terminal =
wenzelm@49889
  1027
  proof_results (SOME initial) #> Seq.maps_results (qeds (#2 (#2 initial), terminal))
wenzelm@49863
  1028
  #> Seq.the_result "";
wenzelm@49848
  1029
wenzelm@49890
  1030
in
wenzelm@49890
  1031
wenzelm@29383
  1032
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true);
wenzelm@49889
  1033
val local_default_proof = local_terminal_proof ((Method.default_text, Position.no_range), NONE);
wenzelm@49889
  1034
val local_immediate_proof = local_terminal_proof ((Method.this_text, Position.no_range), NONE);
wenzelm@49889
  1035
val local_done_proof = terminal_proof local_qeds (Method.done_text, Position.no_range) (NONE, false);
wenzelm@17112
  1036
wenzelm@29383
  1037
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true);
wenzelm@49889
  1038
val global_default_proof = global_terminal_proof ((Method.default_text, Position.no_range), NONE);
wenzelm@49889
  1039
val global_immediate_proof = global_terminal_proof ((Method.this_text, Position.no_range), NONE);
wenzelm@49889
  1040
val global_done_proof = terminal_proof global_qeds (Method.done_text, Position.no_range) (NONE, false);
wenzelm@5820
  1041
wenzelm@49890
  1042
end;
wenzelm@49890
  1043
wenzelm@6896
  1044
wenzelm@49907
  1045
(* skip proofs *)
wenzelm@49907
  1046
wenzelm@49907
  1047
fun local_skip_proof int state =
wenzelm@49907
  1048
  local_terminal_proof ((Method.sorry_text int, Position.no_range), NONE) state before
wenzelm@51551
  1049
  Skip_Proof.report (context_of state);
wenzelm@49907
  1050
wenzelm@49907
  1051
fun global_skip_proof int state =
wenzelm@49907
  1052
  global_terminal_proof ((Method.sorry_text int, Position.no_range), NONE) state before
wenzelm@51551
  1053
  Skip_Proof.report (context_of state);
wenzelm@49907
  1054
wenzelm@49907
  1055
wenzelm@17359
  1056
(* common goal statements *)
wenzelm@17359
  1057
wenzelm@17359
  1058
local
wenzelm@17359
  1059
wenzelm@60388
  1060
fun gen_have prep_att prep_propp before_qed after_qed stmt int =
wenzelm@56932
  1061
  local_goal (Proof_Display.print_results int (Position.thread_data ()))
wenzelm@60388
  1062
    prep_att prep_propp "have" before_qed after_qed stmt;
wenzelm@6896
  1063
wenzelm@60388
  1064
fun gen_show prep_att prep_propp before_qed after_qed stmt int state =
wenzelm@17359
  1065
  let
wenzelm@32738
  1066
    val testing = Unsynchronized.ref false;
wenzelm@32738
  1067
    val rule = Unsynchronized.ref (NONE: thm option);
wenzelm@17359
  1068
    fun fail_msg ctxt =
wenzelm@50315
  1069
      "Local statement fails to refine any pending goal" ::
wenzelm@33389
  1070
      (case ! rule of NONE => [] | SOME th => [Proof_Display.string_of_rule ctxt "Failed" th])
wenzelm@17359
  1071
      |> cat_lines;
wenzelm@6896
  1072
wenzelm@56932
  1073
    val pos = Position.thread_data ();
wenzelm@17359
  1074
    fun print_results ctxt res =
wenzelm@46728
  1075
      if ! testing then ()
wenzelm@56932
  1076
      else Proof_Display.print_results int pos ctxt res;
wenzelm@17359
  1077
    fun print_rule ctxt th =
wenzelm@17359
  1078
      if ! testing then rule := SOME th
wenzelm@41181
  1079
      else if int then
wenzelm@56933
  1080
        Proof_Display.string_of_rule ctxt "Successful" th
wenzelm@56933
  1081
        |> Markup.markup Markup.text_fold
wenzelm@59184
  1082
        |> Output.state
wenzelm@17359
  1083
      else ();
wenzelm@17359
  1084
    val test_proof =
wenzelm@50315
  1085
      local_skip_proof true
wenzelm@39616
  1086
      |> Unsynchronized.setmp testing true
wenzelm@42042
  1087
      |> Exn.interruptible_capture;
wenzelm@6896
  1088
wenzelm@18124
  1089
    fun after_qed' results =
wenzelm@19482
  1090
      refine_goals print_rule (context_of state) (flat results)
wenzelm@29383
  1091
      #> check_result "Failed to refine any pending goal"
wenzelm@29383
  1092
      #> after_qed results;
wenzelm@17359
  1093
  in
wenzelm@17359
  1094
    state
wenzelm@60388
  1095
    |> local_goal print_results prep_att prep_propp "show" before_qed after_qed' stmt
wenzelm@21565
  1096
    |> int ? (fn goal_state =>
wenzelm@49907
  1097
      (case test_proof (map_context (Context_Position.set_visible false) goal_state) of
wenzelm@50315
  1098
        Exn.Res _ => goal_state
wenzelm@42042
  1099
      | Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))])))
wenzelm@17359
  1100
  end;
wenzelm@17359
  1101
wenzelm@17359
  1102
in
wenzelm@17359
  1103
wenzelm@60388
  1104
val have = gen_have (K I) Proof_Context.cert_propp;
wenzelm@60388
  1105
val have_cmd = gen_have Attrib.attribute_cmd Proof_Context.read_propp;
wenzelm@60388
  1106
val show = gen_show (K I) Proof_Context.cert_propp;
wenzelm@60388
  1107
val show_cmd = gen_show Attrib.attribute_cmd Proof_Context.read_propp;
wenzelm@6896
  1108
wenzelm@5820
  1109
end;
wenzelm@17359
  1110
wenzelm@28410
  1111
wenzelm@29385
  1112
wenzelm@29385
  1113
(** future proofs **)
wenzelm@29385
  1114
wenzelm@29385
  1115
(* relevant proof states *)
wenzelm@29385
  1116
wenzelm@29385
  1117
fun schematic_goal state =
wenzelm@29385
  1118
  let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state
wenzelm@51553
  1119
  in Goal.is_schematic prop end;
wenzelm@29385
  1120
wenzelm@29385
  1121
fun is_relevant state =
wenzelm@29385
  1122
  (case try find_goal state of
wenzelm@29385
  1123
    NONE => true
wenzelm@29385
  1124
  | SOME (_, (_, {statement = (_, _, prop), goal, ...})) =>
wenzelm@51553
  1125
      Goal.is_schematic prop orelse not (Logic.protect prop aconv Thm.concl_of goal));
wenzelm@29385
  1126
wenzelm@29385
  1127
wenzelm@29385
  1128
(* full proofs *)
wenzelm@28410
  1129
wenzelm@29346
  1130
local
wenzelm@29346
  1131
wenzelm@49912
  1132
structure Result = Proof_Data
wenzelm@49912
  1133
(
wenzelm@49912
  1134
  type T = thm option;
wenzelm@59150
  1135
  fun init _ = NONE;
wenzelm@49912
  1136
);
wenzelm@49912
  1137
wenzelm@49912
  1138
fun the_result ctxt =
wenzelm@49912
  1139
  (case Result.get ctxt of
wenzelm@49912
  1140
    NONE => error "No result of forked proof"
wenzelm@49912
  1141
  | SOME th => th);
wenzelm@49912
  1142
wenzelm@49912
  1143
val set_result = Result.put o SOME;
wenzelm@49912
  1144
val reset_result = Result.put NONE;
wenzelm@49912
  1145
wenzelm@51318
  1146
in
wenzelm@51318
  1147
wenzelm@51318
  1148
fun future_proof fork_proof state =
wenzelm@28410
  1149
  let
wenzelm@29381
  1150
    val _ = assert_backward state;
wenzelm@28410
  1151
    val (goal_ctxt, (_, goal)) = find_goal state;
wenzelm@58892
  1152
    val {statement as (kind, _, prop), using, goal, before_qed, after_qed} = goal;
wenzelm@47431
  1153
    val goal_tfrees =
wenzelm@47431
  1154
      fold Term.add_tfrees
wenzelm@47431
  1155
        (prop :: map Thm.term_of (Assumption.all_assms_of goal_ctxt)) [];
wenzelm@28410
  1156
wenzelm@29383
  1157
    val _ = is_relevant state andalso error "Cannot fork relevant proof";
wenzelm@29383
  1158
wenzelm@29346
  1159
    val prop' = Logic.protect prop;
wenzelm@29346
  1160
    val statement' = (kind, [[], [prop']], prop');
wenzelm@52456
  1161
    val goal' = Thm.adjust_maxidx_thm (Thm.maxidx_of goal) (Goal.protect (Thm.nprems_of goal) goal);
wenzelm@49912
  1162
    val after_qed' = (fn [[th]] => map_context (set_result th), fn [[th]] => set_result th);
wenzelm@28410
  1163
wenzelm@28973
  1164
    val result_ctxt =
wenzelm@28973
  1165
      state
wenzelm@49912
  1166
      |> map_context reset_result
wenzelm@58892
  1167
      |> map_goal I (K (statement', using, goal', before_qed, after_qed'))
wenzelm@47431
  1168
        (fold (Variable.declare_typ o TFree) goal_tfrees)
wenzelm@29346
  1169
      |> fork_proof;
wenzelm@28973
  1170
wenzelm@51318
  1171
    val future_thm = Future.map (the_result o snd) result_ctxt;
wenzelm@32062
  1172
    val finished_goal = Goal.future_result goal_ctxt future_thm prop';
wenzelm@28973
  1173
    val state' =
wenzelm@28973
  1174
      state
wenzelm@58892
  1175
      |> map_goal I (K (statement, using, finished_goal, NONE, after_qed)) I;
wenzelm@51318
  1176
  in (Future.map fst result_ctxt, state') end;
wenzelm@29385
  1177
wenzelm@17359
  1178
end;
wenzelm@29346
  1179
wenzelm@29385
  1180
wenzelm@51662
  1181
(* terminal proofs *)  (* FIXME avoid toplevel imitation -- include in PIDE/document *)
wenzelm@29385
  1182
wenzelm@29385
  1183
local
wenzelm@29385
  1184
wenzelm@51605
  1185
fun future_terminal_proof proof1 proof2 done int state =
wenzelm@53189
  1186
  if Goal.future_enabled 3 andalso not (is_relevant state) then
wenzelm@51318
  1187
    state |> future_proof (fn state' =>
wenzelm@51662
  1188
      let
wenzelm@51662
  1189
        val pos = Position.thread_data ();
wenzelm@51662
  1190
        val props = Markup.command_timing :: (Markup.nameN, "by") :: Position.properties_of pos;
wenzelm@51662
  1191
      in
wenzelm@53192
  1192
        Execution.fork {name = "Proof.future_terminal_proof", pos = pos, pri = ~1}
wenzelm@51662
  1193
          (fn () => ((), Timing.protocol props proof2 state'))
wenzelm@51662
  1194
      end) |> snd |> done
wenzelm@51318
  1195
  else proof1 state;
wenzelm@29385
  1196
wenzelm@29385
  1197
in
wenzelm@29385
  1198
wenzelm@51318
  1199
fun local_future_terminal_proof meths =
wenzelm@51605
  1200
  future_terminal_proof
wenzelm@51318
  1201
    (local_terminal_proof meths)
wenzelm@51318
  1202
    (local_terminal_proof meths #> context_of) local_done_proof;
wenzelm@29385
  1203
wenzelm@51318
  1204
fun global_future_terminal_proof meths =
wenzelm@51605
  1205
  future_terminal_proof
wenzelm@51318
  1206
    (global_terminal_proof meths)
wenzelm@51318
  1207
    (global_terminal_proof meths) global_done_proof;
wenzelm@29350
  1208
wenzelm@29346
  1209
end;
wenzelm@29346
  1210
wenzelm@29385
  1211
end;
wenzelm@29385
  1212