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