src/Pure/Isar/proof.ML
author wenzelm
Sun Mar 07 11:57:16 2010 +0100 (2010-03-07)
changeset 35624 c4e29a0bb8c1
parent 34916 f625d8d6fcf3
child 36322 81cba3921ba5
permissions -rw-r--r--
modernized structure Local_Defs;
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
wenzelm@28278
    19
  val map_contexts: (context -> context) -> state -> state
wenzelm@30757
    20
  val bind_terms: (indexname * term option) list -> state -> state
wenzelm@26251
    21
  val put_thms: bool -> string * thm list option -> state -> state
wenzelm@6091
    22
  val the_facts: state -> thm list
wenzelm@9469
    23
  val the_fact: state -> thm
wenzelm@17450
    24
  val put_facts: thm list option -> state -> state
wenzelm@6891
    25
  val assert_forward: state -> state
wenzelm@17359
    26
  val assert_chain: state -> state
wenzelm@9469
    27
  val assert_forward_or_chain: state -> state
wenzelm@5820
    28
  val assert_backward: state -> state
wenzelm@8206
    29
  val assert_no_chain: state -> state
wenzelm@5820
    30
  val enter_forward: state -> state
wenzelm@24543
    31
  val goal_message: (unit -> Pretty.T) -> state -> state
wenzelm@32738
    32
  val show_main_goal: bool Unsynchronized.ref
wenzelm@32738
    33
  val verbose: bool Unsynchronized.ref
wenzelm@12423
    34
  val pretty_state: int -> state -> Pretty.T list
wenzelm@10360
    35
  val pretty_goals: bool -> 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@20208
    39
  val goal_tac: thm -> int -> tactic
wenzelm@17359
    40
  val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq
wenzelm@33288
    41
  val raw_goal: state -> {context: context, facts: thm list, goal: thm}
wenzelm@33288
    42
  val goal: state -> {context: context, facts: thm list, goal: thm}
wenzelm@33288
    43
  val simple_goal: state -> {context: context, goal: thm}
wenzelm@5936
    44
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    45
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@8617
    46
  val let_bind: (string list * string) list -> state -> state
wenzelm@8617
    47
  val let_bind_i: (term list * term) list -> state -> state
haftmann@29581
    48
  val fix: (binding * string option * mixfix) list -> state -> state
haftmann@29581
    49
  val fix_i: (binding * typ option * mixfix) list -> state -> state
wenzelm@20224
    50
  val assm: Assumption.export ->
wenzelm@28084
    51
    (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@20224
    52
  val assm_i: Assumption.export ->
wenzelm@30211
    53
    (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@28084
    54
  val assume: (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@30211
    55
  val assume_i: (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@28084
    56
  val presume: (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@30211
    57
  val presume_i: (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@30211
    58
  val def: (Attrib.binding * ((binding * mixfix) * (string * string list))) list -> state -> state
wenzelm@30211
    59
  val def_i: (Thm.binding * ((binding * mixfix) * (term * term list))) list -> state -> state
wenzelm@17359
    60
  val chain: state -> state
wenzelm@17359
    61
  val chain_facts: thm list -> state -> state
wenzelm@26336
    62
  val get_thmss: state -> (Facts.ref * Attrib.src list) list -> thm list
wenzelm@28084
    63
  val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@30211
    64
  val note_thmss_i: (Thm.binding * (thm list * attribute list) list) list -> state -> state
wenzelm@26336
    65
  val from_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    66
  val from_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@26336
    67
  val with_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    68
  val with_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@26336
    69
  val using: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    70
  val using_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@26336
    71
  val unfolding: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    72
  val unfolding_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@17112
    73
  val invoke_case: string * string option list * Attrib.src list -> state -> state
wenzelm@18728
    74
  val invoke_case_i: string * string option list * attribute list -> state -> state
wenzelm@17359
    75
  val begin_block: state -> state
wenzelm@17359
    76
  val next_block: state -> state
wenzelm@20309
    77
  val end_block: state -> state
wenzelm@17112
    78
  val proof: Method.text option -> state -> state Seq.seq
wenzelm@17112
    79
  val defer: int option -> state -> state Seq.seq
wenzelm@17112
    80
  val prefer: int -> state -> state Seq.seq
wenzelm@17112
    81
  val apply: Method.text -> state -> state Seq.seq
wenzelm@17112
    82
  val apply_end: Method.text -> state -> state Seq.seq
wenzelm@17359
    83
  val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
wenzelm@18728
    84
    (theory -> 'a -> attribute) ->
wenzelm@17359
    85
    (context * 'b list -> context * (term list list * (context -> context))) ->
wenzelm@29383
    86
    string -> Method.text option -> (thm list list -> state -> state) ->
haftmann@29581
    87
    ((binding * 'a list) * 'b) list -> state -> state
wenzelm@29383
    88
  val local_qed: Method.text option * bool -> state -> state
wenzelm@21442
    89
  val theorem: Method.text option -> (thm list list -> context -> context) ->
wenzelm@21362
    90
    (string * string list) list list -> context -> state
wenzelm@21442
    91
  val theorem_i: Method.text option -> (thm list list -> context -> context) ->
wenzelm@21362
    92
    (term * term list) list list -> context -> state
wenzelm@20363
    93
  val global_qed: Method.text option * bool -> state -> context
wenzelm@29383
    94
  val local_terminal_proof: Method.text * Method.text option -> state -> state
wenzelm@29383
    95
  val local_default_proof: state -> state
wenzelm@29383
    96
  val local_immediate_proof: state -> state
wenzelm@29383
    97
  val local_skip_proof: bool -> state -> state
wenzelm@29383
    98
  val local_done_proof: state -> state
wenzelm@20363
    99
  val global_terminal_proof: Method.text * Method.text option -> state -> context
wenzelm@20363
   100
  val global_default_proof: state -> context
wenzelm@20363
   101
  val global_immediate_proof: state -> context
wenzelm@29383
   102
  val global_skip_proof: bool -> state -> context
wenzelm@20363
   103
  val global_done_proof: state -> context
wenzelm@29383
   104
  val have: Method.text option -> (thm list list -> state -> state) ->
wenzelm@28084
   105
    (Attrib.binding * (string * string list) list) list -> bool -> state -> state
wenzelm@29383
   106
  val have_i: Method.text option -> (thm list list -> state -> state) ->
wenzelm@30211
   107
    (Thm.binding * (term * term list) list) list -> bool -> state -> state
wenzelm@29383
   108
  val show: Method.text option -> (thm list list -> state -> state) ->
wenzelm@28084
   109
    (Attrib.binding * (string * string list) list) list -> bool -> state -> state
wenzelm@29383
   110
  val show_i: Method.text option -> (thm list list -> state -> state) ->
wenzelm@30211
   111
    (Thm.binding * (term * term list) list) list -> bool -> state -> state
wenzelm@29385
   112
  val schematic_goal: state -> bool
wenzelm@28452
   113
  val is_relevant: state -> bool
wenzelm@29385
   114
  val local_future_proof: (state -> ('a * state) Future.future) ->
wenzelm@29385
   115
    state -> 'a Future.future * state
wenzelm@29385
   116
  val global_future_proof: (state -> ('a * Proof.context) Future.future) ->
wenzelm@29385
   117
    state -> 'a Future.future * context
wenzelm@29385
   118
  val local_future_terminal_proof: Method.text * Method.text option -> bool -> state -> state
wenzelm@29385
   119
  val global_future_terminal_proof: Method.text * Method.text option -> bool -> state -> context
wenzelm@5820
   120
end;
wenzelm@5820
   121
wenzelm@13377
   122
structure Proof: PROOF =
wenzelm@5820
   123
struct
wenzelm@5820
   124
wenzelm@33031
   125
type context = Proof.context;
wenzelm@17112
   126
type method = Method.method;
wenzelm@16813
   127
wenzelm@5820
   128
wenzelm@5820
   129
(** proof state **)
wenzelm@5820
   130
wenzelm@17359
   131
(* datatype state *)
wenzelm@5820
   132
wenzelm@17112
   133
datatype mode = Forward | Chain | Backward;
wenzelm@5820
   134
wenzelm@17359
   135
datatype state =
wenzelm@17359
   136
  State of node Stack.T
wenzelm@17359
   137
and node =
wenzelm@7176
   138
  Node of
wenzelm@7176
   139
   {context: context,
wenzelm@7176
   140
    facts: thm list option,
wenzelm@7176
   141
    mode: mode,
wenzelm@17359
   142
    goal: goal option}
wenzelm@17359
   143
and goal =
wenzelm@17359
   144
  Goal of
wenzelm@29346
   145
   {statement: (string * Position.T) * term list list * term,
wenzelm@28410
   146
      (*goal kind and statement (starting with vars), initial proposition*)
wenzelm@25958
   147
    messages: (unit -> Pretty.T) list,    (*persistent messages (hints etc.)*)
wenzelm@25958
   148
    using: thm list,                      (*goal facts*)
wenzelm@25958
   149
    goal: thm,                            (*subgoals ==> statement*)
wenzelm@17859
   150
    before_qed: Method.text option,
wenzelm@18124
   151
    after_qed:
wenzelm@29383
   152
      (thm list list -> state -> state) *
wenzelm@20363
   153
      (thm list list -> context -> context)};
wenzelm@17359
   154
wenzelm@24543
   155
fun make_goal (statement, messages, using, goal, before_qed, after_qed) =
wenzelm@24543
   156
  Goal {statement = statement, messages = messages, using = using, goal = goal,
wenzelm@17859
   157
    before_qed = before_qed, after_qed = after_qed};
wenzelm@5820
   158
wenzelm@7176
   159
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   160
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   161
wenzelm@17359
   162
fun map_node f (Node {context, facts, mode, goal}) =
wenzelm@17359
   163
  make_node (f (context, facts, mode, goal));
wenzelm@5820
   164
wenzelm@21727
   165
val init_context =
wenzelm@33165
   166
  ProofContext.set_stmt true #>
wenzelm@33165
   167
  ProofContext.map_naming (K ProofContext.local_naming);
wenzelm@21727
   168
wenzelm@21466
   169
fun init ctxt =
wenzelm@21727
   170
  State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE)));
wenzelm@5820
   171
wenzelm@17359
   172
fun current (State st) = Stack.top st |> (fn Node node => node);
wenzelm@21274
   173
fun map_current f (State st) = State (Stack.map_top (map_node f) st);
wenzelm@28278
   174
fun map_all f (State st) = State (Stack.map_all (map_node f) st);
wenzelm@12045
   175
wenzelm@5820
   176
wenzelm@5820
   177
wenzelm@5820
   178
(** basic proof state operations **)
wenzelm@5820
   179
wenzelm@17359
   180
(* block structure *)
wenzelm@17359
   181
wenzelm@17359
   182
fun open_block (State st) = State (Stack.push st);
wenzelm@17359
   183
wenzelm@18678
   184
fun close_block (State st) = State (Stack.pop st)
wenzelm@18678
   185
  handle Empty => error "Unbalanced block parentheses";
wenzelm@17359
   186
wenzelm@17359
   187
fun level (State st) = Stack.level st;
wenzelm@17359
   188
wenzelm@17359
   189
fun assert_bottom b state =
wenzelm@17359
   190
  let val b' = (level state <= 2) in
wenzelm@18678
   191
    if b andalso not b' then error "Not at bottom of proof!"
wenzelm@18678
   192
    else if not b andalso b' then error "Already at bottom of proof!"
wenzelm@17359
   193
    else state
wenzelm@17359
   194
  end;
wenzelm@17359
   195
wenzelm@17359
   196
wenzelm@5820
   197
(* context *)
wenzelm@5820
   198
wenzelm@17359
   199
val context_of = #context o current;
wenzelm@5820
   200
val theory_of = ProofContext.theory_of o context_of;
wenzelm@5820
   201
wenzelm@17359
   202
fun map_context f =
wenzelm@17359
   203
  map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   204
wenzelm@17359
   205
fun map_context_result f state =
wenzelm@17859
   206
  f (context_of state) ||> (fn ctxt => map_context (K ctxt) state);
wenzelm@5820
   207
wenzelm@28278
   208
fun map_contexts f = map_all (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@28278
   209
wenzelm@30757
   210
val bind_terms = map_context o ProofContext.bind_terms;
wenzelm@26251
   211
val put_thms = map_context oo ProofContext.put_thms;
wenzelm@5820
   212
wenzelm@5820
   213
wenzelm@5820
   214
(* facts *)
wenzelm@5820
   215
wenzelm@17359
   216
val get_facts = #facts o current;
wenzelm@17359
   217
wenzelm@17359
   218
fun the_facts state =
wenzelm@17359
   219
  (case get_facts state of SOME facts => facts
wenzelm@18678
   220
  | NONE => error "No current facts available");
wenzelm@5820
   221
wenzelm@9469
   222
fun the_fact state =
wenzelm@17359
   223
  (case the_facts state of [thm] => thm
wenzelm@18678
   224
  | _ => error "Single theorem expected");
wenzelm@7605
   225
wenzelm@17359
   226
fun put_facts facts =
wenzelm@19078
   227
  map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #>
wenzelm@33386
   228
  put_thms true (Auto_Bind.thisN, facts);
wenzelm@5820
   229
wenzelm@17359
   230
fun these_factss more_facts (named_factss, state) =
wenzelm@19482
   231
  (named_factss, state |> put_facts (SOME (maps snd named_factss @ more_facts)));
wenzelm@5820
   232
wenzelm@17359
   233
fun export_facts inner outer =
wenzelm@17359
   234
  (case get_facts inner of
wenzelm@20309
   235
    NONE => put_facts NONE outer
wenzelm@17359
   236
  | SOME thms =>
wenzelm@17359
   237
      thms
wenzelm@20309
   238
      |> ProofContext.export (context_of inner) (context_of outer)
wenzelm@20309
   239
      |> (fn ths => put_facts (SOME ths) outer));
wenzelm@5820
   240
wenzelm@5820
   241
wenzelm@5820
   242
(* mode *)
wenzelm@5820
   243
wenzelm@17359
   244
val get_mode = #mode o current;
wenzelm@5820
   245
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   246
wenzelm@17359
   247
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove");
wenzelm@5820
   248
wenzelm@5820
   249
fun assert_mode pred state =
wenzelm@5820
   250
  let val mode = get_mode state in
wenzelm@5820
   251
    if pred mode then state
wenzelm@18678
   252
    else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode")
wenzelm@5820
   253
  end;
wenzelm@5820
   254
wenzelm@19308
   255
val assert_forward = assert_mode (fn mode => mode = Forward);
wenzelm@19308
   256
val assert_chain = assert_mode (fn mode => mode = Chain);
wenzelm@19308
   257
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain);
wenzelm@19308
   258
val assert_backward = assert_mode (fn mode => mode = Backward);
wenzelm@19308
   259
val assert_no_chain = assert_mode (fn mode => mode <> Chain);
wenzelm@5820
   260
wenzelm@17359
   261
val enter_forward = put_mode Forward;
wenzelm@17359
   262
val enter_chain = put_mode Chain;
wenzelm@17359
   263
val enter_backward = put_mode Backward;
wenzelm@5820
   264
wenzelm@17359
   265
wenzelm@17359
   266
(* current goal *)
wenzelm@17359
   267
wenzelm@17359
   268
fun current_goal state =
wenzelm@17359
   269
  (case current state of
wenzelm@17359
   270
    {context, goal = SOME (Goal goal), ...} => (context, goal)
wenzelm@18678
   271
  | _ => error "No current goal!");
wenzelm@5820
   272
wenzelm@17359
   273
fun assert_current_goal g state =
wenzelm@17359
   274
  let val g' = can current_goal state in
wenzelm@18678
   275
    if g andalso not g' then error "No goal in this block!"
wenzelm@18678
   276
    else if not g andalso g' then error "Goal present in this block!"
wenzelm@17359
   277
    else state
wenzelm@17359
   278
  end;
wenzelm@6776
   279
wenzelm@17359
   280
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal));
wenzelm@17359
   281
wenzelm@17859
   282
val before_qed = #before_qed o #2 o current_goal;
wenzelm@17859
   283
wenzelm@17359
   284
wenzelm@17359
   285
(* nested goal *)
wenzelm@5820
   286
wenzelm@17359
   287
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) =
wenzelm@17359
   288
      let
wenzelm@24543
   289
        val Goal {statement, messages, using, goal, before_qed, after_qed} = goal;
wenzelm@24543
   290
        val goal' = make_goal (g (statement, messages, using, goal, before_qed, after_qed));
wenzelm@17359
   291
      in State (make_node (f context, facts, mode, SOME goal'), nodes) end
wenzelm@17359
   292
  | map_goal f g (State (nd, node :: nodes)) =
wenzelm@17359
   293
      let val State (node', nodes') = map_goal f g (State (node, nodes))
wenzelm@17359
   294
      in map_context f (State (nd, node' :: nodes')) end
wenzelm@17359
   295
  | map_goal _ _ state = state;
wenzelm@5820
   296
wenzelm@24556
   297
fun set_goal goal = map_goal I (fn (statement, _, using, _, before_qed, after_qed) =>
wenzelm@24556
   298
  (statement, [], using, goal, before_qed, after_qed));
wenzelm@19188
   299
wenzelm@24543
   300
fun goal_message msg = map_goal I (fn (statement, messages, using, goal, before_qed, after_qed) =>
wenzelm@24543
   301
  (statement, msg :: messages, using, goal, before_qed, after_qed));
wenzelm@24543
   302
wenzelm@24556
   303
fun using_facts using = map_goal I (fn (statement, _, _, goal, before_qed, after_qed) =>
wenzelm@24556
   304
  (statement, [], using, goal, before_qed, after_qed));
wenzelm@17359
   305
wenzelm@17359
   306
local
wenzelm@17359
   307
  fun find i state =
wenzelm@17359
   308
    (case try current_goal state of
wenzelm@17359
   309
      SOME (ctxt, goal) => (ctxt, (i, goal))
wenzelm@18678
   310
    | NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present"));
wenzelm@17359
   311
in val find_goal = find 0 end;
wenzelm@17359
   312
wenzelm@17359
   313
fun get_goal state =
wenzelm@17359
   314
  let val (ctxt, (_, {using, goal, ...})) = find_goal state
wenzelm@17359
   315
  in (ctxt, (using, goal)) end;
wenzelm@5820
   316
wenzelm@5820
   317
wenzelm@5820
   318
wenzelm@12423
   319
(** pretty_state **)
wenzelm@5820
   320
wenzelm@32738
   321
val show_main_goal = Unsynchronized.ref false;
wenzelm@16539
   322
val verbose = ProofContext.verbose;
nipkow@13698
   323
skalberg@15531
   324
fun pretty_facts _ _ NONE = []
skalberg@15531
   325
  | pretty_facts s ctxt (SOME ths) =
wenzelm@32091
   326
      [Pretty.big_list (s ^ "this:") (map (Display.pretty_thm ctxt) ths), Pretty.str ""];
wenzelm@6756
   327
wenzelm@17359
   328
fun pretty_state nr state =
wenzelm@5820
   329
  let
wenzelm@17359
   330
    val {context, facts, mode, goal = _} = current state;
wenzelm@5820
   331
wenzelm@5820
   332
    fun levels_up 0 = ""
wenzelm@17359
   333
      | levels_up 1 = "1 level up"
wenzelm@17359
   334
      | levels_up i = string_of_int i ^ " levels up";
wenzelm@5820
   335
wenzelm@11556
   336
    fun subgoals 0 = ""
wenzelm@17359
   337
      | subgoals 1 = "1 subgoal"
wenzelm@17359
   338
      | subgoals n = string_of_int n ^ " subgoals";
wenzelm@17359
   339
wenzelm@17359
   340
    fun description strs =
wenzelm@28375
   341
      (case filter_out (fn s => s = "") strs of [] => ""
wenzelm@17359
   342
      | strs' => enclose " (" ")" (commas strs'));
wenzelm@12146
   343
wenzelm@29416
   344
    fun prt_goal (SOME (ctxt, (i,
wenzelm@29416
   345
      {statement = ((_, pos), _, _), messages, using, goal, before_qed = _, after_qed = _}))) =
wenzelm@17359
   346
          pretty_facts "using " ctxt
wenzelm@17359
   347
            (if mode <> Backward orelse null using then NONE else SOME using) @
wenzelm@21442
   348
          [Pretty.str ("goal" ^
wenzelm@21442
   349
            description [levels_up (i div 2), subgoals (Thm.nprems_of goal)] ^ ":")] @
wenzelm@32187
   350
          Goal_Display.pretty_goals ctxt
wenzelm@32167
   351
            {total = true, main = ! show_main_goal, maxgoals = ! Display.goals_limit} goal @
wenzelm@25958
   352
          (map (fn msg => Position.setmp_thread_data pos msg ()) (rev messages))
wenzelm@17359
   353
      | prt_goal NONE = [];
wenzelm@6848
   354
wenzelm@17359
   355
    val prt_ctxt =
wenzelm@17359
   356
      if ! verbose orelse mode = Forward then ProofContext.pretty_context context
wenzelm@18670
   357
      else if mode = Backward then ProofContext.pretty_ctxt context
wenzelm@7575
   358
      else [];
wenzelm@17359
   359
  in
wenzelm@17359
   360
    [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
wenzelm@17359
   361
      (if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")),
wenzelm@17359
   362
      Pretty.str ""] @
wenzelm@17359
   363
    (if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @
wenzelm@17359
   364
    (if ! verbose orelse mode = Forward then
wenzelm@17359
   365
       pretty_facts "" context facts @ prt_goal (try find_goal state)
wenzelm@17359
   366
     else if mode = Chain then pretty_facts "picking " context facts
wenzelm@17359
   367
     else prt_goal (try find_goal state))
wenzelm@17359
   368
  end;
wenzelm@5820
   369
wenzelm@12085
   370
fun pretty_goals main state =
wenzelm@32167
   371
  let val (ctxt, (_, goal)) = get_goal state in
wenzelm@32187
   372
    Goal_Display.pretty_goals ctxt
wenzelm@32167
   373
      {total = false, main = main, maxgoals = ! Display.goals_limit} goal
wenzelm@32167
   374
  end;
wenzelm@10320
   375
wenzelm@5820
   376
wenzelm@5820
   377
wenzelm@5820
   378
(** proof steps **)
wenzelm@5820
   379
wenzelm@17359
   380
(* refine via method *)
wenzelm@5820
   381
wenzelm@8234
   382
local
wenzelm@8234
   383
wenzelm@16146
   384
fun goalN i = "goal" ^ string_of_int i;
wenzelm@16146
   385
fun goals st = map goalN (1 upto Thm.nprems_of st);
wenzelm@16146
   386
wenzelm@16146
   387
fun no_goal_cases st = map (rpair NONE) (goals st);
wenzelm@16146
   388
wenzelm@16146
   389
fun goal_cases st =
berghofe@34916
   390
  Rule_Cases.make_common (Thm.theory_of_thm st, Thm.prop_of st) (map (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@18475
   401
          (ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #>
wenzelm@18475
   402
           ProofContext.add_cases true meth_cases)
wenzelm@24556
   403
          (K (statement, [], using, goal', before_qed, after_qed)))
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@21687
   412
    |> Seq.lift set_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@19188
   415
      |> Seq.lift set_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@30557
   443
fun finish_tac 0 = K all_tac
wenzelm@30557
   444
  | finish_tac n =
wenzelm@30557
   445
      Goal.norm_hhf_tac THEN'
wenzelm@30557
   446
      SUBGOAL (fn (goal, i) =>
wenzelm@30557
   447
        if can Logic.unprotect (Logic.strip_assums_concl goal) then
wenzelm@30557
   448
          Tactic.etac Drule.protectI i THEN finish_tac (n - 1) i
wenzelm@30557
   449
        else finish_tac (n - 1) (i + 1));
wenzelm@30557
   450
wenzelm@20208
   451
fun goal_tac rule =
wenzelm@30557
   452
  Goal.norm_hhf_tac THEN'
wenzelm@30557
   453
  Tactic.rtac rule THEN'
wenzelm@30557
   454
  finish_tac (Thm.nprems_of rule);
wenzelm@11816
   455
wenzelm@19915
   456
fun refine_goals print_rule inner raw_rules state =
wenzelm@19915
   457
  let
wenzelm@19915
   458
    val (outer, (_, goal)) = get_goal state;
wenzelm@20208
   459
    fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st);
wenzelm@19915
   460
  in
wenzelm@19915
   461
    raw_rules
wenzelm@20309
   462
    |> ProofContext.goal_export inner outer
wenzelm@20309
   463
    |> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state)
wenzelm@19915
   464
  end;
wenzelm@17359
   465
wenzelm@6932
   466
wenzelm@17359
   467
(* conclude_goal *)
wenzelm@6932
   468
wenzelm@28627
   469
fun conclude_goal ctxt goal propss =
wenzelm@5820
   470
  let
wenzelm@28627
   471
    val thy = ProofContext.theory_of ctxt;
wenzelm@24920
   472
    val string_of_term = Syntax.string_of_term ctxt;
wenzelm@32091
   473
    val string_of_thm = Display.string_of_thm ctxt;
wenzelm@5820
   474
wenzelm@17359
   475
    val ngoals = Thm.nprems_of goal;
wenzelm@19774
   476
    val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks
wenzelm@32187
   477
      (Goal_Display.pretty_goals ctxt
wenzelm@32167
   478
          {total = true, main = ! show_main_goal, maxgoals = ! Display.goals_limit} goal @
wenzelm@23639
   479
        [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")])));
wenzelm@20224
   480
wenzelm@20224
   481
    val extra_hyps = Assumption.extra_hyps ctxt goal;
wenzelm@20224
   482
    val _ = null extra_hyps orelse
wenzelm@20224
   483
      error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps));
wenzelm@5820
   484
wenzelm@23418
   485
    fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal);
wenzelm@23418
   486
berghofe@23782
   487
    val th = Goal.conclude
wenzelm@23806
   488
      (if length (flat propss) > 1 then Thm.norm_proof goal else goal)
berghofe@23782
   489
      handle THM _ => lost_structure ();
wenzelm@23418
   490
    val goal_propss = filter_out null propss;
wenzelm@23418
   491
    val results =
wenzelm@23418
   492
      Conjunction.elim_balanced (length goal_propss) th
wenzelm@23418
   493
      |> map2 Conjunction.elim_balanced (map length goal_propss)
wenzelm@23418
   494
      handle THM _ => lost_structure ();
wenzelm@23418
   495
    val _ = Unify.matches_list thy (flat goal_propss) (map Thm.prop_of (flat results)) orelse
wenzelm@19774
   496
      error ("Proved a different theorem:\n" ^ string_of_thm th);
wenzelm@28627
   497
    val _ = Thm.check_shyps (Variable.sorts_of ctxt) th;
wenzelm@23418
   498
wenzelm@23418
   499
    fun recover_result ([] :: pss) thss = [] :: recover_result pss thss
wenzelm@23418
   500
      | recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss
wenzelm@23418
   501
      | recover_result [] [] = []
wenzelm@23418
   502
      | recover_result _ _ = lost_structure ();
wenzelm@23418
   503
  in recover_result propss results end;
wenzelm@5820
   504
wenzelm@5820
   505
wenzelm@33288
   506
(* goal views -- corresponding to methods *)
wenzelm@33288
   507
wenzelm@33288
   508
fun raw_goal state =
wenzelm@33288
   509
  let val (ctxt, (facts, goal)) = get_goal state
wenzelm@33288
   510
  in {context = ctxt, facts = facts, goal = goal} end;
wenzelm@33288
   511
wenzelm@33288
   512
val goal = raw_goal o refine_insert [];
wenzelm@33288
   513
wenzelm@33288
   514
fun simple_goal state =
wenzelm@33288
   515
  let
wenzelm@33288
   516
    val (_, (facts, _)) = get_goal state;
wenzelm@33288
   517
    val (ctxt, (_, goal)) = get_goal (refine_insert facts state);
wenzelm@33288
   518
  in {context = ctxt, goal = goal} end;
wenzelm@33288
   519
wenzelm@33288
   520
wenzelm@5820
   521
wenzelm@5820
   522
(*** structured proof commands ***)
wenzelm@5820
   523
wenzelm@17112
   524
(** context elements **)
wenzelm@5820
   525
wenzelm@17112
   526
(* bindings *)
wenzelm@5820
   527
wenzelm@16813
   528
local
wenzelm@16813
   529
wenzelm@17359
   530
fun gen_bind bind args state =
wenzelm@5820
   531
  state
wenzelm@5820
   532
  |> assert_forward
wenzelm@18308
   533
  |> map_context (bind args #> snd)
wenzelm@17359
   534
  |> put_facts NONE;
wenzelm@5820
   535
wenzelm@16813
   536
in
wenzelm@16813
   537
wenzelm@8617
   538
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   539
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   540
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   541
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   542
wenzelm@16813
   543
end;
wenzelm@16813
   544
wenzelm@5820
   545
wenzelm@17359
   546
(* fix *)
wenzelm@9196
   547
wenzelm@12714
   548
local
wenzelm@12714
   549
wenzelm@30763
   550
fun gen_fix prep_vars args =
wenzelm@17359
   551
  assert_forward
wenzelm@30763
   552
  #> map_context (fn ctxt => snd (ProofContext.add_fixes (prep_vars ctxt args) ctxt))
wenzelm@17359
   553
  #> put_facts NONE;
wenzelm@5820
   554
wenzelm@16813
   555
in
wenzelm@16813
   556
wenzelm@30763
   557
val fix = gen_fix (fn ctxt => fn args => fst (ProofContext.read_vars args ctxt));
wenzelm@30763
   558
val fix_i = gen_fix (K I);
wenzelm@5820
   559
wenzelm@16813
   560
end;
wenzelm@16813
   561
wenzelm@5820
   562
wenzelm@17359
   563
(* assume etc. *)
wenzelm@5820
   564
wenzelm@16813
   565
local
wenzelm@16813
   566
wenzelm@17112
   567
fun gen_assume asm prep_att exp args state =
wenzelm@5820
   568
  state
wenzelm@5820
   569
  |> assert_forward
wenzelm@17112
   570
  |> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args))
wenzelm@17359
   571
  |> these_factss [] |> #2;
wenzelm@6932
   572
wenzelm@16813
   573
in
wenzelm@16813
   574
wenzelm@18728
   575
val assm      = gen_assume ProofContext.add_assms Attrib.attribute;
wenzelm@18670
   576
val assm_i    = gen_assume ProofContext.add_assms_i (K I);
wenzelm@20224
   577
val assume    = assm Assumption.assume_export;
wenzelm@20224
   578
val assume_i  = assm_i Assumption.assume_export;
wenzelm@20224
   579
val presume   = assm Assumption.presume_export;
wenzelm@20224
   580
val presume_i = assm_i Assumption.presume_export;
wenzelm@5820
   581
wenzelm@16813
   582
end;
wenzelm@16813
   583
wenzelm@7271
   584
wenzelm@17359
   585
(* def *)
wenzelm@11891
   586
wenzelm@16813
   587
local
wenzelm@16813
   588
wenzelm@20913
   589
fun gen_def prep_att prep_vars prep_binds args state =
wenzelm@11891
   590
  let
wenzelm@11891
   591
    val _ = assert_forward state;
wenzelm@17112
   592
    val thy = theory_of state;
wenzelm@11891
   593
wenzelm@20913
   594
    val (raw_name_atts, (raw_vars, raw_rhss)) = args |> split_list ||> split_list;
wenzelm@20913
   595
    val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts;
wenzelm@11891
   596
  in
wenzelm@20913
   597
    state
wenzelm@20913
   598
    |> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars))
wenzelm@20913
   599
    |>> map (fn (x, _, mx) => (x, mx))
wenzelm@20913
   600
    |-> (fn vars =>
wenzelm@20913
   601
      map_context_result (prep_binds false (map swap raw_rhss))
wenzelm@35624
   602
      #-> (fn rhss => map_context_result (Local_Defs.add_defs (vars ~~ (name_atts ~~ rhss)))))
wenzelm@20913
   603
    |-> (put_facts o SOME o map (#2 o #2))
wenzelm@11891
   604
  end;
wenzelm@11891
   605
wenzelm@16813
   606
in
wenzelm@16813
   607
wenzelm@20913
   608
val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind;
wenzelm@20913
   609
val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i;
wenzelm@11891
   610
wenzelm@16813
   611
end;
wenzelm@16813
   612
wenzelm@11891
   613
wenzelm@8374
   614
wenzelm@17112
   615
(** facts **)
wenzelm@5820
   616
wenzelm@17359
   617
(* chain *)
wenzelm@5820
   618
wenzelm@24011
   619
fun clean_facts ctxt =
wenzelm@24050
   620
  put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt;
wenzelm@24011
   621
wenzelm@17359
   622
val chain =
wenzelm@17359
   623
  assert_forward
wenzelm@24011
   624
  #> clean_facts
wenzelm@17359
   625
  #> enter_chain;
wenzelm@5820
   626
wenzelm@17359
   627
fun chain_facts facts =
wenzelm@17359
   628
  put_facts (SOME facts)
wenzelm@17359
   629
  #> chain;
wenzelm@5820
   630
wenzelm@5820
   631
wenzelm@17359
   632
(* note etc. *)
wenzelm@17112
   633
haftmann@28965
   634
fun no_binding args = map (pair (Binding.empty, [])) args;
wenzelm@17112
   635
wenzelm@17112
   636
local
wenzelm@17112
   637
wenzelm@30760
   638
fun gen_thmss more_facts opt_chain opt_result prep_atts prep_fact args state =
wenzelm@17112
   639
  state
wenzelm@17112
   640
  |> assert_forward
wenzelm@30761
   641
  |> map_context_result (ProofContext.note_thmss ""
wenzelm@30760
   642
    (Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state)) args))
wenzelm@17112
   643
  |> these_factss (more_facts state)
wenzelm@17359
   644
  ||> opt_chain
wenzelm@17359
   645
  |> opt_result;
wenzelm@17112
   646
wenzelm@17112
   647
in
wenzelm@17112
   648
wenzelm@30760
   649
val note_thmss = gen_thmss (K []) I #2 Attrib.attribute ProofContext.get_fact;
wenzelm@30760
   650
val note_thmss_i = gen_thmss (K []) I #2 (K I) (K I);
wenzelm@17112
   651
wenzelm@30760
   652
val from_thmss = gen_thmss (K []) chain #2 Attrib.attribute ProofContext.get_fact o no_binding;
wenzelm@30760
   653
val from_thmss_i = gen_thmss (K []) chain #2 (K I) (K I) o no_binding;
wenzelm@17359
   654
wenzelm@30760
   655
val with_thmss = gen_thmss the_facts chain #2 Attrib.attribute ProofContext.get_fact o no_binding;
wenzelm@30760
   656
val with_thmss_i = gen_thmss the_facts chain #2 (K I) (K I) o no_binding;
wenzelm@30760
   657
wenzelm@30760
   658
val local_results = gen_thmss (K []) I I (K I) (K I) o map (apsnd Thm.simple_fact);
wenzelm@17359
   659
haftmann@28965
   660
fun get_thmss state srcs = the_facts (note_thmss [((Binding.empty, []), srcs)] state);
wenzelm@17112
   661
wenzelm@17112
   662
end;
wenzelm@17112
   663
wenzelm@17112
   664
wenzelm@18548
   665
(* using/unfolding *)
wenzelm@17112
   666
wenzelm@17112
   667
local
wenzelm@17112
   668
wenzelm@30760
   669
fun gen_using f g prep_atts prep_fact args state =
wenzelm@17112
   670
  state
wenzelm@17112
   671
  |> assert_backward
wenzelm@21442
   672
  |> map_context_result
wenzelm@30761
   673
    (ProofContext.note_thmss ""
wenzelm@30760
   674
      (Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state))
wenzelm@30760
   675
        (no_binding args)))
wenzelm@18843
   676
  |> (fn (named_facts, state') =>
wenzelm@24556
   677
    state' |> map_goal I (fn (statement, _, using, goal, before_qed, after_qed) =>
wenzelm@18843
   678
      let
wenzelm@18843
   679
        val ctxt = context_of state';
wenzelm@19482
   680
        val ths = maps snd named_facts;
wenzelm@24556
   681
      in (statement, [], f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end));
wenzelm@18548
   682
wenzelm@24050
   683
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths;
wenzelm@35624
   684
fun unfold_using ctxt ths = map (Local_Defs.unfold ctxt ths);
wenzelm@35624
   685
val unfold_goals = Local_Defs.unfold_goals;
wenzelm@17112
   686
wenzelm@17112
   687
in
wenzelm@17112
   688
wenzelm@30760
   689
val using = gen_using append_using (K (K I)) Attrib.attribute ProofContext.get_fact;
wenzelm@30760
   690
val using_i = gen_using append_using (K (K I)) (K I) (K I);
wenzelm@30760
   691
val unfolding = gen_using unfold_using unfold_goals Attrib.attribute ProofContext.get_fact;
wenzelm@30760
   692
val unfolding_i = gen_using unfold_using unfold_goals (K I) (K I);
wenzelm@17112
   693
wenzelm@17112
   694
end;
wenzelm@17112
   695
wenzelm@17112
   696
wenzelm@17112
   697
(* case *)
wenzelm@17112
   698
wenzelm@17112
   699
local
wenzelm@17112
   700
wenzelm@30419
   701
fun qualified_binding a =
wenzelm@30419
   702
  Binding.qualify true (Long_Name.qualifier a) (Binding.name (Long_Name.base_name a));
wenzelm@30419
   703
wenzelm@17112
   704
fun gen_invoke_case prep_att (name, xs, raw_atts) state =
wenzelm@17112
   705
  let
wenzelm@17112
   706
    val atts = map (prep_att (theory_of state)) raw_atts;
wenzelm@19078
   707
    val (asms, state') = state |> map_context_result (fn ctxt =>
wenzelm@19078
   708
      ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs));
wenzelm@30419
   709
    val assumptions = asms |> map (fn (a, ts) => ((qualified_binding a, atts), map (rpair []) ts));
wenzelm@17112
   710
  in
wenzelm@17112
   711
    state'
wenzelm@17112
   712
    |> assume_i assumptions
wenzelm@33386
   713
    |> bind_terms Auto_Bind.no_facts
haftmann@28965
   714
    |> `the_facts |-> (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])])
wenzelm@17112
   715
  end;
wenzelm@17112
   716
wenzelm@17112
   717
in
wenzelm@17112
   718
wenzelm@18728
   719
val invoke_case = gen_invoke_case Attrib.attribute;
wenzelm@17112
   720
val invoke_case_i = gen_invoke_case (K I);
wenzelm@17112
   721
wenzelm@17112
   722
end;
wenzelm@17112
   723
wenzelm@17112
   724
wenzelm@17112
   725
wenzelm@17359
   726
(** proof structure **)
wenzelm@17359
   727
wenzelm@17359
   728
(* blocks *)
wenzelm@17359
   729
wenzelm@17359
   730
val begin_block =
wenzelm@17359
   731
  assert_forward
wenzelm@17359
   732
  #> open_block
wenzelm@17359
   733
  #> put_goal NONE
wenzelm@17359
   734
  #> open_block;
wenzelm@17359
   735
wenzelm@17359
   736
val next_block =
wenzelm@17359
   737
  assert_forward
wenzelm@17359
   738
  #> close_block
wenzelm@17359
   739
  #> open_block
wenzelm@17359
   740
  #> put_goal NONE
wenzelm@17359
   741
  #> put_facts NONE;
wenzelm@17359
   742
wenzelm@17359
   743
fun end_block state =
wenzelm@17359
   744
  state
wenzelm@17359
   745
  |> assert_forward
wenzelm@17359
   746
  |> close_block
wenzelm@17359
   747
  |> assert_current_goal false
wenzelm@17359
   748
  |> close_block
wenzelm@17359
   749
  |> export_facts state;
wenzelm@17359
   750
wenzelm@17359
   751
wenzelm@17359
   752
(* sub-proofs *)
wenzelm@17359
   753
wenzelm@17359
   754
fun proof opt_text =
wenzelm@17359
   755
  assert_backward
wenzelm@17859
   756
  #> refine (the_default Method.default_text opt_text)
wenzelm@17359
   757
  #> Seq.map (using_facts [] #> enter_forward);
wenzelm@17359
   758
wenzelm@23360
   759
fun end_proof bot txt state =
wenzelm@23360
   760
  state
wenzelm@23360
   761
  |> assert_forward
wenzelm@23360
   762
  |> assert_bottom bot
wenzelm@23360
   763
  |> close_block
wenzelm@23360
   764
  |> assert_current_goal true
wenzelm@23360
   765
  |> using_facts []
wenzelm@23360
   766
  |> `before_qed |-> (refine o the_default Method.succeed_text)
wenzelm@32193
   767
  |> Seq.maps (refine (Method.finish_text txt));
wenzelm@17359
   768
wenzelm@29383
   769
fun check_result msg sq =
wenzelm@29383
   770
  (case Seq.pull sq of
wenzelm@29383
   771
    NONE => error msg
wenzelm@29383
   772
  | SOME (s, _) => s);
wenzelm@29383
   773
wenzelm@29383
   774
fun check_finish sq = check_result "Failed to finish proof" sq;
wenzelm@29383
   775
wenzelm@17359
   776
wenzelm@17359
   777
(* unstructured refinement *)
wenzelm@17359
   778
wenzelm@32193
   779
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i)));
wenzelm@32193
   780
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i)));
wenzelm@17359
   781
wenzelm@17359
   782
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
wenzelm@17359
   783
fun apply_end text = assert_forward #> refine_end text;
wenzelm@17359
   784
wenzelm@17359
   785
wenzelm@17359
   786
wenzelm@17112
   787
(** goals **)
wenzelm@17112
   788
wenzelm@17359
   789
(* generic goals *)
wenzelm@17359
   790
wenzelm@19774
   791
local
wenzelm@19774
   792
wenzelm@19846
   793
fun implicit_vars dest add props =
wenzelm@19846
   794
  let
wenzelm@19846
   795
    val (explicit_vars, props') = take_prefix (can dest) props |>> map dest;
wenzelm@19846
   796
    val vars = rev (subtract (op =) explicit_vars (fold add props []));
wenzelm@19846
   797
    val _ =
wenzelm@19846
   798
      if null vars then ()
wenzelm@19846
   799
      else warning ("Goal statement contains unbound schematic variable(s): " ^
wenzelm@19846
   800
        commas_quote (map (Term.string_of_vname o fst) vars));
wenzelm@19846
   801
  in (rev vars, props') end;
wenzelm@19774
   802
wenzelm@19774
   803
fun refine_terms n =
wenzelm@30510
   804
  refine (Method.Basic (K (RAW_METHOD
wenzelm@19774
   805
    (K (HEADGOAL (PRECISE_CONJUNCTS n
wenzelm@32193
   806
      (HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI))))))))))
wenzelm@19774
   807
  #> Seq.hd;
wenzelm@19774
   808
wenzelm@19774
   809
in
wenzelm@17359
   810
wenzelm@17859
   811
fun generic_goal prepp kind before_qed after_qed raw_propp state =
wenzelm@5820
   812
  let
wenzelm@17359
   813
    val thy = theory_of state;
wenzelm@23418
   814
    val cert = Thm.cterm_of thy;
wenzelm@17359
   815
    val chaining = can assert_chain state;
wenzelm@25958
   816
    val pos = Position.thread_data ();
wenzelm@17359
   817
wenzelm@17359
   818
    val ((propss, after_ctxt), goal_state) =
wenzelm@5936
   819
      state
wenzelm@5936
   820
      |> assert_forward_or_chain
wenzelm@5936
   821
      |> enter_forward
wenzelm@17359
   822
      |> open_block
wenzelm@17859
   823
      |> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp)));
wenzelm@19482
   824
    val props = flat propss;
wenzelm@15703
   825
wenzelm@19846
   826
    val (_, props') =
wenzelm@19846
   827
      implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props;
wenzelm@19846
   828
    val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props';
wenzelm@19774
   829
wenzelm@19774
   830
    val propss' = map (Logic.mk_term o Var) vars :: propss;
wenzelm@23418
   831
    val goal_propss = filter_out null propss';
wenzelm@29346
   832
    val goal =
wenzelm@29346
   833
      cert (Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss))
wenzelm@28627
   834
      |> Thm.weaken_sorts (Variable.sorts_of (context_of goal_state));
wenzelm@29346
   835
    val statement = ((kind, pos), propss', Thm.term_of goal);
wenzelm@18124
   836
    val after_qed' = after_qed |>> (fn after_local =>
wenzelm@18124
   837
      fn results => map_context after_ctxt #> after_local results);
wenzelm@5820
   838
  in
wenzelm@17359
   839
    goal_state
wenzelm@21727
   840
    |> map_context (init_context #> Variable.set_body true)
wenzelm@28410
   841
    |> put_goal (SOME (make_goal (statement, [], [], Goal.init goal, before_qed, after_qed')))
wenzelm@17359
   842
    |> map_context (ProofContext.auto_bind_goal props)
wenzelm@21565
   843
    |> chaining ? (`the_facts #-> using_facts)
wenzelm@17359
   844
    |> put_facts NONE
wenzelm@17359
   845
    |> open_block
wenzelm@17359
   846
    |> put_goal NONE
wenzelm@5820
   847
    |> enter_backward
wenzelm@23418
   848
    |> not (null vars) ? refine_terms (length goal_propss)
wenzelm@32193
   849
    |> null props ? (refine (Method.Basic Method.assumption) #> Seq.hd)
wenzelm@5820
   850
  end;
wenzelm@5820
   851
wenzelm@29090
   852
fun generic_qed after_ctxt state =
wenzelm@12503
   853
  let
wenzelm@25958
   854
    val (goal_ctxt, {statement, goal, after_qed, ...}) = current_goal state;
wenzelm@8617
   855
    val outer_state = state |> close_block;
wenzelm@8617
   856
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   857
wenzelm@28410
   858
    val ((_, pos), stmt, _) = statement;
wenzelm@18503
   859
    val props =
wenzelm@19774
   860
      flat (tl stmt)
wenzelm@19915
   861
      |> Variable.exportT_terms goal_ctxt outer_ctxt;
wenzelm@17359
   862
    val results =
wenzelm@28627
   863
      tl (conclude_goal goal_ctxt goal stmt)
wenzelm@20309
   864
      |> burrow (ProofContext.export goal_ctxt outer_ctxt);
wenzelm@17359
   865
  in
wenzelm@17359
   866
    outer_state
wenzelm@29090
   867
    |> map_context (after_ctxt props)
wenzelm@34239
   868
    |> pair (after_qed, results)
wenzelm@17359
   869
  end;
wenzelm@17359
   870
wenzelm@19774
   871
end;
wenzelm@19774
   872
wenzelm@9469
   873
wenzelm@17359
   874
(* local goals *)
wenzelm@17359
   875
wenzelm@17859
   876
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state =
wenzelm@17359
   877
  let
wenzelm@21362
   878
    val thy = theory_of state;
wenzelm@21362
   879
    val ((names, attss), propp) =
wenzelm@21362
   880
      Attrib.map_specs (prep_att thy) stmt |> split_list |>> split_list;
wenzelm@17359
   881
wenzelm@18124
   882
    fun after_qed' results =
wenzelm@18808
   883
      local_results ((names ~~ attss) ~~ results)
wenzelm@17359
   884
      #-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
wenzelm@18124
   885
      #> after_qed results;
wenzelm@5820
   886
  in
wenzelm@17359
   887
    state
wenzelm@21362
   888
    |> generic_goal prepp kind before_qed (after_qed', K I) propp
wenzelm@19900
   889
    |> tap (Variable.warn_extra_tfrees (context_of state) o context_of)
wenzelm@5820
   890
  end;
wenzelm@5820
   891
wenzelm@29383
   892
fun local_qeds txt =
wenzelm@29383
   893
  end_proof false txt
wenzelm@29383
   894
  #> Seq.map (generic_qed ProofContext.auto_bind_facts #->
wenzelm@29090
   895
    (fn ((after_qed, _), results) => after_qed results));
wenzelm@5820
   896
wenzelm@29383
   897
fun local_qed txt = local_qeds txt #> check_finish;
wenzelm@29383
   898
wenzelm@5820
   899
wenzelm@17359
   900
(* global goals *)
wenzelm@17359
   901
wenzelm@21442
   902
fun global_goal prepp before_qed after_qed propp ctxt =
wenzelm@21362
   903
  init ctxt
wenzelm@29383
   904
  |> generic_goal (prepp #> ProofContext.auto_fixes) "" before_qed (K I, after_qed) propp;
wenzelm@17359
   905
wenzelm@21362
   906
val theorem = global_goal ProofContext.bind_propp_schematic;
wenzelm@21362
   907
val theorem_i = global_goal ProofContext.bind_propp_schematic_i;
wenzelm@12065
   908
wenzelm@17359
   909
fun global_qeds txt =
wenzelm@17359
   910
  end_proof true txt
wenzelm@29090
   911
  #> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) =>
wenzelm@29383
   912
    after_qed results (context_of state)));
wenzelm@17112
   913
wenzelm@29383
   914
fun global_qed txt = global_qeds txt #> check_finish;
wenzelm@12959
   915
wenzelm@5820
   916
wenzelm@17359
   917
(* concluding steps *)
wenzelm@17112
   918
wenzelm@29383
   919
fun terminal_proof qed initial terminal =
wenzelm@29383
   920
  proof (SOME initial) #> Seq.maps (qed terminal) #> check_finish;
wenzelm@17112
   921
wenzelm@29383
   922
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true);
wenzelm@17112
   923
val local_default_proof = local_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   924
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE);
wenzelm@17359
   925
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE);
wenzelm@29383
   926
val local_done_proof = terminal_proof local_qeds Method.done_text (NONE, false);
wenzelm@17112
   927
wenzelm@29383
   928
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true);
wenzelm@17112
   929
val global_default_proof = global_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   930
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE);
wenzelm@17359
   931
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE);
wenzelm@29383
   932
val global_done_proof = terminal_proof global_qeds Method.done_text (NONE, false);
wenzelm@5820
   933
wenzelm@6896
   934
wenzelm@17359
   935
(* common goal statements *)
wenzelm@17359
   936
wenzelm@17359
   937
local
wenzelm@17359
   938
wenzelm@17859
   939
fun gen_have prep_att prepp before_qed after_qed stmt int =
wenzelm@33389
   940
  local_goal (Proof_Display.print_results int) prep_att prepp "have" before_qed after_qed stmt;
wenzelm@6896
   941
wenzelm@17859
   942
fun gen_show prep_att prepp before_qed after_qed stmt int state =
wenzelm@17359
   943
  let
wenzelm@32738
   944
    val testing = Unsynchronized.ref false;
wenzelm@32738
   945
    val rule = Unsynchronized.ref (NONE: thm option);
wenzelm@17359
   946
    fun fail_msg ctxt =
wenzelm@29383
   947
      "Local statement will fail to refine any pending goal" ::
wenzelm@33389
   948
      (case ! rule of NONE => [] | SOME th => [Proof_Display.string_of_rule ctxt "Failed" th])
wenzelm@17359
   949
      |> cat_lines;
wenzelm@6896
   950
wenzelm@17359
   951
    fun print_results ctxt res =
wenzelm@33389
   952
      if ! testing then () else Proof_Display.print_results int ctxt res;
wenzelm@17359
   953
    fun print_rule ctxt th =
wenzelm@17359
   954
      if ! testing then rule := SOME th
wenzelm@33389
   955
      else if int then priority (Proof_Display.string_of_rule ctxt "Successful" th)
wenzelm@17359
   956
      else ();
wenzelm@17359
   957
    val test_proof =
wenzelm@29383
   958
      try (local_skip_proof true)
wenzelm@28289
   959
      |> setmp_noncritical testing true
wenzelm@23963
   960
      |> Exn.capture;
wenzelm@6896
   961
wenzelm@18124
   962
    fun after_qed' results =
wenzelm@19482
   963
      refine_goals print_rule (context_of state) (flat results)
wenzelm@29383
   964
      #> check_result "Failed to refine any pending goal"
wenzelm@29383
   965
      #> after_qed results;
wenzelm@17359
   966
  in
wenzelm@17359
   967
    state
wenzelm@17859
   968
    |> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt
wenzelm@21565
   969
    |> int ? (fn goal_state =>
wenzelm@17359
   970
      (case test_proof goal_state of
wenzelm@23963
   971
        Exn.Result (SOME _) => goal_state
wenzelm@23963
   972
      | Exn.Result NONE => error (fail_msg (context_of goal_state))
wenzelm@28443
   973
      | Exn.Exn Exn.Interrupt => raise Exn.Interrupt
wenzelm@28458
   974
      | Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))])))
wenzelm@17359
   975
  end;
wenzelm@17359
   976
wenzelm@17359
   977
in
wenzelm@17359
   978
wenzelm@18728
   979
val have = gen_have Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   980
val have_i = gen_have (K I) ProofContext.bind_propp_i;
wenzelm@18728
   981
val show = gen_show Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   982
val show_i = gen_show (K I) ProofContext.bind_propp_i;
wenzelm@6896
   983
wenzelm@5820
   984
end;
wenzelm@17359
   985
wenzelm@28410
   986
wenzelm@29385
   987
wenzelm@29385
   988
(** future proofs **)
wenzelm@29385
   989
wenzelm@29385
   990
(* relevant proof states *)
wenzelm@29385
   991
wenzelm@29385
   992
fun is_schematic t =
wenzelm@29385
   993
  Term.exists_subterm Term.is_Var t orelse
wenzelm@29385
   994
  Term.exists_type (Term.exists_subtype Term.is_TVar) t;
wenzelm@29385
   995
wenzelm@29385
   996
fun schematic_goal state =
wenzelm@29385
   997
  let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state
wenzelm@29385
   998
  in is_schematic prop end;
wenzelm@29385
   999
wenzelm@29385
  1000
fun is_relevant state =
wenzelm@29385
  1001
  (case try find_goal state of
wenzelm@29385
  1002
    NONE => true
wenzelm@29385
  1003
  | SOME (_, (_, {statement = (_, _, prop), goal, ...})) =>
wenzelm@29385
  1004
      is_schematic prop orelse not (Logic.protect prop aconv Thm.concl_of goal));
wenzelm@29385
  1005
wenzelm@29385
  1006
wenzelm@29385
  1007
(* full proofs *)
wenzelm@28410
  1008
wenzelm@29346
  1009
local
wenzelm@29346
  1010
wenzelm@29385
  1011
fun future_proof done get_context fork_proof state =
wenzelm@28410
  1012
  let
wenzelm@29381
  1013
    val _ = assert_backward state;
wenzelm@28410
  1014
    val (goal_ctxt, (_, goal)) = find_goal state;
wenzelm@32786
  1015
    val {statement as (kind, _, prop), messages, using, goal, before_qed, after_qed} = goal;
wenzelm@32062
  1016
    val goal_txt = prop :: map Thm.term_of (Assumption.all_assms_of goal_ctxt);
wenzelm@28410
  1017
wenzelm@29383
  1018
    val _ = is_relevant state andalso error "Cannot fork relevant proof";
wenzelm@29383
  1019
wenzelm@29346
  1020
    val prop' = Logic.protect prop;
wenzelm@29346
  1021
    val statement' = (kind, [[], [prop']], prop');
wenzelm@29346
  1022
    val goal' = Thm.adjust_maxidx_thm (Thm.maxidx_of goal)
wenzelm@29346
  1023
      (Drule.comp_no_flatten (goal, Thm.nprems_of goal) 1 Drule.protectI);
wenzelm@29385
  1024
wenzelm@33386
  1025
    fun after_local' [[th]] = put_thms false (Auto_Bind.thisN, SOME [th]);
wenzelm@33386
  1026
    fun after_global' [[th]] = ProofContext.put_thms false (Auto_Bind.thisN, SOME [th]);
wenzelm@29385
  1027
    val after_qed' = (after_local', after_global');
wenzelm@33386
  1028
    val this_name = ProofContext.full_name goal_ctxt (Binding.name Auto_Bind.thisN);
wenzelm@28410
  1029
wenzelm@28973
  1030
    val result_ctxt =
wenzelm@28973
  1031
      state
wenzelm@32062
  1032
      |> map_contexts (fold Variable.declare_term goal_txt)
wenzelm@29385
  1033
      |> map_goal I (K (statement', messages, using, goal', before_qed, after_qed'))
wenzelm@29346
  1034
      |> fork_proof;
wenzelm@28973
  1035
wenzelm@29385
  1036
    val future_thm = result_ctxt |> Future.map (fn (_, x) =>
wenzelm@29385
  1037
      ProofContext.get_fact_single (get_context x) (Facts.named this_name));
wenzelm@32062
  1038
    val finished_goal = Goal.future_result goal_ctxt future_thm prop';
wenzelm@28973
  1039
    val state' =
wenzelm@28973
  1040
      state
wenzelm@28973
  1041
      |> map_goal I (K (statement, messages, using, finished_goal, NONE, after_qed))
wenzelm@29385
  1042
      |> done;
wenzelm@28973
  1043
  in (Future.map #1 result_ctxt, state') end;
wenzelm@28410
  1044
wenzelm@29385
  1045
in
wenzelm@29385
  1046
wenzelm@29385
  1047
fun local_future_proof x = future_proof local_done_proof context_of x;
wenzelm@29385
  1048
fun global_future_proof x = future_proof global_done_proof I x;
wenzelm@29385
  1049
wenzelm@17359
  1050
end;
wenzelm@29346
  1051
wenzelm@29385
  1052
wenzelm@29385
  1053
(* terminal proofs *)
wenzelm@29385
  1054
wenzelm@29385
  1055
local
wenzelm@29385
  1056
wenzelm@29385
  1057
fun future_terminal_proof proof1 proof2 meths int state =
wenzelm@32061
  1058
  if int orelse is_relevant state orelse not (Goal.local_future_enabled ())
wenzelm@29385
  1059
  then proof1 meths state
wenzelm@32062
  1060
  else snd (proof2 (fn state' => Future.fork_pri ~1 (fn () => ((), proof1 meths state'))) state);
wenzelm@29385
  1061
wenzelm@29385
  1062
in
wenzelm@29385
  1063
wenzelm@29385
  1064
fun local_future_terminal_proof x =
wenzelm@29385
  1065
  future_terminal_proof local_terminal_proof local_future_proof x;
wenzelm@29385
  1066
wenzelm@29385
  1067
fun global_future_terminal_proof x =
wenzelm@29385
  1068
  future_terminal_proof global_terminal_proof global_future_proof x;
wenzelm@29350
  1069
wenzelm@29346
  1070
end;
wenzelm@29346
  1071
wenzelm@29385
  1072
end;
wenzelm@29385
  1073