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