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