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