src/Pure/Isar/proof.ML
author wenzelm
Tue Nov 21 19:04:59 2000 +0100 (2000-11-21)
changeset 10508 6306977d867b
parent 10464 b7b916a82dca
child 10553 7f239ef89c50
permissions -rw-r--r--
tag result with name reference to final binding (basically just a comment);
wenzelm@5820
     1
(*  Title:      Pure/Isar/proof.ML
wenzelm@5820
     2
    ID:         $Id$
wenzelm@5820
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8807
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@5820
     5
wenzelm@5820
     6
Proof states and methods.
wenzelm@5820
     7
*)
wenzelm@5820
     8
wenzelm@8152
     9
signature BASIC_PROOF =
wenzelm@8152
    10
sig
wenzelm@9469
    11
  val RANGE: (int -> tactic) list -> int -> tactic
wenzelm@8374
    12
  val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@8374
    13
  val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@8152
    14
end;
wenzelm@8152
    15
wenzelm@5820
    16
signature PROOF =
wenzelm@5820
    17
sig
wenzelm@8152
    18
  include BASIC_PROOF
wenzelm@5820
    19
  type context
wenzelm@5820
    20
  type state
wenzelm@5820
    21
  exception STATE of string * state
wenzelm@6871
    22
  val check_result: string -> state -> 'a Seq.seq -> 'a Seq.seq
wenzelm@7011
    23
  val init_state: theory -> state
wenzelm@5820
    24
  val context_of: state -> context
wenzelm@5820
    25
  val theory_of: state -> theory
wenzelm@5820
    26
  val sign_of: state -> Sign.sg
wenzelm@7924
    27
  val warn_extra_tfrees: state -> state -> state
wenzelm@7605
    28
  val reset_thms: string -> state -> state
wenzelm@6091
    29
  val the_facts: state -> thm list
wenzelm@9469
    30
  val the_fact: state -> thm
wenzelm@7665
    31
  val get_goal: state -> term * (thm list * thm)
wenzelm@6091
    32
  val goal_facts: (state -> thm list) -> state -> state
wenzelm@5820
    33
  val use_facts: state -> state
wenzelm@5820
    34
  val reset_facts: state -> state
wenzelm@9469
    35
  val is_chain: state -> bool
wenzelm@6891
    36
  val assert_forward: state -> state
wenzelm@9469
    37
  val assert_forward_or_chain: state -> state
wenzelm@5820
    38
  val assert_backward: state -> state
wenzelm@8206
    39
  val assert_no_chain: state -> state
wenzelm@5820
    40
  val enter_forward: state -> state
wenzelm@6982
    41
  val show_hyps: bool ref
wenzelm@6982
    42
  val pretty_thm: thm -> Pretty.T
wenzelm@7412
    43
  val pretty_thms: thm list -> Pretty.T
wenzelm@6529
    44
  val verbose: bool ref
wenzelm@7201
    45
  val print_state: int -> state -> unit
wenzelm@10360
    46
  val pretty_goals: bool -> state -> Pretty.T list
wenzelm@6776
    47
  val level: state -> int
wenzelm@5820
    48
  type method
wenzelm@6848
    49
  val method: (thm list -> tactic) -> method
wenzelm@8374
    50
  val method_cases: (thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq) -> method
wenzelm@5820
    51
  val refine: (context -> method) -> state -> state Seq.seq
wenzelm@8234
    52
  val refine_end: (context -> method) -> state -> state Seq.seq
wenzelm@6932
    53
  val export_thm: context -> thm -> thm
wenzelm@5936
    54
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    55
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@8617
    56
  val let_bind: (string list * string) list -> state -> state
wenzelm@8617
    57
  val let_bind_i: (term list * term) list -> state -> state
wenzelm@6876
    58
  val simple_have_thms: string -> thm list -> state -> state
wenzelm@9196
    59
  val have_thmss: ((string * context attribute list) *
wenzelm@9196
    60
    (thm list * context attribute list) list) list -> state -> state
wenzelm@9196
    61
  val with_thmss: ((string * context attribute list) *
wenzelm@9196
    62
    (thm list * context attribute list) list) list -> state -> state
wenzelm@7412
    63
  val fix: (string list * string option) list -> state -> state
wenzelm@7665
    64
  val fix_i: (string list * typ option) list -> state -> state
wenzelm@10446
    65
  val norm_hhf_tac: int -> tactic
wenzelm@9469
    66
  val hard_asm_tac: int -> tactic
wenzelm@9469
    67
  val soft_asm_tac: int -> tactic
wenzelm@9469
    68
  val assm: ProofContext.exporter
wenzelm@10464
    69
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7271
    70
    -> state -> state
wenzelm@9469
    71
  val assm_i: ProofContext.exporter
wenzelm@10464
    72
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    73
    -> state -> state
wenzelm@10464
    74
  val assume:
wenzelm@10464
    75
    ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7271
    76
    -> state -> state
wenzelm@10464
    77
  val assume_i: ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    78
    -> state -> state
wenzelm@10464
    79
  val presume:
wenzelm@10464
    80
    ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@6932
    81
    -> state -> state
wenzelm@10464
    82
  val presume_i: ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    83
    -> state -> state
wenzelm@8450
    84
  val invoke_case: string * context attribute list -> state -> state
wenzelm@6932
    85
  val theorem: bstring -> theory attribute list -> string * (string list * string list)
wenzelm@6932
    86
    -> theory -> state
wenzelm@6932
    87
  val theorem_i: bstring -> theory attribute list -> term * (term list * term list)
wenzelm@6932
    88
    -> theory -> state
wenzelm@6932
    89
  val lemma: bstring -> theory attribute list -> string * (string list * string list)
wenzelm@6932
    90
    -> theory -> state
wenzelm@6932
    91
  val lemma_i: bstring -> theory attribute list -> term * (term list * term list)
wenzelm@6932
    92
    -> theory -> state
wenzelm@5820
    93
  val chain: state -> state
wenzelm@6091
    94
  val from_facts: thm list -> state -> state
wenzelm@7176
    95
  val show: (state -> state Seq.seq) -> string -> context attribute list
wenzelm@7176
    96
    -> string * (string list * string list) -> state -> state
wenzelm@7176
    97
  val show_i: (state -> state Seq.seq) -> string -> context attribute list
wenzelm@7176
    98
    -> term * (term list * term list) -> state -> state
wenzelm@7176
    99
  val have: (state -> state Seq.seq) -> string -> context attribute list
wenzelm@7176
   100
    -> string * (string list * string list) -> state -> state
wenzelm@7176
   101
  val have_i: (state -> state Seq.seq) -> string -> context attribute list
wenzelm@7176
   102
    -> term * (term list * term list) -> state -> state
wenzelm@6404
   103
  val at_bottom: state -> bool
wenzelm@6982
   104
  val local_qed: (state -> state Seq.seq)
wenzelm@6982
   105
    -> ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit) -> state -> state Seq.seq
wenzelm@10508
   106
  val name_refN: string
wenzelm@6950
   107
  val global_qed: (state -> state Seq.seq) -> state
wenzelm@6950
   108
    -> (theory * {kind: string, name: string, thm: thm}) Seq.seq
wenzelm@6896
   109
  val begin_block: state -> state
wenzelm@6932
   110
  val end_block: state -> state Seq.seq
wenzelm@6896
   111
  val next_block: state -> state
wenzelm@5820
   112
end;
wenzelm@5820
   113
wenzelm@8152
   114
signature PRIVATE_PROOF =
wenzelm@5820
   115
sig
wenzelm@5820
   116
  include PROOF
wenzelm@5820
   117
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> state -> state
wenzelm@5820
   118
end;
wenzelm@5820
   119
wenzelm@8152
   120
structure Proof: PRIVATE_PROOF =
wenzelm@5820
   121
struct
wenzelm@5820
   122
wenzelm@5820
   123
wenzelm@5820
   124
(** proof state **)
wenzelm@5820
   125
wenzelm@5820
   126
type context = ProofContext.context;
wenzelm@5820
   127
wenzelm@5820
   128
wenzelm@5820
   129
(* type goal *)
wenzelm@5820
   130
wenzelm@5820
   131
datatype kind =
wenzelm@5820
   132
  Theorem of theory attribute list |    (*top-level theorem*)
wenzelm@5820
   133
  Lemma of theory attribute list |      (*top-level lemma*)
wenzelm@10380
   134
  Show of context attribute list |      (*intermediate result, solving subgoal*)
wenzelm@10380
   135
  Have of context attribute list ;       (*intermediate result*)
wenzelm@5820
   136
wenzelm@5820
   137
val kind_name =
wenzelm@10380
   138
  fn Theorem _ => "theorem" | Lemma _ => "lemma" | Show _ => "show" | Have _ => "have";
wenzelm@5820
   139
wenzelm@5820
   140
type goal =
wenzelm@6932
   141
 (kind *        (*result kind*)
wenzelm@6932
   142
  string *      (*result name*)
wenzelm@6932
   143
  term) *       (*result statement*)
wenzelm@6932
   144
 (thm list *    (*use facts*)
wenzelm@6932
   145
  thm);         (*goal: subgoals ==> statement*)
wenzelm@5820
   146
wenzelm@5820
   147
wenzelm@5820
   148
(* type mode *)
wenzelm@5820
   149
wenzelm@5820
   150
datatype mode = Forward | ForwardChain | Backward;
wenzelm@7201
   151
val mode_name = (fn Forward => "state" | ForwardChain => "chain" | Backward => "prove");
wenzelm@5820
   152
wenzelm@5820
   153
wenzelm@5820
   154
(* datatype state *)
wenzelm@5820
   155
wenzelm@7176
   156
datatype node =
wenzelm@7176
   157
  Node of
wenzelm@7176
   158
   {context: context,
wenzelm@7176
   159
    facts: thm list option,
wenzelm@7176
   160
    mode: mode,
wenzelm@7176
   161
    goal: (goal * (state -> state Seq.seq)) option}
wenzelm@7176
   162
and state =
wenzelm@5820
   163
  State of
wenzelm@5820
   164
    node *              (*current*)
wenzelm@5820
   165
    node list;          (*parents wrt. block structure*)
wenzelm@5820
   166
wenzelm@7176
   167
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   168
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   169
wenzelm@7176
   170
wenzelm@5820
   171
exception STATE of string * state;
wenzelm@5820
   172
wenzelm@5820
   173
fun err_malformed name state =
wenzelm@5820
   174
  raise STATE (name ^ ": internal error -- malformed proof state", state);
wenzelm@5820
   175
wenzelm@6871
   176
fun check_result msg state sq =
wenzelm@6871
   177
  (case Seq.pull sq of
wenzelm@6871
   178
    None => raise STATE (msg, state)
wenzelm@6871
   179
  | Some s_sq => Seq.cons s_sq);
wenzelm@6871
   180
wenzelm@5820
   181
wenzelm@7176
   182
fun map_current f (State (Node {context, facts, mode, goal}, nodes)) =
wenzelm@5820
   183
  State (make_node (f (context, facts, mode, goal)), nodes);
wenzelm@5820
   184
wenzelm@5820
   185
fun init_state thy =
wenzelm@5875
   186
  State (make_node (ProofContext.init thy, None, Forward, None), []);
wenzelm@5820
   187
wenzelm@5820
   188
wenzelm@5820
   189
wenzelm@5820
   190
(** basic proof state operations **)
wenzelm@5820
   191
wenzelm@5820
   192
(* context *)
wenzelm@5820
   193
wenzelm@7176
   194
fun context_of (State (Node {context, ...}, _)) = context;
wenzelm@5820
   195
val theory_of = ProofContext.theory_of o context_of;
wenzelm@5820
   196
val sign_of = ProofContext.sign_of o context_of;
wenzelm@5820
   197
wenzelm@5820
   198
fun map_context f = map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   199
wenzelm@7176
   200
fun map_context_result f (state as State (Node {context, facts, mode, goal}, nodes)) =
wenzelm@5820
   201
  let val (context', result) = f context
wenzelm@5820
   202
  in (State (make_node (context', facts, mode, goal), nodes), result) end;
wenzelm@5820
   203
wenzelm@5820
   204
wenzelm@5820
   205
fun put_data kind f = map_context o ProofContext.put_data kind f;
wenzelm@7924
   206
val warn_extra_tfrees = map_context o ProofContext.warn_extra_tfrees o context_of;
wenzelm@6790
   207
val auto_bind_goal = map_context o ProofContext.auto_bind_goal;
wenzelm@6798
   208
val auto_bind_facts = map_context oo ProofContext.auto_bind_facts;
wenzelm@6091
   209
val put_thms = map_context o ProofContext.put_thms;
wenzelm@6091
   210
val put_thmss = map_context o ProofContext.put_thmss;
wenzelm@7605
   211
val reset_thms = map_context o ProofContext.reset_thms;
wenzelm@6932
   212
val assumptions = ProofContext.assumptions o context_of;
wenzelm@8374
   213
val get_case = ProofContext.get_case o context_of;
wenzelm@5820
   214
wenzelm@5820
   215
wenzelm@5820
   216
(* facts *)
wenzelm@5820
   217
wenzelm@7176
   218
fun the_facts (State (Node {facts = Some facts, ...}, _)) = facts
wenzelm@5820
   219
  | the_facts state = raise STATE ("No current facts available", state);
wenzelm@5820
   220
wenzelm@9469
   221
fun the_fact state =
wenzelm@9469
   222
  (case the_facts state of
wenzelm@9469
   223
    [thm] => thm
wenzelm@9469
   224
  | _ => raise STATE ("Single fact expected", state));
wenzelm@9469
   225
wenzelm@6848
   226
fun assert_facts state = (the_facts state; state);
wenzelm@7176
   227
fun get_facts (State (Node {facts, ...}, _)) = facts;
wenzelm@6848
   228
wenzelm@7605
   229
wenzelm@7605
   230
val thisN = "this";
wenzelm@7605
   231
wenzelm@5820
   232
fun put_facts facts state =
wenzelm@5820
   233
  state
wenzelm@5820
   234
  |> map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal))
wenzelm@7605
   235
  |> (case facts of None => reset_thms thisN | Some ths => put_thms (thisN, ths));
wenzelm@5820
   236
wenzelm@5820
   237
val reset_facts = put_facts None;
wenzelm@5820
   238
wenzelm@9196
   239
fun these_factss (state, named_factss) =
wenzelm@5820
   240
  state
wenzelm@9196
   241
  |> put_thmss named_factss
wenzelm@9196
   242
  |> put_facts (Some (flat (map #2 named_factss)));
wenzelm@5820
   243
wenzelm@5820
   244
wenzelm@5820
   245
(* goal *)
wenzelm@5820
   246
wenzelm@7176
   247
fun find_goal i (state as State (Node {goal = Some goal, ...}, _)) = (context_of state, (i, goal))
wenzelm@7176
   248
  | find_goal i (State (Node {goal = None, ...}, node :: nodes)) =
wenzelm@5820
   249
      find_goal (i + 1) (State (node, nodes))
wenzelm@5820
   250
  | find_goal _ (state as State (_, [])) = err_malformed "find_goal" state;
wenzelm@5820
   251
wenzelm@7176
   252
fun get_goal state =
wenzelm@7665
   253
  let val (_, (_, (((_, _, t), goal), _))) = find_goal 0 state
wenzelm@7665
   254
  in (t, goal) end;
wenzelm@7176
   255
wenzelm@5820
   256
fun put_goal goal = map_current (fn (ctxt, facts, mode, _) => (ctxt, facts, mode, goal));
wenzelm@5820
   257
wenzelm@8374
   258
fun map_goal f g (State (Node {context, facts, mode, goal = Some goal}, nodes)) =
wenzelm@8374
   259
      State (make_node (f context, facts, mode, Some (g goal)), nodes)
wenzelm@8374
   260
  | map_goal f g (State (nd, node :: nodes)) =
wenzelm@8374
   261
      let val State (node', nodes') = map_goal f g (State (node, nodes))
wenzelm@8374
   262
      in map_context f (State (nd, node' :: nodes')) end
wenzelm@8374
   263
  | map_goal _ _ state = state;
wenzelm@5820
   264
wenzelm@5820
   265
fun goal_facts get state =
wenzelm@5820
   266
  state
wenzelm@8374
   267
  |> map_goal I (fn ((result, (_, thm)), f) => ((result, (get state, thm)), f));
wenzelm@5820
   268
wenzelm@5820
   269
fun use_facts state =
wenzelm@5820
   270
  state
wenzelm@5820
   271
  |> goal_facts the_facts
wenzelm@5820
   272
  |> reset_facts;
wenzelm@5820
   273
wenzelm@5820
   274
wenzelm@5820
   275
(* mode *)
wenzelm@5820
   276
wenzelm@7176
   277
fun get_mode (State (Node {mode, ...}, _)) = mode;
wenzelm@5820
   278
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   279
wenzelm@5820
   280
val enter_forward = put_mode Forward;
wenzelm@5820
   281
val enter_forward_chain = put_mode ForwardChain;
wenzelm@5820
   282
val enter_backward = put_mode Backward;
wenzelm@5820
   283
wenzelm@5820
   284
fun assert_mode pred state =
wenzelm@5820
   285
  let val mode = get_mode state in
wenzelm@5820
   286
    if pred mode then state
wenzelm@9196
   287
    else raise STATE ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode", state)
wenzelm@5820
   288
  end;
wenzelm@5820
   289
wenzelm@5820
   290
fun is_chain state = get_mode state = ForwardChain;
wenzelm@5820
   291
val assert_forward = assert_mode (equal Forward);
wenzelm@5820
   292
val assert_forward_or_chain = assert_mode (equal Forward orf equal ForwardChain);
wenzelm@5820
   293
val assert_backward = assert_mode (equal Backward);
wenzelm@8206
   294
val assert_no_chain = assert_mode (not_equal ForwardChain);
wenzelm@5820
   295
wenzelm@5820
   296
wenzelm@5820
   297
(* blocks *)
wenzelm@5820
   298
wenzelm@6776
   299
fun level (State (_, nodes)) = length nodes;
wenzelm@6776
   300
wenzelm@5820
   301
fun open_block (State (node, nodes)) = State (node, node :: nodes);
wenzelm@5820
   302
wenzelm@5820
   303
fun new_block state =
wenzelm@5820
   304
  state
wenzelm@5820
   305
  |> open_block
wenzelm@5820
   306
  |> put_goal None;
wenzelm@5820
   307
wenzelm@7487
   308
fun close_block (state as State (_, node :: nodes)) = State (node, nodes)
wenzelm@5820
   309
  | close_block state = raise STATE ("Unbalanced block parentheses", state);
wenzelm@5820
   310
wenzelm@5820
   311
wenzelm@5820
   312
wenzelm@5820
   313
(** print_state **)
wenzelm@5820
   314
wenzelm@6982
   315
val show_hyps = ProofContext.show_hyps;
wenzelm@6982
   316
val pretty_thm = ProofContext.pretty_thm;
wenzelm@6982
   317
wenzelm@7412
   318
fun pretty_thms [th] = pretty_thm th
wenzelm@7580
   319
  | pretty_thms ths = Pretty.blk (0, Pretty.fbreaks (map pretty_thm ths));
wenzelm@7412
   320
wenzelm@7412
   321
wenzelm@6529
   322
val verbose = ProofContext.verbose;
wenzelm@6529
   323
wenzelm@8462
   324
fun pretty_facts _ None = []
wenzelm@8462
   325
  | pretty_facts s (Some ths) =
wenzelm@8462
   326
      [Pretty.big_list (s ^ "this:") (map pretty_thm ths), Pretty.str ""];
wenzelm@6756
   327
wenzelm@7201
   328
fun print_state nr (state as State (Node {context, facts, mode, goal = _}, nodes)) =
wenzelm@5820
   329
  let
wenzelm@5945
   330
    val ref (_, _, begin_goal) = Goals.current_goals_markers;
wenzelm@5820
   331
wenzelm@5820
   332
    fun levels_up 0 = ""
wenzelm@7575
   333
      | levels_up 1 = ", 1 level up"
wenzelm@7575
   334
      | levels_up i = ", " ^ string_of_int i ^ " levels up";
wenzelm@5820
   335
wenzelm@8462
   336
    fun pretty_goal (_, (i, (((kind, name, _), (goal_facts, thm)), _))) =
wenzelm@8462
   337
      pretty_facts "using "
wenzelm@8462
   338
        (if mode <> Backward orelse null goal_facts then None else Some goal_facts) @
wenzelm@8462
   339
      [Pretty.str ("goal (" ^ kind_name kind ^ (if name = "" then "" else " " ^ name) ^
wenzelm@8462
   340
        levels_up (i div 2) ^ "):")] @
wenzelm@8462
   341
      Locale.pretty_goals_marker begin_goal (! goals_limit) thm;
wenzelm@6848
   342
wenzelm@8462
   343
    val ctxt_prts =
wenzelm@8462
   344
      if ! verbose orelse mode = Forward then ProofContext.pretty_context context
wenzelm@8462
   345
      else if mode = Backward then ProofContext.pretty_prems context
wenzelm@7575
   346
      else [];
wenzelm@8462
   347
wenzelm@8462
   348
    val prts =
wenzelm@8582
   349
     [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
wenzelm@8561
   350
        (if ! verbose then ", depth " ^ string_of_int (length nodes div 2)
wenzelm@8561
   351
        else "")), Pretty.str ""] @
wenzelm@8462
   352
     (if null ctxt_prts then [] else ctxt_prts @ [Pretty.str ""]) @
wenzelm@8462
   353
     (if ! verbose orelse mode = Forward then
wenzelm@8462
   354
       (pretty_facts "" facts @ pretty_goal (find_goal 0 state))
wenzelm@8462
   355
      else if mode = ForwardChain then pretty_facts "picking " facts
wenzelm@8462
   356
      else pretty_goal (find_goal 0 state))
wenzelm@8462
   357
  in Pretty.writeln (Pretty.chunks prts) end;
wenzelm@5820
   358
wenzelm@10360
   359
fun pretty_goals main_goal state =
wenzelm@10320
   360
  let val (_, (_, ((_, (_, thm)), _))) = find_goal 0 state
wenzelm@10360
   361
  in Locale.pretty_sub_goals main_goal (!goals_limit) thm end;
wenzelm@10320
   362
wenzelm@5820
   363
wenzelm@5820
   364
wenzelm@5820
   365
(** proof steps **)
wenzelm@5820
   366
wenzelm@5820
   367
(* datatype method *)
wenzelm@5820
   368
wenzelm@8374
   369
datatype method =
wenzelm@8374
   370
  Method of thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq;
wenzelm@8374
   371
wenzelm@8374
   372
fun method tac = Method (fn facts => fn st => Seq.map (rpair []) (tac facts st));
wenzelm@8374
   373
val method_cases = Method;
wenzelm@5820
   374
wenzelm@5820
   375
wenzelm@5820
   376
(* refine goal *)
wenzelm@5820
   377
wenzelm@8234
   378
local
wenzelm@8234
   379
wenzelm@5820
   380
fun check_sign sg state =
wenzelm@5820
   381
  if Sign.subsig (sg, sign_of state) then state
wenzelm@5820
   382
  else raise STATE ("Bad signature of result: " ^ Sign.str_of_sg sg, state);
wenzelm@5820
   383
wenzelm@8234
   384
fun gen_refine current_context meth_fun state =
wenzelm@6848
   385
  let
wenzelm@8234
   386
    val (goal_ctxt, (_, ((result, (facts, thm)), f))) = find_goal 0 state;
wenzelm@8234
   387
    val Method meth = meth_fun (if current_context then context_of state else goal_ctxt);
wenzelm@5820
   388
wenzelm@8374
   389
    fun refn (thm', cases) =
wenzelm@6848
   390
      state
wenzelm@6848
   391
      |> check_sign (Thm.sign_of_thm thm')
wenzelm@8374
   392
      |> map_goal (ProofContext.add_cases cases) (K ((result, (facts, thm')), f));
wenzelm@6848
   393
  in Seq.map refn (meth facts thm) end;
wenzelm@5820
   394
wenzelm@8234
   395
in
wenzelm@8234
   396
wenzelm@8234
   397
val refine = gen_refine true;
wenzelm@8234
   398
val refine_end = gen_refine false;
wenzelm@8234
   399
wenzelm@8234
   400
end;
wenzelm@8234
   401
wenzelm@5820
   402
wenzelm@9469
   403
(* tacticals *)
wenzelm@6932
   404
wenzelm@6932
   405
fun RANGE [] _ = all_tac
wenzelm@6932
   406
  | RANGE (tac :: tacs) i = RANGE tacs (i + 1) THEN tac i;
wenzelm@6932
   407
wenzelm@8152
   408
fun FINDGOAL tac st =
wenzelm@8374
   409
  let fun find (i, n) = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1, n))
wenzelm@8374
   410
  in find (1, Thm.nprems_of st) st end;
wenzelm@8152
   411
wenzelm@8166
   412
fun HEADGOAL tac = tac 1;
wenzelm@8166
   413
wenzelm@9469
   414
wenzelm@9469
   415
(* export results *)
wenzelm@9469
   416
wenzelm@6982
   417
fun export_goal print_rule raw_rule inner state =
wenzelm@6932
   418
  let
wenzelm@7176
   419
    val (outer, (_, ((result, (facts, thm)), f))) = find_goal 0 state;
wenzelm@9469
   420
    val (exp_tac, tacs) = ProofContext.export_wrt true inner (Some outer);
wenzelm@9469
   421
    fun exp_rule rule =
wenzelm@9469
   422
      let
wenzelm@9469
   423
        val _ = print_rule rule;
wenzelm@9469
   424
        val thmq = FINDGOAL (Tactic.rtac rule THEN' RANGE tacs) thm;
wenzelm@9469
   425
      in Seq.map (fn th => map_goal I (K ((result, (facts, th)), f)) state) thmq end;
wenzelm@9469
   426
  in raw_rule |> exp_tac |> (Seq.flat o Seq.map exp_rule) end;
wenzelm@6932
   427
wenzelm@6932
   428
fun export_thm inner thm =
wenzelm@9469
   429
  let val (exp_tac, tacs) = ProofContext.export_wrt false inner None in
wenzelm@9469
   430
    (case Seq.chop (2, (exp_tac THEN RANGE tacs 1) thm) of
wenzelm@6932
   431
      ([thm'], _) => thm'
wenzelm@6932
   432
    | ([], _) => raise THM ("export: failed", 0, [thm])
wenzelm@6932
   433
    | _ => raise THM ("export: more than one result", 0, [thm]))
wenzelm@6932
   434
  end;
wenzelm@6932
   435
wenzelm@6932
   436
fun transfer_facts inner_state state =
wenzelm@6932
   437
  (case get_facts inner_state of
wenzelm@6932
   438
    None => Seq.single (reset_facts state)
wenzelm@8617
   439
  | Some thms =>
wenzelm@8617
   440
      let
wenzelm@9469
   441
        val (exp_tac, tacs) =
wenzelm@9469
   442
          ProofContext.export_wrt false (context_of inner_state) (Some (context_of state));
wenzelm@9469
   443
        val thmqs = map (exp_tac THEN RANGE tacs 1) thms;
wenzelm@8617
   444
      in Seq.map (fn ths => put_facts (Some ths) state) (Seq.commute thmqs) end);
wenzelm@6932
   445
wenzelm@6932
   446
wenzelm@6932
   447
(* prepare result *)
wenzelm@6932
   448
wenzelm@6932
   449
fun prep_result state t raw_thm =
wenzelm@5820
   450
  let
wenzelm@5820
   451
    val ctxt = context_of state;
wenzelm@5820
   452
    fun err msg = raise STATE (msg, state);
wenzelm@5820
   453
wenzelm@5820
   454
    val ngoals = Thm.nprems_of raw_thm;
wenzelm@5820
   455
    val _ =
wenzelm@5820
   456
      if ngoals = 0 then ()
wenzelm@5820
   457
      else (Locale.print_goals ngoals raw_thm; err (string_of_int ngoals ^ " unsolved goal(s)!"));
wenzelm@5820
   458
wenzelm@6932
   459
    val thm = raw_thm RS Drule.rev_triv_goal;
wenzelm@8617
   460
    val {hyps, prop, sign, ...} = Thm.rep_thm thm;
wenzelm@5820
   461
    val tsig = Sign.tsig_of sign;
wenzelm@6932
   462
wenzelm@9469
   463
    val casms = flat (map #1 (assumptions state));
wenzelm@6996
   464
    val bad_hyps = Library.gen_rems Term.aconv (hyps, map (Thm.term_of o Drule.mk_cgoal) casms);
wenzelm@5820
   465
  in
wenzelm@6932
   466
    if not (null bad_hyps) then
wenzelm@6932
   467
      err ("Additional hypotheses:\n" ^ cat_lines (map (Sign.string_of_term sign) bad_hyps))
wenzelm@7605
   468
    else if not (t aconv prop) then
wenzelm@7605
   469
      err ("Proved a different theorem: " ^ Sign.string_of_term sign prop)
wenzelm@8617
   470
    else thm
wenzelm@5820
   471
  end;
wenzelm@5820
   472
wenzelm@5820
   473
wenzelm@5820
   474
wenzelm@5820
   475
(*** structured proof commands ***)
wenzelm@5820
   476
wenzelm@5820
   477
(** context **)
wenzelm@5820
   478
wenzelm@5820
   479
(* bind *)
wenzelm@5820
   480
wenzelm@5820
   481
fun gen_bind f x state =
wenzelm@5820
   482
  state
wenzelm@5820
   483
  |> assert_forward
wenzelm@5820
   484
  |> map_context (f x)
wenzelm@5820
   485
  |> reset_facts;
wenzelm@5820
   486
wenzelm@8617
   487
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   488
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   489
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   490
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   491
wenzelm@5820
   492
wenzelm@9196
   493
(* have_thmss etc. *)
wenzelm@5820
   494
wenzelm@9196
   495
fun have_thmss args state =
wenzelm@5820
   496
  state
wenzelm@5820
   497
  |> assert_forward
wenzelm@9196
   498
  |> map_context_result (ProofContext.have_thmss args)
wenzelm@9196
   499
  |> these_factss;
wenzelm@5820
   500
wenzelm@9196
   501
fun simple_have_thms name thms = have_thmss [((name, []), [(thms, [])])];
wenzelm@9196
   502
wenzelm@9196
   503
fun with_thmss args state =
wenzelm@9196
   504
  let val state' = state |> have_thmss args
wenzelm@9196
   505
  in state' |> simple_have_thms "" (the_facts state' @ the_facts state) end;
wenzelm@6876
   506
wenzelm@5820
   507
wenzelm@5820
   508
(* fix *)
wenzelm@5820
   509
wenzelm@5820
   510
fun gen_fix f xs state =
wenzelm@5820
   511
  state
wenzelm@5820
   512
  |> assert_forward
wenzelm@5820
   513
  |> map_context (f xs)
wenzelm@5820
   514
  |> reset_facts;
wenzelm@5820
   515
wenzelm@5820
   516
val fix = gen_fix ProofContext.fix;
wenzelm@5820
   517
val fix_i = gen_fix ProofContext.fix_i;
wenzelm@5820
   518
wenzelm@5820
   519
wenzelm@5820
   520
(* assume *)
wenzelm@5820
   521
wenzelm@10446
   522
val norm_hhf_tac = Tactic.rewrite_goal_tac [Drule.norm_hhf_eq];
wenzelm@10446
   523
val hard_asm_tac = Tactic.etac Drule.triv_goal;
wenzelm@10446
   524
val soft_asm_tac = Tactic.rtac Drule.triv_goal THEN' norm_hhf_tac;
wenzelm@10446
   525
wenzelm@7271
   526
local
wenzelm@7271
   527
wenzelm@9469
   528
fun gen_assume f exp args state =
wenzelm@5820
   529
  state
wenzelm@5820
   530
  |> assert_forward
wenzelm@9469
   531
  |> map_context_result (f exp args)
wenzelm@7271
   532
  |> (fn (st, (factss, prems)) =>
wenzelm@9196
   533
    these_factss (st, factss)
wenzelm@9196
   534
    |> put_thms ("prems", prems));
wenzelm@6932
   535
wenzelm@9469
   536
fun simple_exporter tac1 tac2 =
wenzelm@9469
   537
  (Seq.single oo Drule.implies_intr_list,
wenzelm@10446
   538
    fn is_goal => fn n => replicate n (norm_hhf_tac THEN' (if is_goal then tac1 else tac2)));
wenzelm@6996
   539
wenzelm@7271
   540
in
wenzelm@7271
   541
wenzelm@7271
   542
val assm = gen_assume ProofContext.assume;
wenzelm@7271
   543
val assm_i = gen_assume ProofContext.assume_i;
wenzelm@9469
   544
val assume = assm (simple_exporter hard_asm_tac soft_asm_tac);
wenzelm@9469
   545
val assume_i = assm_i (simple_exporter hard_asm_tac soft_asm_tac);
wenzelm@9469
   546
val presume = assm (simple_exporter soft_asm_tac soft_asm_tac);
wenzelm@9469
   547
val presume_i = assm_i (simple_exporter soft_asm_tac soft_asm_tac);
wenzelm@5820
   548
wenzelm@7271
   549
end;
wenzelm@7271
   550
wenzelm@5820
   551
wenzelm@8374
   552
(* invoke_case *)
wenzelm@8374
   553
wenzelm@8450
   554
fun invoke_case (name, atts) state =
wenzelm@9292
   555
  let
wenzelm@9292
   556
    val (vars, props) = get_case state name;
wenzelm@9292
   557
    val bind_skolem = ProofContext.bind_skolem (context_of state) (map #1 vars);
wenzelm@9292
   558
  in
wenzelm@8374
   559
    state
wenzelm@8374
   560
    |> fix_i (map (fn (x, T) => ([x], Some T)) vars)
wenzelm@10464
   561
    |> assume_i [((name, atts), map (fn t => (t, ([], []))) (map bind_skolem props))]
wenzelm@8374
   562
  end;
wenzelm@8374
   563
wenzelm@8374
   564
wenzelm@5820
   565
wenzelm@5820
   566
(** goals **)
wenzelm@5820
   567
wenzelm@5820
   568
(* forward chaining *)
wenzelm@5820
   569
wenzelm@5820
   570
fun chain state =
wenzelm@5820
   571
  state
wenzelm@5820
   572
  |> assert_forward
wenzelm@6848
   573
  |> assert_facts
wenzelm@5820
   574
  |> enter_forward_chain;
wenzelm@5820
   575
wenzelm@5820
   576
fun from_facts facts state =
wenzelm@5820
   577
  state
wenzelm@5820
   578
  |> put_facts (Some facts)
wenzelm@5820
   579
  |> chain;
wenzelm@5820
   580
wenzelm@5820
   581
wenzelm@5820
   582
(* setup goals *)
wenzelm@5820
   583
wenzelm@8991
   584
val antN = "antecedent";
wenzelm@8991
   585
wenzelm@7176
   586
fun setup_goal opt_block prepp kind after_qed name atts raw_propp state =
wenzelm@5820
   587
  let
wenzelm@10464
   588
    val (state', ([[prop]], gen_binds)) =
wenzelm@5936
   589
      state
wenzelm@5936
   590
      |> assert_forward_or_chain
wenzelm@5936
   591
      |> enter_forward
wenzelm@8617
   592
      |> opt_block
wenzelm@10464
   593
      |> map_context_result (fn ct => prepp (ct, [[raw_propp]]));
wenzelm@6932
   594
    val cprop = Thm.cterm_of (sign_of state') prop;
wenzelm@7556
   595
    val goal = Drule.mk_triv_goal cprop;
wenzelm@5820
   596
  in
wenzelm@5936
   597
    state'
wenzelm@8617
   598
    |> put_goal (Some (((kind atts, name, prop), ([], goal)), after_qed o map_context gen_binds))
wenzelm@10406
   599
    |> map_context (ProofContext.add_cases (RuleCases.make true goal [antN]))
wenzelm@6790
   600
    |> auto_bind_goal prop
wenzelm@5820
   601
    |> (if is_chain state then use_facts else reset_facts)
wenzelm@5820
   602
    |> new_block
wenzelm@5820
   603
    |> enter_backward
wenzelm@5820
   604
  end;
wenzelm@5820
   605
wenzelm@5820
   606
wenzelm@5820
   607
(*global goals*)
wenzelm@8095
   608
fun global_goal prepp kind name atts x thy =
wenzelm@8095
   609
  setup_goal I prepp kind Seq.single name atts x (init_state thy);
wenzelm@5820
   610
wenzelm@7928
   611
val theorem = global_goal ProofContext.bind_propp Theorem;
wenzelm@7928
   612
val theorem_i = global_goal ProofContext.bind_propp_i Theorem;
wenzelm@7928
   613
val lemma = global_goal ProofContext.bind_propp Lemma;
wenzelm@7928
   614
val lemma_i = global_goal ProofContext.bind_propp_i Lemma;
wenzelm@5820
   615
wenzelm@5820
   616
wenzelm@5820
   617
(*local goals*)
wenzelm@8095
   618
fun local_goal prepp kind f name atts args state =
wenzelm@7928
   619
  state
wenzelm@8095
   620
  |> setup_goal open_block prepp kind f name atts args
wenzelm@7928
   621
  |> warn_extra_tfrees state;
wenzelm@5820
   622
wenzelm@10380
   623
val show   = local_goal ProofContext.bind_propp Show;
wenzelm@10380
   624
val show_i = local_goal ProofContext.bind_propp_i Show;
wenzelm@10380
   625
val have   = local_goal ProofContext.bind_propp Have;
wenzelm@10380
   626
val have_i = local_goal ProofContext.bind_propp_i Have;
wenzelm@5820
   627
wenzelm@5820
   628
wenzelm@5820
   629
wenzelm@5820
   630
(** conclusions **)
wenzelm@5820
   631
wenzelm@5820
   632
(* current goal *)
wenzelm@5820
   633
wenzelm@7176
   634
fun current_goal (State (Node {context, goal = Some goal, ...}, _)) = (context, goal)
wenzelm@5820
   635
  | current_goal state = raise STATE ("No current goal!", state);
wenzelm@5820
   636
wenzelm@7176
   637
fun assert_current_goal true (state as State (Node {goal = None, ...}, _)) =
wenzelm@6404
   638
      raise STATE ("No goal in this block!", state)
wenzelm@7176
   639
  | assert_current_goal false (state as State (Node {goal = Some _, ...}, _)) =
wenzelm@6404
   640
      raise STATE ("Goal present in this block!", state)
wenzelm@6404
   641
  | assert_current_goal _ state = state;
wenzelm@5820
   642
wenzelm@5820
   643
fun assert_bottom true (state as State (_, _ :: _)) =
wenzelm@5820
   644
      raise STATE ("Not at bottom of proof!", state)
wenzelm@5820
   645
  | assert_bottom false (state as State (_, [])) =
wenzelm@5820
   646
      raise STATE ("Already at bottom of proof!", state)
wenzelm@5820
   647
  | assert_bottom _ state = state;
wenzelm@5820
   648
wenzelm@6404
   649
val at_bottom = can (assert_bottom true o close_block);
wenzelm@6404
   650
wenzelm@6932
   651
fun end_proof bot state =
wenzelm@5820
   652
  state
wenzelm@5820
   653
  |> assert_forward
wenzelm@5820
   654
  |> close_block
wenzelm@5820
   655
  |> assert_bottom bot
wenzelm@7011
   656
  |> assert_current_goal true
wenzelm@7011
   657
  |> goal_facts (K []);
wenzelm@5820
   658
wenzelm@5820
   659
wenzelm@6404
   660
(* local_qed *)
wenzelm@5820
   661
wenzelm@6982
   662
fun finish_local (print_result, print_rule) state =
wenzelm@5820
   663
  let
wenzelm@8617
   664
    val (goal_ctxt, (((kind, name, t), (_, raw_thm)), after_qed)) = current_goal state;
wenzelm@8617
   665
    val outer_state = state |> close_block;
wenzelm@8617
   666
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   667
wenzelm@6932
   668
    val result = prep_result state t raw_thm;
wenzelm@9469
   669
    val resultq = #1 (ProofContext.export_wrt false goal_ctxt (Some outer_ctxt)) result;
wenzelm@9469
   670
wenzelm@5820
   671
    val (atts, opt_solve) =
wenzelm@5820
   672
      (case kind of
wenzelm@10380
   673
        Show atts => (atts, export_goal print_rule result goal_ctxt)
wenzelm@10380
   674
      | Have atts => (atts, Seq.single)
wenzelm@6932
   675
      | _ => err_malformed "finish_local" state);
wenzelm@5820
   676
  in
wenzelm@6731
   677
    print_result {kind = kind_name kind, name = name, thm = result};
wenzelm@8617
   678
    outer_state
wenzelm@8617
   679
    |> auto_bind_facts name [ProofContext.generalize goal_ctxt outer_ctxt t]
wenzelm@9469
   680
    |> (fn st => Seq.map (fn res =>
wenzelm@9469
   681
      have_thmss [((name, atts), [Thm.no_attributes [res]])] st) resultq)
wenzelm@9469
   682
    |> (Seq.flat o Seq.map opt_solve)
wenzelm@7176
   683
    |> (Seq.flat o Seq.map after_qed)
wenzelm@5820
   684
  end;
wenzelm@5820
   685
wenzelm@6982
   686
fun local_qed finalize print state =
wenzelm@6404
   687
  state
wenzelm@6932
   688
  |> end_proof false
wenzelm@6871
   689
  |> finalize
wenzelm@6982
   690
  |> (Seq.flat o Seq.map (finish_local print));
wenzelm@5820
   691
wenzelm@5820
   692
wenzelm@6404
   693
(* global_qed *)
wenzelm@5820
   694
wenzelm@10508
   695
val name_refN = "name_ref";
wenzelm@10508
   696
wenzelm@6950
   697
fun finish_global state =
wenzelm@5820
   698
  let
wenzelm@7176
   699
    val (_, (((kind, name, t), (_, raw_thm)), _)) = current_goal state;   (*ignores after_qed!*)
wenzelm@10508
   700
    val full_name = if name = "" then "" else Sign.full_name (sign_of state) name;
wenzelm@10508
   701
    val result =
wenzelm@10508
   702
      prep_result state t raw_thm
wenzelm@10508
   703
      |> Drule.standard
wenzelm@10508
   704
      |> Drule.tag_rule (name_refN, [full_name]);
wenzelm@5820
   705
wenzelm@5820
   706
    val atts =
wenzelm@5820
   707
      (case kind of
wenzelm@6950
   708
        Theorem atts => atts
wenzelm@6950
   709
      | Lemma atts => atts @ [Drule.tag_lemma]
wenzelm@6932
   710
      | _ => err_malformed "finish_global" state);
wenzelm@5820
   711
wenzelm@6091
   712
    val (thy', result') = PureThy.store_thm ((name, result), atts) (theory_of state);
wenzelm@6529
   713
  in (thy', {kind = kind_name kind, name = name, thm = result'}) end;
wenzelm@5820
   714
wenzelm@6871
   715
(*Note: should inspect first result only, backtracking may destroy theory*)
wenzelm@6950
   716
fun global_qed finalize state =
wenzelm@5820
   717
  state
wenzelm@6932
   718
  |> end_proof true
wenzelm@6871
   719
  |> finalize
wenzelm@6950
   720
  |> Seq.map finish_global;
wenzelm@5820
   721
wenzelm@5820
   722
wenzelm@6896
   723
wenzelm@6896
   724
(** blocks **)
wenzelm@6896
   725
wenzelm@6896
   726
(* begin_block *)
wenzelm@6896
   727
wenzelm@6896
   728
fun begin_block state =
wenzelm@6896
   729
  state
wenzelm@6896
   730
  |> assert_forward
wenzelm@6896
   731
  |> new_block
wenzelm@6896
   732
  |> open_block;
wenzelm@6896
   733
wenzelm@6896
   734
wenzelm@6896
   735
(* end_block *)
wenzelm@6896
   736
wenzelm@6896
   737
fun end_block state =
wenzelm@6896
   738
  state
wenzelm@6896
   739
  |> assert_forward
wenzelm@6896
   740
  |> close_block
wenzelm@6896
   741
  |> assert_current_goal false
wenzelm@6896
   742
  |> close_block
wenzelm@6932
   743
  |> transfer_facts state;
wenzelm@6896
   744
wenzelm@6896
   745
wenzelm@6896
   746
(* next_block *)
wenzelm@6896
   747
wenzelm@6896
   748
fun next_block state =
wenzelm@6896
   749
  state
wenzelm@6896
   750
  |> assert_forward
wenzelm@6896
   751
  |> close_block
wenzelm@8718
   752
  |> new_block
wenzelm@8718
   753
  |> reset_facts;
wenzelm@6896
   754
wenzelm@6896
   755
wenzelm@5820
   756
end;
wenzelm@8152
   757
wenzelm@8152
   758
wenzelm@8152
   759
structure BasicProof: BASIC_PROOF = Proof;
wenzelm@8152
   760
open BasicProof;