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