src/Pure/Isar/proof.ML
author wenzelm
Sat Jun 17 19:37:57 2006 +0200 (2006-06-17)
changeset 19915 b08e26fb247e
parent 19900 21a99d88d925
child 19995 7f841a2b431c
permissions -rw-r--r--
ProofContext.exports: simultaneous facts;
Variable.exportT_terms;
wenzelm@5820
     1
(*  Title:      Pure/Isar/proof.ML
wenzelm@5820
     2
    ID:         $Id$
wenzelm@5820
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5820
     4
wenzelm@19000
     5
The Isar/VM proof language interpreter: maintains a structured flow of
wenzelm@19000
     6
context elements, goals, refinements, and facts.
wenzelm@5820
     7
*)
wenzelm@5820
     8
wenzelm@5820
     9
signature PROOF =
wenzelm@5820
    10
sig
wenzelm@17756
    11
  type context (*= Context.proof*)
wenzelm@17756
    12
  type method (*= Method.method*)
wenzelm@5820
    13
  type state
wenzelm@17359
    14
  val init: context -> state
wenzelm@17359
    15
  val level: state -> int
wenzelm@17359
    16
  val assert_bottom: bool -> state -> state
wenzelm@5820
    17
  val context_of: state -> context
wenzelm@5820
    18
  val theory_of: state -> theory
wenzelm@16450
    19
  val sign_of: state -> theory    (*obsolete*)
wenzelm@13377
    20
  val map_context: (context -> context) -> state -> state
wenzelm@17976
    21
  val add_binds_i: (indexname * term option) list -> state -> state
wenzelm@19078
    22
  val put_thms: bool -> string * thm list option -> state -> state
wenzelm@19078
    23
  val put_thms_internal: string * thm list option -> state -> state
wenzelm@6091
    24
  val the_facts: state -> thm list
wenzelm@9469
    25
  val the_fact: state -> thm
wenzelm@17450
    26
  val put_facts: thm list option -> state -> state
wenzelm@6891
    27
  val assert_forward: state -> state
wenzelm@17359
    28
  val assert_chain: state -> state
wenzelm@9469
    29
  val assert_forward_or_chain: state -> state
wenzelm@5820
    30
  val assert_backward: state -> state
wenzelm@8206
    31
  val assert_no_chain: state -> state
wenzelm@5820
    32
  val enter_forward: state -> state
wenzelm@17359
    33
  val get_goal: state -> context * (thm list * thm)
wenzelm@16539
    34
  val show_main_goal: bool ref
wenzelm@6529
    35
  val verbose: bool ref
wenzelm@12423
    36
  val pretty_state: int -> state -> Pretty.T list
wenzelm@10360
    37
  val pretty_goals: bool -> state -> Pretty.T list
wenzelm@17112
    38
  val refine: Method.text -> state -> state Seq.seq
wenzelm@17112
    39
  val refine_end: Method.text -> state -> state Seq.seq
wenzelm@18908
    40
  val refine_insert: thm list -> state -> state
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
wenzelm@19846
    46
  val fix: (string * string option * mixfix) list -> state -> state
wenzelm@19846
    47
  val fix_i: (string * typ option * mixfix) list -> state -> state
wenzelm@18670
    48
  val assm: ProofContext.export ->
wenzelm@19585
    49
    ((string * Attrib.src list) * (string * string list) list) list -> state -> state
wenzelm@18670
    50
  val assm_i: ProofContext.export ->
wenzelm@19585
    51
    ((string * attribute list) * (term * term list) list) list -> state -> state
wenzelm@19585
    52
  val assume: ((string * Attrib.src list) * (string * string list) list) list -> state -> state
wenzelm@19585
    53
  val assume_i: ((string * attribute list) * (term * term list) list) list -> state -> state
wenzelm@19585
    54
  val presume: ((string * Attrib.src list) * (string * string list) list) list -> state -> state
wenzelm@19585
    55
  val presume_i: ((string * attribute list) * (term * term list) list) list -> state -> state
wenzelm@19846
    56
  val def: ((string * Attrib.src list) *
wenzelm@19846
    57
    ((string * mixfix) * (string * string list))) list -> state -> state
wenzelm@19846
    58
  val def_i: ((string * attribute list) *
wenzelm@19846
    59
    ((string * mixfix) * (term * term list))) list -> state -> state
wenzelm@17359
    60
  val chain: state -> state
wenzelm@17359
    61
  val chain_facts: thm list -> state -> state
wenzelm@17359
    62
  val get_thmss: state -> (thmref * Attrib.src list) list -> thm list
wenzelm@14564
    63
  val simple_note_thms: string -> thm list -> state -> state
wenzelm@17359
    64
  val note_thmss: ((string * Attrib.src list) *
wenzelm@17112
    65
    (thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    66
  val note_thmss_i: ((string * attribute list) *
wenzelm@18728
    67
    (thm list * attribute list) list) list -> state -> state
wenzelm@17112
    68
  val from_thmss: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    69
  val from_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@17112
    70
  val with_thmss: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    71
  val with_thmss_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@18548
    72
  val using: ((thmref * Attrib.src list) list) list -> state -> state
wenzelm@18728
    73
  val using_i: ((thm list * attribute list) list) list -> state -> state
wenzelm@18548
    74
  val unfolding: ((thmref * 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@17359
    80
  val end_block: state -> state Seq.seq
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 goal_names: string option -> string -> string list -> string
wenzelm@17359
    87
  val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
wenzelm@18728
    88
    (theory -> 'a -> attribute) ->
wenzelm@17359
    89
    (context * 'b list -> context * (term list list * (context -> context))) ->
wenzelm@18124
    90
    string -> Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@17359
    91
    ((string * 'a list) * 'b) list -> state -> state
wenzelm@17359
    92
  val local_qed: Method.text option * bool -> state -> state Seq.seq
wenzelm@17359
    93
  val global_goal: (context -> (string * string) * (string * thm list) list -> unit) ->
wenzelm@18728
    94
    (theory -> 'a -> attribute) ->
wenzelm@17450
    95
    (context * 'b list -> context * (term list list * (context -> context))) ->
wenzelm@18124
    96
    string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@17859
    97
    string option -> string * 'a list -> ((string * 'a list) * 'b) list -> context -> state
wenzelm@18808
    98
  val global_qed: Method.text option * bool -> state -> context * theory
wenzelm@17359
    99
  val local_terminal_proof: Method.text * Method.text option -> state -> state Seq.seq
wenzelm@17359
   100
  val local_default_proof: state -> state Seq.seq
wenzelm@17359
   101
  val local_immediate_proof: state -> state Seq.seq
wenzelm@17359
   102
  val local_done_proof: state -> state Seq.seq
wenzelm@17359
   103
  val local_skip_proof: bool -> state -> state Seq.seq
wenzelm@18808
   104
  val global_terminal_proof: Method.text * Method.text option -> state -> context * theory
wenzelm@18808
   105
  val global_default_proof: state -> context * theory
wenzelm@18808
   106
  val global_immediate_proof: state -> context * theory
wenzelm@18808
   107
  val global_done_proof: state -> context * theory
wenzelm@18808
   108
  val global_skip_proof: bool -> state -> context * theory
wenzelm@18124
   109
  val have: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@19585
   110
    ((string * Attrib.src list) * (string * string list) list) list -> bool -> state -> state
wenzelm@18124
   111
  val have_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@19585
   112
    ((string * attribute list) * (term * term list) list) list -> bool -> state -> state
wenzelm@18124
   113
  val show: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@19585
   114
    ((string * Attrib.src list) * (string * string list) list) list -> bool -> state -> state
wenzelm@18124
   115
  val show_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
wenzelm@19585
   116
    ((string * attribute list) * (term * term list) list) list -> bool -> state -> state
wenzelm@18124
   117
  val theorem: string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@17359
   118
    string option -> string * Attrib.src list ->
wenzelm@19585
   119
    ((string * Attrib.src list) * (string * string list) list) list -> context -> state
wenzelm@18124
   120
  val theorem_i: string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@18728
   121
    string option -> string * attribute list ->
wenzelm@19585
   122
    ((string * attribute list) * (term * term list) list) list -> context -> state
wenzelm@5820
   123
end;
wenzelm@5820
   124
wenzelm@13377
   125
structure Proof: PROOF =
wenzelm@5820
   126
struct
wenzelm@5820
   127
wenzelm@16813
   128
type context = ProofContext.context;
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@19774
   148
   {statement: string * term list list,     (*goal kind and statement, starting with vars*)
wenzelm@17359
   149
    using: thm list,                        (*goal facts*)
wenzelm@17359
   150
    goal: thm,                              (*subgoals ==> statement*)
wenzelm@17859
   151
    before_qed: Method.text option,
wenzelm@18124
   152
    after_qed:
wenzelm@18124
   153
      (thm list list -> state -> state Seq.seq) *
wenzelm@18124
   154
      (thm list list -> theory -> theory)};
wenzelm@17359
   155
wenzelm@17859
   156
fun make_goal (statement, using, goal, before_qed, after_qed) =
wenzelm@17859
   157
  Goal {statement = statement, using = using, goal = goal,
wenzelm@17859
   158
    before_qed = before_qed, after_qed = after_qed};
wenzelm@5820
   159
wenzelm@7176
   160
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   161
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   162
wenzelm@17359
   163
fun map_node f (Node {context, facts, mode, goal}) =
wenzelm@17359
   164
  make_node (f (context, facts, mode, goal));
wenzelm@5820
   165
wenzelm@17359
   166
fun init ctxt = State (Stack.init (make_node (ctxt, NONE, Forward, NONE)));
wenzelm@5820
   167
wenzelm@17359
   168
fun current (State st) = Stack.top st |> (fn Node node => node);
wenzelm@17359
   169
fun map_current f (State st) = State (Stack.map (map_node f) st);
wenzelm@12045
   170
wenzelm@5820
   171
wenzelm@5820
   172
wenzelm@5820
   173
(** basic proof state operations **)
wenzelm@5820
   174
wenzelm@17359
   175
(* block structure *)
wenzelm@17359
   176
wenzelm@17359
   177
fun open_block (State st) = State (Stack.push st);
wenzelm@17359
   178
wenzelm@18678
   179
fun close_block (State st) = State (Stack.pop st)
wenzelm@18678
   180
  handle Empty => error "Unbalanced block parentheses";
wenzelm@17359
   181
wenzelm@17359
   182
fun level (State st) = Stack.level st;
wenzelm@17359
   183
wenzelm@17359
   184
fun assert_bottom b state =
wenzelm@17359
   185
  let val b' = (level state <= 2) in
wenzelm@18678
   186
    if b andalso not b' then error "Not at bottom of proof!"
wenzelm@18678
   187
    else if not b andalso b' then error "Already at bottom of proof!"
wenzelm@17359
   188
    else state
wenzelm@17359
   189
  end;
wenzelm@17359
   190
wenzelm@17359
   191
wenzelm@5820
   192
(* context *)
wenzelm@5820
   193
wenzelm@17359
   194
val context_of = #context o current;
wenzelm@5820
   195
val theory_of = ProofContext.theory_of o context_of;
wenzelm@16450
   196
val sign_of = theory_of;
wenzelm@5820
   197
wenzelm@17359
   198
fun map_context f =
wenzelm@17359
   199
  map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   200
wenzelm@17359
   201
fun map_context_result f state =
wenzelm@17859
   202
  f (context_of state) ||> (fn ctxt => map_context (K ctxt) state);
wenzelm@5820
   203
wenzelm@10809
   204
val add_binds_i = map_context o ProofContext.add_binds_i;
wenzelm@19078
   205
val put_thms = map_context oo ProofContext.put_thms;
wenzelm@19078
   206
val put_thms_internal = map_context o ProofContext.put_thms_internal;
wenzelm@5820
   207
wenzelm@5820
   208
wenzelm@5820
   209
(* facts *)
wenzelm@5820
   210
wenzelm@17359
   211
val get_facts = #facts o current;
wenzelm@17359
   212
wenzelm@17359
   213
fun the_facts state =
wenzelm@17359
   214
  (case get_facts state of SOME facts => facts
wenzelm@18678
   215
  | NONE => error "No current facts available");
wenzelm@5820
   216
wenzelm@9469
   217
fun the_fact state =
wenzelm@17359
   218
  (case the_facts state of [thm] => thm
wenzelm@18678
   219
  | _ => error "Single theorem expected");
wenzelm@7605
   220
wenzelm@17359
   221
fun put_facts facts =
wenzelm@19078
   222
  map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #>
wenzelm@19078
   223
  put_thms_internal (AutoBind.thisN, facts);
wenzelm@5820
   224
wenzelm@17359
   225
fun these_factss more_facts (named_factss, state) =
wenzelm@19482
   226
  (named_factss, state |> put_facts (SOME (maps snd named_factss @ more_facts)));
wenzelm@5820
   227
wenzelm@17359
   228
fun export_facts inner outer =
wenzelm@17359
   229
  (case get_facts inner of
wenzelm@17359
   230
    NONE => Seq.single (put_facts NONE outer)
wenzelm@17359
   231
  | SOME thms =>
wenzelm@17359
   232
      thms
wenzelm@19915
   233
      |> ProofContext.exports (context_of inner) (context_of outer)
wenzelm@17359
   234
      |> Seq.map (fn ths => put_facts (SOME ths) outer));
wenzelm@5820
   235
wenzelm@5820
   236
wenzelm@5820
   237
(* mode *)
wenzelm@5820
   238
wenzelm@17359
   239
val get_mode = #mode o current;
wenzelm@5820
   240
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   241
wenzelm@17359
   242
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove");
wenzelm@5820
   243
wenzelm@5820
   244
fun assert_mode pred state =
wenzelm@5820
   245
  let val mode = get_mode state in
wenzelm@5820
   246
    if pred mode then state
wenzelm@18678
   247
    else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode")
wenzelm@5820
   248
  end;
wenzelm@5820
   249
wenzelm@19308
   250
val assert_forward = assert_mode (fn mode => mode = Forward);
wenzelm@19308
   251
val assert_chain = assert_mode (fn mode => mode = Chain);
wenzelm@19308
   252
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain);
wenzelm@19308
   253
val assert_backward = assert_mode (fn mode => mode = Backward);
wenzelm@19308
   254
val assert_no_chain = assert_mode (fn mode => mode <> Chain);
wenzelm@5820
   255
wenzelm@17359
   256
val enter_forward = put_mode Forward;
wenzelm@17359
   257
val enter_chain = put_mode Chain;
wenzelm@17359
   258
val enter_backward = put_mode Backward;
wenzelm@5820
   259
wenzelm@17359
   260
wenzelm@17359
   261
(* current goal *)
wenzelm@17359
   262
wenzelm@17359
   263
fun current_goal state =
wenzelm@17359
   264
  (case current state of
wenzelm@17359
   265
    {context, goal = SOME (Goal goal), ...} => (context, goal)
wenzelm@18678
   266
  | _ => error "No current goal!");
wenzelm@5820
   267
wenzelm@17359
   268
fun assert_current_goal g state =
wenzelm@17359
   269
  let val g' = can current_goal state in
wenzelm@18678
   270
    if g andalso not g' then error "No goal in this block!"
wenzelm@18678
   271
    else if not g andalso g' then error "Goal present in this block!"
wenzelm@17359
   272
    else state
wenzelm@17359
   273
  end;
wenzelm@6776
   274
wenzelm@17359
   275
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal));
wenzelm@17359
   276
wenzelm@17859
   277
val before_qed = #before_qed o #2 o current_goal;
wenzelm@17859
   278
wenzelm@17359
   279
wenzelm@17359
   280
(* nested goal *)
wenzelm@5820
   281
wenzelm@17359
   282
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) =
wenzelm@17359
   283
      let
wenzelm@17859
   284
        val Goal {statement, using, goal, before_qed, after_qed} = goal;
wenzelm@17859
   285
        val goal' = make_goal (g (statement, using, goal, before_qed, after_qed));
wenzelm@17359
   286
      in State (make_node (f context, facts, mode, SOME goal'), nodes) end
wenzelm@17359
   287
  | map_goal f g (State (nd, node :: nodes)) =
wenzelm@17359
   288
      let val State (node', nodes') = map_goal f g (State (node, nodes))
wenzelm@17359
   289
      in map_context f (State (nd, node' :: nodes')) end
wenzelm@17359
   290
  | map_goal _ _ state = state;
wenzelm@5820
   291
wenzelm@19188
   292
fun set_goal goal = map_goal I (fn (statement, using, _, before_qed, after_qed) =>
wenzelm@19188
   293
  (statement, using, goal, before_qed, after_qed));
wenzelm@19188
   294
wenzelm@17859
   295
fun using_facts using = map_goal I (fn (statement, _, goal, before_qed, after_qed) =>
wenzelm@17859
   296
  (statement, using, goal, before_qed, after_qed));
wenzelm@17359
   297
wenzelm@17359
   298
local
wenzelm@17359
   299
  fun find i state =
wenzelm@17359
   300
    (case try current_goal state of
wenzelm@17359
   301
      SOME (ctxt, goal) => (ctxt, (i, goal))
wenzelm@18678
   302
    | NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present"));
wenzelm@17359
   303
in val find_goal = find 0 end;
wenzelm@17359
   304
wenzelm@17359
   305
fun get_goal state =
wenzelm@17359
   306
  let val (ctxt, (_, {using, goal, ...})) = find_goal state
wenzelm@17359
   307
  in (ctxt, (using, goal)) end;
wenzelm@5820
   308
wenzelm@5820
   309
wenzelm@5820
   310
wenzelm@12423
   311
(** pretty_state **)
wenzelm@5820
   312
nipkow@13869
   313
val show_main_goal = ref false;
wenzelm@16539
   314
val verbose = ProofContext.verbose;
nipkow@13698
   315
wenzelm@14876
   316
val pretty_goals_local = Display.pretty_goals_aux o ProofContext.pp;
wenzelm@12085
   317
skalberg@15531
   318
fun pretty_facts _ _ NONE = []
skalberg@15531
   319
  | pretty_facts s ctxt (SOME ths) =
wenzelm@12055
   320
      [Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""];
wenzelm@6756
   321
wenzelm@17359
   322
fun pretty_state nr state =
wenzelm@5820
   323
  let
wenzelm@17359
   324
    val {context, facts, mode, goal = _} = current state;
wenzelm@17359
   325
    val ref (_, _, bg) = Display.current_goals_markers;
wenzelm@5820
   326
wenzelm@5820
   327
    fun levels_up 0 = ""
wenzelm@17359
   328
      | levels_up 1 = "1 level up"
wenzelm@17359
   329
      | levels_up i = string_of_int i ^ " levels up";
wenzelm@5820
   330
wenzelm@11556
   331
    fun subgoals 0 = ""
wenzelm@17359
   332
      | subgoals 1 = "1 subgoal"
wenzelm@17359
   333
      | subgoals n = string_of_int n ^ " subgoals";
wenzelm@17359
   334
wenzelm@17359
   335
    fun description strs =
wenzelm@17359
   336
      (case filter_out (equal "") strs of [] => ""
wenzelm@17359
   337
      | strs' => enclose " (" ")" (commas strs'));
wenzelm@12146
   338
wenzelm@17859
   339
    fun prt_goal (SOME (ctxt, (i, {statement = (kind, _), using, goal, before_qed, after_qed}))) =
wenzelm@17359
   340
          pretty_facts "using " ctxt
wenzelm@17359
   341
            (if mode <> Backward orelse null using then NONE else SOME using) @
wenzelm@17359
   342
          [Pretty.str ("goal" ^ description [kind, levels_up (i div 2),
wenzelm@17359
   343
              subgoals (Thm.nprems_of goal)] ^ ":")] @
wenzelm@17359
   344
          pretty_goals_local ctxt bg (true, ! show_main_goal) (! Display.goals_limit) goal
wenzelm@17359
   345
      | prt_goal NONE = [];
wenzelm@6848
   346
wenzelm@17359
   347
    val prt_ctxt =
wenzelm@17359
   348
      if ! verbose orelse mode = Forward then ProofContext.pretty_context context
wenzelm@18670
   349
      else if mode = Backward then ProofContext.pretty_ctxt context
wenzelm@7575
   350
      else [];
wenzelm@17359
   351
  in
wenzelm@17359
   352
    [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
wenzelm@17359
   353
      (if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")),
wenzelm@17359
   354
      Pretty.str ""] @
wenzelm@17359
   355
    (if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @
wenzelm@17359
   356
    (if ! verbose orelse mode = Forward then
wenzelm@17359
   357
       pretty_facts "" context facts @ prt_goal (try find_goal state)
wenzelm@17359
   358
     else if mode = Chain then pretty_facts "picking " context facts
wenzelm@17359
   359
     else prt_goal (try find_goal state))
wenzelm@17359
   360
  end;
wenzelm@5820
   361
wenzelm@12085
   362
fun pretty_goals main state =
wenzelm@19188
   363
  let val (ctxt, (_, goal)) = get_goal state
wenzelm@17359
   364
  in pretty_goals_local ctxt "" (false, main) (! Display.goals_limit) goal end;
wenzelm@10320
   365
wenzelm@5820
   366
wenzelm@5820
   367
wenzelm@5820
   368
(** proof steps **)
wenzelm@5820
   369
wenzelm@17359
   370
(* refine via method *)
wenzelm@5820
   371
wenzelm@8234
   372
local
wenzelm@8234
   373
wenzelm@16146
   374
fun goalN i = "goal" ^ string_of_int i;
wenzelm@16146
   375
fun goals st = map goalN (1 upto Thm.nprems_of st);
wenzelm@16146
   376
wenzelm@16146
   377
fun no_goal_cases st = map (rpair NONE) (goals st);
wenzelm@16146
   378
wenzelm@16146
   379
fun goal_cases st =
wenzelm@18607
   380
  RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st));
wenzelm@16146
   381
wenzelm@16450
   382
fun check_theory thy state =
wenzelm@16450
   383
  if subthy (thy, theory_of state) then state
wenzelm@18678
   384
  else error ("Bad theory of method result: " ^ Context.str_of_thy thy);
wenzelm@5820
   385
wenzelm@17112
   386
fun apply_method current_context meth_fun state =
wenzelm@6848
   387
  let
wenzelm@17859
   388
    val (goal_ctxt, (_, {statement, using, goal, before_qed, after_qed})) = find_goal state;
wenzelm@17112
   389
    val meth = meth_fun (if current_context then context_of state else goal_ctxt);
wenzelm@16146
   390
  in
wenzelm@18228
   391
    Method.apply meth using goal |> Seq.map (fn (meth_cases, goal') =>
wenzelm@6848
   392
      state
wenzelm@17359
   393
      |> check_theory (Thm.theory_of_thm goal')
wenzelm@16146
   394
      |> map_goal
wenzelm@18475
   395
          (ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #>
wenzelm@18475
   396
           ProofContext.add_cases true meth_cases)
wenzelm@17859
   397
          (K (statement, using, goal', before_qed, after_qed)))
wenzelm@16146
   398
  end;
wenzelm@5820
   399
wenzelm@19188
   400
fun select_goals n meth state =
wenzelm@19224
   401
  state
wenzelm@19224
   402
  |> (#2 o #2 o get_goal)
wenzelm@19224
   403
  |> ALLGOALS Tactic.conjunction_tac
wenzelm@19224
   404
  |> Seq.maps (fn goal =>
wenzelm@19188
   405
    state
wenzelm@19224
   406
    |> Seq.lift set_goal (Goal.extract 1 n goal |> Seq.maps (Tactic.conjunction_tac 1))
wenzelm@19188
   407
    |> Seq.maps meth
wenzelm@19188
   408
    |> Seq.maps (fn state' => state'
wenzelm@19188
   409
      |> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal))
wenzelm@19224
   410
    |> Seq.maps (apply_method true (K Method.succeed)));
wenzelm@19188
   411
wenzelm@17112
   412
fun apply_text cc text state =
wenzelm@17112
   413
  let
wenzelm@17112
   414
    val thy = theory_of state;
wenzelm@17112
   415
wenzelm@17112
   416
    fun eval (Method.Basic m) = apply_method cc m
wenzelm@17112
   417
      | eval (Method.Source src) = apply_method cc (Method.method thy src)
wenzelm@17112
   418
      | eval (Method.Then txts) = Seq.EVERY (map eval txts)
wenzelm@17112
   419
      | eval (Method.Orelse txts) = Seq.FIRST (map eval txts)
wenzelm@17112
   420
      | eval (Method.Try txt) = Seq.TRY (eval txt)
wenzelm@19188
   421
      | eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt)
wenzelm@19188
   422
      | eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt);
wenzelm@17112
   423
  in eval text state end;
wenzelm@17112
   424
wenzelm@8234
   425
in
wenzelm@8234
   426
wenzelm@17112
   427
val refine = apply_text true;
wenzelm@17112
   428
val refine_end = apply_text false;
wenzelm@8234
   429
wenzelm@18908
   430
fun refine_insert [] = I
wenzelm@18908
   431
  | refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths)));
wenzelm@18908
   432
wenzelm@8234
   433
end;
wenzelm@8234
   434
wenzelm@5820
   435
wenzelm@17359
   436
(* refine via sub-proof *)
wenzelm@17359
   437
wenzelm@17359
   438
local
wenzelm@9469
   439
wenzelm@11816
   440
fun refine_tac rule =
wenzelm@18186
   441
  Tactic.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW
wenzelm@18186
   442
    (Tactic.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) =>
wenzelm@18186
   443
      if can Logic.unprotect (Logic.strip_assums_concl goal) then
wenzelm@18186
   444
        Tactic.etac Drule.protectI i
wenzelm@18186
   445
      else all_tac)));
wenzelm@11816
   446
wenzelm@17359
   447
in
wenzelm@12146
   448
wenzelm@19915
   449
fun refine_goals print_rule inner raw_rules state =
wenzelm@19915
   450
  let
wenzelm@19915
   451
    val (outer, (_, goal)) = get_goal state;
wenzelm@19915
   452
    fun refine rule st = (print_rule outer rule; FINDGOAL (refine_tac rule) st);
wenzelm@19915
   453
  in
wenzelm@19915
   454
    raw_rules
wenzelm@19915
   455
    |> ProofContext.goal_exports inner outer
wenzelm@19915
   456
    |> Seq.maps (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state)
wenzelm@19915
   457
  end;
wenzelm@17359
   458
wenzelm@17359
   459
end;
wenzelm@6932
   460
wenzelm@6932
   461
wenzelm@17359
   462
(* conclude_goal *)
wenzelm@6932
   463
wenzelm@18503
   464
fun conclude_goal state goal propss =
wenzelm@5820
   465
  let
wenzelm@19774
   466
    val thy = theory_of state;
wenzelm@5820
   467
    val ctxt = context_of state;
wenzelm@19774
   468
    val string_of_term = ProofContext.string_of_term ctxt;
wenzelm@19774
   469
    val string_of_thm = ProofContext.string_of_thm ctxt;
wenzelm@5820
   470
wenzelm@17359
   471
    val ngoals = Thm.nprems_of goal;
wenzelm@19774
   472
    val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks
wenzelm@17359
   473
        (pretty_goals_local ctxt "" (true, ! show_main_goal) (! Display.goals_limit) goal @
wenzelm@19774
   474
          [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")])));
wenzelm@19774
   475
    val _ =
wenzelm@19774
   476
      (case subtract (op aconv) (ProofContext.assms_of ctxt) (#hyps (Thm.rep_thm goal)) of
wenzelm@19774
   477
        [] => ()
wenzelm@19774
   478
      | hyps => error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term hyps)));
wenzelm@5820
   479
wenzelm@19774
   480
    val (results, th) = `(Conjunction.elim_precise (map length propss)) (Goal.conclude goal)
wenzelm@19774
   481
      handle THM _ => error ("Lost goal structure:\n" ^ string_of_thm goal);
wenzelm@19862
   482
    val _ = Unify.matches_list thy (flat propss) (map Thm.prop_of (flat results)) orelse
wenzelm@19774
   483
      error ("Proved a different theorem:\n" ^ string_of_thm th);
wenzelm@19774
   484
  in results end;
wenzelm@5820
   485
wenzelm@5820
   486
wenzelm@5820
   487
wenzelm@5820
   488
(*** structured proof commands ***)
wenzelm@5820
   489
wenzelm@17112
   490
(** context elements **)
wenzelm@5820
   491
wenzelm@17112
   492
(* bindings *)
wenzelm@5820
   493
wenzelm@16813
   494
local
wenzelm@16813
   495
wenzelm@17359
   496
fun gen_bind bind args state =
wenzelm@5820
   497
  state
wenzelm@5820
   498
  |> assert_forward
wenzelm@18308
   499
  |> map_context (bind args #> snd)
wenzelm@17359
   500
  |> put_facts NONE;
wenzelm@5820
   501
wenzelm@16813
   502
in
wenzelm@16813
   503
wenzelm@8617
   504
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   505
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   506
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   507
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   508
wenzelm@16813
   509
end;
wenzelm@16813
   510
wenzelm@5820
   511
wenzelm@17359
   512
(* fix *)
wenzelm@9196
   513
wenzelm@12714
   514
local
wenzelm@12714
   515
wenzelm@18670
   516
fun gen_fix add_fixes args =
wenzelm@17359
   517
  assert_forward
wenzelm@19846
   518
  #> map_context (snd o add_fixes args)
wenzelm@17359
   519
  #> put_facts NONE;
wenzelm@5820
   520
wenzelm@16813
   521
in
wenzelm@16813
   522
wenzelm@18670
   523
val fix = gen_fix ProofContext.add_fixes;
wenzelm@18670
   524
val fix_i = gen_fix ProofContext.add_fixes_i;
wenzelm@5820
   525
wenzelm@16813
   526
end;
wenzelm@16813
   527
wenzelm@5820
   528
wenzelm@17359
   529
(* assume etc. *)
wenzelm@5820
   530
wenzelm@16813
   531
local
wenzelm@16813
   532
wenzelm@17112
   533
fun gen_assume asm prep_att exp args state =
wenzelm@5820
   534
  state
wenzelm@5820
   535
  |> assert_forward
wenzelm@17112
   536
  |> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args))
wenzelm@17359
   537
  |> these_factss [] |> #2;
wenzelm@6932
   538
wenzelm@16813
   539
in
wenzelm@16813
   540
wenzelm@18728
   541
val assm      = gen_assume ProofContext.add_assms Attrib.attribute;
wenzelm@18670
   542
val assm_i    = gen_assume ProofContext.add_assms_i (K I);
wenzelm@18670
   543
val assume    = assm ProofContext.assume_export;
wenzelm@18670
   544
val assume_i  = assm_i ProofContext.assume_export;
wenzelm@18670
   545
val presume   = assm ProofContext.presume_export;
wenzelm@18670
   546
val presume_i = assm_i ProofContext.presume_export;
wenzelm@5820
   547
wenzelm@16813
   548
end;
wenzelm@16813
   549
wenzelm@7271
   550
wenzelm@17359
   551
(* def *)
wenzelm@11891
   552
wenzelm@16813
   553
local
wenzelm@16813
   554
wenzelm@19846
   555
fun gen_def gen_fix prep_att prep_binds args state =
wenzelm@11891
   556
  let
wenzelm@11891
   557
    val _ = assert_forward state;
wenzelm@17112
   558
    val thy = theory_of state;
wenzelm@11891
   559
wenzelm@19846
   560
    val ((raw_names, raw_atts), (vars, raw_rhss)) =
wenzelm@19846
   561
      args |> split_list |>> split_list ||> split_list;
wenzelm@19846
   562
    val xs = map #1 vars;
wenzelm@18308
   563
    val names = map (fn ("", x) => Thm.def_name x | (name, _) => name) (raw_names ~~ xs);
wenzelm@18308
   564
    val atts = map (map (prep_att thy)) raw_atts;
wenzelm@18308
   565
    val (rhss, state') = state |> map_context_result (prep_binds false (map swap raw_rhss));
wenzelm@18826
   566
    val eqs = LocalDefs.mk_def (context_of state') (xs ~~ rhss);
wenzelm@11891
   567
  in
wenzelm@18308
   568
    state'
wenzelm@19846
   569
    |> gen_fix (map (fn (x, mx) => (x, NONE, mx)) vars)
wenzelm@19585
   570
    |> assm_i LocalDefs.def_export ((names ~~ atts) ~~ map (fn eq => [(eq, [])]) eqs)
wenzelm@11891
   571
  end;
wenzelm@11891
   572
wenzelm@16813
   573
in
wenzelm@16813
   574
wenzelm@18728
   575
val def = gen_def fix Attrib.attribute ProofContext.match_bind;
wenzelm@18308
   576
val def_i = gen_def fix_i (K I) ProofContext.match_bind_i;
wenzelm@11891
   577
wenzelm@16813
   578
end;
wenzelm@16813
   579
wenzelm@11891
   580
wenzelm@8374
   581
wenzelm@17112
   582
(** facts **)
wenzelm@5820
   583
wenzelm@17359
   584
(* chain *)
wenzelm@5820
   585
wenzelm@17359
   586
val chain =
wenzelm@17359
   587
  assert_forward
wenzelm@17359
   588
  #> tap the_facts
wenzelm@17359
   589
  #> enter_chain;
wenzelm@5820
   590
wenzelm@17359
   591
fun chain_facts facts =
wenzelm@17359
   592
  put_facts (SOME facts)
wenzelm@17359
   593
  #> chain;
wenzelm@5820
   594
wenzelm@5820
   595
wenzelm@17359
   596
(* note etc. *)
wenzelm@17112
   597
wenzelm@17166
   598
fun no_binding args = map (pair ("", [])) args;
wenzelm@17112
   599
wenzelm@17112
   600
local
wenzelm@17112
   601
wenzelm@17359
   602
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state =
wenzelm@17112
   603
  state
wenzelm@17112
   604
  |> assert_forward
wenzelm@17112
   605
  |> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args))
wenzelm@17112
   606
  |> these_factss (more_facts state)
wenzelm@17359
   607
  ||> opt_chain
wenzelm@17359
   608
  |> opt_result;
wenzelm@17112
   609
wenzelm@17112
   610
in
wenzelm@17112
   611
wenzelm@18728
   612
val note_thmss = gen_thmss ProofContext.note_thmss (K []) I #2 Attrib.attribute;
wenzelm@17359
   613
val note_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) I #2 (K I);
wenzelm@17112
   614
wenzelm@17112
   615
val from_thmss =
wenzelm@18728
   616
  gen_thmss ProofContext.note_thmss (K []) chain #2 Attrib.attribute o no_binding;
wenzelm@17359
   617
val from_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) chain #2 (K I) o no_binding;
wenzelm@17112
   618
wenzelm@17112
   619
val with_thmss =
wenzelm@18728
   620
  gen_thmss ProofContext.note_thmss the_facts chain #2 Attrib.attribute o no_binding;
wenzelm@17359
   621
val with_thmss_i = gen_thmss ProofContext.note_thmss_i the_facts chain #2 (K I) o no_binding;
wenzelm@17359
   622
wenzelm@18808
   623
val local_results =
wenzelm@18808
   624
  gen_thmss ProofContext.note_thmss_i (K []) I I (K I) o map (apsnd Thm.simple_fact);
wenzelm@18808
   625
fun global_results kind = PureThy.note_thmss_i kind o map (apsnd Thm.simple_fact);
wenzelm@17359
   626
wenzelm@17359
   627
fun get_thmss state srcs = the_facts (note_thmss [(("", []), srcs)] state);
wenzelm@17359
   628
fun simple_note_thms name thms = note_thmss_i [((name, []), [(thms, [])])];
wenzelm@17112
   629
wenzelm@17112
   630
end;
wenzelm@17112
   631
wenzelm@17112
   632
wenzelm@18548
   633
(* using/unfolding *)
wenzelm@17112
   634
wenzelm@17112
   635
local
wenzelm@17112
   636
wenzelm@18548
   637
fun gen_using f g note prep_atts args state =
wenzelm@17112
   638
  state
wenzelm@17112
   639
  |> assert_backward
wenzelm@17166
   640
  |> map_context_result (note (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args)))
wenzelm@18843
   641
  |> (fn (named_facts, state') =>
wenzelm@18843
   642
    state' |> map_goal I (fn (statement, using, goal, before_qed, after_qed) =>
wenzelm@18843
   643
      let
wenzelm@18843
   644
        val ctxt = context_of state';
wenzelm@19482
   645
        val ths = maps snd named_facts;
wenzelm@18843
   646
      in (statement, f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end));
wenzelm@18548
   647
wenzelm@18843
   648
fun append_using _ ths using = using @ ths;
wenzelm@18878
   649
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths);
wenzelm@18878
   650
val unfold_goals = LocalDefs.unfold_goals;
wenzelm@17112
   651
wenzelm@17112
   652
in
wenzelm@17112
   653
wenzelm@18843
   654
val using = gen_using append_using (K (K I)) ProofContext.note_thmss Attrib.attribute;
wenzelm@18843
   655
val using_i = gen_using append_using (K (K I)) ProofContext.note_thmss_i (K I);
wenzelm@18826
   656
val unfolding = gen_using unfold_using unfold_goals ProofContext.note_thmss Attrib.attribute;
wenzelm@18826
   657
val unfolding_i = gen_using unfold_using unfold_goals ProofContext.note_thmss_i (K I);
wenzelm@17112
   658
wenzelm@17112
   659
end;
wenzelm@17112
   660
wenzelm@17112
   661
wenzelm@17112
   662
(* case *)
wenzelm@17112
   663
wenzelm@17112
   664
local
wenzelm@17112
   665
wenzelm@17112
   666
fun gen_invoke_case prep_att (name, xs, raw_atts) state =
wenzelm@17112
   667
  let
wenzelm@17112
   668
    val atts = map (prep_att (theory_of state)) raw_atts;
wenzelm@19078
   669
    val (asms, state') = state |> map_context_result (fn ctxt =>
wenzelm@19078
   670
      ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs));
wenzelm@19585
   671
    val assumptions = asms |> map (fn (a, ts) => ((a, atts), map (rpair []) ts));
wenzelm@17112
   672
  in
wenzelm@17112
   673
    state'
wenzelm@17359
   674
    |> map_context (ProofContext.qualified_names #> ProofContext.no_base_names)
wenzelm@17112
   675
    |> assume_i assumptions
wenzelm@17976
   676
    |> add_binds_i AutoBind.no_facts
wenzelm@17112
   677
    |> map_context (ProofContext.restore_naming (context_of state))
wenzelm@17112
   678
    |> `the_facts |-> simple_note_thms name
wenzelm@17112
   679
  end;
wenzelm@17112
   680
wenzelm@17112
   681
in
wenzelm@17112
   682
wenzelm@18728
   683
val invoke_case = gen_invoke_case Attrib.attribute;
wenzelm@17112
   684
val invoke_case_i = gen_invoke_case (K I);
wenzelm@17112
   685
wenzelm@17112
   686
end;
wenzelm@17112
   687
wenzelm@17112
   688
wenzelm@17112
   689
wenzelm@17359
   690
(** proof structure **)
wenzelm@17359
   691
wenzelm@17359
   692
(* blocks *)
wenzelm@17359
   693
wenzelm@17359
   694
val begin_block =
wenzelm@17359
   695
  assert_forward
wenzelm@17359
   696
  #> open_block
wenzelm@17359
   697
  #> put_goal NONE
wenzelm@17359
   698
  #> open_block;
wenzelm@17359
   699
wenzelm@17359
   700
val next_block =
wenzelm@17359
   701
  assert_forward
wenzelm@17359
   702
  #> close_block
wenzelm@17359
   703
  #> open_block
wenzelm@17359
   704
  #> put_goal NONE
wenzelm@17359
   705
  #> put_facts NONE;
wenzelm@17359
   706
wenzelm@17359
   707
fun end_block state =
wenzelm@17359
   708
  state
wenzelm@17359
   709
  |> assert_forward
wenzelm@17359
   710
  |> close_block
wenzelm@17359
   711
  |> assert_current_goal false
wenzelm@17359
   712
  |> close_block
wenzelm@17359
   713
  |> export_facts state;
wenzelm@17359
   714
wenzelm@17359
   715
wenzelm@17359
   716
(* sub-proofs *)
wenzelm@17359
   717
wenzelm@17359
   718
fun proof opt_text =
wenzelm@17359
   719
  assert_backward
wenzelm@17859
   720
  #> refine (the_default Method.default_text opt_text)
wenzelm@17359
   721
  #> Seq.map (using_facts [] #> enter_forward);
wenzelm@17359
   722
wenzelm@17359
   723
fun end_proof bot txt =
wenzelm@17359
   724
  assert_forward
wenzelm@17359
   725
  #> assert_bottom bot
wenzelm@17359
   726
  #> close_block
wenzelm@17359
   727
  #> assert_current_goal true
wenzelm@17359
   728
  #> using_facts []
wenzelm@17859
   729
  #> `before_qed #-> (refine o the_default Method.succeed_text)
wenzelm@17859
   730
  #> Seq.maps (refine (Method.finish_text txt));
wenzelm@17359
   731
wenzelm@17359
   732
wenzelm@17359
   733
(* unstructured refinement *)
wenzelm@17359
   734
wenzelm@17359
   735
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i)));
wenzelm@17359
   736
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i)));
wenzelm@17359
   737
wenzelm@17359
   738
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
wenzelm@17359
   739
fun apply_end text = assert_forward #> refine_end text;
wenzelm@17359
   740
wenzelm@17359
   741
wenzelm@17359
   742
wenzelm@17112
   743
(** goals **)
wenzelm@17112
   744
wenzelm@17359
   745
(* goal names *)
wenzelm@17359
   746
wenzelm@17359
   747
fun prep_names prep_att stmt =
wenzelm@17359
   748
  let
wenzelm@17359
   749
    val (names_attss, propp) = split_list (Attrib.map_specs prep_att stmt);
wenzelm@17359
   750
    val (names, attss) = split_list names_attss;
wenzelm@17359
   751
  in ((names, attss), propp) end;
wenzelm@5820
   752
wenzelm@17359
   753
fun goal_names target name names =
wenzelm@17450
   754
  (case target of NONE => "" | SOME "" => "" | SOME loc => " (in " ^ loc ^ ")") ^
wenzelm@17359
   755
  (if name = "" then "" else " " ^ name) ^
wenzelm@17359
   756
  (case filter_out (equal "") names of [] => ""
wenzelm@17359
   757
  | nms => " " ^ enclose "(" ")" (space_implode " and " (Library.take (7, nms) @
wenzelm@17359
   758
      (if length nms > 7 then ["..."] else []))));
wenzelm@17359
   759
wenzelm@16813
   760
wenzelm@17359
   761
(* generic goals *)
wenzelm@17359
   762
wenzelm@19774
   763
local
wenzelm@19774
   764
wenzelm@19846
   765
fun implicit_vars dest add props =
wenzelm@19846
   766
  let
wenzelm@19846
   767
    val (explicit_vars, props') = take_prefix (can dest) props |>> map dest;
wenzelm@19846
   768
    val vars = rev (subtract (op =) explicit_vars (fold add props []));
wenzelm@19846
   769
    val _ =
wenzelm@19846
   770
      if null vars then ()
wenzelm@19846
   771
      else warning ("Goal statement contains unbound schematic variable(s): " ^
wenzelm@19846
   772
        commas_quote (map (Term.string_of_vname o fst) vars));
wenzelm@19846
   773
  in (rev vars, props') end;
wenzelm@19774
   774
wenzelm@19774
   775
fun refine_terms n =
wenzelm@19774
   776
  refine (Method.Basic (K (Method.RAW_METHOD
wenzelm@19774
   777
    (K (HEADGOAL (PRECISE_CONJUNCTS n
wenzelm@19774
   778
      (HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI))))))))))
wenzelm@19774
   779
  #> Seq.hd;
wenzelm@19774
   780
wenzelm@19774
   781
in
wenzelm@17359
   782
wenzelm@17859
   783
fun generic_goal prepp kind before_qed after_qed raw_propp state =
wenzelm@5820
   784
  let
wenzelm@17359
   785
    val thy = theory_of state;
wenzelm@17359
   786
    val chaining = can assert_chain state;
wenzelm@17359
   787
wenzelm@17359
   788
    val ((propss, after_ctxt), goal_state) =
wenzelm@5936
   789
      state
wenzelm@5936
   790
      |> assert_forward_or_chain
wenzelm@5936
   791
      |> enter_forward
wenzelm@17359
   792
      |> open_block
wenzelm@17859
   793
      |> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp)));
wenzelm@19482
   794
    val props = flat propss;
wenzelm@15703
   795
wenzelm@19846
   796
    val (_, props') =
wenzelm@19846
   797
      implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props;
wenzelm@19846
   798
    val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props';
wenzelm@19774
   799
wenzelm@19774
   800
    val propss' = map (Logic.mk_term o Var) vars :: propss;
wenzelm@19774
   801
    val goal = Goal.init (Thm.cterm_of thy (Logic.mk_conjunction_list2 propss'));
wenzelm@18124
   802
    val after_qed' = after_qed |>> (fn after_local =>
wenzelm@18124
   803
      fn results => map_context after_ctxt #> after_local results);
wenzelm@5820
   804
  in
wenzelm@17359
   805
    goal_state
wenzelm@19900
   806
    |> map_context (Variable.set_body true)
wenzelm@19774
   807
    |> put_goal (SOME (make_goal ((kind, propss'), [], goal, before_qed, after_qed')))
wenzelm@18475
   808
    |> map_context (ProofContext.add_cases false (AutoBind.cases thy props))
wenzelm@17359
   809
    |> map_context (ProofContext.auto_bind_goal props)
wenzelm@17359
   810
    |> K chaining ? (`the_facts #-> using_facts)
wenzelm@17359
   811
    |> put_facts NONE
wenzelm@17359
   812
    |> open_block
wenzelm@17359
   813
    |> put_goal NONE
wenzelm@5820
   814
    |> enter_backward
wenzelm@19774
   815
    |> K (not (null vars)) ? refine_terms (length propss')
wenzelm@17450
   816
    |> K (null props) ? (refine (Method.Basic Method.assumption) #> Seq.hd)
wenzelm@5820
   817
  end;
wenzelm@5820
   818
wenzelm@17359
   819
fun generic_qed state =
wenzelm@12503
   820
  let
wenzelm@18548
   821
    val (goal_ctxt, {statement = (_, stmt), using = _, goal, before_qed = _, after_qed}) =
wenzelm@17859
   822
      current_goal state;
wenzelm@8617
   823
    val outer_state = state |> close_block;
wenzelm@8617
   824
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   825
wenzelm@18503
   826
    val props =
wenzelm@19774
   827
      flat (tl stmt)
wenzelm@19915
   828
      |> Variable.exportT_terms goal_ctxt outer_ctxt;
wenzelm@17359
   829
    val results =
wenzelm@19774
   830
      tl (conclude_goal state goal stmt)
wenzelm@19915
   831
      |> Seq.map_list (ProofContext.exports goal_ctxt outer_ctxt);
wenzelm@17359
   832
  in
wenzelm@17359
   833
    outer_state
wenzelm@17359
   834
    |> map_context (ProofContext.auto_bind_facts props)
wenzelm@18124
   835
    |> pair (after_qed, results)
wenzelm@17359
   836
  end;
wenzelm@17359
   837
wenzelm@19774
   838
end;
wenzelm@19774
   839
wenzelm@9469
   840
wenzelm@17359
   841
(* local goals *)
wenzelm@17359
   842
wenzelm@17859
   843
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state =
wenzelm@17359
   844
  let
wenzelm@17359
   845
    val ((names, attss), propp) = prep_names (prep_att (theory_of state)) stmt;
wenzelm@17359
   846
wenzelm@18124
   847
    fun after_qed' results =
wenzelm@18808
   848
      local_results ((names ~~ attss) ~~ results)
wenzelm@17359
   849
      #-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
wenzelm@18124
   850
      #> after_qed results;
wenzelm@5820
   851
  in
wenzelm@17359
   852
    state
wenzelm@18124
   853
    |> generic_goal prepp (kind ^ goal_names NONE "" names) before_qed (after_qed', K I) propp
wenzelm@19900
   854
    |> tap (Variable.warn_extra_tfrees (context_of state) o context_of)
wenzelm@5820
   855
  end;
wenzelm@5820
   856
wenzelm@17359
   857
fun local_qed txt =
wenzelm@17359
   858
  end_proof false txt
wenzelm@17359
   859
  #> Seq.map generic_qed
wenzelm@18124
   860
  #> Seq.maps (uncurry (fn ((after_qed, _), results) => Seq.lifts after_qed results));
wenzelm@5820
   861
wenzelm@5820
   862
wenzelm@17359
   863
(* global goals *)
wenzelm@17359
   864
wenzelm@17359
   865
fun global_goal print_results prep_att prepp
wenzelm@17859
   866
    kind before_qed after_qed target (name, raw_atts) stmt ctxt =
wenzelm@17359
   867
  let
wenzelm@17359
   868
    val thy = ProofContext.theory_of ctxt;
wenzelm@17359
   869
    val thy_ctxt = ProofContext.init thy;
wenzelm@17359
   870
wenzelm@17359
   871
    val atts = map (prep_att thy) raw_atts;
wenzelm@17359
   872
    val ((names, attss), propp) = prep_names (prep_att thy) stmt;
wenzelm@17359
   873
wenzelm@17450
   874
    fun store_results prfx res =
wenzelm@17450
   875
      K (prfx <> "") ? (Sign.add_path prfx #> Sign.no_base_names)
wenzelm@17450
   876
      #> global_results kind ((names ~~ attss) ~~ res)
wenzelm@17359
   877
      #-> (fn res' =>
wenzelm@17359
   878
        (print_results thy_ctxt ((kind, name), res') : unit;
wenzelm@19482
   879
          #2 o global_results kind [((name, atts), maps #2 res')]))
wenzelm@17450
   880
      #> Sign.restore_naming thy;
wenzelm@17359
   881
wenzelm@18124
   882
    fun after_qed' results =
wenzelm@17450
   883
      (case target of NONE => I
wenzelm@17450
   884
      | SOME prfx => store_results (NameSpace.base prfx)
wenzelm@19915
   885
          (map (ProofContext.export_standard ctxt thy_ctxt
wenzelm@19915
   886
            #> map Drule.strip_shyps_warning) results))
wenzelm@18124
   887
      #> after_qed results;
wenzelm@17359
   888
  in
wenzelm@17359
   889
    init ctxt
wenzelm@18670
   890
    |> generic_goal (prepp #> ProofContext.auto_fixes) (kind ^ goal_names target name names)
wenzelm@18124
   891
      before_qed (K Seq.single, after_qed') propp
wenzelm@17359
   892
  end;
wenzelm@12065
   893
wenzelm@18678
   894
fun check_result msg sq =
wenzelm@17112
   895
  (case Seq.pull sq of
wenzelm@18678
   896
    NONE => error msg
wenzelm@19475
   897
  | SOME (s', sq') => Seq.cons s' sq');
wenzelm@17112
   898
wenzelm@17359
   899
fun global_qeds txt =
wenzelm@17359
   900
  end_proof true txt
wenzelm@17359
   901
  #> Seq.map generic_qed
wenzelm@18124
   902
  #> Seq.maps (fn (((_, after_qed), results), state) =>
wenzelm@18124
   903
    Seq.lift after_qed results (theory_of state)
wenzelm@19100
   904
    |> Seq.map (fn thy => (ProofContext.transfer thy (context_of state), thy)))
wenzelm@17112
   905
  |> Seq.DETERM;   (*backtracking may destroy theory!*)
wenzelm@17112
   906
wenzelm@18678
   907
fun global_qed txt =
wenzelm@18678
   908
  global_qeds txt
wenzelm@18678
   909
  #> check_result "Failed to finish proof"
wenzelm@18678
   910
  #> Seq.hd;
wenzelm@12959
   911
wenzelm@5820
   912
wenzelm@17359
   913
(* concluding steps *)
wenzelm@17112
   914
wenzelm@17359
   915
fun local_terminal_proof (text, opt_text) =
wenzelm@17359
   916
  proof (SOME text) #> Seq.maps (local_qed (opt_text, true));
wenzelm@17112
   917
wenzelm@17112
   918
val local_default_proof = local_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   919
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE);
wenzelm@17359
   920
val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false));
wenzelm@17359
   921
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE);
wenzelm@17112
   922
wenzelm@18678
   923
fun global_term_proof immed (text, opt_text) =
wenzelm@18678
   924
  proof (SOME text)
wenzelm@18678
   925
  #> check_result "Terminal proof method failed"
wenzelm@18678
   926
  #> Seq.maps (global_qeds (opt_text, immed))
wenzelm@18678
   927
  #> check_result "Failed to finish proof (after successful terminal method)"
wenzelm@18678
   928
  #> Seq.hd;
wenzelm@17112
   929
wenzelm@17112
   930
val global_terminal_proof = global_term_proof true;
wenzelm@17112
   931
val global_default_proof = global_terminal_proof (Method.default_text, NONE);
wenzelm@17112
   932
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE);
wenzelm@17112
   933
val global_done_proof = global_term_proof false (Method.done_text, NONE);
wenzelm@17359
   934
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE);
wenzelm@5820
   935
wenzelm@6896
   936
wenzelm@17359
   937
(* common goal statements *)
wenzelm@17359
   938
wenzelm@17359
   939
local
wenzelm@17359
   940
wenzelm@17859
   941
fun gen_have prep_att prepp before_qed after_qed stmt int =
wenzelm@17859
   942
  local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt;
wenzelm@6896
   943
wenzelm@17859
   944
fun gen_show prep_att prepp before_qed after_qed stmt int state =
wenzelm@17359
   945
  let
wenzelm@17359
   946
    val testing = ref false;
wenzelm@17359
   947
    val rule = ref (NONE: thm option);
wenzelm@17359
   948
    fun fail_msg ctxt =
wenzelm@17359
   949
      "Local statement will fail to solve any pending goal" ::
wenzelm@17359
   950
      (case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th])
wenzelm@17359
   951
      |> cat_lines;
wenzelm@6896
   952
wenzelm@17359
   953
    fun print_results ctxt res =
wenzelm@17359
   954
      if ! testing then () else ProofDisplay.print_results int ctxt res;
wenzelm@17359
   955
    fun print_rule ctxt th =
wenzelm@17359
   956
      if ! testing then rule := SOME th
wenzelm@17359
   957
      else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th)
wenzelm@17359
   958
      else ();
wenzelm@17359
   959
    val test_proof =
wenzelm@17359
   960
      (Seq.pull oo local_skip_proof) true
wenzelm@17359
   961
      |> setmp testing true
wenzelm@17359
   962
      |> setmp proofs 0
wenzelm@17359
   963
      |> capture;
wenzelm@6896
   964
wenzelm@18124
   965
    fun after_qed' results =
wenzelm@19482
   966
      refine_goals print_rule (context_of state) (flat results)
wenzelm@18124
   967
      #> Seq.maps (after_qed results);
wenzelm@17359
   968
  in
wenzelm@17359
   969
    state
wenzelm@17859
   970
    |> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt
wenzelm@17359
   971
    |> K int ? (fn goal_state =>
wenzelm@17359
   972
      (case test_proof goal_state of
wenzelm@17359
   973
        Result (SOME _) => goal_state
wenzelm@18678
   974
      | Result NONE => error (fail_msg (context_of goal_state))
wenzelm@17359
   975
      | Exn Interrupt => raise Interrupt
wenzelm@17359
   976
      | Exn exn => raise EXCEPTION (exn, fail_msg (context_of goal_state))))
wenzelm@17359
   977
  end;
wenzelm@17359
   978
wenzelm@17859
   979
fun gen_theorem prep_att prepp kind before_qed after_qed target a =
wenzelm@17859
   980
  global_goal ProofDisplay.present_results prep_att prepp kind before_qed after_qed target a;
wenzelm@17359
   981
wenzelm@17359
   982
in
wenzelm@17359
   983
wenzelm@18728
   984
val have = gen_have Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   985
val have_i = gen_have (K I) ProofContext.bind_propp_i;
wenzelm@18728
   986
val show = gen_show Attrib.attribute ProofContext.bind_propp;
wenzelm@17359
   987
val show_i = gen_show (K I) ProofContext.bind_propp_i;
wenzelm@18728
   988
val theorem = gen_theorem Attrib.attribute ProofContext.bind_propp_schematic;
wenzelm@17359
   989
val theorem_i = gen_theorem (K I) ProofContext.bind_propp_schematic_i;
wenzelm@6896
   990
wenzelm@5820
   991
end;
wenzelm@17359
   992
wenzelm@17359
   993
end;