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