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