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