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