src/Pure/Isar/proof.ML
author skalberg
Fri Mar 04 15:07:34 2005 +0100 (2005-03-04)
changeset 15574 b1d1b5bfc464
parent 15570 8d8c70b41bab
child 15596 8665d08085df
permissions -rw-r--r--
Removed practically all references to Library.foldr.
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
paulson@15194
     8
paulson@15194
     9
(*Jia Meng: added in atp_hook and modified enter_forward. *)
paulson@15194
    10
wenzelm@8152
    11
signature BASIC_PROOF =
wenzelm@8152
    12
sig
wenzelm@8374
    13
  val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@8374
    14
  val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@8152
    15
end;
wenzelm@8152
    16
wenzelm@5820
    17
signature PROOF =
wenzelm@5820
    18
sig
wenzelm@8152
    19
  include BASIC_PROOF
wenzelm@5820
    20
  type context
wenzelm@5820
    21
  type state
berghofe@14129
    22
  datatype mode = Forward | ForwardChain | Backward
wenzelm@5820
    23
  exception STATE of string * state
wenzelm@6871
    24
  val check_result: string -> state -> 'a Seq.seq -> 'a Seq.seq
wenzelm@12045
    25
  val init_state: theory -> state
wenzelm@5820
    26
  val context_of: state -> context
wenzelm@5820
    27
  val theory_of: state -> theory
wenzelm@5820
    28
  val sign_of: state -> Sign.sg
wenzelm@13377
    29
  val map_context: (context -> context) -> state -> state
wenzelm@7924
    30
  val warn_extra_tfrees: state -> state -> state
wenzelm@14554
    31
  val put_thms: string * thm list -> state -> state
wenzelm@7605
    32
  val reset_thms: string -> state -> state
wenzelm@6091
    33
  val the_facts: state -> thm list
wenzelm@9469
    34
  val the_fact: state -> thm
wenzelm@11079
    35
  val get_goal: state -> context * (thm list * thm)
wenzelm@6091
    36
  val goal_facts: (state -> thm list) -> state -> state
berghofe@14129
    37
  val get_mode: state -> mode
wenzelm@9469
    38
  val is_chain: state -> bool
wenzelm@6891
    39
  val assert_forward: state -> state
wenzelm@9469
    40
  val assert_forward_or_chain: state -> state
wenzelm@5820
    41
  val assert_backward: state -> state
wenzelm@8206
    42
  val assert_no_chain: state -> state
paulson@15452
    43
  val atp_hook: (ProofContext.context * Thm.thm -> unit) ref
wenzelm@5820
    44
  val enter_forward: state -> state
wenzelm@6529
    45
  val verbose: bool ref
nipkow@13698
    46
  val show_main_goal: bool ref
wenzelm@12423
    47
  val pretty_state: int -> state -> Pretty.T list
wenzelm@10360
    48
  val pretty_goals: bool -> state -> Pretty.T list
wenzelm@6776
    49
  val level: state -> int
wenzelm@5820
    50
  type method
wenzelm@6848
    51
  val method: (thm list -> tactic) -> method
wenzelm@8374
    52
  val method_cases: (thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq) -> method
wenzelm@5820
    53
  val refine: (context -> method) -> state -> state Seq.seq
wenzelm@8234
    54
  val refine_end: (context -> method) -> state -> state Seq.seq
wenzelm@5936
    55
  val match_bind: (string list * string) list -> state -> state
wenzelm@5936
    56
  val match_bind_i: (term list * term) list -> state -> state
wenzelm@8617
    57
  val let_bind: (string list * string) list -> state -> state
wenzelm@8617
    58
  val let_bind_i: (term list * term) list -> state -> state
wenzelm@14564
    59
  val simple_note_thms: string -> thm list -> state -> state
wenzelm@14564
    60
  val note_thmss: ((bstring * context attribute list) *
berghofe@15456
    61
    (thmref * context attribute list) list) list -> state -> state
wenzelm@14564
    62
  val note_thmss_i: ((bstring * context attribute list) *
wenzelm@9196
    63
    (thm list * context attribute list) list) list -> state -> state
wenzelm@12714
    64
  val with_thmss: ((bstring * context attribute list) *
berghofe@15456
    65
    (thmref * context attribute list) list) list -> state -> state
wenzelm@12714
    66
  val with_thmss_i: ((bstring * context attribute list) *
wenzelm@9196
    67
    (thm list * context attribute list) list) list -> state -> state
berghofe@15456
    68
  val using_thmss: ((thmref * context attribute list) list) list -> state -> state
wenzelm@12930
    69
  val using_thmss_i: ((thm list * context attribute list) list) list -> state -> state
ballarin@14528
    70
  val instantiate_locale: string * (string * context attribute list) -> state
ballarin@14528
    71
    -> state
wenzelm@7412
    72
  val fix: (string list * string option) list -> state -> state
wenzelm@7665
    73
  val fix_i: (string list * typ option) list -> state -> state
wenzelm@9469
    74
  val assm: ProofContext.exporter
wenzelm@10464
    75
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7271
    76
    -> state -> state
wenzelm@9469
    77
  val assm_i: ProofContext.exporter
wenzelm@10464
    78
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    79
    -> state -> state
wenzelm@10464
    80
  val assume:
wenzelm@10464
    81
    ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7271
    82
    -> state -> state
wenzelm@10464
    83
  val assume_i: ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    84
    -> state -> state
wenzelm@10464
    85
  val presume:
wenzelm@10464
    86
    ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@6932
    87
    -> state -> state
wenzelm@10464
    88
  val presume_i: ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@6932
    89
    -> state -> state
wenzelm@11891
    90
  val def: string -> context attribute list -> string *  (string * string list) -> state -> state
wenzelm@11891
    91
  val def_i: string -> context attribute list -> string * (term * term list) -> state -> state
wenzelm@11793
    92
  val invoke_case: string * string option list * context attribute list -> state -> state
wenzelm@12959
    93
  val multi_theorem: string
wenzelm@12959
    94
    -> (xstring * (context attribute list * context attribute list list)) option
ballarin@15206
    95
    -> bstring * theory attribute list -> context attribute Locale.element Locale.elem_expr list
wenzelm@12146
    96
    -> ((bstring * theory attribute list) * (string * (string list * string list)) list) list
wenzelm@12146
    97
    -> theory -> state
wenzelm@12959
    98
  val multi_theorem_i: string
wenzelm@12959
    99
    -> (string * (context attribute list * context attribute list list)) option
wenzelm@12959
   100
    -> bstring * theory attribute list
ballarin@15206
   101
    -> context attribute Locale.element_i Locale.elem_expr list
wenzelm@12146
   102
    -> ((bstring * theory attribute list) * (term * (term list * term list)) list) list
wenzelm@12146
   103
    -> theory -> state
wenzelm@5820
   104
  val chain: state -> state
wenzelm@6091
   105
  val from_facts: thm list -> state -> state
wenzelm@12971
   106
  val show: (bool -> state -> state) -> (state -> state Seq.seq) -> bool
wenzelm@12146
   107
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@12146
   108
    -> bool -> state -> state
wenzelm@12971
   109
  val show_i: (bool -> state -> state) -> (state -> state Seq.seq) -> bool
wenzelm@12146
   110
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@12146
   111
    -> bool -> state -> state
wenzelm@12971
   112
  val have: (state -> state Seq.seq) -> bool
wenzelm@12146
   113
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@12146
   114
    -> state -> state
wenzelm@12971
   115
  val have_i: (state -> state Seq.seq) -> bool
wenzelm@12146
   116
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@12146
   117
    -> state -> state
wenzelm@6404
   118
  val at_bottom: state -> bool
wenzelm@6982
   119
  val local_qed: (state -> state Seq.seq)
wenzelm@12146
   120
    -> (context -> string * (string * thm list) list -> unit) * (context -> thm -> unit)
wenzelm@12146
   121
    -> state -> state Seq.seq
wenzelm@6950
   122
  val global_qed: (state -> state Seq.seq) -> state
wenzelm@12244
   123
    -> (theory * ((string * string) * (string * thm list) list)) Seq.seq
wenzelm@6896
   124
  val begin_block: state -> state
wenzelm@6932
   125
  val end_block: state -> state Seq.seq
wenzelm@6896
   126
  val next_block: state -> state
kleing@14548
   127
  val thisN: string
paulson@15194
   128
  val call_atp: bool ref;
paulson@15194
   129
paulson@15194
   130
wenzelm@5820
   131
end;
wenzelm@5820
   132
wenzelm@13377
   133
structure Proof: PROOF =
wenzelm@5820
   134
struct
wenzelm@5820
   135
paulson@15194
   136
(*Jia Meng: by default, no ATP is called. *)
paulson@15194
   137
val call_atp = ref false;
wenzelm@5820
   138
wenzelm@5820
   139
(** proof state **)
wenzelm@5820
   140
wenzelm@5820
   141
type context = ProofContext.context;
wenzelm@5820
   142
wenzelm@5820
   143
wenzelm@5820
   144
(* type goal *)
wenzelm@5820
   145
ballarin@15099
   146
(* CB: three kinds of Isar goals are distinguished:
ballarin@15099
   147
   - Theorem: global goal in a theory, corresponds to Isar commands theorem,
ballarin@15099
   148
     lemma and corollary,
ballarin@15099
   149
   - Have: local goal in a proof, Isar command have
ballarin@15099
   150
   - Show: local goal in a proof, Isar command show
ballarin@15099
   151
*)
ballarin@15099
   152
wenzelm@5820
   153
datatype kind =
wenzelm@12959
   154
  Theorem of {kind: string,
wenzelm@12959
   155
    theory_spec: (bstring * theory attribute list) * theory attribute list list,
wenzelm@13415
   156
    locale_spec: (string * (context attribute list * context attribute list list)) option,
ballarin@15206
   157
    view: cterm list * cterm list} |
ballarin@15206
   158
(* target view and includes view *)
wenzelm@12959
   159
  Show of context attribute list list |
wenzelm@12959
   160
  Have of context attribute list list;
wenzelm@5820
   161
ballarin@15099
   162
(* CB: this function prints the goal kind (Isar command), name and target in
ballarin@15099
   163
   the proof state *)
ballarin@15099
   164
wenzelm@13415
   165
fun kind_name _ (Theorem {kind = s, theory_spec = ((a, _), _),
skalberg@15531
   166
        locale_spec = NONE, view = _}) = s ^ (if a = "" then "" else " " ^ a)
wenzelm@13399
   167
  | kind_name sg (Theorem {kind = s, theory_spec = ((a, _), _),
skalberg@15531
   168
        locale_spec = SOME (name, _), view = _}) =
wenzelm@13415
   169
      s ^ " (in " ^ Locale.cond_extern sg name ^ ")" ^ (if a = "" then "" else " " ^ a)
wenzelm@12015
   170
  | kind_name _ (Show _) = "show"
wenzelm@12015
   171
  | kind_name _ (Have _) = "have";
wenzelm@5820
   172
wenzelm@5820
   173
type goal =
wenzelm@12146
   174
 (kind *             (*result kind*)
wenzelm@12146
   175
  string list *      (*result names*)
wenzelm@12146
   176
  term list list) *  (*result statements*)
wenzelm@12146
   177
 (thm list *         (*use facts*)
wenzelm@12146
   178
  thm);              (*goal: subgoals ==> statement*)
wenzelm@5820
   179
wenzelm@5820
   180
wenzelm@5820
   181
(* type mode *)
wenzelm@5820
   182
wenzelm@5820
   183
datatype mode = Forward | ForwardChain | Backward;
wenzelm@7201
   184
val mode_name = (fn Forward => "state" | ForwardChain => "chain" | Backward => "prove");
wenzelm@5820
   185
wenzelm@5820
   186
wenzelm@5820
   187
(* datatype state *)
wenzelm@5820
   188
wenzelm@7176
   189
datatype node =
wenzelm@7176
   190
  Node of
wenzelm@7176
   191
   {context: context,
wenzelm@7176
   192
    facts: thm list option,
wenzelm@7176
   193
    mode: mode,
wenzelm@12971
   194
    goal: (goal * ((state -> state Seq.seq) * bool)) option}
wenzelm@7176
   195
and state =
wenzelm@5820
   196
  State of
wenzelm@5820
   197
    node *              (*current*)
wenzelm@5820
   198
    node list;          (*parents wrt. block structure*)
wenzelm@5820
   199
wenzelm@7176
   200
fun make_node (context, facts, mode, goal) =
wenzelm@7176
   201
  Node {context = context, facts = facts, mode = mode, goal = goal};
wenzelm@7176
   202
wenzelm@7176
   203
wenzelm@5820
   204
exception STATE of string * state;
wenzelm@5820
   205
wenzelm@5820
   206
fun err_malformed name state =
wenzelm@5820
   207
  raise STATE (name ^ ": internal error -- malformed proof state", state);
wenzelm@5820
   208
wenzelm@6871
   209
fun check_result msg state sq =
wenzelm@6871
   210
  (case Seq.pull sq of
skalberg@15531
   211
    NONE => raise STATE (msg, state)
skalberg@15531
   212
  | SOME s_sq => Seq.cons s_sq);
wenzelm@6871
   213
wenzelm@5820
   214
wenzelm@7176
   215
fun map_current f (State (Node {context, facts, mode, goal}, nodes)) =
wenzelm@5820
   216
  State (make_node (f (context, facts, mode, goal)), nodes);
wenzelm@5820
   217
wenzelm@12045
   218
fun init_state thy =
skalberg@15531
   219
  State (make_node (ProofContext.init thy, NONE, Forward, NONE), []);
wenzelm@12045
   220
wenzelm@5820
   221
wenzelm@5820
   222
wenzelm@5820
   223
(** basic proof state operations **)
wenzelm@5820
   224
wenzelm@5820
   225
(* context *)
wenzelm@5820
   226
wenzelm@7176
   227
fun context_of (State (Node {context, ...}, _)) = context;
wenzelm@5820
   228
val theory_of = ProofContext.theory_of o context_of;
wenzelm@5820
   229
val sign_of = ProofContext.sign_of o context_of;
wenzelm@5820
   230
wenzelm@5820
   231
fun map_context f = map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
wenzelm@5820
   232
wenzelm@7176
   233
fun map_context_result f (state as State (Node {context, facts, mode, goal}, nodes)) =
wenzelm@5820
   234
  let val (context', result) = f context
wenzelm@5820
   235
  in (State (make_node (context', facts, mode, goal), nodes), result) end;
wenzelm@5820
   236
wenzelm@5820
   237
wenzelm@7924
   238
val warn_extra_tfrees = map_context o ProofContext.warn_extra_tfrees o context_of;
wenzelm@10809
   239
val add_binds_i = map_context o ProofContext.add_binds_i;
wenzelm@6790
   240
val auto_bind_goal = map_context o ProofContext.auto_bind_goal;
wenzelm@12146
   241
val auto_bind_facts = map_context o ProofContext.auto_bind_facts;
wenzelm@6091
   242
val put_thms = map_context o ProofContext.put_thms;
wenzelm@6091
   243
val put_thmss = map_context o ProofContext.put_thmss;
wenzelm@7605
   244
val reset_thms = map_context o ProofContext.reset_thms;
wenzelm@8374
   245
val get_case = ProofContext.get_case o context_of;
wenzelm@5820
   246
wenzelm@5820
   247
wenzelm@5820
   248
(* facts *)
wenzelm@5820
   249
skalberg@15531
   250
fun the_facts (State (Node {facts = SOME facts, ...}, _)) = facts
wenzelm@5820
   251
  | the_facts state = raise STATE ("No current facts available", state);
wenzelm@5820
   252
wenzelm@9469
   253
fun the_fact state =
wenzelm@9469
   254
  (case the_facts state of
wenzelm@9469
   255
    [thm] => thm
wenzelm@9469
   256
  | _ => raise STATE ("Single fact expected", state));
wenzelm@9469
   257
wenzelm@6848
   258
fun assert_facts state = (the_facts state; state);
wenzelm@7176
   259
fun get_facts (State (Node {facts, ...}, _)) = facts;
wenzelm@6848
   260
wenzelm@7605
   261
wenzelm@7605
   262
val thisN = "this";
wenzelm@7605
   263
wenzelm@5820
   264
fun put_facts facts state =
wenzelm@5820
   265
  state
wenzelm@5820
   266
  |> map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal))
skalberg@15531
   267
  |> (case facts of NONE => reset_thms thisN | SOME ths => put_thms (thisN, ths));
wenzelm@5820
   268
skalberg@15531
   269
val reset_facts = put_facts NONE;
wenzelm@5820
   270
wenzelm@9196
   271
fun these_factss (state, named_factss) =
skalberg@15570
   272
  state |> put_facts (SOME (List.concat (map snd named_factss)));
wenzelm@5820
   273
wenzelm@5820
   274
wenzelm@5820
   275
(* goal *)
wenzelm@5820
   276
wenzelm@10553
   277
local
skalberg@15531
   278
  fun find i (state as State (Node {goal = SOME goal, ...}, _)) = (context_of state, (i, goal))
skalberg@15531
   279
    | find i (State (Node {goal = NONE, ...}, node :: nodes)) = find (i + 1) (State (node, nodes))
wenzelm@10553
   280
    | find _ (state as State (_, [])) = err_malformed "find_goal" state;
wenzelm@10553
   281
in val find_goal = find 0 end;
wenzelm@7176
   282
wenzelm@11079
   283
fun get_goal state =
wenzelm@11079
   284
  let val (ctxt, (_, ((_, x), _))) = find_goal state
wenzelm@11079
   285
  in (ctxt, x) end;
wenzelm@11079
   286
paulson@15452
   287
paulson@15452
   288
(*
paulson@15452
   289
(* Jia: added here: get all goals from the state 10/01/05 *)
skalberg@15531
   290
fun find_all i (state as State (Node {goal = SOME goal, ...}, node::nodes)) = 
paulson@15452
   291
    let val others = find_all (i+1) (State (node, nodes))
paulson@15452
   292
    in
paulson@15452
   293
	(context_of state, (i, goal)) :: others
paulson@15452
   294
    end
skalberg@15531
   295
  | find_all i (State (Node {goal = NONE, ...}, node :: nodes)) = find_all (i + 1) (State (node, nodes))
paulson@15452
   296
  | find_all _ (state as State (_, [])) = [];
paulson@15452
   297
paulson@15452
   298
val find_all_goals = find_all 0;
paulson@15452
   299
paulson@15452
   300
fun find_all_goals_ctxts state =
paulson@15452
   301
    let val all_goals = find_all_goals state
paulson@15452
   302
	fun find_ctxt_g [] = []
paulson@15452
   303
	  | find_ctxt_g ((ctxt, (_, ((_, (_, thm)), _)))::others) = (ctxt,thm) :: (find_ctxt_g others)
paulson@15452
   304
    in
paulson@15452
   305
	find_ctxt_g all_goals
paulson@15452
   306
    end;
paulson@15452
   307
*)
paulson@15452
   308
wenzelm@5820
   309
fun put_goal goal = map_current (fn (ctxt, facts, mode, _) => (ctxt, facts, mode, goal));
wenzelm@5820
   310
skalberg@15531
   311
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) =
skalberg@15531
   312
      State (make_node (f context, facts, mode, SOME (g goal)), nodes)
wenzelm@8374
   313
  | map_goal f g (State (nd, node :: nodes)) =
wenzelm@8374
   314
      let val State (node', nodes') = map_goal f g (State (node, nodes))
wenzelm@8374
   315
      in map_context f (State (nd, node' :: nodes')) end
wenzelm@8374
   316
  | map_goal _ _ state = state;
wenzelm@5820
   317
wenzelm@5820
   318
fun goal_facts get state =
wenzelm@5820
   319
  state
wenzelm@8374
   320
  |> map_goal I (fn ((result, (_, thm)), f) => ((result, (get state, thm)), f));
wenzelm@5820
   321
wenzelm@5820
   322
fun use_facts state =
wenzelm@5820
   323
  state
wenzelm@5820
   324
  |> goal_facts the_facts
wenzelm@5820
   325
  |> reset_facts;
wenzelm@5820
   326
wenzelm@5820
   327
wenzelm@5820
   328
(* mode *)
wenzelm@5820
   329
wenzelm@7176
   330
fun get_mode (State (Node {mode, ...}, _)) = mode;
wenzelm@5820
   331
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
wenzelm@5820
   332
paulson@15194
   333
val enter_forward_aux = put_mode Forward;
wenzelm@5820
   334
val enter_forward_chain = put_mode ForwardChain;
wenzelm@5820
   335
val enter_backward = put_mode Backward;
wenzelm@5820
   336
wenzelm@5820
   337
fun assert_mode pred state =
wenzelm@5820
   338
  let val mode = get_mode state in
wenzelm@5820
   339
    if pred mode then state
wenzelm@12010
   340
    else raise STATE ("Illegal application of proof command in "
wenzelm@12010
   341
      ^ quote (mode_name mode) ^ " mode", state)
wenzelm@5820
   342
  end;
wenzelm@5820
   343
wenzelm@5820
   344
fun is_chain state = get_mode state = ForwardChain;
wenzelm@5820
   345
val assert_forward = assert_mode (equal Forward);
wenzelm@5820
   346
val assert_forward_or_chain = assert_mode (equal Forward orf equal ForwardChain);
wenzelm@5820
   347
val assert_backward = assert_mode (equal Backward);
wenzelm@8206
   348
val assert_no_chain = assert_mode (not_equal ForwardChain);
wenzelm@5820
   349
wenzelm@5820
   350
paulson@15194
   351
(*Jia Meng: a hook to be used for calling ATPs. *)
paulson@15452
   352
(* send the entire proof context *)
paulson@15452
   353
val atp_hook = ref (fn ctxt_state: ProofContext.context * Thm.thm => ());
paulson@15194
   354
paulson@15194
   355
(*Jia Meng: the modified version of enter_forward. *)
paulson@15194
   356
(*Jia Meng: atp: Proof.state -> unit *)
paulson@15194
   357
local
paulson@15194
   358
 fun atp state = 
paulson@15452
   359
     let val (ctxt, (_, ((_, (_, thm)), _))) = find_goal state
paulson@15452
   360
     in
paulson@15452
   361
	 (!atp_hook) (ctxt,thm)          
paulson@15452
   362
     end;
paulson@15452
   363
     
paulson@15194
   364
in
paulson@15194
   365
paulson@15194
   366
 fun enter_forward state = 
paulson@15194
   367
   if (!call_atp) then 
paulson@15194
   368
   ((atp state; enter_forward_aux state)
paulson@15194
   369
                           handle (STATE _) => enter_forward_aux state)
paulson@15194
   370
       else (enter_forward_aux state);
paulson@15194
   371
paulson@15194
   372
end;
paulson@15194
   373
paulson@15194
   374
wenzelm@5820
   375
(* blocks *)
wenzelm@5820
   376
wenzelm@6776
   377
fun level (State (_, nodes)) = length nodes;
wenzelm@6776
   378
wenzelm@5820
   379
fun open_block (State (node, nodes)) = State (node, node :: nodes);
wenzelm@5820
   380
wenzelm@5820
   381
fun new_block state =
wenzelm@5820
   382
  state
wenzelm@5820
   383
  |> open_block
skalberg@15531
   384
  |> put_goal NONE;
wenzelm@5820
   385
wenzelm@7487
   386
fun close_block (state as State (_, node :: nodes)) = State (node, nodes)
wenzelm@5820
   387
  | close_block state = raise STATE ("Unbalanced block parentheses", state);
wenzelm@5820
   388
wenzelm@5820
   389
wenzelm@5820
   390
wenzelm@12423
   391
(** pretty_state **)
wenzelm@5820
   392
nipkow@13869
   393
val show_main_goal = ref false;
nipkow@13698
   394
wenzelm@6529
   395
val verbose = ProofContext.verbose;
wenzelm@6529
   396
wenzelm@14876
   397
val pretty_goals_local = Display.pretty_goals_aux o ProofContext.pp;
wenzelm@12085
   398
skalberg@15531
   399
fun pretty_facts _ _ NONE = []
skalberg@15531
   400
  | pretty_facts s ctxt (SOME ths) =
wenzelm@12055
   401
      [Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""];
wenzelm@6756
   402
wenzelm@12423
   403
fun pretty_state nr (state as State (Node {context = ctxt, facts, mode, goal = _}, nodes)) =
wenzelm@5820
   404
  let
wenzelm@11891
   405
    val ref (_, _, begin_goal) = Display.current_goals_markers;
wenzelm@5820
   406
wenzelm@5820
   407
    fun levels_up 0 = ""
wenzelm@7575
   408
      | levels_up 1 = ", 1 level up"
wenzelm@7575
   409
      | levels_up i = ", " ^ string_of_int i ^ " levels up";
wenzelm@5820
   410
wenzelm@11556
   411
    fun subgoals 0 = ""
wenzelm@11556
   412
      | subgoals 1 = ", 1 subgoal"
wenzelm@11556
   413
      | subgoals n = ", " ^ string_of_int n ^ " subgoals";
wenzelm@12146
   414
wenzelm@12146
   415
    fun prt_names names =
wenzelm@12242
   416
      (case filter_out (equal "") names of [] => ""
skalberg@15570
   417
      | nms => " " ^ enclose "(" ")" (space_implode " and " (Library.take (7, nms) @
wenzelm@12308
   418
          (if length nms > 7 then ["..."] else []))));
wenzelm@12146
   419
wenzelm@12146
   420
    fun prt_goal (_, (i, (((kind, names, _), (goal_facts, thm)), _))) =
wenzelm@12085
   421
      pretty_facts "using " ctxt
skalberg@15531
   422
        (if mode <> Backward orelse null goal_facts then NONE else SOME goal_facts) @
wenzelm@12146
   423
      [Pretty.str ("goal (" ^ kind_name (sign_of state) kind ^ prt_names names ^
wenzelm@12146
   424
          levels_up (i div 2) ^ subgoals (Thm.nprems_of thm) ^ "):")] @
nipkow@13698
   425
      pretty_goals_local ctxt begin_goal (true, !show_main_goal) (! Display.goals_limit) thm;
wenzelm@6848
   426
wenzelm@8462
   427
    val ctxt_prts =
wenzelm@12085
   428
      if ! verbose orelse mode = Forward then ProofContext.pretty_context ctxt
wenzelm@12085
   429
      else if mode = Backward then ProofContext.pretty_asms ctxt
wenzelm@7575
   430
      else [];
wenzelm@8462
   431
wenzelm@8462
   432
    val prts =
wenzelm@8582
   433
     [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
wenzelm@12010
   434
        (if ! verbose then ", depth " ^ string_of_int (length nodes div 2 - 1)
wenzelm@8561
   435
        else "")), Pretty.str ""] @
wenzelm@8462
   436
     (if null ctxt_prts then [] else ctxt_prts @ [Pretty.str ""]) @
wenzelm@8462
   437
     (if ! verbose orelse mode = Forward then
wenzelm@12146
   438
       (pretty_facts "" ctxt facts @ prt_goal (find_goal state))
wenzelm@12085
   439
      else if mode = ForwardChain then pretty_facts "picking " ctxt facts
wenzelm@12146
   440
      else prt_goal (find_goal state))
wenzelm@12423
   441
  in prts end;
wenzelm@5820
   442
wenzelm@12085
   443
fun pretty_goals main state =
wenzelm@12085
   444
  let val (ctxt, (_, ((_, (_, thm)), _))) = find_goal state
wenzelm@12085
   445
  in pretty_goals_local ctxt "" (false, main) (! Display.goals_limit) thm end;
wenzelm@10320
   446
wenzelm@5820
   447
wenzelm@5820
   448
wenzelm@5820
   449
(** proof steps **)
wenzelm@5820
   450
wenzelm@5820
   451
(* datatype method *)
wenzelm@5820
   452
wenzelm@8374
   453
datatype method =
wenzelm@8374
   454
  Method of thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq;
wenzelm@8374
   455
wenzelm@8374
   456
fun method tac = Method (fn facts => fn st => Seq.map (rpair []) (tac facts st));
wenzelm@8374
   457
val method_cases = Method;
wenzelm@5820
   458
wenzelm@5820
   459
wenzelm@5820
   460
(* refine goal *)
wenzelm@5820
   461
wenzelm@8234
   462
local
wenzelm@8234
   463
wenzelm@5820
   464
fun check_sign sg state =
wenzelm@5820
   465
  if Sign.subsig (sg, sign_of state) then state
wenzelm@5820
   466
  else raise STATE ("Bad signature of result: " ^ Sign.str_of_sg sg, state);
wenzelm@5820
   467
berghofe@15533
   468
fun mk_goals_cases st =
berghofe@15533
   469
  RuleCases.make true NONE (sign_of_thm st, prop_of st)
berghofe@15533
   470
    (map (fn i => "goal" ^ string_of_int i) (1 upto nprems_of st));
berghofe@15533
   471
wenzelm@8234
   472
fun gen_refine current_context meth_fun state =
wenzelm@6848
   473
  let
wenzelm@12971
   474
    val (goal_ctxt, (_, ((result, (facts, thm)), x))) = find_goal state;
wenzelm@8234
   475
    val Method meth = meth_fun (if current_context then context_of state else goal_ctxt);
wenzelm@5820
   476
wenzelm@8374
   477
    fun refn (thm', cases) =
wenzelm@6848
   478
      state
wenzelm@6848
   479
      |> check_sign (Thm.sign_of_thm thm')
berghofe@15533
   480
      |> map_goal (ProofContext.add_cases (cases @ mk_goals_cases thm'))
berghofe@15533
   481
           (K ((result, (facts, thm')), x));
wenzelm@6848
   482
  in Seq.map refn (meth facts thm) end;
wenzelm@5820
   483
wenzelm@8234
   484
in
wenzelm@8234
   485
wenzelm@8234
   486
val refine = gen_refine true;
wenzelm@8234
   487
val refine_end = gen_refine false;
wenzelm@8234
   488
wenzelm@8234
   489
end;
wenzelm@8234
   490
wenzelm@5820
   491
wenzelm@11917
   492
(* goal addressing *)
wenzelm@6932
   493
wenzelm@8152
   494
fun FINDGOAL tac st =
wenzelm@8374
   495
  let fun find (i, n) = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1, n))
wenzelm@8374
   496
  in find (1, Thm.nprems_of st) st end;
wenzelm@8152
   497
wenzelm@8166
   498
fun HEADGOAL tac = tac 1;
wenzelm@8166
   499
wenzelm@9469
   500
wenzelm@9469
   501
(* export results *)
wenzelm@9469
   502
wenzelm@11816
   503
fun refine_tac rule =
wenzelm@12703
   504
  Tactic.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW (SUBGOAL (fn (goal, i) =>
wenzelm@11816
   505
    if can Logic.dest_goal (Logic.strip_assums_concl goal) then
wenzelm@11816
   506
      Tactic.etac Drule.triv_goal i
wenzelm@11816
   507
    else all_tac));
wenzelm@11816
   508
wenzelm@12146
   509
fun export_goal inner print_rule raw_rule state =
wenzelm@6932
   510
  let
wenzelm@12971
   511
    val (outer, (_, ((result, (facts, thm)), x))) = find_goal state;
wenzelm@12010
   512
    val exp_tac = ProofContext.export true inner outer;
wenzelm@9469
   513
    fun exp_rule rule =
wenzelm@9469
   514
      let
wenzelm@12055
   515
        val _ = print_rule outer rule;
wenzelm@11816
   516
        val thmq = FINDGOAL (refine_tac rule) thm;
wenzelm@12971
   517
      in Seq.map (fn th => map_goal I (K ((result, (facts, th)), x)) state) thmq end;
wenzelm@9469
   518
  in raw_rule |> exp_tac |> (Seq.flat o Seq.map exp_rule) end;
wenzelm@6932
   519
wenzelm@12146
   520
fun export_goals inner print_rule raw_rules =
wenzelm@12146
   521
  Seq.EVERY (map (export_goal inner print_rule) raw_rules);
wenzelm@12146
   522
wenzelm@6932
   523
fun transfer_facts inner_state state =
wenzelm@6932
   524
  (case get_facts inner_state of
skalberg@15531
   525
    NONE => Seq.single (reset_facts state)
skalberg@15531
   526
  | SOME thms =>
wenzelm@8617
   527
      let
wenzelm@12010
   528
        val exp_tac = ProofContext.export false (context_of inner_state) (context_of state);
wenzelm@11816
   529
        val thmqs = map exp_tac thms;
skalberg@15531
   530
      in Seq.map (fn ths => put_facts (SOME ths) state) (Seq.commute thmqs) end);
wenzelm@6932
   531
wenzelm@6932
   532
wenzelm@6932
   533
(* prepare result *)
wenzelm@6932
   534
wenzelm@12146
   535
fun prep_result state ts raw_th =
wenzelm@5820
   536
  let
wenzelm@5820
   537
    val ctxt = context_of state;
wenzelm@5820
   538
    fun err msg = raise STATE (msg, state);
wenzelm@5820
   539
wenzelm@12146
   540
    val ngoals = Thm.nprems_of raw_th;
wenzelm@5820
   541
    val _ =
wenzelm@5820
   542
      if ngoals = 0 then ()
nipkow@13698
   543
      else (err (Pretty.string_of (Pretty.chunks (pretty_goals_local ctxt "" (true, !show_main_goal)
wenzelm@12146
   544
            (! Display.goals_limit) raw_th @
wenzelm@12085
   545
          [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))));
wenzelm@5820
   546
wenzelm@12146
   547
    val {hyps, sign, ...} = Thm.rep_thm raw_th;
wenzelm@5820
   548
    val tsig = Sign.tsig_of sign;
skalberg@15570
   549
    val casms = List.concat (map #1 (ProofContext.assumptions_of (context_of state)));
wenzelm@11816
   550
    val bad_hyps = Library.gen_rems Term.aconv (hyps, map Thm.term_of casms);
wenzelm@12146
   551
wenzelm@12146
   552
    val th = raw_th RS Drule.rev_triv_goal;
wenzelm@12146
   553
    val ths = Drule.conj_elim_precise (length ts) th
wenzelm@12146
   554
      handle THM _ => err "Main goal structure corrupted";
wenzelm@5820
   555
  in
wenzelm@12146
   556
    conditional (not (null bad_hyps)) (fn () => err ("Additional hypotheses:\n" ^
wenzelm@12146
   557
        cat_lines (map (ProofContext.string_of_term ctxt) bad_hyps)));
wenzelm@12808
   558
    conditional (exists (not o Pattern.matches tsig) (ts ~~ map Thm.prop_of ths)) (fn () =>
wenzelm@12146
   559
      err ("Proved a different theorem: " ^ Pretty.string_of (ProofContext.pretty_thm ctxt th)));
wenzelm@12146
   560
    ths
wenzelm@5820
   561
  end;
wenzelm@5820
   562
wenzelm@5820
   563
wenzelm@5820
   564
wenzelm@5820
   565
(*** structured proof commands ***)
wenzelm@5820
   566
wenzelm@5820
   567
(** context **)
wenzelm@5820
   568
wenzelm@5820
   569
(* bind *)
wenzelm@5820
   570
wenzelm@5820
   571
fun gen_bind f x state =
wenzelm@5820
   572
  state
wenzelm@5820
   573
  |> assert_forward
wenzelm@5820
   574
  |> map_context (f x)
wenzelm@5820
   575
  |> reset_facts;
wenzelm@5820
   576
wenzelm@8617
   577
val match_bind = gen_bind (ProofContext.match_bind false);
wenzelm@8617
   578
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
wenzelm@8617
   579
val let_bind = gen_bind (ProofContext.match_bind true);
wenzelm@8617
   580
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
wenzelm@5820
   581
wenzelm@5820
   582
wenzelm@14564
   583
(* note_thmss *)
wenzelm@5820
   584
wenzelm@12714
   585
local
wenzelm@12714
   586
wenzelm@14564
   587
fun gen_note_thmss f args state =
wenzelm@5820
   588
  state
wenzelm@5820
   589
  |> assert_forward
wenzelm@12714
   590
  |> map_context_result (f args)
wenzelm@9196
   591
  |> these_factss;
wenzelm@5820
   592
wenzelm@12714
   593
in
wenzelm@12714
   594
wenzelm@14564
   595
val note_thmss = gen_note_thmss ProofContext.note_thmss;
wenzelm@14564
   596
val note_thmss_i = gen_note_thmss ProofContext.note_thmss_i;
wenzelm@12714
   597
wenzelm@14564
   598
fun simple_note_thms name thms = note_thmss_i [((name, []), [(thms, [])])];
wenzelm@12714
   599
wenzelm@12714
   600
end;
wenzelm@12714
   601
wenzelm@12714
   602
wenzelm@12714
   603
(* with_thmss *)
wenzelm@9196
   604
wenzelm@12714
   605
local
wenzelm@12714
   606
wenzelm@12714
   607
fun gen_with_thmss f args state =
wenzelm@12714
   608
  let val state' = state |> f args
wenzelm@14564
   609
  in state' |> simple_note_thms "" (the_facts state' @ the_facts state) end;
wenzelm@6876
   610
wenzelm@12714
   611
in
wenzelm@12714
   612
wenzelm@14564
   613
val with_thmss = gen_with_thmss note_thmss;
wenzelm@14564
   614
val with_thmss_i = gen_with_thmss note_thmss_i;
wenzelm@12714
   615
wenzelm@12714
   616
end;
wenzelm@12714
   617
wenzelm@5820
   618
wenzelm@12930
   619
(* using_thmss *)
wenzelm@12930
   620
wenzelm@12930
   621
local
wenzelm@12930
   622
wenzelm@12930
   623
fun gen_using_thmss f args state =
wenzelm@12930
   624
  state
wenzelm@12930
   625
  |> assert_backward
wenzelm@12930
   626
  |> map_context_result (f (map (pair ("", [])) args))
wenzelm@12930
   627
  |> (fn (st, named_facts) =>
wenzelm@12971
   628
    let val (_, (_, ((result, (facts, thm)), x))) = find_goal st;
skalberg@15570
   629
    in st |> map_goal I (K ((result, (facts @ List.concat (map snd named_facts), thm)), x)) end);
wenzelm@12930
   630
wenzelm@12930
   631
in
wenzelm@12930
   632
wenzelm@14564
   633
val using_thmss = gen_using_thmss ProofContext.note_thmss;
wenzelm@14564
   634
val using_thmss_i = gen_using_thmss ProofContext.note_thmss_i;
wenzelm@12930
   635
wenzelm@12930
   636
end;
wenzelm@12930
   637
wenzelm@12930
   638
ballarin@14508
   639
(* locale instantiation *)
ballarin@14508
   640
ballarin@14528
   641
fun instantiate_locale (loc_name, prfx_attribs) state = let
skalberg@15531
   642
    val facts = if is_chain state then get_facts state else NONE;
ballarin@14508
   643
  in
ballarin@14508
   644
    state
ballarin@14508
   645
    |> assert_forward_or_chain
ballarin@14508
   646
    |> enter_forward
ballarin@14508
   647
    |> reset_facts
ballarin@14528
   648
    |> map_context (Locale.instantiate loc_name prfx_attribs facts)
ballarin@14508
   649
  end;
ballarin@14508
   650
wenzelm@5820
   651
(* fix *)
wenzelm@5820
   652
wenzelm@5820
   653
fun gen_fix f xs state =
wenzelm@5820
   654
  state
wenzelm@5820
   655
  |> assert_forward
wenzelm@5820
   656
  |> map_context (f xs)
wenzelm@5820
   657
  |> reset_facts;
wenzelm@5820
   658
wenzelm@5820
   659
val fix = gen_fix ProofContext.fix;
wenzelm@5820
   660
val fix_i = gen_fix ProofContext.fix_i;
wenzelm@5820
   661
wenzelm@5820
   662
wenzelm@11891
   663
(* assume and presume *)
wenzelm@5820
   664
wenzelm@9469
   665
fun gen_assume f exp args state =
wenzelm@5820
   666
  state
wenzelm@5820
   667
  |> assert_forward
wenzelm@9469
   668
  |> map_context_result (f exp args)
wenzelm@11924
   669
  |> these_factss;
wenzelm@6932
   670
wenzelm@7271
   671
val assm = gen_assume ProofContext.assume;
wenzelm@7271
   672
val assm_i = gen_assume ProofContext.assume_i;
wenzelm@11917
   673
val assume = assm ProofContext.export_assume;
wenzelm@11917
   674
val assume_i = assm_i ProofContext.export_assume;
wenzelm@11917
   675
val presume = assm ProofContext.export_presume;
wenzelm@11917
   676
val presume_i = assm_i ProofContext.export_presume;
wenzelm@5820
   677
wenzelm@7271
   678
wenzelm@5820
   679
wenzelm@11891
   680
(** local definitions **)
wenzelm@11891
   681
wenzelm@11891
   682
fun gen_def fix prep_term prep_pats raw_name atts (x, (raw_rhs, raw_pats)) state =
wenzelm@11891
   683
  let
wenzelm@11891
   684
    val _ = assert_forward state;
wenzelm@11891
   685
    val ctxt = context_of state;
wenzelm@11891
   686
wenzelm@11891
   687
    (*rhs*)
wenzelm@11891
   688
    val name = if raw_name = "" then Thm.def_name x else raw_name;
wenzelm@11891
   689
    val rhs = prep_term ctxt raw_rhs;
wenzelm@11891
   690
    val T = Term.fastype_of rhs;
wenzelm@11891
   691
    val pats = prep_pats T (ProofContext.declare_term rhs ctxt) raw_pats;
wenzelm@11891
   692
wenzelm@11891
   693
    (*lhs*)
wenzelm@11891
   694
    val lhs = ProofContext.bind_skolem ctxt [x] (Free (x, T));
wenzelm@11891
   695
  in
wenzelm@11891
   696
    state
skalberg@15531
   697
    |> fix [([x], NONE)]
wenzelm@11891
   698
    |> match_bind_i [(pats, rhs)]
wenzelm@11917
   699
    |> assm_i ProofContext.export_def [((name, atts), [(Logic.mk_equals (lhs, rhs), ([], []))])]
wenzelm@11891
   700
  end;
wenzelm@11891
   701
wenzelm@11891
   702
val def = gen_def fix ProofContext.read_term ProofContext.read_term_pats;
wenzelm@11891
   703
val def_i = gen_def fix_i ProofContext.cert_term ProofContext.cert_term_pats;
wenzelm@11891
   704
wenzelm@11891
   705
wenzelm@8374
   706
(* invoke_case *)
wenzelm@8374
   707
wenzelm@11793
   708
fun invoke_case (name, xs, atts) state =
wenzelm@9292
   709
  let
wenzelm@10830
   710
    val (state', (lets, asms)) =
wenzelm@11793
   711
      map_context_result (ProofContext.apply_case (get_case state name xs)) state;
wenzelm@13425
   712
    val assumptions = asms |> map (fn (a, ts) =>
wenzelm@13425
   713
      ((if a = "" then "" else NameSpace.append name a, atts), map (rpair ([], [])) ts));
wenzelm@13425
   714
    val qnames = filter_out (equal "") (map (#1 o #1) assumptions);
wenzelm@9292
   715
  in
wenzelm@10830
   716
    state'
wenzelm@10809
   717
    |> add_binds_i lets
wenzelm@13425
   718
    |> map_context (ProofContext.qualified true)
wenzelm@13425
   719
    |> assume_i assumptions
wenzelm@13425
   720
    |> map_context (ProofContext.hide_thms false qnames)
wenzelm@14564
   721
    |> (fn st => simple_note_thms name (the_facts st) st)
wenzelm@13425
   722
    |> map_context (ProofContext.restore_qualified (context_of state))
wenzelm@8374
   723
  end;
wenzelm@8374
   724
wenzelm@8374
   725
wenzelm@5820
   726
wenzelm@5820
   727
(** goals **)
wenzelm@5820
   728
wenzelm@5820
   729
(* forward chaining *)
wenzelm@5820
   730
wenzelm@5820
   731
fun chain state =
wenzelm@5820
   732
  state
wenzelm@5820
   733
  |> assert_forward
wenzelm@6848
   734
  |> assert_facts
wenzelm@5820
   735
  |> enter_forward_chain;
wenzelm@5820
   736
wenzelm@5820
   737
fun from_facts facts state =
wenzelm@5820
   738
  state
skalberg@15531
   739
  |> put_facts (SOME facts)
wenzelm@5820
   740
  |> chain;
wenzelm@5820
   741
wenzelm@5820
   742
wenzelm@5820
   743
(* setup goals *)
wenzelm@5820
   744
wenzelm@11549
   745
val rule_contextN = "rule_context";
wenzelm@8991
   746
wenzelm@12971
   747
fun setup_goal opt_block prepp autofix kind after_qed pr names raw_propp state =
wenzelm@5820
   748
  let
wenzelm@12146
   749
    val (state', (propss, gen_binds)) =
wenzelm@5936
   750
      state
wenzelm@5936
   751
      |> assert_forward_or_chain
wenzelm@5936
   752
      |> enter_forward
wenzelm@8617
   753
      |> opt_block
wenzelm@12534
   754
      |> map_context_result (fn ctxt => prepp (ctxt, raw_propp));
wenzelm@12808
   755
    val sign' = sign_of state';
wenzelm@12146
   756
skalberg@15570
   757
    val props = List.concat propss;
wenzelm@12808
   758
    val cprop = Thm.cterm_of sign' (Logic.mk_conjunction_list props);
wenzelm@7556
   759
    val goal = Drule.mk_triv_goal cprop;
wenzelm@10553
   760
skalberg@15574
   761
    val tvars = foldr Term.add_term_tvars [] props;
skalberg@15574
   762
    val vars = foldr Term.add_term_vars [] props;
wenzelm@5820
   763
  in
wenzelm@10553
   764
    if null tvars then ()
wenzelm@10553
   765
    else raise STATE ("Goal statement contains illegal schematic type variable(s): " ^
wenzelm@10553
   766
      commas (map (Syntax.string_of_vname o #1) tvars), state);
wenzelm@10553
   767
    if null vars then ()
wenzelm@10553
   768
    else warning ("Goal statement contains unbound schematic variable(s): " ^
wenzelm@12055
   769
      commas (map (ProofContext.string_of_term (context_of state')) vars));
wenzelm@5936
   770
    state'
wenzelm@12146
   771
    |> map_context (autofix props)
skalberg@15531
   772
    |> put_goal (SOME (((kind, names, propss), ([], goal)),
wenzelm@12971
   773
      (after_qed o map_context gen_binds, pr)))
wenzelm@12167
   774
    |> map_context (ProofContext.add_cases
wenzelm@12808
   775
     (if length props = 1 then
skalberg@15531
   776
      RuleCases.make true NONE (Thm.sign_of_thm goal, Thm.prop_of goal) [rule_contextN]
wenzelm@12167
   777
      else [(rule_contextN, RuleCases.empty)]))
wenzelm@12146
   778
    |> auto_bind_goal props
wenzelm@5820
   779
    |> (if is_chain state then use_facts else reset_facts)
wenzelm@5820
   780
    |> new_block
wenzelm@5820
   781
    |> enter_backward
wenzelm@5820
   782
  end;
wenzelm@5820
   783
wenzelm@5820
   784
(*global goals*)
wenzelm@12959
   785
fun global_goal prep kind raw_locale a elems concl thy =
wenzelm@12503
   786
  let
wenzelm@12549
   787
    val init = init_state thy;
wenzelm@13399
   788
    val (opt_name, view, locale_ctxt, elems_ctxt, propp) =
skalberg@15570
   789
      prep (Option.map fst raw_locale) elems (map snd concl) (context_of init);
wenzelm@12503
   790
  in
wenzelm@12549
   791
    init
wenzelm@12549
   792
    |> open_block
wenzelm@12511
   793
    |> map_context (K locale_ctxt)
wenzelm@12065
   794
    |> open_block
wenzelm@12511
   795
    |> map_context (K elems_ctxt)
ballarin@15206
   796
(* CB: elems_ctxt is an extension of locale_ctxt, see prep_context_statement
ballarin@15206
   797
   in locale.ML, naming there: ctxt and import_ctxt. *)
wenzelm@12959
   798
    |> setup_goal I ProofContext.bind_propp_schematic_i ProofContext.fix_frees
wenzelm@13415
   799
      (Theorem {kind = kind,
wenzelm@13415
   800
        theory_spec = (a, map (snd o fst) concl),
skalberg@15570
   801
        locale_spec = (case raw_locale of NONE => NONE | SOME (_, x) => SOME (valOf opt_name, x)),
wenzelm@13415
   802
        view = view})
wenzelm@12971
   803
      Seq.single true (map (fst o fst) concl) propp
wenzelm@12065
   804
  end;
wenzelm@5820
   805
wenzelm@12534
   806
val multi_theorem = global_goal Locale.read_context_statement;
wenzelm@12534
   807
val multi_theorem_i = global_goal Locale.cert_context_statement;
wenzelm@12146
   808
wenzelm@5820
   809
wenzelm@5820
   810
(*local goals*)
wenzelm@12971
   811
fun local_goal' prepp kind (check: bool -> state -> state) f pr args int state =
wenzelm@7928
   812
  state
wenzelm@12146
   813
  |> setup_goal open_block prepp (K I) (kind (map (snd o fst) args))
wenzelm@12971
   814
    f pr (map (fst o fst) args) (map snd args)
wenzelm@10936
   815
  |> warn_extra_tfrees state
wenzelm@10936
   816
  |> check int;
wenzelm@5820
   817
wenzelm@12971
   818
fun local_goal prepp kind f pr args = local_goal' prepp kind (K I) f pr args false;
wenzelm@10936
   819
wenzelm@10936
   820
val show = local_goal' ProofContext.bind_propp Show;
wenzelm@10936
   821
val show_i = local_goal' ProofContext.bind_propp_i Show;
wenzelm@10936
   822
val have = local_goal ProofContext.bind_propp Have;
wenzelm@10380
   823
val have_i = local_goal ProofContext.bind_propp_i Have;
wenzelm@5820
   824
wenzelm@5820
   825
wenzelm@5820
   826
wenzelm@5820
   827
(** conclusions **)
wenzelm@5820
   828
wenzelm@5820
   829
(* current goal *)
wenzelm@5820
   830
skalberg@15531
   831
fun current_goal (State (Node {context, goal = SOME goal, ...}, _)) = (context, goal)
wenzelm@5820
   832
  | current_goal state = raise STATE ("No current goal!", state);
wenzelm@5820
   833
skalberg@15531
   834
fun assert_current_goal true (state as State (Node {goal = NONE, ...}, _)) =
wenzelm@6404
   835
      raise STATE ("No goal in this block!", state)
skalberg@15531
   836
  | assert_current_goal false (state as State (Node {goal = SOME _, ...}, _)) =
wenzelm@6404
   837
      raise STATE ("Goal present in this block!", state)
wenzelm@6404
   838
  | assert_current_goal _ state = state;
wenzelm@5820
   839
wenzelm@12010
   840
fun assert_bottom b (state as State (_, nodes)) =
wenzelm@12010
   841
  let val bot = (length nodes <= 2) in
wenzelm@12010
   842
    if b andalso not bot then raise STATE ("Not at bottom of proof!", state)
wenzelm@12010
   843
    else if not b andalso bot then raise STATE ("Already at bottom of proof!", state)
wenzelm@12010
   844
    else state
wenzelm@12010
   845
  end;
wenzelm@5820
   846
wenzelm@6404
   847
val at_bottom = can (assert_bottom true o close_block);
wenzelm@6404
   848
wenzelm@6932
   849
fun end_proof bot state =
wenzelm@5820
   850
  state
wenzelm@5820
   851
  |> assert_forward
wenzelm@5820
   852
  |> close_block
wenzelm@5820
   853
  |> assert_bottom bot
wenzelm@7011
   854
  |> assert_current_goal true
wenzelm@7011
   855
  |> goal_facts (K []);
wenzelm@5820
   856
wenzelm@5820
   857
wenzelm@6404
   858
(* local_qed *)
wenzelm@5820
   859
wenzelm@6982
   860
fun finish_local (print_result, print_rule) state =
wenzelm@5820
   861
  let
wenzelm@12971
   862
    val (goal_ctxt, (((kind, names, tss), (_, raw_thm)), (after_qed, pr))) = current_goal state;
wenzelm@8617
   863
    val outer_state = state |> close_block;
wenzelm@8617
   864
    val outer_ctxt = context_of outer_state;
wenzelm@8617
   865
skalberg@15570
   866
    val ts = List.concat tss;
wenzelm@12146
   867
    val results = prep_result state ts raw_thm;
wenzelm@12146
   868
    val resultq =
wenzelm@12146
   869
      results |> map (ProofContext.export false goal_ctxt outer_ctxt)
wenzelm@12146
   870
      |> Seq.commute |> Seq.map (Library.unflat tss);
wenzelm@9469
   871
wenzelm@12146
   872
    val (attss, opt_solve) =
wenzelm@5820
   873
      (case kind of
wenzelm@12971
   874
        Show attss => (attss,
wenzelm@12971
   875
          export_goals goal_ctxt (if pr then print_rule else (K (K ()))) results)
wenzelm@12146
   876
      | Have attss => (attss, Seq.single)
wenzelm@6932
   877
      | _ => err_malformed "finish_local" state);
wenzelm@5820
   878
  in
wenzelm@12971
   879
    conditional pr (fn () => print_result goal_ctxt
wenzelm@12971
   880
      (kind_name (sign_of state) kind, names ~~ Library.unflat tss results));
wenzelm@8617
   881
    outer_state
wenzelm@12549
   882
    |> auto_bind_facts (ProofContext.generalize goal_ctxt outer_ctxt ts)
wenzelm@9469
   883
    |> (fn st => Seq.map (fn res =>
wenzelm@14564
   884
      note_thmss_i ((names ~~ attss) ~~ map (single o Thm.no_attributes) res) st) resultq)
wenzelm@9469
   885
    |> (Seq.flat o Seq.map opt_solve)
wenzelm@7176
   886
    |> (Seq.flat o Seq.map after_qed)
wenzelm@5820
   887
  end;
wenzelm@5820
   888
wenzelm@6982
   889
fun local_qed finalize print state =
wenzelm@6404
   890
  state
wenzelm@6932
   891
  |> end_proof false
wenzelm@6871
   892
  |> finalize
wenzelm@6982
   893
  |> (Seq.flat o Seq.map (finish_local print));
wenzelm@5820
   894
wenzelm@5820
   895
wenzelm@12703
   896
(* global_qed *)
wenzelm@12065
   897
wenzelm@6950
   898
fun finish_global state =
wenzelm@5820
   899
  let
wenzelm@12146
   900
    val (goal_ctxt, (((kind, names, tss), (_, raw_thm)), _)) = current_goal state;
wenzelm@12065
   901
    val locale_ctxt = context_of (state |> close_block);
wenzelm@12065
   902
    val theory_ctxt = context_of (state |> close_block |> close_block);
ballarin@15206
   903
    val {kind = k, theory_spec = ((name, atts), attss), locale_spec, view = (target_view, elems_view)} =
wenzelm@13399
   904
      (case kind of Theorem x => x | _ => err_malformed "finish_global" state);
wenzelm@5820
   905
skalberg@15570
   906
    val ts = List.concat tss;
ballarin@15206
   907
    val locale_results = map (ProofContext.export_standard elems_view goal_ctxt locale_ctxt)
wenzelm@13377
   908
      (prep_result state ts raw_thm);
ballarin@14215
   909
wenzelm@13377
   910
    val results = map (Drule.strip_shyps_warning o
ballarin@15206
   911
      ProofContext.export_standard target_view locale_ctxt theory_ctxt) locale_results;
wenzelm@12703
   912
wenzelm@12959
   913
    val (theory', results') =
wenzelm@12959
   914
      theory_of state
skalberg@15531
   915
      |> (case locale_spec of NONE => I | SOME (loc, (loc_atts, loc_attss)) => fn thy =>
wenzelm@12959
   916
        if length names <> length loc_attss then
wenzelm@12959
   917
          raise THEORY ("Bad number of locale attributes", [thy])
wenzelm@13335
   918
        else (thy, locale_ctxt)
ballarin@15206
   919
          |> Locale.add_thmss loc ((names ~~ Library.unflat tss locale_results) ~~ loc_attss)
wenzelm@13335
   920
          |> (fn ((thy', ctxt'), res) =>
wenzelm@12959
   921
            if name = "" andalso null loc_atts then thy'
wenzelm@13335
   922
            else (thy', ctxt')
skalberg@15570
   923
              |> (#1 o #1 o Locale.add_thmss loc [((name, List.concat (map #2 res)), loc_atts)])))
wenzelm@14564
   924
      |> Locale.smart_note_thmss k locale_spec
wenzelm@12703
   925
        ((names ~~ attss) ~~ map (single o Thm.no_attributes) (Library.unflat tss results))
wenzelm@12959
   926
      |> (fn (thy, res) => (thy, res)
wenzelm@14564
   927
          |>> (#1 o Locale.smart_note_thmss k locale_spec
skalberg@15570
   928
            [((name, atts), [(List.concat (map #2 res), [])])]));
wenzelm@12959
   929
  in (theory', ((k, name), results')) end;
wenzelm@12959
   930
wenzelm@5820
   931
wenzelm@10553
   932
(*note: clients should inspect first result only, as backtracking may destroy theory*)
wenzelm@6950
   933
fun global_qed finalize state =
wenzelm@5820
   934
  state
wenzelm@6932
   935
  |> end_proof true
wenzelm@6871
   936
  |> finalize
wenzelm@12065
   937
  |> Seq.map finish_global;
wenzelm@5820
   938
wenzelm@5820
   939
wenzelm@6896
   940
wenzelm@6896
   941
(** blocks **)
wenzelm@6896
   942
wenzelm@6896
   943
(* begin_block *)
wenzelm@6896
   944
wenzelm@6896
   945
fun begin_block state =
wenzelm@6896
   946
  state
wenzelm@6896
   947
  |> assert_forward
wenzelm@6896
   948
  |> new_block
wenzelm@6896
   949
  |> open_block;
wenzelm@6896
   950
wenzelm@6896
   951
wenzelm@6896
   952
(* end_block *)
wenzelm@6896
   953
wenzelm@6896
   954
fun end_block state =
wenzelm@6896
   955
  state
wenzelm@6896
   956
  |> assert_forward
wenzelm@6896
   957
  |> close_block
wenzelm@6896
   958
  |> assert_current_goal false
wenzelm@6896
   959
  |> close_block
wenzelm@6932
   960
  |> transfer_facts state;
wenzelm@6896
   961
wenzelm@6896
   962
wenzelm@6896
   963
(* next_block *)
wenzelm@6896
   964
wenzelm@6896
   965
fun next_block state =
wenzelm@6896
   966
  state
wenzelm@6896
   967
  |> assert_forward
wenzelm@6896
   968
  |> close_block
wenzelm@8718
   969
  |> new_block
wenzelm@8718
   970
  |> reset_facts;
wenzelm@6896
   971
wenzelm@6896
   972
wenzelm@5820
   973
end;
wenzelm@8152
   974
wenzelm@8152
   975
structure BasicProof: BASIC_PROOF = Proof;
wenzelm@8152
   976
open BasicProof;