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