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