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