src/Pure/Isar/proof.ML
author wenzelm
Tue Oct 20 21:26:45 2009 +0200 (2009-10-20)
changeset 33031 b75c35574e04
parent 32856 92d9555ac790
child 33165 50c4debfd5ae
permissions -rw-r--r--
backpatching of structure Proof and ProofContext -- avoid odd aliases;
renamed transfer_proof to raw_transfer;
indicate firm naming conventions for theory, Proof.context, Context.generic;
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@17359
    32
  val get_goal: state -> context * (thm list * thm)
wenzelm@32738
    33
  val show_main_goal: bool Unsynchronized.ref
wenzelm@32738
    34
  val verbose: bool Unsynchronized.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@32771
    40
  val flat_goal: state -> Proof.context * thm
wenzelm@20208
    41
  val goal_tac: thm -> int -> tactic
wenzelm@17359
    42
  val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq
wenzelm@5936
    43
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    44
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@8617
    45
  val let_bind: (string list * string) list -> state -> state
wenzelm@8617
    46
  val let_bind_i: (term list * term) list -> state -> state
haftmann@29581
    47
  val fix: (binding * string option * mixfix) list -> state -> state
haftmann@29581
    48
  val fix_i: (binding * typ option * mixfix) list -> state -> state
wenzelm@20224
    49
  val assm: Assumption.export ->
wenzelm@28084
    50
    (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@20224
    51
  val assm_i: Assumption.export ->
wenzelm@30211
    52
    (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@28084
    53
  val assume: (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@30211
    54
  val assume_i: (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@28084
    55
  val presume: (Attrib.binding * (string * string list) list) list -> state -> state
wenzelm@30211
    56
  val presume_i: (Thm.binding * (term * term list) list) list -> state -> state
wenzelm@30211
    57
  val def: (Attrib.binding * ((binding * mixfix) * (string * string list))) list -> state -> state
wenzelm@30211
    58
  val def_i: (Thm.binding * ((binding * mixfix) * (term * term list))) list -> state -> state
wenzelm@17359
    59
  val chain: state -> state
wenzelm@17359
    60
  val chain_facts: thm list -> state -> state
wenzelm@26336
    61
  val get_thmss: state -> (Facts.ref * Attrib.src list) list -> thm list
wenzelm@28084
    62
  val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@30211
    63
  val note_thmss_i: (Thm.binding * (thm list * attribute list) list) list -> state -> state
wenzelm@26336
    64
  val from_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    65
  val from_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@26336
    66
  val with_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    67
  val with_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@26336
    68
  val using: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    69
  val using_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@26336
    70
  val unfolding: ((Facts.ref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    71
  val unfolding_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@17112
    72
  val invoke_case: string * string option list * Attrib.src list -> state -> state
wenzelm@18728
    73
  val invoke_case_i: string * string option list * attribute list -> state -> state
wenzelm@17359
    74
  val begin_block: state -> state
wenzelm@17359
    75
  val next_block: state -> state
wenzelm@20309
    76
  val end_block: state -> state
wenzelm@17112
    77
  val proof: Method.text option -> state -> state Seq.seq
wenzelm@17112
    78
  val defer: int option -> state -> state Seq.seq
wenzelm@17112
    79
  val prefer: int -> state -> state Seq.seq
wenzelm@17112
    80
  val apply: Method.text -> state -> state Seq.seq
wenzelm@17112
    81
  val apply_end: Method.text -> state -> state Seq.seq
wenzelm@17359
    82
  val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
wenzelm@18728
    83
    (theory -> 'a -> attribute) ->
wenzelm@17359
    84
    (context * 'b list -> context * (term list list * (context -> context))) ->
wenzelm@29383
    85
    string -> Method.text option -> (thm list list -> state -> state) ->
haftmann@29581
    86
    ((binding * 'a list) * 'b) list -> state -> state
wenzelm@29383
    87
  val local_qed: Method.text option * bool -> state -> state
wenzelm@21442
    88
  val theorem: Method.text option -> (thm list list -> context -> context) ->
wenzelm@21362
    89
    (string * string list) list list -> context -> state
wenzelm@21442
    90
  val theorem_i: Method.text option -> (thm list list -> context -> context) ->
wenzelm@21362
    91
    (term * term list) list list -> context -> state
wenzelm@20363
    92
  val global_qed: Method.text option * bool -> state -> context
wenzelm@29383
    93
  val local_terminal_proof: Method.text * Method.text option -> state -> state
wenzelm@29383
    94
  val local_default_proof: state -> state
wenzelm@29383
    95
  val local_immediate_proof: state -> state
wenzelm@29383
    96
  val local_skip_proof: bool -> state -> state
wenzelm@29383
    97
  val local_done_proof: state -> state
wenzelm@20363
    98
  val global_terminal_proof: Method.text * Method.text option -> state -> context
wenzelm@20363
    99
  val global_default_proof: state -> context
wenzelm@20363
   100
  val global_immediate_proof: state -> context
wenzelm@29383
   101
  val global_skip_proof: bool -> state -> context
wenzelm@20363
   102
  val global_done_proof: state -> context
wenzelm@29383
   103
  val have: Method.text option -> (thm list list -> state -> state) ->
wenzelm@28084
   104
    (Attrib.binding * (string * string list) list) list -> bool -> state -> state
wenzelm@29383
   105
  val have_i: Method.text option -> (thm list list -> state -> state) ->
wenzelm@30211
   106
    (Thm.binding * (term * term list) list) list -> bool -> state -> state
wenzelm@29383
   107
  val show: 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 show_i: Method.text option -> (thm list list -> state -> state) ->
wenzelm@30211
   110
    (Thm.binding * (term * term list) list) list -> bool -> state -> state
wenzelm@29385
   111
  val schematic_goal: state -> bool
wenzelm@28452
   112
  val is_relevant: state -> bool
wenzelm@29385
   113
  val local_future_proof: (state -> ('a * state) Future.future) ->
wenzelm@29385
   114
    state -> 'a Future.future * state
wenzelm@29385
   115
  val global_future_proof: (state -> ('a * Proof.context) Future.future) ->
wenzelm@29385
   116
    state -> 'a Future.future * context
wenzelm@29385
   117
  val local_future_terminal_proof: Method.text * Method.text option -> bool -> state -> state
wenzelm@29385
   118
  val global_future_terminal_proof: Method.text * Method.text option -> bool -> state -> context
wenzelm@5820
   119
end;
wenzelm@5820
   120
wenzelm@13377
   121
structure Proof: PROOF =
wenzelm@5820
   122
struct
wenzelm@5820
   123
wenzelm@33031
   124
type context = Proof.context;
wenzelm@17112
   125
type method = Method.method;
wenzelm@16813
   126
wenzelm@5820
   127
wenzelm@5820
   128
(** proof state **)
wenzelm@5820
   129
wenzelm@17359
   130
(* datatype state *)
wenzelm@5820
   131
wenzelm@17112
   132
datatype mode = Forward | Chain | Backward;
wenzelm@5820
   133
wenzelm@17359
   134
datatype state =
wenzelm@17359
   135
  State of node Stack.T
wenzelm@17359
   136
and node =
wenzelm@7176
   137
  Node of
wenzelm@7176
   138
   {context: context,
wenzelm@7176
   139
    facts: thm list option,
wenzelm@7176
   140
    mode: mode,
wenzelm@17359
   141
    goal: goal option}
wenzelm@17359
   142
and goal =
wenzelm@17359
   143
  Goal of
wenzelm@29346
   144
   {statement: (string * Position.T) * term list list * term,
wenzelm@28410
   145
      (*goal kind and statement (starting with vars), initial proposition*)
wenzelm@25958
   146
    messages: (unit -> Pretty.T) list,    (*persistent messages (hints etc.)*)
wenzelm@25958
   147
    using: thm list,                      (*goal facts*)
wenzelm@25958
   148
    goal: thm,                            (*subgoals ==> statement*)
wenzelm@17859
   149
    before_qed: Method.text option,
wenzelm@18124
   150
    after_qed:
wenzelm@29383
   151
      (thm list list -> state -> state) *
wenzelm@20363
   152
      (thm list list -> context -> context)};
wenzelm@17359
   153
wenzelm@24543
   154
fun make_goal (statement, messages, using, goal, before_qed, after_qed) =
wenzelm@24543
   155
  Goal {statement = statement, messages = messages, using = using, goal = goal,
wenzelm@17859
   156
    before_qed = before_qed, after_qed = after_qed};
wenzelm@5820
   157
wenzelm@7176
   158
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   159
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   160
wenzelm@17359
   161
fun map_node f (Node {context, facts, mode, goal}) =
wenzelm@17359
   162
  make_node (f (context, facts, mode, goal));
wenzelm@5820
   163
wenzelm@21727
   164
val init_context =
wenzelm@21727
   165
  ProofContext.set_stmt true #> ProofContext.reset_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@26251
   226
  put_thms true (AutoBind.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 =
wenzelm@18607
   388
  RuleCases.make_common true (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@32771
   438
fun flat_goal state =
wenzelm@32771
   439
  let
wenzelm@32771
   440
    val (_, (using, _)) = get_goal state;
wenzelm@32771
   441
    val (ctxt, (_, goal)) = get_goal (refine_insert using state);
wenzelm@32771
   442
  in (ctxt, goal) end;
wenzelm@32771
   443
wenzelm@5820
   444
wenzelm@17359
   445
(* refine via sub-proof *)
wenzelm@17359
   446
wenzelm@30557
   447
fun finish_tac 0 = K all_tac
wenzelm@30557
   448
  | finish_tac n =
wenzelm@30557
   449
      Goal.norm_hhf_tac THEN'
wenzelm@30557
   450
      SUBGOAL (fn (goal, i) =>
wenzelm@30557
   451
        if can Logic.unprotect (Logic.strip_assums_concl goal) then
wenzelm@30557
   452
          Tactic.etac Drule.protectI i THEN finish_tac (n - 1) i
wenzelm@30557
   453
        else finish_tac (n - 1) (i + 1));
wenzelm@30557
   454
wenzelm@20208
   455
fun goal_tac rule =
wenzelm@30557
   456
  Goal.norm_hhf_tac THEN'
wenzelm@30557
   457
  Tactic.rtac rule THEN'
wenzelm@30557
   458
  finish_tac (Thm.nprems_of rule);
wenzelm@11816
   459
wenzelm@19915
   460
fun refine_goals print_rule inner raw_rules state =
wenzelm@19915
   461
  let
wenzelm@19915
   462
    val (outer, (_, goal)) = get_goal state;
wenzelm@20208
   463
    fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st);
wenzelm@19915
   464
  in
wenzelm@19915
   465
    raw_rules
wenzelm@20309
   466
    |> ProofContext.goal_export inner outer
wenzelm@20309
   467
    |> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state)
wenzelm@19915
   468
  end;
wenzelm@17359
   469
wenzelm@6932
   470
wenzelm@17359
   471
(* conclude_goal *)
wenzelm@6932
   472
wenzelm@28627
   473
fun conclude_goal ctxt goal propss =
wenzelm@5820
   474
  let
wenzelm@28627
   475
    val thy = ProofContext.theory_of ctxt;
wenzelm@24920
   476
    val string_of_term = Syntax.string_of_term ctxt;
wenzelm@32091
   477
    val string_of_thm = Display.string_of_thm ctxt;
wenzelm@5820
   478
wenzelm@17359
   479
    val ngoals = Thm.nprems_of goal;
wenzelm@19774
   480
    val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks
wenzelm@32187
   481
      (Goal_Display.pretty_goals ctxt
wenzelm@32167
   482
          {total = true, main = ! show_main_goal, maxgoals = ! Display.goals_limit} goal @
wenzelm@23639
   483
        [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")])));
wenzelm@20224
   484
wenzelm@20224
   485
    val extra_hyps = Assumption.extra_hyps ctxt goal;
wenzelm@20224
   486
    val _ = null extra_hyps orelse
wenzelm@20224
   487
      error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps));
wenzelm@5820
   488
wenzelm@23418
   489
    fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal);
wenzelm@23418
   490
berghofe@23782
   491
    val th = Goal.conclude
wenzelm@23806
   492
      (if length (flat propss) > 1 then Thm.norm_proof goal else goal)
berghofe@23782
   493
      handle THM _ => lost_structure ();
wenzelm@23418
   494
    val goal_propss = filter_out null propss;
wenzelm@23418
   495
    val results =
wenzelm@23418
   496
      Conjunction.elim_balanced (length goal_propss) th
wenzelm@23418
   497
      |> map2 Conjunction.elim_balanced (map length goal_propss)
wenzelm@23418
   498
      handle THM _ => lost_structure ();
wenzelm@23418
   499
    val _ = Unify.matches_list thy (flat goal_propss) (map Thm.prop_of (flat results)) orelse
wenzelm@19774
   500
      error ("Proved a different theorem:\n" ^ string_of_thm th);
wenzelm@28627
   501
    val _ = Thm.check_shyps (Variable.sorts_of ctxt) th;
wenzelm@23418
   502
wenzelm@23418
   503
    fun recover_result ([] :: pss) thss = [] :: recover_result pss thss
wenzelm@23418
   504
      | recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss
wenzelm@23418
   505
      | recover_result [] [] = []
wenzelm@23418
   506
      | recover_result _ _ = lost_structure ();
wenzelm@23418
   507
  in recover_result propss results end;
wenzelm@5820
   508
wenzelm@5820
   509
wenzelm@5820
   510
wenzelm@5820
   511
(*** structured proof commands ***)
wenzelm@5820
   512
wenzelm@17112
   513
(** context elements **)
wenzelm@5820
   514
wenzelm@17112
   515
(* bindings *)
wenzelm@5820
   516
wenzelm@16813
   517
local
wenzelm@16813
   518
wenzelm@17359
   519
fun gen_bind bind args state =
wenzelm@5820
   520
  state
wenzelm@5820
   521
  |> assert_forward
wenzelm@18308
   522
  |> map_context (bind args #> snd)
wenzelm@17359
   523
  |> put_facts NONE;
wenzelm@5820
   524
wenzelm@16813
   525
in
wenzelm@16813
   526
wenzelm@8617
   527
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   528
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   529
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   530
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   531
wenzelm@16813
   532
end;
wenzelm@16813
   533
wenzelm@5820
   534
wenzelm@17359
   535
(* fix *)
wenzelm@9196
   536
wenzelm@12714
   537
local
wenzelm@12714
   538
wenzelm@30763
   539
fun gen_fix prep_vars args =
wenzelm@17359
   540
  assert_forward
wenzelm@30763
   541
  #> map_context (fn ctxt => snd (ProofContext.add_fixes (prep_vars ctxt args) ctxt))
wenzelm@17359
   542
  #> put_facts NONE;
wenzelm@5820
   543
wenzelm@16813
   544
in
wenzelm@16813
   545
wenzelm@30763
   546
val fix = gen_fix (fn ctxt => fn args => fst (ProofContext.read_vars args ctxt));
wenzelm@30763
   547
val fix_i = gen_fix (K I);
wenzelm@5820
   548
wenzelm@16813
   549
end;
wenzelm@16813
   550
wenzelm@5820
   551
wenzelm@17359
   552
(* assume etc. *)
wenzelm@5820
   553
wenzelm@16813
   554
local
wenzelm@16813
   555
wenzelm@17112
   556
fun gen_assume asm prep_att exp args state =
wenzelm@5820
   557
  state
wenzelm@5820
   558
  |> assert_forward
wenzelm@17112
   559
  |> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args))
wenzelm@17359
   560
  |> these_factss [] |> #2;
wenzelm@6932
   561
wenzelm@16813
   562
in
wenzelm@16813
   563
wenzelm@18728
   564
val assm      = gen_assume ProofContext.add_assms Attrib.attribute;
wenzelm@18670
   565
val assm_i    = gen_assume ProofContext.add_assms_i (K I);
wenzelm@20224
   566
val assume    = assm Assumption.assume_export;
wenzelm@20224
   567
val assume_i  = assm_i Assumption.assume_export;
wenzelm@20224
   568
val presume   = assm Assumption.presume_export;
wenzelm@20224
   569
val presume_i = assm_i Assumption.presume_export;
wenzelm@5820
   570
wenzelm@16813
   571
end;
wenzelm@16813
   572
wenzelm@7271
   573
wenzelm@17359
   574
(* def *)
wenzelm@11891
   575
wenzelm@16813
   576
local
wenzelm@16813
   577
wenzelm@20913
   578
fun gen_def prep_att prep_vars prep_binds args state =
wenzelm@11891
   579
  let
wenzelm@11891
   580
    val _ = assert_forward state;
wenzelm@17112
   581
    val thy = theory_of state;
wenzelm@11891
   582
wenzelm@20913
   583
    val (raw_name_atts, (raw_vars, raw_rhss)) = args |> split_list ||> split_list;
wenzelm@20913
   584
    val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts;
wenzelm@11891
   585
  in
wenzelm@20913
   586
    state
wenzelm@20913
   587
    |> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars))
wenzelm@20913
   588
    |>> map (fn (x, _, mx) => (x, mx))
wenzelm@20913
   589
    |-> (fn vars =>
wenzelm@20913
   590
      map_context_result (prep_binds false (map swap raw_rhss))
wenzelm@20913
   591
      #-> (fn rhss => map_context_result (LocalDefs.add_defs (vars ~~ (name_atts ~~ rhss)))))
wenzelm@20913
   592
    |-> (put_facts o SOME o map (#2 o #2))
wenzelm@11891
   593
  end;
wenzelm@11891
   594
wenzelm@16813
   595
in
wenzelm@16813
   596
wenzelm@20913
   597
val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind;
wenzelm@20913
   598
val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i;
wenzelm@11891
   599
wenzelm@16813
   600
end;
wenzelm@16813
   601
wenzelm@11891
   602
wenzelm@8374
   603
wenzelm@17112
   604
(** facts **)
wenzelm@5820
   605
wenzelm@17359
   606
(* chain *)
wenzelm@5820
   607
wenzelm@24011
   608
fun clean_facts ctxt =
wenzelm@24050
   609
  put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt;
wenzelm@24011
   610
wenzelm@17359
   611
val chain =
wenzelm@17359
   612
  assert_forward
wenzelm@24011
   613
  #> clean_facts
wenzelm@17359
   614
  #> enter_chain;
wenzelm@5820
   615
wenzelm@17359
   616
fun chain_facts facts =
wenzelm@17359
   617
  put_facts (SOME facts)
wenzelm@17359
   618
  #> chain;
wenzelm@5820
   619
wenzelm@5820
   620
wenzelm@17359
   621
(* note etc. *)
wenzelm@17112
   622
haftmann@28965
   623
fun no_binding args = map (pair (Binding.empty, [])) args;
wenzelm@17112
   624
wenzelm@17112
   625
local
wenzelm@17112
   626
wenzelm@30760
   627
fun gen_thmss more_facts opt_chain opt_result prep_atts prep_fact args state =
wenzelm@17112
   628
  state
wenzelm@17112
   629
  |> assert_forward
wenzelm@30761
   630
  |> map_context_result (ProofContext.note_thmss ""
wenzelm@30760
   631
    (Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state)) args))
wenzelm@17112
   632
  |> these_factss (more_facts state)
wenzelm@17359
   633
  ||> opt_chain
wenzelm@17359
   634
  |> opt_result;
wenzelm@17112
   635
wenzelm@17112
   636
in
wenzelm@17112
   637
wenzelm@30760
   638
val note_thmss = gen_thmss (K []) I #2 Attrib.attribute ProofContext.get_fact;
wenzelm@30760
   639
val note_thmss_i = gen_thmss (K []) I #2 (K I) (K I);
wenzelm@17112
   640
wenzelm@30760
   641
val from_thmss = gen_thmss (K []) chain #2 Attrib.attribute ProofContext.get_fact o no_binding;
wenzelm@30760
   642
val from_thmss_i = gen_thmss (K []) chain #2 (K I) (K I) o no_binding;
wenzelm@17359
   643
wenzelm@30760
   644
val with_thmss = gen_thmss the_facts chain #2 Attrib.attribute ProofContext.get_fact o no_binding;
wenzelm@30760
   645
val with_thmss_i = gen_thmss the_facts chain #2 (K I) (K I) o no_binding;
wenzelm@30760
   646
wenzelm@30760
   647
val local_results = gen_thmss (K []) I I (K I) (K I) o map (apsnd Thm.simple_fact);
wenzelm@17359
   648
haftmann@28965
   649
fun get_thmss state srcs = the_facts (note_thmss [((Binding.empty, []), srcs)] state);
wenzelm@17112
   650
wenzelm@17112
   651
end;
wenzelm@17112
   652
wenzelm@17112
   653
wenzelm@18548
   654
(* using/unfolding *)
wenzelm@17112
   655
wenzelm@17112
   656
local
wenzelm@17112
   657
wenzelm@30760
   658
fun gen_using f g prep_atts prep_fact args state =
wenzelm@17112
   659
  state
wenzelm@17112
   660
  |> assert_backward
wenzelm@21442
   661
  |> map_context_result
wenzelm@30761
   662
    (ProofContext.note_thmss ""
wenzelm@30760
   663
      (Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state))
wenzelm@30760
   664
        (no_binding args)))
wenzelm@18843
   665
  |> (fn (named_facts, state') =>
wenzelm@24556
   666
    state' |> map_goal I (fn (statement, _, using, goal, before_qed, after_qed) =>
wenzelm@18843
   667
      let
wenzelm@18843
   668
        val ctxt = context_of state';
wenzelm@19482
   669
        val ths = maps snd named_facts;
wenzelm@24556
   670
      in (statement, [], f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end));
wenzelm@18548
   671
wenzelm@24050
   672
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths;
wenzelm@18878
   673
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths);
wenzelm@18878
   674
val unfold_goals = LocalDefs.unfold_goals;
wenzelm@17112
   675
wenzelm@17112
   676
in
wenzelm@17112
   677
wenzelm@30760
   678
val using = gen_using append_using (K (K I)) Attrib.attribute ProofContext.get_fact;
wenzelm@30760
   679
val using_i = gen_using append_using (K (K I)) (K I) (K I);
wenzelm@30760
   680
val unfolding = gen_using unfold_using unfold_goals Attrib.attribute ProofContext.get_fact;
wenzelm@30760
   681
val unfolding_i = gen_using unfold_using unfold_goals (K I) (K I);
wenzelm@17112
   682
wenzelm@17112
   683
end;
wenzelm@17112
   684
wenzelm@17112
   685
wenzelm@17112
   686
(* case *)
wenzelm@17112
   687
wenzelm@17112
   688
local
wenzelm@17112
   689
wenzelm@30419
   690
fun qualified_binding a =
wenzelm@30419
   691
  Binding.qualify true (Long_Name.qualifier a) (Binding.name (Long_Name.base_name a));
wenzelm@30419
   692
wenzelm@17112
   693
fun gen_invoke_case prep_att (name, xs, raw_atts) state =
wenzelm@17112
   694
  let
wenzelm@17112
   695
    val atts = map (prep_att (theory_of state)) raw_atts;
wenzelm@19078
   696
    val (asms, state') = state |> map_context_result (fn ctxt =>
wenzelm@19078
   697
      ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs));
wenzelm@30419
   698
    val assumptions = asms |> map (fn (a, ts) => ((qualified_binding a, atts), map (rpair []) ts));
wenzelm@17112
   699
  in
wenzelm@17112
   700
    state'
wenzelm@17112
   701
    |> assume_i assumptions
wenzelm@30757
   702
    |> bind_terms AutoBind.no_facts
haftmann@28965
   703
    |> `the_facts |-> (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])])
wenzelm@17112
   704
  end;
wenzelm@17112
   705
wenzelm@17112
   706
in
wenzelm@17112
   707
wenzelm@18728
   708
val invoke_case = gen_invoke_case Attrib.attribute;
wenzelm@17112
   709
val invoke_case_i = gen_invoke_case (K I);
wenzelm@17112
   710
wenzelm@17112
   711
end;
wenzelm@17112
   712
wenzelm@17112
   713
wenzelm@17112
   714
wenzelm@17359
   715
(** proof structure **)
wenzelm@17359
   716
wenzelm@17359
   717
(* blocks *)
wenzelm@17359
   718
wenzelm@17359
   719
val begin_block =
wenzelm@17359
   720
  assert_forward
wenzelm@17359
   721
  #> open_block
wenzelm@17359
   722
  #> put_goal NONE
wenzelm@17359
   723
  #> open_block;
wenzelm@17359
   724
wenzelm@17359
   725
val next_block =
wenzelm@17359
   726
  assert_forward
wenzelm@17359
   727
  #> close_block
wenzelm@17359
   728
  #> open_block
wenzelm@17359
   729
  #> put_goal NONE
wenzelm@17359
   730
  #> put_facts NONE;
wenzelm@17359
   731
wenzelm@17359
   732
fun end_block state =
wenzelm@17359
   733
  state
wenzelm@17359
   734
  |> assert_forward
wenzelm@17359
   735
  |> close_block
wenzelm@17359
   736
  |> assert_current_goal false
wenzelm@17359
   737
  |> close_block
wenzelm@17359
   738
  |> export_facts state;
wenzelm@17359
   739
wenzelm@17359
   740
wenzelm@17359
   741
(* sub-proofs *)
wenzelm@17359
   742
wenzelm@17359
   743
fun proof opt_text =
wenzelm@17359
   744
  assert_backward
wenzelm@17859
   745
  #> refine (the_default Method.default_text opt_text)
wenzelm@17359
   746
  #> Seq.map (using_facts [] #> enter_forward);
wenzelm@17359
   747
wenzelm@23360
   748
fun end_proof bot txt state =
wenzelm@23360
   749
  state
wenzelm@23360
   750
  |> assert_forward
wenzelm@23360
   751
  |> assert_bottom bot
wenzelm@23360
   752
  |> close_block
wenzelm@23360
   753
  |> assert_current_goal true
wenzelm@23360
   754
  |> using_facts []
wenzelm@23360
   755
  |> `before_qed |-> (refine o the_default Method.succeed_text)
wenzelm@32193
   756
  |> Seq.maps (refine (Method.finish_text txt));
wenzelm@17359
   757
wenzelm@29383
   758
fun check_result msg sq =
wenzelm@29383
   759
  (case Seq.pull sq of
wenzelm@29383
   760
    NONE => error msg
wenzelm@29383
   761
  | SOME (s, _) => s);
wenzelm@29383
   762
wenzelm@29383
   763
fun check_finish sq = check_result "Failed to finish proof" sq;
wenzelm@29383
   764
wenzelm@17359
   765
wenzelm@17359
   766
(* unstructured refinement *)
wenzelm@17359
   767
wenzelm@32193
   768
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i)));
wenzelm@32193
   769
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i)));
wenzelm@17359
   770
wenzelm@17359
   771
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
wenzelm@17359
   772
fun apply_end text = assert_forward #> refine_end text;
wenzelm@17359
   773
wenzelm@17359
   774
wenzelm@17359
   775
wenzelm@17112
   776
(** goals **)
wenzelm@17112
   777
wenzelm@17359
   778
(* generic goals *)
wenzelm@17359
   779
wenzelm@19774
   780
local
wenzelm@19774
   781
wenzelm@19846
   782
fun implicit_vars dest add props =
wenzelm@19846
   783
  let
wenzelm@19846
   784
    val (explicit_vars, props') = take_prefix (can dest) props |>> map dest;
wenzelm@19846
   785
    val vars = rev (subtract (op =) explicit_vars (fold add props []));
wenzelm@19846
   786
    val _ =
wenzelm@19846
   787
      if null vars then ()
wenzelm@19846
   788
      else warning ("Goal statement contains unbound schematic variable(s): " ^
wenzelm@19846
   789
        commas_quote (map (Term.string_of_vname o fst) vars));
wenzelm@19846
   790
  in (rev vars, props') end;
wenzelm@19774
   791
wenzelm@19774
   792
fun refine_terms n =
wenzelm@30510
   793
  refine (Method.Basic (K (RAW_METHOD
wenzelm@19774
   794
    (K (HEADGOAL (PRECISE_CONJUNCTS n
wenzelm@32193
   795
      (HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI))))))))))
wenzelm@19774
   796
  #> Seq.hd;
wenzelm@19774
   797
wenzelm@19774
   798
in
wenzelm@17359
   799
wenzelm@17859
   800
fun generic_goal prepp kind before_qed after_qed raw_propp state =
wenzelm@5820
   801
  let
wenzelm@17359
   802
    val thy = theory_of state;
wenzelm@23418
   803
    val cert = Thm.cterm_of thy;
wenzelm@17359
   804
    val chaining = can assert_chain state;
wenzelm@25958
   805
    val pos = Position.thread_data ();
wenzelm@17359
   806
wenzelm@17359
   807
    val ((propss, after_ctxt), goal_state) =
wenzelm@5936
   808
      state
wenzelm@5936
   809
      |> assert_forward_or_chain
wenzelm@5936
   810
      |> enter_forward
wenzelm@17359
   811
      |> open_block
wenzelm@17859
   812
      |> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp)));
wenzelm@19482
   813
    val props = flat propss;
wenzelm@15703
   814
wenzelm@19846
   815
    val (_, props') =
wenzelm@19846
   816
      implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props;
wenzelm@19846
   817
    val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props';
wenzelm@19774
   818
wenzelm@19774
   819
    val propss' = map (Logic.mk_term o Var) vars :: propss;
wenzelm@23418
   820
    val goal_propss = filter_out null propss';
wenzelm@29346
   821
    val goal =
wenzelm@29346
   822
      cert (Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss))
wenzelm@28627
   823
      |> Thm.weaken_sorts (Variable.sorts_of (context_of goal_state));
wenzelm@29346
   824
    val statement = ((kind, pos), propss', Thm.term_of goal);
wenzelm@18124
   825
    val after_qed' = after_qed |>> (fn after_local =>
wenzelm@18124
   826
      fn results => map_context after_ctxt #> after_local results);
wenzelm@5820
   827
  in
wenzelm@17359
   828
    goal_state
wenzelm@21727
   829
    |> map_context (init_context #> Variable.set_body true)
wenzelm@28410
   830
    |> put_goal (SOME (make_goal (statement, [], [], Goal.init goal, before_qed, after_qed')))
wenzelm@17359
   831
    |> map_context (ProofContext.auto_bind_goal props)
wenzelm@21565
   832
    |> chaining ? (`the_facts #-> using_facts)
wenzelm@17359
   833
    |> put_facts NONE
wenzelm@17359
   834
    |> open_block
wenzelm@17359
   835
    |> put_goal NONE
wenzelm@5820
   836
    |> enter_backward
wenzelm@23418
   837
    |> not (null vars) ? refine_terms (length goal_propss)
wenzelm@32193
   838
    |> null props ? (refine (Method.Basic Method.assumption) #> Seq.hd)
wenzelm@5820
   839
  end;
wenzelm@5820
   840
wenzelm@29090
   841
fun generic_qed after_ctxt state =
wenzelm@12503
   842
  let
wenzelm@25958
   843
    val (goal_ctxt, {statement, goal, after_qed, ...}) = current_goal state;
wenzelm@8617
   844
    val outer_state = state |> close_block;
wenzelm@8617
   845
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   846
wenzelm@28410
   847
    val ((_, pos), stmt, _) = statement;
wenzelm@18503
   848
    val props =
wenzelm@19774
   849
      flat (tl stmt)
wenzelm@19915
   850
      |> Variable.exportT_terms goal_ctxt outer_ctxt;
wenzelm@17359
   851
    val results =
wenzelm@28627
   852
      tl (conclude_goal goal_ctxt goal stmt)
wenzelm@20309
   853
      |> burrow (ProofContext.export goal_ctxt outer_ctxt);
wenzelm@25958
   854
wenzelm@25958
   855
    val (after_local, after_global) = after_qed;
wenzelm@29383
   856
    fun after_local' x y = Position.setmp_thread_data pos (fn () => after_local x y) ();
wenzelm@25958
   857
    fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) ();
wenzelm@17359
   858
  in
wenzelm@17359
   859
    outer_state
wenzelm@29090
   860
    |> map_context (after_ctxt props)
wenzelm@25958
   861
    |> pair ((after_local', after_global'), results)
wenzelm@17359
   862
  end;
wenzelm@17359
   863
wenzelm@19774
   864
end;
wenzelm@19774
   865
wenzelm@9469
   866
wenzelm@17359
   867
(* local goals *)
wenzelm@17359
   868
wenzelm@17859
   869
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state =
wenzelm@17359
   870
  let
wenzelm@21362
   871
    val thy = theory_of state;
wenzelm@21362
   872
    val ((names, attss), propp) =
wenzelm@21362
   873
      Attrib.map_specs (prep_att thy) stmt |> split_list |>> split_list;
wenzelm@17359
   874
wenzelm@18124
   875
    fun after_qed' results =
wenzelm@18808
   876
      local_results ((names ~~ attss) ~~ results)
wenzelm@17359
   877
      #-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
wenzelm@18124
   878
      #> after_qed results;
wenzelm@5820
   879
  in
wenzelm@17359
   880
    state
wenzelm@21362
   881
    |> generic_goal prepp kind before_qed (after_qed', K I) propp
wenzelm@19900
   882
    |> tap (Variable.warn_extra_tfrees (context_of state) o context_of)
wenzelm@5820
   883
  end;
wenzelm@5820
   884
wenzelm@29383
   885
fun local_qeds txt =
wenzelm@29383
   886
  end_proof false txt
wenzelm@29383
   887
  #> Seq.map (generic_qed ProofContext.auto_bind_facts #->
wenzelm@29090
   888
    (fn ((after_qed, _), results) => after_qed results));
wenzelm@5820
   889
wenzelm@29383
   890
fun local_qed txt = local_qeds txt #> check_finish;
wenzelm@29383
   891
wenzelm@5820
   892
wenzelm@17359
   893
(* global goals *)
wenzelm@17359
   894
wenzelm@21442
   895
fun global_goal prepp before_qed after_qed propp ctxt =
wenzelm@21362
   896
  init ctxt
wenzelm@29383
   897
  |> generic_goal (prepp #> ProofContext.auto_fixes) "" before_qed (K I, after_qed) propp;
wenzelm@17359
   898
wenzelm@21362
   899
val theorem = global_goal ProofContext.bind_propp_schematic;
wenzelm@21362
   900
val theorem_i = global_goal ProofContext.bind_propp_schematic_i;
wenzelm@12065
   901
wenzelm@17359
   902
fun global_qeds txt =
wenzelm@17359
   903
  end_proof true txt
wenzelm@29090
   904
  #> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) =>
wenzelm@29383
   905
    after_qed results (context_of state)));
wenzelm@17112
   906
wenzelm@29383
   907
fun global_qed txt = global_qeds txt #> check_finish;
wenzelm@12959
   908
wenzelm@5820
   909
wenzelm@17359
   910
(* concluding steps *)
wenzelm@17112
   911
wenzelm@29383
   912
fun terminal_proof qed initial terminal =
wenzelm@29383
   913
  proof (SOME initial) #> Seq.maps (qed terminal) #> check_finish;
wenzelm@17112
   914
wenzelm@29383
   915
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true);
wenzelm@17112
   916
val local_default_proof = local_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   917
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE);
wenzelm@17359
   918
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE);
wenzelm@29383
   919
val local_done_proof = terminal_proof local_qeds Method.done_text (NONE, false);
wenzelm@17112
   920
wenzelm@29383
   921
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true);
wenzelm@17112
   922
val global_default_proof = global_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   923
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE);
wenzelm@17359
   924
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE);
wenzelm@29383
   925
val global_done_proof = terminal_proof global_qeds Method.done_text (NONE, false);
wenzelm@5820
   926
wenzelm@6896
   927
wenzelm@17359
   928
(* common goal statements *)
wenzelm@17359
   929
wenzelm@17359
   930
local
wenzelm@17359
   931
wenzelm@17859
   932
fun gen_have prep_att prepp before_qed after_qed stmt int =
wenzelm@17859
   933
  local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt;
wenzelm@6896
   934
wenzelm@17859
   935
fun gen_show prep_att prepp before_qed after_qed stmt int state =
wenzelm@17359
   936
  let
wenzelm@32738
   937
    val testing = Unsynchronized.ref false;
wenzelm@32738
   938
    val rule = Unsynchronized.ref (NONE: thm option);
wenzelm@17359
   939
    fun fail_msg ctxt =
wenzelm@29383
   940
      "Local statement will fail to refine any pending goal" ::
wenzelm@17359
   941
      (case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th])
wenzelm@17359
   942
      |> cat_lines;
wenzelm@6896
   943
wenzelm@17359
   944
    fun print_results ctxt res =
wenzelm@17359
   945
      if ! testing then () else ProofDisplay.print_results int ctxt res;
wenzelm@17359
   946
    fun print_rule ctxt th =
wenzelm@17359
   947
      if ! testing then rule := SOME th
wenzelm@17359
   948
      else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th)
wenzelm@17359
   949
      else ();
wenzelm@17359
   950
    val test_proof =
wenzelm@29383
   951
      try (local_skip_proof true)
wenzelm@28289
   952
      |> setmp_noncritical testing true
wenzelm@23963
   953
      |> Exn.capture;
wenzelm@6896
   954
wenzelm@18124
   955
    fun after_qed' results =
wenzelm@19482
   956
      refine_goals print_rule (context_of state) (flat results)
wenzelm@29383
   957
      #> check_result "Failed to refine any pending goal"
wenzelm@29383
   958
      #> after_qed results;
wenzelm@17359
   959
  in
wenzelm@17359
   960
    state
wenzelm@17859
   961
    |> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt
wenzelm@21565
   962
    |> int ? (fn goal_state =>
wenzelm@17359
   963
      (case test_proof goal_state of
wenzelm@23963
   964
        Exn.Result (SOME _) => goal_state
wenzelm@23963
   965
      | Exn.Result NONE => error (fail_msg (context_of goal_state))
wenzelm@28443
   966
      | Exn.Exn Exn.Interrupt => raise Exn.Interrupt
wenzelm@28458
   967
      | Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))])))
wenzelm@17359
   968
  end;
wenzelm@17359
   969
wenzelm@17359
   970
in
wenzelm@17359
   971
wenzelm@18728
   972
val have = gen_have Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   973
val have_i = gen_have (K I) ProofContext.bind_propp_i;
wenzelm@18728
   974
val show = gen_show Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   975
val show_i = gen_show (K I) ProofContext.bind_propp_i;
wenzelm@6896
   976
wenzelm@5820
   977
end;
wenzelm@17359
   978
wenzelm@28410
   979
wenzelm@29385
   980
wenzelm@29385
   981
(** future proofs **)
wenzelm@29385
   982
wenzelm@29385
   983
(* relevant proof states *)
wenzelm@29385
   984
wenzelm@29385
   985
fun is_schematic t =
wenzelm@29385
   986
  Term.exists_subterm Term.is_Var t orelse
wenzelm@29385
   987
  Term.exists_type (Term.exists_subtype Term.is_TVar) t;
wenzelm@29385
   988
wenzelm@29385
   989
fun schematic_goal state =
wenzelm@29385
   990
  let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state
wenzelm@29385
   991
  in is_schematic prop end;
wenzelm@29385
   992
wenzelm@29385
   993
fun is_relevant state =
wenzelm@29385
   994
  (case try find_goal state of
wenzelm@29385
   995
    NONE => true
wenzelm@29385
   996
  | SOME (_, (_, {statement = (_, _, prop), goal, ...})) =>
wenzelm@29385
   997
      is_schematic prop orelse not (Logic.protect prop aconv Thm.concl_of goal));
wenzelm@29385
   998
wenzelm@29385
   999
wenzelm@29385
  1000
(* full proofs *)
wenzelm@28410
  1001
wenzelm@29346
  1002
local
wenzelm@29346
  1003
wenzelm@29385
  1004
fun future_proof done get_context fork_proof state =
wenzelm@28410
  1005
  let
wenzelm@29381
  1006
    val _ = assert_backward state;
wenzelm@28410
  1007
    val (goal_ctxt, (_, goal)) = find_goal state;
wenzelm@32786
  1008
    val {statement as (kind, _, prop), messages, using, goal, before_qed, after_qed} = goal;
wenzelm@32062
  1009
    val goal_txt = prop :: map Thm.term_of (Assumption.all_assms_of goal_ctxt);
wenzelm@28410
  1010
wenzelm@29383
  1011
    val _ = is_relevant state andalso error "Cannot fork relevant proof";
wenzelm@29383
  1012
wenzelm@29346
  1013
    val prop' = Logic.protect prop;
wenzelm@29346
  1014
    val statement' = (kind, [[], [prop']], prop');
wenzelm@29346
  1015
    val goal' = Thm.adjust_maxidx_thm (Thm.maxidx_of goal)
wenzelm@29346
  1016
      (Drule.comp_no_flatten (goal, Thm.nprems_of goal) 1 Drule.protectI);
wenzelm@29385
  1017
wenzelm@29385
  1018
    fun after_local' [[th]] = put_thms false (AutoBind.thisN, SOME [th]);
wenzelm@29385
  1019
    fun after_global' [[th]] = ProofContext.put_thms false (AutoBind.thisN, SOME [th]);
wenzelm@29385
  1020
    val after_qed' = (after_local', after_global');
wenzelm@30279
  1021
    val this_name = ProofContext.full_name goal_ctxt (Binding.name AutoBind.thisN);
wenzelm@28410
  1022
wenzelm@28973
  1023
    val result_ctxt =
wenzelm@28973
  1024
      state
wenzelm@32062
  1025
      |> map_contexts (fold Variable.declare_term goal_txt)
wenzelm@29385
  1026
      |> map_goal I (K (statement', messages, using, goal', before_qed, after_qed'))
wenzelm@29346
  1027
      |> fork_proof;
wenzelm@28973
  1028
wenzelm@29385
  1029
    val future_thm = result_ctxt |> Future.map (fn (_, x) =>
wenzelm@29385
  1030
      ProofContext.get_fact_single (get_context x) (Facts.named this_name));
wenzelm@32062
  1031
    val finished_goal = Goal.future_result goal_ctxt future_thm prop';
wenzelm@28973
  1032
    val state' =
wenzelm@28973
  1033
      state
wenzelm@28973
  1034
      |> map_goal I (K (statement, messages, using, finished_goal, NONE, after_qed))
wenzelm@29385
  1035
      |> done;
wenzelm@28973
  1036
  in (Future.map #1 result_ctxt, state') end;
wenzelm@28410
  1037
wenzelm@29385
  1038
in
wenzelm@29385
  1039
wenzelm@29385
  1040
fun local_future_proof x = future_proof local_done_proof context_of x;
wenzelm@29385
  1041
fun global_future_proof x = future_proof global_done_proof I x;
wenzelm@29385
  1042
wenzelm@17359
  1043
end;
wenzelm@29346
  1044
wenzelm@29385
  1045
wenzelm@29385
  1046
(* terminal proofs *)
wenzelm@29385
  1047
wenzelm@29385
  1048
local
wenzelm@29385
  1049
wenzelm@29385
  1050
fun future_terminal_proof proof1 proof2 meths int state =
wenzelm@32061
  1051
  if int orelse is_relevant state orelse not (Goal.local_future_enabled ())
wenzelm@29385
  1052
  then proof1 meths state
wenzelm@32062
  1053
  else snd (proof2 (fn state' => Future.fork_pri ~1 (fn () => ((), proof1 meths state'))) state);
wenzelm@29385
  1054
wenzelm@29385
  1055
in
wenzelm@29385
  1056
wenzelm@29385
  1057
fun local_future_terminal_proof x =
wenzelm@29385
  1058
  future_terminal_proof local_terminal_proof local_future_proof x;
wenzelm@29385
  1059
wenzelm@29385
  1060
fun global_future_terminal_proof x =
wenzelm@29385
  1061
  future_terminal_proof global_terminal_proof global_future_proof x;
wenzelm@29350
  1062
wenzelm@29346
  1063
end;
wenzelm@29346
  1064
wenzelm@29385
  1065
end;
wenzelm@29385
  1066