src/Pure/Isar/proof.ML
author wenzelm
Thu Jul 01 21:20:57 1999 +0200 (1999-07-01)
changeset 6876 4ae9c47f2b6b
parent 6871 01866edde713
child 6887 12b5fb35a688
permissions -rw-r--r--
have_thmss: more_ths;
simple_have_thmss;
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@5820
     5
Proof states and methods.
wenzelm@5820
     6
*)
wenzelm@5820
     7
wenzelm@5820
     8
signature PROOF =
wenzelm@5820
     9
sig
wenzelm@5820
    10
  type context
wenzelm@5820
    11
  type state
wenzelm@5820
    12
  exception STATE of string * state
wenzelm@6871
    13
  val check_result: string -> state -> 'a Seq.seq -> 'a Seq.seq
wenzelm@5820
    14
  val context_of: state -> context
wenzelm@5820
    15
  val theory_of: state -> theory
wenzelm@5820
    16
  val sign_of: state -> Sign.sg
wenzelm@6091
    17
  val the_facts: state -> thm list
wenzelm@6776
    18
  val the_fact: state -> thm
wenzelm@6091
    19
  val goal_facts: (state -> thm list) -> state -> state
wenzelm@5820
    20
  val use_facts: state -> state
wenzelm@5820
    21
  val reset_facts: state -> state
wenzelm@5820
    22
  val assert_backward: state -> state
wenzelm@5820
    23
  val enter_forward: state -> state
wenzelm@6529
    24
  val verbose: bool ref
wenzelm@5820
    25
  val print_state: state -> unit
wenzelm@6776
    26
  val level: state -> int
wenzelm@5820
    27
  type method
wenzelm@6848
    28
  val method: (thm list -> tactic) -> method
wenzelm@5820
    29
  val refine: (context -> method) -> state -> state Seq.seq
wenzelm@5820
    30
  val bind: (indexname * string) list -> state -> state
wenzelm@5820
    31
  val bind_i: (indexname * term) list -> state -> state
wenzelm@5936
    32
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    33
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@6876
    34
  val have_thmss: thm list -> string -> context attribute list ->
wenzelm@6091
    35
    (thm list * context attribute list) list -> state -> state
wenzelm@6876
    36
  val simple_have_thms: string -> thm list -> state -> state
wenzelm@6848
    37
  val assume: (int -> tactic) -> string -> context attribute list -> (string * string list) list
wenzelm@6848
    38
    -> state -> state
wenzelm@6848
    39
  val assume_i: (int -> tactic) -> string -> context attribute list -> (term * term list) list
wenzelm@6848
    40
    -> state -> state
wenzelm@5820
    41
  val fix: (string * string option) list -> state -> state
wenzelm@5820
    42
  val fix_i: (string * typ) list -> state -> state
wenzelm@5936
    43
  val theorem: bstring -> theory attribute list -> string * string list -> theory -> state
wenzelm@5936
    44
  val theorem_i: bstring -> theory attribute list -> term * term list -> theory -> state
wenzelm@5936
    45
  val lemma: bstring -> theory attribute list -> string * string list -> theory -> state
wenzelm@5936
    46
  val lemma_i: bstring -> theory attribute list -> term * term list -> theory -> state
wenzelm@5820
    47
  val chain: state -> state
wenzelm@6091
    48
  val from_facts: thm list -> state -> state
wenzelm@5936
    49
  val show: string -> context attribute list -> string * string list -> state -> state
wenzelm@5936
    50
  val show_i: string -> context attribute list -> term * term list -> state -> state
wenzelm@5936
    51
  val have: string -> context attribute list -> string * string list -> state -> state
wenzelm@5936
    52
  val have_i: string -> context attribute list -> term * term list -> state -> state
wenzelm@5820
    53
  val begin_block: state -> state
wenzelm@5820
    54
  val next_block: state -> state
wenzelm@6404
    55
  val end_block: state -> state
wenzelm@6404
    56
  val at_bottom: state -> bool
wenzelm@6731
    57
  val local_qed: (state -> state Seq.seq) -> ({kind: string, name: string, thm: thm} -> unit)
wenzelm@6731
    58
    -> state -> state Seq.seq
wenzelm@6404
    59
  val global_qed: (state -> state Seq.seq) -> bstring option
wenzelm@6871
    60
    -> theory attribute list option -> state -> (theory * {kind: string, name: string, thm: thm}) Seq.seq
wenzelm@5820
    61
end;
wenzelm@5820
    62
wenzelm@5820
    63
signature PROOF_PRIVATE =
wenzelm@5820
    64
sig
wenzelm@5820
    65
  include PROOF
wenzelm@5820
    66
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> state -> state
wenzelm@5820
    67
end;
wenzelm@5820
    68
wenzelm@5820
    69
structure Proof: PROOF_PRIVATE =
wenzelm@5820
    70
struct
wenzelm@5820
    71
wenzelm@5820
    72
wenzelm@5820
    73
(** proof state **)
wenzelm@5820
    74
wenzelm@5820
    75
type context = ProofContext.context;
wenzelm@5820
    76
wenzelm@5820
    77
wenzelm@5820
    78
(* type goal *)
wenzelm@5820
    79
wenzelm@5820
    80
datatype kind =
wenzelm@5820
    81
  Theorem of theory attribute list |    (*top-level theorem*)
wenzelm@5820
    82
  Lemma of theory attribute list |      (*top-level lemma*)
wenzelm@5820
    83
  Goal of context attribute list |      (*intermediate result, solving subgoal*)
wenzelm@5820
    84
  Aux of context attribute list ;       (*intermediate result*)
wenzelm@5820
    85
wenzelm@5820
    86
val kind_name =
wenzelm@6001
    87
  fn Theorem _ => "theorem" | Lemma _ => "lemma" | Goal _ => "show" | Aux _ => "have";
wenzelm@5820
    88
wenzelm@5820
    89
type goal =
wenzelm@6848
    90
 (kind *               		(*result kind*)
wenzelm@6848
    91
  string *                      (*result name*)
wenzelm@6848
    92
  cterm list *			(*result assumptions*)
wenzelm@6848
    93
  (int -> tactic) list *      	(*tactics to solve result assumptions*)
wenzelm@6848
    94
  term) *                       (*result statement*)
wenzelm@6848
    95
 (thm list *                    (*use facts*)
wenzelm@6848
    96
  thm);                         (*goal: subgoals ==> statement*)
wenzelm@5820
    97
wenzelm@5820
    98
wenzelm@5820
    99
(* type mode *)
wenzelm@5820
   100
wenzelm@5820
   101
datatype mode = Forward | ForwardChain | Backward;
wenzelm@5820
   102
wenzelm@5820
   103
val mode_name =
wenzelm@6798
   104
  enclose "`" "'" o
wenzelm@6798
   105
    (fn Forward => "state" | ForwardChain => "chain" | Backward => "prove");
wenzelm@5820
   106
wenzelm@5820
   107
wenzelm@5820
   108
(* type node *)
wenzelm@5820
   109
wenzelm@5820
   110
type node =
wenzelm@5820
   111
 {context: context,
wenzelm@6091
   112
  facts: thm list option,
wenzelm@5820
   113
  mode: mode,
wenzelm@5820
   114
  goal: goal option};
wenzelm@5820
   115
wenzelm@5820
   116
fun make_node (context, facts, mode, goal) =
wenzelm@5820
   117
  {context = context, facts = facts, mode = mode, goal = goal}: node;
wenzelm@5820
   118
wenzelm@5820
   119
wenzelm@5820
   120
(* datatype state *)
wenzelm@5820
   121
wenzelm@5820
   122
datatype state =
wenzelm@5820
   123
  State of
wenzelm@5820
   124
    node *              (*current*)
wenzelm@5820
   125
    node list;          (*parents wrt. block structure*)
wenzelm@5820
   126
wenzelm@5820
   127
exception STATE of string * state;
wenzelm@5820
   128
wenzelm@5820
   129
fun err_malformed name state =
wenzelm@5820
   130
  raise STATE (name ^ ": internal error -- malformed proof state", state);
wenzelm@5820
   131
wenzelm@6871
   132
fun check_result msg state sq =
wenzelm@6871
   133
  (case Seq.pull sq of
wenzelm@6871
   134
    None => raise STATE (msg, state)
wenzelm@6871
   135
  | Some s_sq => Seq.cons s_sq);
wenzelm@6871
   136
wenzelm@5820
   137
wenzelm@5820
   138
fun map_current f (State ({context, facts, mode, goal}, nodes)) =
wenzelm@5820
   139
  State (make_node (f (context, facts, mode, goal)), nodes);
wenzelm@5820
   140
wenzelm@5820
   141
fun init_state thy =
wenzelm@5875
   142
  State (make_node (ProofContext.init thy, None, Forward, None), []);
wenzelm@5820
   143
wenzelm@5820
   144
wenzelm@5820
   145
wenzelm@5820
   146
(** basic proof state operations **)
wenzelm@5820
   147
wenzelm@5820
   148
(* context *)
wenzelm@5820
   149
wenzelm@5820
   150
fun context_of (State ({context, ...}, _)) = context;
wenzelm@5820
   151
val theory_of = ProofContext.theory_of o context_of;
wenzelm@5820
   152
val sign_of = ProofContext.sign_of o context_of;
wenzelm@5820
   153
wenzelm@5820
   154
fun map_context f = map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   155
wenzelm@5820
   156
fun map_context_result f (state as State ({context, facts, mode, goal}, nodes)) =
wenzelm@5820
   157
  let val (context', result) = f context
wenzelm@5820
   158
  in (State (make_node (context', facts, mode, goal), nodes), result) end;
wenzelm@5820
   159
wenzelm@5820
   160
wenzelm@5820
   161
fun put_data kind f = map_context o ProofContext.put_data kind f;
wenzelm@5820
   162
val declare_term = map_context o ProofContext.declare_term;
wenzelm@5820
   163
val add_binds = map_context o ProofContext.add_binds_i;
wenzelm@6790
   164
val auto_bind_goal = map_context o ProofContext.auto_bind_goal;
wenzelm@6798
   165
val auto_bind_facts = map_context oo ProofContext.auto_bind_facts;
wenzelm@6091
   166
val put_thms = map_context o ProofContext.put_thms;
wenzelm@6091
   167
val put_thmss = map_context o ProofContext.put_thmss;
wenzelm@5820
   168
wenzelm@5820
   169
wenzelm@5820
   170
(* facts *)
wenzelm@5820
   171
wenzelm@5820
   172
fun the_facts (State ({facts = Some facts, ...}, _)) = facts
wenzelm@5820
   173
  | the_facts state = raise STATE ("No current facts available", state);
wenzelm@5820
   174
wenzelm@6776
   175
fun the_fact state =
wenzelm@6776
   176
  (case the_facts state of
wenzelm@6776
   177
    [fact] => fact
wenzelm@6776
   178
  | _ => raise STATE ("Single fact expected", state));
wenzelm@6776
   179
wenzelm@6848
   180
fun assert_facts state = (the_facts state; state);
wenzelm@6848
   181
wenzelm@5820
   182
fun put_facts facts state =
wenzelm@5820
   183
  state
wenzelm@5820
   184
  |> map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal))
wenzelm@6798
   185
  |> put_thms ("facts", if_none facts []);
wenzelm@5820
   186
wenzelm@5820
   187
val reset_facts = put_facts None;
wenzelm@5820
   188
wenzelm@5820
   189
fun have_facts (name, facts) state =
wenzelm@5820
   190
  state
wenzelm@5820
   191
  |> put_facts (Some facts)
wenzelm@6798
   192
  |> put_thms (name, facts);
wenzelm@5820
   193
wenzelm@5820
   194
fun these_facts (state, ths) = have_facts ths state;
wenzelm@5820
   195
fun fetch_facts (State ({facts, ...}, _)) = put_facts facts;
wenzelm@5820
   196
wenzelm@5820
   197
wenzelm@5820
   198
(* goal *)
wenzelm@5820
   199
wenzelm@5820
   200
fun find_goal i (State ({goal = Some goal, ...}, _)) = (i, goal)
wenzelm@5820
   201
  | find_goal i (State ({goal = None, ...}, node :: nodes)) =
wenzelm@5820
   202
      find_goal (i + 1) (State (node, nodes))
wenzelm@5820
   203
  | find_goal _ (state as State (_, [])) = err_malformed "find_goal" state;
wenzelm@5820
   204
wenzelm@5820
   205
fun put_goal goal = map_current (fn (ctxt, facts, mode, _) => (ctxt, facts, mode, goal));
wenzelm@5820
   206
wenzelm@5820
   207
fun map_goal f (State ({context, facts, mode, goal = Some goal}, nodes)) =
wenzelm@5820
   208
      State (make_node (context, facts, mode, Some (f goal)), nodes)
wenzelm@5820
   209
  | map_goal f (State (nd, node :: nodes)) =
wenzelm@5820
   210
      let val State (node', nodes') = map_goal f (State (node, nodes))
wenzelm@5820
   211
      in State (nd, node' :: nodes') end
wenzelm@5820
   212
  | map_goal _ state = state;
wenzelm@5820
   213
wenzelm@5820
   214
fun goal_facts get state =
wenzelm@5820
   215
  state
wenzelm@5820
   216
  |> map_goal (fn (result, (_, thm)) => (result, (get state, thm)));
wenzelm@5820
   217
wenzelm@5820
   218
fun use_facts state =
wenzelm@5820
   219
  state
wenzelm@5820
   220
  |> goal_facts the_facts
wenzelm@5820
   221
  |> reset_facts;
wenzelm@5820
   222
wenzelm@5820
   223
wenzelm@5820
   224
(* mode *)
wenzelm@5820
   225
wenzelm@5820
   226
fun get_mode (State ({mode, ...}, _)) = mode;
wenzelm@5820
   227
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   228
wenzelm@5820
   229
val enter_forward = put_mode Forward;
wenzelm@5820
   230
val enter_forward_chain = put_mode ForwardChain;
wenzelm@5820
   231
val enter_backward = put_mode Backward;
wenzelm@5820
   232
wenzelm@5820
   233
fun assert_mode pred state =
wenzelm@5820
   234
  let val mode = get_mode state in
wenzelm@5820
   235
    if pred mode then state
wenzelm@6731
   236
    else raise STATE ("Illegal application of proof command in " ^ mode_name mode ^ " mode", state)
wenzelm@5820
   237
  end;
wenzelm@5820
   238
wenzelm@5820
   239
fun is_chain state = get_mode state = ForwardChain;
wenzelm@5820
   240
val assert_forward = assert_mode (equal Forward);
wenzelm@5820
   241
val assert_forward_or_chain = assert_mode (equal Forward orf equal ForwardChain);
wenzelm@5820
   242
val assert_backward = assert_mode (equal Backward);
wenzelm@5820
   243
wenzelm@5820
   244
wenzelm@5820
   245
(* blocks *)
wenzelm@5820
   246
wenzelm@6776
   247
fun level (State (_, nodes)) = length nodes;
wenzelm@6776
   248
wenzelm@5820
   249
fun open_block (State (node, nodes)) = State (node, node :: nodes);
wenzelm@5820
   250
wenzelm@5820
   251
fun new_block state =
wenzelm@5820
   252
  state
wenzelm@5820
   253
  |> open_block
wenzelm@5820
   254
  |> put_goal None;
wenzelm@5820
   255
wenzelm@5820
   256
fun close_block (State (_, node :: nodes)) = State (node, nodes)
wenzelm@5820
   257
  | close_block state = raise STATE ("Unbalanced block parentheses", state);
wenzelm@5820
   258
wenzelm@5820
   259
wenzelm@5820
   260
wenzelm@5820
   261
(** print_state **)
wenzelm@5820
   262
wenzelm@6529
   263
val verbose = ProofContext.verbose;
wenzelm@6529
   264
wenzelm@6756
   265
fun print_facts _ None = ()
wenzelm@6871
   266
  | print_facts s (Some ths) = Pretty.writeln (Pretty.big_list (s ^ " facts:")
wenzelm@6871
   267
      (map (setmp Display.show_hyps false Display.pretty_thm) ths));
wenzelm@6756
   268
wenzelm@5820
   269
fun print_state (state as State ({context, facts, mode, goal = _}, nodes)) =
wenzelm@5820
   270
  let
wenzelm@5945
   271
    val ref (_, _, begin_goal) = Goals.current_goals_markers;
wenzelm@5820
   272
wenzelm@5820
   273
    fun levels_up 0 = ""
wenzelm@5820
   274
      | levels_up i = " (" ^ string_of_int i ^ " levels up)";
wenzelm@5820
   275
wenzelm@6848
   276
    fun print_goal (i, ((kind, name, _, _, _), (goal_facts, thm))) =
wenzelm@6756
   277
      (print_facts "Using" (if null goal_facts then None else Some goal_facts);
wenzelm@6756
   278
        writeln (kind_name kind ^ " " ^ quote name ^ levels_up (i div 2) ^ ":");
wenzelm@5945
   279
        Locale.print_goals_marker begin_goal (! goals_limit) thm);
wenzelm@6848
   280
wenzelm@6848
   281
    val ctxt_strings = ProofContext.strings_of_context context;
wenzelm@5820
   282
  in
wenzelm@6262
   283
    writeln ("Nesting level: " ^ string_of_int (length nodes div 2));
wenzelm@5820
   284
    writeln "";
wenzelm@6798
   285
    writeln (mode_name mode ^ " mode");
wenzelm@5993
   286
    writeln "";
wenzelm@6529
   287
    if ! verbose orelse mode = Forward then
wenzelm@6848
   288
      (if null ctxt_strings then () else (seq writeln ctxt_strings; writeln "");
wenzelm@6756
   289
        print_facts "Current" facts;
wenzelm@6529
   290
        print_goal (find_goal 0 state))
wenzelm@6756
   291
    else if mode = ForwardChain then print_facts "Picking" facts
wenzelm@6529
   292
    else print_goal (find_goal 0 state)
wenzelm@5820
   293
  end;
wenzelm@5820
   294
wenzelm@5820
   295
wenzelm@5820
   296
wenzelm@5820
   297
(** proof steps **)
wenzelm@5820
   298
wenzelm@5820
   299
(* datatype method *)
wenzelm@5820
   300
wenzelm@6848
   301
datatype method = Method of thm list -> tactic;
wenzelm@5820
   302
val method = Method;
wenzelm@5820
   303
wenzelm@5820
   304
wenzelm@5820
   305
(* refine goal *)
wenzelm@5820
   306
wenzelm@5820
   307
fun check_sign sg state =
wenzelm@5820
   308
  if Sign.subsig (sg, sign_of state) then state
wenzelm@5820
   309
  else raise STATE ("Bad signature of result: " ^ Sign.str_of_sg sg, state);
wenzelm@5820
   310
wenzelm@5820
   311
fun refine meth_fun (state as State ({context, ...}, _)) =
wenzelm@6848
   312
  let
wenzelm@6848
   313
    val Method meth = meth_fun context;
wenzelm@6848
   314
    val (_, (result, (facts, thm))) = find_goal 0 state;
wenzelm@5820
   315
wenzelm@6848
   316
    fun refn thm' =
wenzelm@6848
   317
      state
wenzelm@6848
   318
      |> check_sign (Thm.sign_of_thm thm')
wenzelm@6848
   319
      |> map_goal (K (result, (facts, thm')));
wenzelm@6848
   320
  in Seq.map refn (meth facts thm) end;
wenzelm@5820
   321
wenzelm@5820
   322
wenzelm@5820
   323
(* prepare result *)
wenzelm@5820
   324
wenzelm@5820
   325
fun varify_frees names thm =
wenzelm@5820
   326
  let
wenzelm@5820
   327
    fun get_free x (None, t as Free (y, _)) = if x = y then Some t else None
wenzelm@5820
   328
      | get_free _ (opt, _) = opt;
wenzelm@5820
   329
wenzelm@5820
   330
    fun find_free t x = foldl_aterms (get_free x) (None, t);
wenzelm@5820
   331
wenzelm@5820
   332
    val {sign, maxidx, prop, ...} = Thm.rep_thm thm;
wenzelm@5820
   333
    val frees = map (Thm.cterm_of sign) (mapfilter (find_free prop) names);
wenzelm@5820
   334
  in
wenzelm@5820
   335
    thm
wenzelm@5820
   336
    |> Drule.forall_intr_list frees
wenzelm@5820
   337
    |> Drule.forall_elim_vars (maxidx + 1)
wenzelm@5820
   338
  end;
wenzelm@5820
   339
wenzelm@6790
   340
fun varify_tfrees thm =
wenzelm@6790
   341
  let
wenzelm@6790
   342
    val {hyps, prop, ...} = Thm.rep_thm thm;
wenzelm@6790
   343
    val frees = foldr Term.add_term_frees (prop :: hyps, []);
wenzelm@6790
   344
    val leave_tfrees = foldr Term.add_term_tfree_names (frees, []);
wenzelm@6790
   345
  in thm |> Thm.varifyT' leave_tfrees end;
wenzelm@6790
   346
wenzelm@5820
   347
fun implies_elim_hyps thm =
wenzelm@5820
   348
  foldl (uncurry Thm.implies_elim) (thm, map Thm.assume (Drule.cprems_of thm));
wenzelm@5820
   349
wenzelm@6848
   350
wenzelm@5820
   351
fun prep_result state asms t raw_thm =
wenzelm@5820
   352
  let
wenzelm@5820
   353
    val ctxt = context_of state;
wenzelm@5820
   354
    fun err msg = raise STATE (msg, state);
wenzelm@5820
   355
wenzelm@5820
   356
    val ngoals = Thm.nprems_of raw_thm;
wenzelm@5820
   357
    val _ =
wenzelm@5820
   358
      if ngoals = 0 then ()
wenzelm@5820
   359
      else (Locale.print_goals ngoals raw_thm; err (string_of_int ngoals ^ " unsolved goal(s)!"));
wenzelm@5820
   360
wenzelm@5820
   361
    val thm =
wenzelm@5820
   362
      raw_thm RS Drule.rev_triv_goal
wenzelm@5820
   363
      |> implies_elim_hyps
wenzelm@5820
   364
      |> Drule.implies_intr_list asms
wenzelm@6731
   365
      |> varify_frees (ProofContext.fixed_names ctxt)
wenzelm@6790
   366
      |> varify_tfrees;
wenzelm@5820
   367
wenzelm@5820
   368
    val {hyps, prop, sign, ...} = Thm.rep_thm thm;
wenzelm@5820
   369
    val tsig = Sign.tsig_of sign;
wenzelm@5820
   370
  in
wenzelm@5820
   371
(* FIXME
wenzelm@5820
   372
    if not (Pattern.matches tsig (t, Logic.skip_flexpairs prop)) then
wenzelm@5820
   373
      warning ("Proved a different theorem: " ^ Sign.string_of_term sign prop)
wenzelm@5820
   374
    else ();
wenzelm@5820
   375
*)
wenzelm@5820
   376
    if not (null hyps) then
wenzelm@5820
   377
      err ("Additional hypotheses:\n" ^ cat_lines (map (Sign.string_of_term sign) hyps))
wenzelm@5820
   378
(* FIXME    else if not (Pattern.matches tsig (t, Logic.skip_flexpairs prop)) then
wenzelm@5820
   379
      err ("Proved a different theorem: " ^ Sign.string_of_term sign prop) *)
wenzelm@6871
   380
    else thm
wenzelm@5820
   381
  end;
wenzelm@5820
   382
wenzelm@5820
   383
wenzelm@5820
   384
(* prepare final result *)
wenzelm@5820
   385
wenzelm@5820
   386
fun strip_flexflex thm =
wenzelm@5820
   387
  Seq.hd (Thm.flexflex_rule thm) handle THM _ => thm;
wenzelm@5820
   388
wenzelm@5820
   389
fun final_result state pre_thm =
wenzelm@5820
   390
  let
wenzelm@5820
   391
    val thm =
wenzelm@5820
   392
      pre_thm
wenzelm@5820
   393
      |> strip_flexflex
wenzelm@5820
   394
      |> Thm.strip_shyps
wenzelm@5820
   395
      |> Drule.standard;
wenzelm@5820
   396
wenzelm@5820
   397
    val str_of_sort = Sign.str_of_sort (Thm.sign_of_thm thm);
wenzelm@5820
   398
    val xshyps = Thm.extra_shyps thm;
wenzelm@5820
   399
  in
wenzelm@5820
   400
    if not (null xshyps) then
wenzelm@5820
   401
      raise STATE ("Extra sort hypotheses: " ^ commas (map str_of_sort xshyps), state)
wenzelm@5820
   402
    else thm
wenzelm@5820
   403
  end;
wenzelm@5820
   404
wenzelm@5820
   405
wenzelm@5820
   406
(* solve goal *)
wenzelm@5820
   407
wenzelm@6853
   408
fun RANGE [] _ = all_tac
wenzelm@6853
   409
  | RANGE (tac :: tacs) i = RANGE tacs (i + 1) THEN tac i;
wenzelm@6848
   410
wenzelm@6848
   411
fun solve_goal rule tacs state =
wenzelm@5820
   412
  let
wenzelm@5820
   413
    val (_, (result, (facts, thm))) = find_goal 0 state;
wenzelm@6853
   414
    val thms' = FIRSTGOAL (rtac rule THEN' RANGE tacs) thm;
wenzelm@5820
   415
  in Seq.map (fn thm' => map_goal (K (result, (facts, thm'))) state) thms' end;
wenzelm@5820
   416
wenzelm@5820
   417
wenzelm@5820
   418
wenzelm@5820
   419
(*** structured proof commands ***)
wenzelm@5820
   420
wenzelm@5820
   421
(** context **)
wenzelm@5820
   422
wenzelm@5820
   423
(* bind *)
wenzelm@5820
   424
wenzelm@5820
   425
fun gen_bind f x state =
wenzelm@5820
   426
  state
wenzelm@5820
   427
  |> assert_forward
wenzelm@5820
   428
  |> map_context (f x)
wenzelm@5820
   429
  |> reset_facts;
wenzelm@5820
   430
wenzelm@5820
   431
val bind = gen_bind ProofContext.add_binds;
wenzelm@5820
   432
val bind_i = gen_bind ProofContext.add_binds_i;
wenzelm@5820
   433
wenzelm@5820
   434
val match_bind = gen_bind ProofContext.match_binds;
wenzelm@5820
   435
val match_bind_i = gen_bind ProofContext.match_binds_i;
wenzelm@5820
   436
wenzelm@5820
   437
wenzelm@6091
   438
(* have_thmss *)
wenzelm@5820
   439
wenzelm@6876
   440
fun have_thmss ths name atts ths_atts state =
wenzelm@5820
   441
  state
wenzelm@5820
   442
  |> assert_forward
wenzelm@6876
   443
  |> map_context_result (ProofContext.have_thmss ths (PureThy.default_name name) atts ths_atts)
wenzelm@5820
   444
  |> these_facts;
wenzelm@5820
   445
wenzelm@6876
   446
fun simple_have_thms name thms = have_thmss [] name [] [(thms, [])];
wenzelm@6876
   447
wenzelm@5820
   448
wenzelm@5820
   449
(* fix *)
wenzelm@5820
   450
wenzelm@5820
   451
fun gen_fix f xs state =
wenzelm@5820
   452
  state
wenzelm@5820
   453
  |> assert_forward
wenzelm@5820
   454
  |> map_context (f xs)
wenzelm@5820
   455
  |> reset_facts;
wenzelm@5820
   456
wenzelm@5820
   457
val fix = gen_fix ProofContext.fix;
wenzelm@5820
   458
val fix_i = gen_fix ProofContext.fix_i;
wenzelm@5820
   459
wenzelm@5820
   460
wenzelm@5820
   461
(* assume *)
wenzelm@5820
   462
wenzelm@6848
   463
fun gen_assume f tac name atts props state =
wenzelm@5820
   464
  state
wenzelm@5820
   465
  |> assert_forward
wenzelm@6848
   466
  |> map_context_result (f tac (PureThy.default_name name) atts props)
wenzelm@6798
   467
  |> (fn (st, (facts, prems)) =>
wenzelm@6798
   468
    (st, facts)
wenzelm@6798
   469
    |> these_facts
wenzelm@6798
   470
    |> put_thms ("prems", prems));
wenzelm@5820
   471
wenzelm@5820
   472
val assume = gen_assume ProofContext.assume;
wenzelm@5820
   473
val assume_i = gen_assume ProofContext.assume_i;
wenzelm@5820
   474
wenzelm@5820
   475
wenzelm@5820
   476
wenzelm@5820
   477
(** goals **)
wenzelm@5820
   478
wenzelm@5820
   479
(* forward chaining *)
wenzelm@5820
   480
wenzelm@5820
   481
fun chain state =
wenzelm@5820
   482
  state
wenzelm@5820
   483
  |> assert_forward
wenzelm@6848
   484
  |> assert_facts
wenzelm@5820
   485
  |> enter_forward_chain;
wenzelm@5820
   486
wenzelm@5820
   487
fun from_facts facts state =
wenzelm@5820
   488
  state
wenzelm@5820
   489
  |> put_facts (Some facts)
wenzelm@5820
   490
  |> chain;
wenzelm@5820
   491
wenzelm@5820
   492
wenzelm@5820
   493
(* setup goals *)
wenzelm@5820
   494
wenzelm@5936
   495
fun setup_goal opt_block prepp kind name atts raw_propp state =
wenzelm@5820
   496
  let
wenzelm@5936
   497
    val (state', concl) =
wenzelm@5936
   498
      state
wenzelm@5936
   499
      |> assert_forward_or_chain
wenzelm@5936
   500
      |> enter_forward
wenzelm@5936
   501
      |> opt_block
wenzelm@5936
   502
      |> map_context_result (fn c => prepp (c, raw_propp));
wenzelm@6752
   503
    val cterm_of = Thm.cterm_of (sign_of state);
wenzelm@5820
   504
wenzelm@6848
   505
    val (casms, asm_tacs) = Library.split_list (ProofContext.assumptions (context_of state'));
wenzelm@6752
   506
    val cprems = map cterm_of (Logic.strip_imp_prems concl);
wenzelm@6848
   507
    val prem_tacs = replicate (length cprems) (K all_tac);
wenzelm@6848
   508
wenzelm@6752
   509
    val prop = Logic.list_implies (map Thm.term_of casms, concl);
wenzelm@6752
   510
    val cprop = cterm_of prop;
wenzelm@5820
   511
    val thm = Drule.mk_triv_goal cprop;
wenzelm@5820
   512
  in
wenzelm@5936
   513
    state'
wenzelm@6848
   514
    |> put_goal (Some ((kind atts, (PureThy.default_name name), casms @ cprems,
wenzelm@6848
   515
        asm_tacs @ prem_tacs, prop), ([], thm)))
wenzelm@6790
   516
    |> auto_bind_goal prop
wenzelm@5820
   517
    |> (if is_chain state then use_facts else reset_facts)
wenzelm@5820
   518
    |> new_block
wenzelm@5820
   519
    |> enter_backward
wenzelm@5820
   520
  end;
wenzelm@5820
   521
wenzelm@5820
   522
wenzelm@5820
   523
(*global goals*)
wenzelm@5820
   524
fun global_goal prep kind name atts x thy =
wenzelm@5820
   525
  setup_goal I prep kind name atts x (init_state thy);
wenzelm@5820
   526
wenzelm@5936
   527
val theorem = global_goal ProofContext.bind_propp Theorem;
wenzelm@5936
   528
val theorem_i = global_goal ProofContext.bind_propp_i Theorem;
wenzelm@5936
   529
val lemma = global_goal ProofContext.bind_propp Lemma;
wenzelm@5936
   530
val lemma_i = global_goal ProofContext.bind_propp_i Lemma;
wenzelm@5820
   531
wenzelm@5820
   532
wenzelm@5820
   533
(*local goals*)
wenzelm@5820
   534
fun local_goal prep kind name atts x =
wenzelm@5820
   535
  setup_goal open_block prep kind name atts x;
wenzelm@5820
   536
wenzelm@5936
   537
val show   = local_goal ProofContext.bind_propp Goal;
wenzelm@5936
   538
val show_i = local_goal ProofContext.bind_propp_i Goal;
wenzelm@5936
   539
val have   = local_goal ProofContext.bind_propp Aux;
wenzelm@5936
   540
val have_i = local_goal ProofContext.bind_propp_i Aux;
wenzelm@5820
   541
wenzelm@5820
   542
wenzelm@5820
   543
wenzelm@5820
   544
(** blocks **)
wenzelm@5820
   545
wenzelm@5820
   546
(* begin_block *)
wenzelm@5820
   547
wenzelm@5820
   548
fun begin_block state =
wenzelm@5820
   549
  state
wenzelm@5820
   550
  |> assert_forward
wenzelm@5820
   551
  |> new_block
wenzelm@5820
   552
  |> reset_facts
wenzelm@5820
   553
  |> open_block;
wenzelm@5820
   554
wenzelm@5820
   555
wenzelm@5820
   556
(* next_block *)
wenzelm@5820
   557
wenzelm@5820
   558
fun next_block state =
wenzelm@5820
   559
  state
wenzelm@5820
   560
  |> assert_forward
wenzelm@5820
   561
  |> close_block
wenzelm@5820
   562
  |> new_block;
wenzelm@5820
   563
wenzelm@5820
   564
wenzelm@5820
   565
wenzelm@5820
   566
(** conclusions **)
wenzelm@5820
   567
wenzelm@5820
   568
(* current goal *)
wenzelm@5820
   569
wenzelm@5820
   570
fun current_goal (State ({goal = Some goal, ...}, _)) = goal
wenzelm@5820
   571
  | current_goal state = raise STATE ("No current goal!", state);
wenzelm@5820
   572
wenzelm@6404
   573
fun assert_current_goal true (state as State ({goal = None, ...}, _)) =
wenzelm@6404
   574
      raise STATE ("No goal in this block!", state)
wenzelm@6404
   575
  | assert_current_goal false (state as State ({goal = Some _, ...}, _)) =
wenzelm@6404
   576
      raise STATE ("Goal present in this block!", state)
wenzelm@6404
   577
  | assert_current_goal _ state = state;
wenzelm@5820
   578
wenzelm@5820
   579
fun assert_bottom true (state as State (_, _ :: _)) =
wenzelm@5820
   580
      raise STATE ("Not at bottom of proof!", state)
wenzelm@5820
   581
  | assert_bottom false (state as State (_, [])) =
wenzelm@5820
   582
      raise STATE ("Already at bottom of proof!", state)
wenzelm@5820
   583
  | assert_bottom _ state = state;
wenzelm@5820
   584
wenzelm@6404
   585
val at_bottom = can (assert_bottom true o close_block);
wenzelm@6404
   586
wenzelm@5820
   587
wenzelm@5820
   588
(* finish proof *)
wenzelm@5820
   589
wenzelm@6871
   590
fun finish_proof bot state =
wenzelm@5820
   591
  state
wenzelm@5820
   592
  |> assert_forward
wenzelm@5820
   593
  |> close_block
wenzelm@5820
   594
  |> assert_bottom bot
wenzelm@6871
   595
  |> assert_current_goal true;
wenzelm@5820
   596
wenzelm@5820
   597
wenzelm@6404
   598
(* end_block *)
wenzelm@6404
   599
wenzelm@6404
   600
fun end_block state =
wenzelm@6404
   601
  state
wenzelm@6404
   602
  |> assert_forward
wenzelm@6404
   603
  |> close_block
wenzelm@6404
   604
  |> assert_current_goal false
wenzelm@6404
   605
  |> close_block
wenzelm@6404
   606
  |> fetch_facts state;
wenzelm@6404
   607
wenzelm@6404
   608
wenzelm@6404
   609
(* local_qed *)
wenzelm@5820
   610
wenzelm@6731
   611
fun finish_local print_result state =
wenzelm@5820
   612
  let
wenzelm@6848
   613
    val ((kind, name, asms, tacs, t), (_, raw_thm)) = current_goal state;
wenzelm@6871
   614
    val result = prep_result state asms t raw_thm;
wenzelm@5820
   615
    val (atts, opt_solve) =
wenzelm@5820
   616
      (case kind of
wenzelm@6848
   617
        Goal atts => (atts, solve_goal result tacs)
wenzelm@5820
   618
      | Aux atts => (atts, Seq.single)
wenzelm@5820
   619
      | _ => raise STATE ("No local goal!", state));
wenzelm@5820
   620
  in
wenzelm@6731
   621
    print_result {kind = kind_name kind, name = name, thm = result};
wenzelm@5820
   622
    state
wenzelm@5820
   623
    |> close_block
wenzelm@6871
   624
    |> auto_bind_facts name [t]
wenzelm@6876
   625
    |> have_thmss [] name atts [Thm.no_attributes [result]]
wenzelm@5820
   626
    |> opt_solve
wenzelm@5820
   627
  end;
wenzelm@5820
   628
wenzelm@6731
   629
fun local_qed finalize print_result state =
wenzelm@6404
   630
  state
wenzelm@6871
   631
  |> finish_proof false
wenzelm@6871
   632
  |> finalize
wenzelm@6731
   633
  |> (Seq.flat o Seq.map (finish_local print_result));
wenzelm@5820
   634
wenzelm@5820
   635
wenzelm@6404
   636
(* global_qed *)
wenzelm@5820
   637
wenzelm@5820
   638
fun finish_global alt_name alt_atts state =
wenzelm@5820
   639
  let
wenzelm@6848
   640
    val ((kind, def_name, asms, _, t), (_, raw_thm)) = current_goal state;
wenzelm@6871
   641
    val result = final_result state (prep_result state asms t raw_thm);
wenzelm@5820
   642
wenzelm@5820
   643
    val name = if_none alt_name def_name;
wenzelm@5820
   644
    val atts =
wenzelm@5820
   645
      (case kind of
wenzelm@5820
   646
        Theorem atts => if_none alt_atts atts
wenzelm@6091
   647
      | Lemma atts => (if_none alt_atts atts) @ [Drule.tag_lemma]
wenzelm@5820
   648
      | _ => raise STATE ("No global goal!", state));
wenzelm@5820
   649
wenzelm@6091
   650
    val (thy', result') = PureThy.store_thm ((name, result), atts) (theory_of state);
wenzelm@6529
   651
  in (thy', {kind = kind_name kind, name = name, thm = result'}) end;
wenzelm@5820
   652
wenzelm@6871
   653
(*Note: should inspect first result only, backtracking may destroy theory*)
wenzelm@6404
   654
fun global_qed finalize alt_name alt_atts state =
wenzelm@5820
   655
  state
wenzelm@6871
   656
  |> finish_proof true
wenzelm@6871
   657
  |> finalize
wenzelm@6871
   658
  |> Seq.map (finish_global alt_name alt_atts);
wenzelm@5820
   659
wenzelm@5820
   660
wenzelm@5820
   661
end;