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