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