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