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