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