author | wenzelm |
Mon, 02 Nov 2009 20:57:48 +0100 | |
changeset 33389 | bb3a5fa94a91 |
parent 33386 | ff29d1549aca |
child 34239 | e18b0f7b9902 |
permissions | -rw-r--r-- |
5820 | 1 |
(* Title: Pure/Isar/proof.ML |
2 |
Author: Markus Wenzel, TU Muenchen |
|
3 |
||
19000 | 4 |
The Isar/VM proof language interpreter: maintains a structured flow of |
5 |
context elements, goals, refinements, and facts. |
|
5820 | 6 |
*) |
7 |
||
8 |
signature PROOF = |
|
9 |
sig |
|
33031
b75c35574e04
backpatching of structure Proof and ProofContext -- avoid odd aliases;
wenzelm
parents:
32856
diff
changeset
|
10 |
type context = Proof.context |
23639 | 11 |
type method = Method.method |
5820 | 12 |
type state |
17359 | 13 |
val init: context -> state |
14 |
val level: state -> int |
|
15 |
val assert_bottom: bool -> state -> state |
|
5820 | 16 |
val context_of: state -> context |
17 |
val theory_of: state -> theory |
|
13377 | 18 |
val map_context: (context -> context) -> state -> state |
28278 | 19 |
val map_contexts: (context -> context) -> state -> state |
30757
2d2076300185
replaced add_binds(_i) by bind_terms -- internal version only;
wenzelm
parents:
30557
diff
changeset
|
20 |
val bind_terms: (indexname * term option) list -> state -> state |
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset
|
21 |
val put_thms: bool -> string * thm list option -> state -> state |
6091 | 22 |
val the_facts: state -> thm list |
9469 | 23 |
val the_fact: state -> thm |
17450 | 24 |
val put_facts: thm list option -> state -> state |
6891 | 25 |
val assert_forward: state -> state |
17359 | 26 |
val assert_chain: state -> state |
9469 | 27 |
val assert_forward_or_chain: state -> state |
5820 | 28 |
val assert_backward: state -> state |
8206 | 29 |
val assert_no_chain: state -> state |
5820 | 30 |
val enter_forward: state -> state |
24543 | 31 |
val goal_message: (unit -> Pretty.T) -> state -> state |
32738 | 32 |
val show_main_goal: bool Unsynchronized.ref |
33 |
val verbose: bool Unsynchronized.ref |
|
12423 | 34 |
val pretty_state: int -> state -> Pretty.T list |
10360 | 35 |
val pretty_goals: bool -> state -> Pretty.T list |
17112 | 36 |
val refine: Method.text -> state -> state Seq.seq |
37 |
val refine_end: Method.text -> state -> state Seq.seq |
|
18908 | 38 |
val refine_insert: thm list -> state -> state |
20208 | 39 |
val goal_tac: thm -> int -> tactic |
17359 | 40 |
val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq |
33288
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
41 |
val raw_goal: state -> {context: context, facts: thm list, goal: thm} |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
42 |
val goal: state -> {context: context, facts: thm list, goal: thm} |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
43 |
val simple_goal: state -> {context: context, goal: thm} |
5936 | 44 |
val match_bind: (string list * string) list -> state -> state |
45 |
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
|
46 |
val let_bind: (string list * string) list -> state -> state |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
47 |
val let_bind_i: (term list * term) list -> state -> state |
29581 | 48 |
val fix: (binding * string option * mixfix) list -> state -> state |
49 |
val fix_i: (binding * typ option * mixfix) list -> state -> state |
|
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
50 |
val assm: Assumption.export -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
51 |
(Attrib.binding * (string * string list) list) list -> state -> state |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
52 |
val assm_i: Assumption.export -> |
30211 | 53 |
(Thm.binding * (term * term list) list) list -> state -> state |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
54 |
val assume: (Attrib.binding * (string * string list) list) list -> state -> state |
30211 | 55 |
val assume_i: (Thm.binding * (term * term list) list) list -> state -> state |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
56 |
val presume: (Attrib.binding * (string * string list) list) list -> state -> state |
30211 | 57 |
val presume_i: (Thm.binding * (term * term list) list) list -> state -> state |
58 |
val def: (Attrib.binding * ((binding * mixfix) * (string * string list))) list -> state -> state |
|
59 |
val def_i: (Thm.binding * ((binding * mixfix) * (term * term list))) list -> state -> state |
|
17359 | 60 |
val chain: state -> state |
61 |
val chain_facts: thm list -> state -> state |
|
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
62 |
val get_thmss: state -> (Facts.ref * Attrib.src list) list -> thm list |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
63 |
val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list -> state -> state |
30211 | 64 |
val note_thmss_i: (Thm.binding * (thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
65 |
val from_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 66 |
val from_thmss_i: ((thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
67 |
val with_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 68 |
val with_thmss_i: ((thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
69 |
val using: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 70 |
val using_i: ((thm list * attribute list) list) list -> state -> state |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26251
diff
changeset
|
71 |
val unfolding: ((Facts.ref * Attrib.src list) list) list -> state -> state |
18728 | 72 |
val unfolding_i: ((thm list * attribute list) list) list -> state -> state |
17112 | 73 |
val invoke_case: string * string option list * Attrib.src list -> state -> state |
18728 | 74 |
val invoke_case_i: string * string option list * attribute list -> state -> state |
17359 | 75 |
val begin_block: state -> state |
76 |
val next_block: state -> state |
|
20309 | 77 |
val end_block: state -> state |
17112 | 78 |
val proof: Method.text option -> state -> state Seq.seq |
79 |
val defer: int option -> state -> state Seq.seq |
|
80 |
val prefer: int -> state -> state Seq.seq |
|
81 |
val apply: Method.text -> state -> state Seq.seq |
|
82 |
val apply_end: Method.text -> state -> state Seq.seq |
|
17359 | 83 |
val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) -> |
18728 | 84 |
(theory -> 'a -> attribute) -> |
17359 | 85 |
(context * 'b list -> context * (term list list * (context -> context))) -> |
29383 | 86 |
string -> Method.text option -> (thm list list -> state -> state) -> |
29581 | 87 |
((binding * 'a list) * 'b) list -> state -> state |
29383 | 88 |
val local_qed: Method.text option * bool -> state -> state |
21442 | 89 |
val theorem: Method.text option -> (thm list list -> context -> context) -> |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
90 |
(string * string list) list list -> context -> state |
21442 | 91 |
val theorem_i: Method.text option -> (thm list list -> context -> context) -> |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
92 |
(term * term list) list list -> context -> state |
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
93 |
val global_qed: Method.text option * bool -> state -> context |
29383 | 94 |
val local_terminal_proof: Method.text * Method.text option -> state -> state |
95 |
val local_default_proof: state -> state |
|
96 |
val local_immediate_proof: state -> state |
|
97 |
val local_skip_proof: bool -> state -> state |
|
98 |
val local_done_proof: state -> state |
|
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
99 |
val global_terminal_proof: Method.text * Method.text option -> state -> context |
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
100 |
val global_default_proof: state -> context |
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
101 |
val global_immediate_proof: state -> context |
29383 | 102 |
val global_skip_proof: bool -> state -> context |
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
103 |
val global_done_proof: state -> context |
29383 | 104 |
val have: Method.text option -> (thm list list -> state -> state) -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
105 |
(Attrib.binding * (string * string list) list) list -> bool -> state -> state |
29383 | 106 |
val have_i: Method.text option -> (thm list list -> state -> state) -> |
30211 | 107 |
(Thm.binding * (term * term list) list) list -> bool -> state -> state |
29383 | 108 |
val show: Method.text option -> (thm list list -> state -> state) -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
109 |
(Attrib.binding * (string * string list) list) list -> bool -> state -> state |
29383 | 110 |
val show_i: Method.text option -> (thm list list -> state -> state) -> |
30211 | 111 |
(Thm.binding * (term * term list) list) list -> bool -> state -> state |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
112 |
val schematic_goal: state -> bool |
28452 | 113 |
val is_relevant: state -> bool |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
114 |
val local_future_proof: (state -> ('a * state) Future.future) -> |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
115 |
state -> 'a Future.future * state |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
116 |
val global_future_proof: (state -> ('a * Proof.context) Future.future) -> |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
117 |
state -> 'a Future.future * context |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
118 |
val local_future_terminal_proof: Method.text * Method.text option -> bool -> state -> state |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
119 |
val global_future_terminal_proof: Method.text * Method.text option -> bool -> state -> context |
5820 | 120 |
end; |
121 |
||
13377 | 122 |
structure Proof: PROOF = |
5820 | 123 |
struct |
124 |
||
33031
b75c35574e04
backpatching of structure Proof and ProofContext -- avoid odd aliases;
wenzelm
parents:
32856
diff
changeset
|
125 |
type context = Proof.context; |
17112 | 126 |
type method = Method.method; |
16813 | 127 |
|
5820 | 128 |
|
129 |
(** proof state **) |
|
130 |
||
17359 | 131 |
(* datatype state *) |
5820 | 132 |
|
17112 | 133 |
datatype mode = Forward | Chain | Backward; |
5820 | 134 |
|
17359 | 135 |
datatype state = |
136 |
State of node Stack.T |
|
137 |
and node = |
|
7176 | 138 |
Node of |
139 |
{context: context, |
|
140 |
facts: thm list option, |
|
141 |
mode: mode, |
|
17359 | 142 |
goal: goal option} |
143 |
and goal = |
|
144 |
Goal of |
|
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
145 |
{statement: (string * Position.T) * term list list * term, |
28410 | 146 |
(*goal kind and statement (starting with vars), initial proposition*) |
25958 | 147 |
messages: (unit -> Pretty.T) list, (*persistent messages (hints etc.)*) |
148 |
using: thm list, (*goal facts*) |
|
149 |
goal: thm, (*subgoals ==> statement*) |
|
17859 | 150 |
before_qed: Method.text option, |
18124 | 151 |
after_qed: |
29383 | 152 |
(thm list list -> state -> state) * |
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset
|
153 |
(thm list list -> context -> context)}; |
17359 | 154 |
|
24543 | 155 |
fun make_goal (statement, messages, using, goal, before_qed, after_qed) = |
156 |
Goal {statement = statement, messages = messages, using = using, goal = goal, |
|
17859 | 157 |
before_qed = before_qed, after_qed = after_qed}; |
5820 | 158 |
|
7176 | 159 |
fun make_node (context, facts, mode, goal) = |
160 |
Node {context = context, facts = facts, mode = mode, goal = goal}; |
|
161 |
||
17359 | 162 |
fun map_node f (Node {context, facts, mode, goal}) = |
163 |
make_node (f (context, facts, mode, goal)); |
|
5820 | 164 |
|
21727 | 165 |
val init_context = |
33165 | 166 |
ProofContext.set_stmt true #> |
167 |
ProofContext.map_naming (K ProofContext.local_naming); |
|
21727 | 168 |
|
21466
6ffb8f455b84
init: enter inner statement mode, which prevents local notes from being named internally;
wenzelm
parents:
21451
diff
changeset
|
169 |
fun init ctxt = |
21727 | 170 |
State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE))); |
5820 | 171 |
|
17359 | 172 |
fun current (State st) = Stack.top st |> (fn Node node => node); |
21274 | 173 |
fun map_current f (State st) = State (Stack.map_top (map_node f) st); |
28278 | 174 |
fun map_all f (State st) = State (Stack.map_all (map_node f) st); |
12045 | 175 |
|
5820 | 176 |
|
177 |
||
178 |
(** basic proof state operations **) |
|
179 |
||
17359 | 180 |
(* block structure *) |
181 |
||
182 |
fun open_block (State st) = State (Stack.push st); |
|
183 |
||
18678 | 184 |
fun close_block (State st) = State (Stack.pop st) |
185 |
handle Empty => error "Unbalanced block parentheses"; |
|
17359 | 186 |
|
187 |
fun level (State st) = Stack.level st; |
|
188 |
||
189 |
fun assert_bottom b state = |
|
190 |
let val b' = (level state <= 2) in |
|
18678 | 191 |
if b andalso not b' then error "Not at bottom of proof!" |
192 |
else if not b andalso b' then error "Already at bottom of proof!" |
|
17359 | 193 |
else state |
194 |
end; |
|
195 |
||
196 |
||
5820 | 197 |
(* context *) |
198 |
||
17359 | 199 |
val context_of = #context o current; |
5820 | 200 |
val theory_of = ProofContext.theory_of o context_of; |
201 |
||
17359 | 202 |
fun map_context f = |
203 |
map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); |
|
5820 | 204 |
|
17359 | 205 |
fun map_context_result f state = |
17859 | 206 |
f (context_of state) ||> (fn ctxt => map_context (K ctxt) state); |
5820 | 207 |
|
28278 | 208 |
fun map_contexts f = map_all (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); |
209 |
||
30757
2d2076300185
replaced add_binds(_i) by bind_terms -- internal version only;
wenzelm
parents:
30557
diff
changeset
|
210 |
val bind_terms = map_context o ProofContext.bind_terms; |
26251
b8c6259d366b
put_facts: do_props, i.e. facts are indexed by proposition again;
wenzelm
parents:
25958
diff
changeset
|
211 |
val put_thms = map_context oo ProofContext.put_thms; |
5820 | 212 |
|
213 |
||
214 |
(* facts *) |
|
215 |
||
17359 | 216 |
val get_facts = #facts o current; |
217 |
||
218 |
fun the_facts state = |
|
219 |
(case get_facts state of SOME facts => facts |
|
18678 | 220 |
| NONE => error "No current facts available"); |
5820 | 221 |
|
9469 | 222 |
fun the_fact state = |
17359 | 223 |
(case the_facts state of [thm] => thm |
18678 | 224 |
| _ => error "Single theorem expected"); |
7605 | 225 |
|
17359 | 226 |
fun put_facts facts = |
19078 | 227 |
map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #> |
33386 | 228 |
put_thms true (Auto_Bind.thisN, facts); |
5820 | 229 |
|
17359 | 230 |
fun these_factss more_facts (named_factss, state) = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
231 |
(named_factss, state |> put_facts (SOME (maps snd named_factss @ more_facts))); |
5820 | 232 |
|
17359 | 233 |
fun export_facts inner outer = |
234 |
(case get_facts inner of |
|
20309 | 235 |
NONE => put_facts NONE outer |
17359 | 236 |
| SOME thms => |
237 |
thms |
|
20309 | 238 |
|> ProofContext.export (context_of inner) (context_of outer) |
239 |
|> (fn ths => put_facts (SOME ths) outer)); |
|
5820 | 240 |
|
241 |
||
242 |
(* mode *) |
|
243 |
||
17359 | 244 |
val get_mode = #mode o current; |
5820 | 245 |
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal)); |
246 |
||
17359 | 247 |
val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove"); |
5820 | 248 |
|
249 |
fun assert_mode pred state = |
|
250 |
let val mode = get_mode state in |
|
251 |
if pred mode then state |
|
18678 | 252 |
else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode") |
5820 | 253 |
end; |
254 |
||
19308 | 255 |
val assert_forward = assert_mode (fn mode => mode = Forward); |
256 |
val assert_chain = assert_mode (fn mode => mode = Chain); |
|
257 |
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain); |
|
258 |
val assert_backward = assert_mode (fn mode => mode = Backward); |
|
259 |
val assert_no_chain = assert_mode (fn mode => mode <> Chain); |
|
5820 | 260 |
|
17359 | 261 |
val enter_forward = put_mode Forward; |
262 |
val enter_chain = put_mode Chain; |
|
263 |
val enter_backward = put_mode Backward; |
|
5820 | 264 |
|
17359 | 265 |
|
266 |
(* current goal *) |
|
267 |
||
268 |
fun current_goal state = |
|
269 |
(case current state of |
|
270 |
{context, goal = SOME (Goal goal), ...} => (context, goal) |
|
18678 | 271 |
| _ => error "No current goal!"); |
5820 | 272 |
|
17359 | 273 |
fun assert_current_goal g state = |
274 |
let val g' = can current_goal state in |
|
18678 | 275 |
if g andalso not g' then error "No goal in this block!" |
276 |
else if not g andalso g' then error "Goal present in this block!" |
|
17359 | 277 |
else state |
278 |
end; |
|
6776 | 279 |
|
17359 | 280 |
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal)); |
281 |
||
17859 | 282 |
val before_qed = #before_qed o #2 o current_goal; |
283 |
||
17359 | 284 |
|
285 |
(* nested goal *) |
|
5820 | 286 |
|
17359 | 287 |
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) = |
288 |
let |
|
24543 | 289 |
val Goal {statement, messages, using, goal, before_qed, after_qed} = goal; |
290 |
val goal' = make_goal (g (statement, messages, using, goal, before_qed, after_qed)); |
|
17359 | 291 |
in State (make_node (f context, facts, mode, SOME goal'), nodes) end |
292 |
| map_goal f g (State (nd, node :: nodes)) = |
|
293 |
let val State (node', nodes') = map_goal f g (State (node, nodes)) |
|
294 |
in map_context f (State (nd, node' :: nodes')) end |
|
295 |
| map_goal _ _ state = state; |
|
5820 | 296 |
|
24556 | 297 |
fun set_goal goal = map_goal I (fn (statement, _, using, _, before_qed, after_qed) => |
298 |
(statement, [], using, goal, before_qed, after_qed)); |
|
19188 | 299 |
|
24543 | 300 |
fun goal_message msg = map_goal I (fn (statement, messages, using, goal, before_qed, after_qed) => |
301 |
(statement, msg :: messages, using, goal, before_qed, after_qed)); |
|
302 |
||
24556 | 303 |
fun using_facts using = map_goal I (fn (statement, _, _, goal, before_qed, after_qed) => |
304 |
(statement, [], using, goal, before_qed, after_qed)); |
|
17359 | 305 |
|
306 |
local |
|
307 |
fun find i state = |
|
308 |
(case try current_goal state of |
|
309 |
SOME (ctxt, goal) => (ctxt, (i, goal)) |
|
18678 | 310 |
| NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present")); |
17359 | 311 |
in val find_goal = find 0 end; |
312 |
||
313 |
fun get_goal state = |
|
314 |
let val (ctxt, (_, {using, goal, ...})) = find_goal state |
|
315 |
in (ctxt, (using, goal)) end; |
|
5820 | 316 |
|
317 |
||
318 |
||
12423 | 319 |
(** pretty_state **) |
5820 | 320 |
|
32738 | 321 |
val show_main_goal = Unsynchronized.ref false; |
16539 | 322 |
val verbose = ProofContext.verbose; |
13698 | 323 |
|
15531 | 324 |
fun pretty_facts _ _ NONE = [] |
325 |
| pretty_facts s ctxt (SOME ths) = |
|
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32089
diff
changeset
|
326 |
[Pretty.big_list (s ^ "this:") (map (Display.pretty_thm ctxt) ths), Pretty.str ""]; |
6756 | 327 |
|
17359 | 328 |
fun pretty_state nr state = |
5820 | 329 |
let |
17359 | 330 |
val {context, facts, mode, goal = _} = current state; |
5820 | 331 |
|
332 |
fun levels_up 0 = "" |
|
17359 | 333 |
| levels_up 1 = "1 level up" |
334 |
| levels_up i = string_of_int i ^ " levels up"; |
|
5820 | 335 |
|
11556 | 336 |
fun subgoals 0 = "" |
17359 | 337 |
| subgoals 1 = "1 subgoal" |
338 |
| subgoals n = string_of_int n ^ " subgoals"; |
|
339 |
||
340 |
fun description strs = |
|
28375 | 341 |
(case filter_out (fn s => s = "") strs of [] => "" |
17359 | 342 |
| strs' => enclose " (" ")" (commas strs')); |
12146 | 343 |
|
29416 | 344 |
fun prt_goal (SOME (ctxt, (i, |
345 |
{statement = ((_, pos), _, _), messages, using, goal, before_qed = _, after_qed = _}))) = |
|
17359 | 346 |
pretty_facts "using " ctxt |
347 |
(if mode <> Backward orelse null using then NONE else SOME using) @ |
|
21442 | 348 |
[Pretty.str ("goal" ^ |
349 |
description [levels_up (i div 2), subgoals (Thm.nprems_of goal)] ^ ":")] @ |
|
32187 | 350 |
Goal_Display.pretty_goals ctxt |
32167
d32817dda0e6
Display_Goal.pretty_goals: always Markup.subgoal, clarified options;
wenzelm
parents:
32145
diff
changeset
|
351 |
{total = true, main = ! show_main_goal, maxgoals = ! Display.goals_limit} goal @ |
25958 | 352 |
(map (fn msg => Position.setmp_thread_data pos msg ()) (rev messages)) |
17359 | 353 |
| prt_goal NONE = []; |
6848 | 354 |
|
17359 | 355 |
val prt_ctxt = |
356 |
if ! verbose orelse mode = Forward then ProofContext.pretty_context context |
|
18670 | 357 |
else if mode = Backward then ProofContext.pretty_ctxt context |
7575 | 358 |
else []; |
17359 | 359 |
in |
360 |
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^ |
|
361 |
(if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")), |
|
362 |
Pretty.str ""] @ |
|
363 |
(if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @ |
|
364 |
(if ! verbose orelse mode = Forward then |
|
365 |
pretty_facts "" context facts @ prt_goal (try find_goal state) |
|
366 |
else if mode = Chain then pretty_facts "picking " context facts |
|
367 |
else prt_goal (try find_goal state)) |
|
368 |
end; |
|
5820 | 369 |
|
12085 | 370 |
fun pretty_goals main state = |
32167
d32817dda0e6
Display_Goal.pretty_goals: always Markup.subgoal, clarified options;
wenzelm
parents:
32145
diff
changeset
|
371 |
let val (ctxt, (_, goal)) = get_goal state in |
32187 | 372 |
Goal_Display.pretty_goals ctxt |
32167
d32817dda0e6
Display_Goal.pretty_goals: always Markup.subgoal, clarified options;
wenzelm
parents:
32145
diff
changeset
|
373 |
{total = false, main = main, maxgoals = ! Display.goals_limit} goal |
d32817dda0e6
Display_Goal.pretty_goals: always Markup.subgoal, clarified options;
wenzelm
parents:
32145
diff
changeset
|
374 |
end; |
10320 | 375 |
|
5820 | 376 |
|
377 |
||
378 |
(** proof steps **) |
|
379 |
||
17359 | 380 |
(* refine via method *) |
5820 | 381 |
|
8234 | 382 |
local |
383 |
||
16146 | 384 |
fun goalN i = "goal" ^ string_of_int i; |
385 |
fun goals st = map goalN (1 upto Thm.nprems_of st); |
|
386 |
||
387 |
fun no_goal_cases st = map (rpair NONE) (goals st); |
|
388 |
||
389 |
fun goal_cases st = |
|
33368 | 390 |
Rule_Cases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st)); |
16146 | 391 |
|
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
392 |
fun apply_method current_context meth state = |
6848 | 393 |
let |
24556 | 394 |
val (goal_ctxt, (_, {statement, messages = _, using, goal, before_qed, after_qed})) = |
24543 | 395 |
find_goal state; |
25958 | 396 |
val ctxt = if current_context then context_of state else goal_ctxt; |
16146 | 397 |
in |
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
398 |
Method.apply meth ctxt using goal |> Seq.map (fn (meth_cases, goal') => |
6848 | 399 |
state |
16146 | 400 |
|> map_goal |
18475 | 401 |
(ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #> |
402 |
ProofContext.add_cases true meth_cases) |
|
24556 | 403 |
(K (statement, [], using, goal', before_qed, after_qed))) |
16146 | 404 |
end; |
5820 | 405 |
|
19188 | 406 |
fun select_goals n meth state = |
19224 | 407 |
state |
408 |
|> (#2 o #2 o get_goal) |
|
21687 | 409 |
|> ALLGOALS Goal.conjunction_tac |
19224 | 410 |
|> Seq.maps (fn goal => |
19188 | 411 |
state |
21687 | 412 |
|> Seq.lift set_goal (Goal.extract 1 n goal |> Seq.maps (Goal.conjunction_tac 1)) |
19188 | 413 |
|> Seq.maps meth |
414 |
|> Seq.maps (fn state' => state' |
|
415 |
|> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal)) |
|
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
416 |
|> Seq.maps (apply_method true (K Method.succeed))); |
19188 | 417 |
|
17112 | 418 |
fun apply_text cc text state = |
419 |
let |
|
420 |
val thy = theory_of state; |
|
421 |
||
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
422 |
fun eval (Method.Basic m) = apply_method cc m |
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
423 |
| eval (Method.Source src) = apply_method cc (Method.method thy src) |
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
424 |
| eval (Method.Source_i src) = apply_method cc (Method.method_i thy src) |
17112 | 425 |
| eval (Method.Then txts) = Seq.EVERY (map eval txts) |
426 |
| eval (Method.Orelse txts) = Seq.FIRST (map eval txts) |
|
427 |
| eval (Method.Try txt) = Seq.TRY (eval txt) |
|
19188 | 428 |
| eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt) |
429 |
| eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt); |
|
17112 | 430 |
in eval text state end; |
431 |
||
8234 | 432 |
in |
433 |
||
17112 | 434 |
val refine = apply_text true; |
435 |
val refine_end = apply_text false; |
|
32856
92d9555ac790
clarified Proof.refine_insert -- always "refine" to apply standard method treatment (of conjunctions);
wenzelm
parents:
32786
diff
changeset
|
436 |
fun refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths))); |
18908 | 437 |
|
8234 | 438 |
end; |
439 |
||
5820 | 440 |
|
17359 | 441 |
(* refine via sub-proof *) |
442 |
||
30557
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
443 |
fun finish_tac 0 = K all_tac |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
444 |
| finish_tac n = |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
445 |
Goal.norm_hhf_tac THEN' |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
446 |
SUBGOAL (fn (goal, i) => |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
447 |
if can Logic.unprotect (Logic.strip_assums_concl goal) then |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
448 |
Tactic.etac Drule.protectI i THEN finish_tac (n - 1) i |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
449 |
else finish_tac (n - 1) (i + 1)); |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
450 |
|
20208 | 451 |
fun goal_tac rule = |
30557
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
452 |
Goal.norm_hhf_tac THEN' |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
453 |
Tactic.rtac rule THEN' |
a28d83e903ce
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm
parents:
30510
diff
changeset
|
454 |
finish_tac (Thm.nprems_of rule); |
11816 | 455 |
|
19915 | 456 |
fun refine_goals print_rule inner raw_rules state = |
457 |
let |
|
458 |
val (outer, (_, goal)) = get_goal state; |
|
20208 | 459 |
fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st); |
19915 | 460 |
in |
461 |
raw_rules |
|
20309 | 462 |
|> ProofContext.goal_export inner outer |
463 |
|> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state) |
|
19915 | 464 |
end; |
17359 | 465 |
|
6932 | 466 |
|
17359 | 467 |
(* conclude_goal *) |
6932 | 468 |
|
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
469 |
fun conclude_goal ctxt goal propss = |
5820 | 470 |
let |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
471 |
val thy = ProofContext.theory_of ctxt; |
24920 | 472 |
val string_of_term = Syntax.string_of_term ctxt; |
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32089
diff
changeset
|
473 |
val string_of_thm = Display.string_of_thm ctxt; |
5820 | 474 |
|
17359 | 475 |
val ngoals = Thm.nprems_of goal; |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
476 |
val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks |
32187 | 477 |
(Goal_Display.pretty_goals ctxt |
32167
d32817dda0e6
Display_Goal.pretty_goals: always Markup.subgoal, clarified options;
wenzelm
parents:
32145
diff
changeset
|
478 |
{total = true, main = ! show_main_goal, maxgoals = ! Display.goals_limit} goal @ |
23639 | 479 |
[Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))); |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
480 |
|
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
481 |
val extra_hyps = Assumption.extra_hyps ctxt goal; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
482 |
val _ = null extra_hyps orelse |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
483 |
error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps)); |
5820 | 484 |
|
23418 | 485 |
fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal); |
486 |
||
23782
4dd0ba632e40
Proof terms for meta-conjunctions are now normalized before
berghofe
parents:
23639
diff
changeset
|
487 |
val th = Goal.conclude |
23806 | 488 |
(if length (flat propss) > 1 then Thm.norm_proof goal else goal) |
23782
4dd0ba632e40
Proof terms for meta-conjunctions are now normalized before
berghofe
parents:
23639
diff
changeset
|
489 |
handle THM _ => lost_structure (); |
23418 | 490 |
val goal_propss = filter_out null propss; |
491 |
val results = |
|
492 |
Conjunction.elim_balanced (length goal_propss) th |
|
493 |
|> map2 Conjunction.elim_balanced (map length goal_propss) |
|
494 |
handle THM _ => lost_structure (); |
|
495 |
val _ = Unify.matches_list thy (flat goal_propss) (map Thm.prop_of (flat results)) orelse |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
496 |
error ("Proved a different theorem:\n" ^ string_of_thm th); |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
497 |
val _ = Thm.check_shyps (Variable.sorts_of ctxt) th; |
23418 | 498 |
|
499 |
fun recover_result ([] :: pss) thss = [] :: recover_result pss thss |
|
500 |
| recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss |
|
501 |
| recover_result [] [] = [] |
|
502 |
| recover_result _ _ = lost_structure (); |
|
503 |
in recover_result propss results end; |
|
5820 | 504 |
|
505 |
||
33288
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
506 |
(* goal views -- corresponding to methods *) |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
507 |
|
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
508 |
fun raw_goal state = |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
509 |
let val (ctxt, (facts, goal)) = get_goal state |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
510 |
in {context = ctxt, facts = facts, goal = goal} end; |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
511 |
|
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
512 |
val goal = raw_goal o refine_insert []; |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
513 |
|
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
514 |
fun simple_goal state = |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
515 |
let |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
516 |
val (_, (facts, _)) = get_goal state; |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
517 |
val (ctxt, (_, goal)) = get_goal (refine_insert facts state); |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
518 |
in {context = ctxt, goal = goal} end; |
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
519 |
|
bd3f30da7bc1
replaced slightly odd get_goal/flat_goal by explicit goal views that correspond to the usual method categories;
wenzelm
parents:
33165
diff
changeset
|
520 |
|
5820 | 521 |
|
522 |
(*** structured proof commands ***) |
|
523 |
||
17112 | 524 |
(** context elements **) |
5820 | 525 |
|
17112 | 526 |
(* bindings *) |
5820 | 527 |
|
16813 | 528 |
local |
529 |
||
17359 | 530 |
fun gen_bind bind args state = |
5820 | 531 |
state |
532 |
|> assert_forward |
|
18308 | 533 |
|> map_context (bind args #> snd) |
17359 | 534 |
|> put_facts NONE; |
5820 | 535 |
|
16813 | 536 |
in |
537 |
||
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
538 |
val match_bind = gen_bind (ProofContext.match_bind false); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
539 |
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
|
540 |
val let_bind = gen_bind (ProofContext.match_bind true); |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
541 |
val let_bind_i = gen_bind (ProofContext.match_bind_i true); |
5820 | 542 |
|
16813 | 543 |
end; |
544 |
||
5820 | 545 |
|
17359 | 546 |
(* fix *) |
9196 | 547 |
|
12714 | 548 |
local |
549 |
||
30763
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
550 |
fun gen_fix prep_vars args = |
17359 | 551 |
assert_forward |
30763
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
552 |
#> map_context (fn ctxt => snd (ProofContext.add_fixes (prep_vars ctxt args) ctxt)) |
17359 | 553 |
#> put_facts NONE; |
5820 | 554 |
|
16813 | 555 |
in |
556 |
||
30763
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
557 |
val fix = gen_fix (fn ctxt => fn args => fst (ProofContext.read_vars args ctxt)); |
6976521b4263
renamed ProofContext.add_fixes_i to ProofContext.add_fixes, eliminated obsolete external version;
wenzelm
parents:
30761
diff
changeset
|
558 |
val fix_i = gen_fix (K I); |
5820 | 559 |
|
16813 | 560 |
end; |
561 |
||
5820 | 562 |
|
17359 | 563 |
(* assume etc. *) |
5820 | 564 |
|
16813 | 565 |
local |
566 |
||
17112 | 567 |
fun gen_assume asm prep_att exp args state = |
5820 | 568 |
state |
569 |
|> assert_forward |
|
17112 | 570 |
|> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args)) |
17359 | 571 |
|> these_factss [] |> #2; |
6932 | 572 |
|
16813 | 573 |
in |
574 |
||
18728 | 575 |
val assm = gen_assume ProofContext.add_assms Attrib.attribute; |
18670 | 576 |
val assm_i = gen_assume ProofContext.add_assms_i (K I); |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
577 |
val assume = assm Assumption.assume_export; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
578 |
val assume_i = assm_i Assumption.assume_export; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
579 |
val presume = assm Assumption.presume_export; |
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset
|
580 |
val presume_i = assm_i Assumption.presume_export; |
5820 | 581 |
|
16813 | 582 |
end; |
583 |
||
7271 | 584 |
|
17359 | 585 |
(* def *) |
11891 | 586 |
|
16813 | 587 |
local |
588 |
||
20913 | 589 |
fun gen_def prep_att prep_vars prep_binds args state = |
11891 | 590 |
let |
591 |
val _ = assert_forward state; |
|
17112 | 592 |
val thy = theory_of state; |
11891 | 593 |
|
20913 | 594 |
val (raw_name_atts, (raw_vars, raw_rhss)) = args |> split_list ||> split_list; |
595 |
val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts; |
|
11891 | 596 |
in |
20913 | 597 |
state |
598 |
|> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars)) |
|
599 |
|>> map (fn (x, _, mx) => (x, mx)) |
|
600 |
|-> (fn vars => |
|
601 |
map_context_result (prep_binds false (map swap raw_rhss)) |
|
602 |
#-> (fn rhss => map_context_result (LocalDefs.add_defs (vars ~~ (name_atts ~~ rhss))))) |
|
603 |
|-> (put_facts o SOME o map (#2 o #2)) |
|
11891 | 604 |
end; |
605 |
||
16813 | 606 |
in |
607 |
||
20913 | 608 |
val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind; |
609 |
val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i; |
|
11891 | 610 |
|
16813 | 611 |
end; |
612 |
||
11891 | 613 |
|
8374 | 614 |
|
17112 | 615 |
(** facts **) |
5820 | 616 |
|
17359 | 617 |
(* chain *) |
5820 | 618 |
|
24011 | 619 |
fun clean_facts ctxt = |
24050 | 620 |
put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt; |
24011 | 621 |
|
17359 | 622 |
val chain = |
623 |
assert_forward |
|
24011 | 624 |
#> clean_facts |
17359 | 625 |
#> enter_chain; |
5820 | 626 |
|
17359 | 627 |
fun chain_facts facts = |
628 |
put_facts (SOME facts) |
|
629 |
#> chain; |
|
5820 | 630 |
|
631 |
||
17359 | 632 |
(* note etc. *) |
17112 | 633 |
|
28965 | 634 |
fun no_binding args = map (pair (Binding.empty, [])) args; |
17112 | 635 |
|
636 |
local |
|
637 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
638 |
fun gen_thmss more_facts opt_chain opt_result prep_atts prep_fact args state = |
17112 | 639 |
state |
640 |
|> assert_forward |
|
30761
ac7570d80c3d
renamed ProofContext.note_thmss_i to ProofContext.note_thmss, eliminated obsolete external version;
wenzelm
parents:
30760
diff
changeset
|
641 |
|> map_context_result (ProofContext.note_thmss "" |
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
642 |
(Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state)) args)) |
17112 | 643 |
|> these_factss (more_facts state) |
17359 | 644 |
||> opt_chain |
645 |
|> opt_result; |
|
17112 | 646 |
|
647 |
in |
|
648 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
649 |
val note_thmss = gen_thmss (K []) I #2 Attrib.attribute ProofContext.get_fact; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
650 |
val note_thmss_i = gen_thmss (K []) I #2 (K I) (K I); |
17112 | 651 |
|
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
652 |
val from_thmss = gen_thmss (K []) chain #2 Attrib.attribute ProofContext.get_fact o no_binding; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
653 |
val from_thmss_i = gen_thmss (K []) chain #2 (K I) (K I) o no_binding; |
17359 | 654 |
|
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
655 |
val with_thmss = gen_thmss the_facts chain #2 Attrib.attribute ProofContext.get_fact o no_binding; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
656 |
val with_thmss_i = gen_thmss the_facts chain #2 (K I) (K I) o no_binding; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
657 |
|
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
658 |
val local_results = gen_thmss (K []) I I (K I) (K I) o map (apsnd Thm.simple_fact); |
17359 | 659 |
|
28965 | 660 |
fun get_thmss state srcs = the_facts (note_thmss [((Binding.empty, []), srcs)] state); |
17112 | 661 |
|
662 |
end; |
|
663 |
||
664 |
||
18548 | 665 |
(* using/unfolding *) |
17112 | 666 |
|
667 |
local |
|
668 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
669 |
fun gen_using f g prep_atts prep_fact args state = |
17112 | 670 |
state |
671 |
|> assert_backward |
|
21442 | 672 |
|> map_context_result |
30761
ac7570d80c3d
renamed ProofContext.note_thmss_i to ProofContext.note_thmss, eliminated obsolete external version;
wenzelm
parents:
30760
diff
changeset
|
673 |
(ProofContext.note_thmss "" |
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
674 |
(Attrib.map_facts_refs (prep_atts (theory_of state)) (prep_fact (context_of state)) |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
675 |
(no_binding args))) |
18843 | 676 |
|> (fn (named_facts, state') => |
24556 | 677 |
state' |> map_goal I (fn (statement, _, using, goal, before_qed, after_qed) => |
18843 | 678 |
let |
679 |
val ctxt = context_of state'; |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
680 |
val ths = maps snd named_facts; |
24556 | 681 |
in (statement, [], f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end)); |
18548 | 682 |
|
24050 | 683 |
fun append_using _ ths using = using @ filter_out Thm.is_dummy ths; |
18878 | 684 |
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths); |
685 |
val unfold_goals = LocalDefs.unfold_goals; |
|
17112 | 686 |
|
687 |
in |
|
688 |
||
30760
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
689 |
val using = gen_using append_using (K (K I)) Attrib.attribute ProofContext.get_fact; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
690 |
val using_i = gen_using append_using (K (K I)) (K I) (K I); |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
691 |
val unfolding = gen_using unfold_using unfold_goals Attrib.attribute ProofContext.get_fact; |
0fffc66b10d7
simplified references to facts, eliminated external note_thmss;
wenzelm
parents:
30757
diff
changeset
|
692 |
val unfolding_i = gen_using unfold_using unfold_goals (K I) (K I); |
17112 | 693 |
|
694 |
end; |
|
695 |
||
696 |
||
697 |
(* case *) |
|
698 |
||
699 |
local |
|
700 |
||
30419
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
701 |
fun qualified_binding a = |
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
702 |
Binding.qualify true (Long_Name.qualifier a) (Binding.name (Long_Name.base_name a)); |
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
703 |
|
17112 | 704 |
fun gen_invoke_case prep_att (name, xs, raw_atts) state = |
705 |
let |
|
706 |
val atts = map (prep_att (theory_of state)) raw_atts; |
|
19078 | 707 |
val (asms, state') = state |> map_context_result (fn ctxt => |
708 |
ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs)); |
|
30419
c944e299eaf9
invoke_case: proper qualification of name binding, avoiding old no_base_names;
wenzelm
parents:
30279
diff
changeset
|
709 |
val assumptions = asms |> map (fn (a, ts) => ((qualified_binding a, atts), map (rpair []) ts)); |
17112 | 710 |
in |
711 |
state' |
|
712 |
|> assume_i assumptions |
|
33386 | 713 |
|> bind_terms Auto_Bind.no_facts |
28965 | 714 |
|> `the_facts |-> (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])]) |
17112 | 715 |
end; |
716 |
||
717 |
in |
|
718 |
||
18728 | 719 |
val invoke_case = gen_invoke_case Attrib.attribute; |
17112 | 720 |
val invoke_case_i = gen_invoke_case (K I); |
721 |
||
722 |
end; |
|
723 |
||
724 |
||
725 |
||
17359 | 726 |
(** proof structure **) |
727 |
||
728 |
(* blocks *) |
|
729 |
||
730 |
val begin_block = |
|
731 |
assert_forward |
|
732 |
#> open_block |
|
733 |
#> put_goal NONE |
|
734 |
#> open_block; |
|
735 |
||
736 |
val next_block = |
|
737 |
assert_forward |
|
738 |
#> close_block |
|
739 |
#> open_block |
|
740 |
#> put_goal NONE |
|
741 |
#> put_facts NONE; |
|
742 |
||
743 |
fun end_block state = |
|
744 |
state |
|
745 |
|> assert_forward |
|
746 |
|> close_block |
|
747 |
|> assert_current_goal false |
|
748 |
|> close_block |
|
749 |
|> export_facts state; |
|
750 |
||
751 |
||
752 |
(* sub-proofs *) |
|
753 |
||
754 |
fun proof opt_text = |
|
755 |
assert_backward |
|
17859 | 756 |
#> refine (the_default Method.default_text opt_text) |
17359 | 757 |
#> Seq.map (using_facts [] #> enter_forward); |
758 |
||
23360 | 759 |
fun end_proof bot txt state = |
760 |
state |
|
761 |
|> assert_forward |
|
762 |
|> assert_bottom bot |
|
763 |
|> close_block |
|
764 |
|> assert_current_goal true |
|
765 |
|> using_facts [] |
|
766 |
|> `before_qed |-> (refine o the_default Method.succeed_text) |
|
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
767 |
|> Seq.maps (refine (Method.finish_text txt)); |
17359 | 768 |
|
29383 | 769 |
fun check_result msg sq = |
770 |
(case Seq.pull sq of |
|
771 |
NONE => error msg |
|
772 |
| SOME (s, _) => s); |
|
773 |
||
774 |
fun check_finish sq = check_result "Failed to finish proof" sq; |
|
775 |
||
17359 | 776 |
|
777 |
(* unstructured refinement *) |
|
778 |
||
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
779 |
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i))); |
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
780 |
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i))); |
17359 | 781 |
|
782 |
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []); |
|
783 |
fun apply_end text = assert_forward #> refine_end text; |
|
784 |
||
785 |
||
786 |
||
17112 | 787 |
(** goals **) |
788 |
||
17359 | 789 |
(* generic goals *) |
790 |
||
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
791 |
local |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
792 |
|
19846 | 793 |
fun implicit_vars dest add props = |
794 |
let |
|
795 |
val (explicit_vars, props') = take_prefix (can dest) props |>> map dest; |
|
796 |
val vars = rev (subtract (op =) explicit_vars (fold add props [])); |
|
797 |
val _ = |
|
798 |
if null vars then () |
|
799 |
else warning ("Goal statement contains unbound schematic variable(s): " ^ |
|
800 |
commas_quote (map (Term.string_of_vname o fst) vars)); |
|
801 |
in (rev vars, props') end; |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
802 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
803 |
fun refine_terms n = |
30510
4120fc59dd85
unified type Proof.method and pervasive METHOD combinators;
wenzelm
parents:
30419
diff
changeset
|
804 |
refine (Method.Basic (K (RAW_METHOD |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
805 |
(K (HEADGOAL (PRECISE_CONJUNCTS n |
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
806 |
(HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI)))))))))) |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
807 |
#> Seq.hd; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
808 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
809 |
in |
17359 | 810 |
|
17859 | 811 |
fun generic_goal prepp kind before_qed after_qed raw_propp state = |
5820 | 812 |
let |
17359 | 813 |
val thy = theory_of state; |
23418 | 814 |
val cert = Thm.cterm_of thy; |
17359 | 815 |
val chaining = can assert_chain state; |
25958 | 816 |
val pos = Position.thread_data (); |
17359 | 817 |
|
818 |
val ((propss, after_ctxt), goal_state) = |
|
5936 | 819 |
state |
820 |
|> assert_forward_or_chain |
|
821 |
|> enter_forward |
|
17359 | 822 |
|> open_block |
17859 | 823 |
|> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp))); |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
824 |
val props = flat propss; |
15703 | 825 |
|
19846 | 826 |
val (_, props') = |
827 |
implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props; |
|
828 |
val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props'; |
|
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
829 |
|
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
830 |
val propss' = map (Logic.mk_term o Var) vars :: propss; |
23418 | 831 |
val goal_propss = filter_out null propss'; |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
832 |
val goal = |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
833 |
cert (Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss)) |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
834 |
|> Thm.weaken_sorts (Variable.sorts_of (context_of goal_state)); |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
835 |
val statement = ((kind, pos), propss', Thm.term_of goal); |
18124 | 836 |
val after_qed' = after_qed |>> (fn after_local => |
837 |
fn results => map_context after_ctxt #> after_local results); |
|
5820 | 838 |
in |
17359 | 839 |
goal_state |
21727 | 840 |
|> map_context (init_context #> Variable.set_body true) |
28410 | 841 |
|> put_goal (SOME (make_goal (statement, [], [], Goal.init goal, before_qed, after_qed'))) |
17359 | 842 |
|> map_context (ProofContext.auto_bind_goal props) |
21565 | 843 |
|> chaining ? (`the_facts #-> using_facts) |
17359 | 844 |
|> put_facts NONE |
845 |
|> open_block |
|
846 |
|> put_goal NONE |
|
5820 | 847 |
|> enter_backward |
23418 | 848 |
|> not (null vars) ? refine_terms (length goal_propss) |
32193
c314b4836031
basic method application: avoid Position.setmp_thread_data_seq, which destroys transaction context;
wenzelm
parents:
32187
diff
changeset
|
849 |
|> null props ? (refine (Method.Basic Method.assumption) #> Seq.hd) |
5820 | 850 |
end; |
851 |
||
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
852 |
fun generic_qed after_ctxt state = |
12503 | 853 |
let |
25958 | 854 |
val (goal_ctxt, {statement, goal, after_qed, ...}) = current_goal state; |
8617
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
855 |
val outer_state = state |> close_block; |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
856 |
val outer_ctxt = context_of outer_state; |
33e2bd53aec3
support Hindley-Milner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset
|
857 |
|
28410 | 858 |
val ((_, pos), stmt, _) = statement; |
18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset
|
859 |
val props = |
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
860 |
flat (tl stmt) |
19915 | 861 |
|> Variable.exportT_terms goal_ctxt outer_ctxt; |
17359 | 862 |
val results = |
28627
63663cfa297c
conclude_goal: precise goal context, include all sorts from context into statement, check shyps of result;
wenzelm
parents:
28458
diff
changeset
|
863 |
tl (conclude_goal goal_ctxt goal stmt) |
20309 | 864 |
|> burrow (ProofContext.export goal_ctxt outer_ctxt); |
25958 | 865 |
|
866 |
val (after_local, after_global) = after_qed; |
|
29383 | 867 |
fun after_local' x y = Position.setmp_thread_data pos (fn () => after_local x y) (); |
25958 | 868 |
fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) (); |
17359 | 869 |
in |
870 |
outer_state |
|
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
871 |
|> map_context (after_ctxt props) |
25958 | 872 |
|> pair ((after_local', after_global'), results) |
17359 | 873 |
end; |
874 |
||
19774
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
875 |
end; |
5fe7731d0836
allow non-trivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset
|
876 |
|
9469 | 877 |
|
17359 | 878 |
(* local goals *) |
879 |
||
17859 | 880 |
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state = |
17359 | 881 |
let |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
882 |
val thy = theory_of state; |
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
883 |
val ((names, attss), propp) = |
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
884 |
Attrib.map_specs (prep_att thy) stmt |> split_list |>> split_list; |
17359 | 885 |
|
18124 | 886 |
fun after_qed' results = |
18808 | 887 |
local_results ((names ~~ attss) ~~ results) |
17359 | 888 |
#-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit)) |
18124 | 889 |
#> after_qed results; |
5820 | 890 |
in |
17359 | 891 |
state |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
892 |
|> generic_goal prepp kind before_qed (after_qed', K I) propp |
19900
21a99d88d925
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19862
diff
changeset
|
893 |
|> tap (Variable.warn_extra_tfrees (context_of state) o context_of) |
5820 | 894 |
end; |
895 |
||
29383 | 896 |
fun local_qeds txt = |
897 |
end_proof false txt |
|
898 |
#> Seq.map (generic_qed ProofContext.auto_bind_facts #-> |
|
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
899 |
(fn ((after_qed, _), results) => after_qed results)); |
5820 | 900 |
|
29383 | 901 |
fun local_qed txt = local_qeds txt #> check_finish; |
902 |
||
5820 | 903 |
|
17359 | 904 |
(* global goals *) |
905 |
||
21442 | 906 |
fun global_goal prepp before_qed after_qed propp ctxt = |
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
907 |
init ctxt |
29383 | 908 |
|> generic_goal (prepp #> ProofContext.auto_fixes) "" before_qed (K I, after_qed) propp; |
17359 | 909 |
|
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
910 |
val theorem = global_goal ProofContext.bind_propp_schematic; |
3a2ab1dce297
simplified Proof.theorem(_i) interface -- removed target support;
wenzelm
parents:
21274
diff
changeset
|
911 |
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; |
12065 | 912 |
|
17359 | 913 |
fun global_qeds txt = |
914 |
end_proof true txt |
|
29090
bbfac5fd8d78
global_qed: refrain from ProofContext.auto_bind_facts, to avoid
wenzelm
parents:
28981
diff
changeset
|
915 |
#> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) => |
29383 | 916 |
after_qed results (context_of state))); |
17112 | 917 |
|
29383 | 918 |
fun global_qed txt = global_qeds txt #> check_finish; |
12959 | 919 |
|
5820 | 920 |
|
17359 | 921 |
(* concluding steps *) |
17112 | 922 |
|
29383 | 923 |
fun terminal_proof qed initial terminal = |
924 |
proof (SOME initial) #> Seq.maps (qed terminal) #> check_finish; |
|
17112 | 925 |
|
29383 | 926 |
fun local_terminal_proof (text, opt_text) = terminal_proof local_qeds text (opt_text, true); |
17112 | 927 |
val local_default_proof = local_terminal_proof (Method.default_text, NONE); |
928 |
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); |
|
17359 | 929 |
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); |
29383 | 930 |
val local_done_proof = terminal_proof local_qeds Method.done_text (NONE, false); |
17112 | 931 |
|
29383 | 932 |
fun global_terminal_proof (text, opt_text) = terminal_proof global_qeds text (opt_text, true); |
17112 | 933 |
val global_default_proof = global_terminal_proof (Method.default_text, NONE); |
934 |
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); |
|
17359 | 935 |
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); |
29383 | 936 |
val global_done_proof = terminal_proof global_qeds Method.done_text (NONE, false); |
5820 | 937 |
|
6896 | 938 |
|
17359 | 939 |
(* common goal statements *) |
940 |
||
941 |
local |
|
942 |
||
17859 | 943 |
fun gen_have prep_att prepp before_qed after_qed stmt int = |
33389 | 944 |
local_goal (Proof_Display.print_results int) prep_att prepp "have" before_qed after_qed stmt; |
6896 | 945 |
|
17859 | 946 |
fun gen_show prep_att prepp before_qed after_qed stmt int state = |
17359 | 947 |
let |
32738 | 948 |
val testing = Unsynchronized.ref false; |
949 |
val rule = Unsynchronized.ref (NONE: thm option); |
|
17359 | 950 |
fun fail_msg ctxt = |
29383 | 951 |
"Local statement will fail to refine any pending goal" :: |
33389 | 952 |
(case ! rule of NONE => [] | SOME th => [Proof_Display.string_of_rule ctxt "Failed" th]) |
17359 | 953 |
|> cat_lines; |
6896 | 954 |
|
17359 | 955 |
fun print_results ctxt res = |
33389 | 956 |
if ! testing then () else Proof_Display.print_results int ctxt res; |
17359 | 957 |
fun print_rule ctxt th = |
958 |
if ! testing then rule := SOME th |
|
33389 | 959 |
else if int then priority (Proof_Display.string_of_rule ctxt "Successful" th) |
17359 | 960 |
else (); |
961 |
val test_proof = |
|
29383 | 962 |
try (local_skip_proof true) |
28289 | 963 |
|> setmp_noncritical testing true |
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset
|
964 |
|> Exn.capture; |
6896 | 965 |
|
18124 | 966 |
fun after_qed' results = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset
|
967 |
refine_goals print_rule (context_of state) (flat results) |
29383 | 968 |
#> check_result "Failed to refine any pending goal" |
969 |
#> after_qed results; |
|
17359 | 970 |
in |
971 |
state |
|
17859 | 972 |
|> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt |
21565 | 973 |
|> int ? (fn goal_state => |
17359 | 974 |
(case test_proof goal_state of |
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset
|
975 |
Exn.Result (SOME _) => goal_state |
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23806
diff
changeset
|
976 |
| Exn.Result NONE => error (fail_msg (context_of goal_state)) |
28443 | 977 |
| Exn.Exn Exn.Interrupt => raise Exn.Interrupt |
28458 | 978 |
| Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))]))) |
17359 | 979 |
end; |
980 |
||
981 |
in |
|
982 |
||
18728 | 983 |
val have = gen_have Attrib.attribute ProofContext.bind_propp; |
17359 | 984 |
val have_i = gen_have (K I) ProofContext.bind_propp_i; |
18728 | 985 |
val show = gen_show Attrib.attribute ProofContext.bind_propp; |
17359 | 986 |
val show_i = gen_show (K I) ProofContext.bind_propp_i; |
6896 | 987 |
|
5820 | 988 |
end; |
17359 | 989 |
|
28410 | 990 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
991 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
992 |
(** future proofs **) |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
993 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
994 |
(* relevant proof states *) |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
995 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
996 |
fun is_schematic t = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
997 |
Term.exists_subterm Term.is_Var t orelse |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
998 |
Term.exists_type (Term.exists_subtype Term.is_TVar) t; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
999 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1000 |
fun schematic_goal state = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1001 |
let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1002 |
in is_schematic prop end; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1003 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1004 |
fun is_relevant state = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1005 |
(case try find_goal state of |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1006 |
NONE => true |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1007 |
| SOME (_, (_, {statement = (_, _, prop), goal, ...})) => |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1008 |
is_schematic prop orelse not (Logic.protect prop aconv Thm.concl_of goal)); |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1009 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1010 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1011 |
(* full proofs *) |
28410 | 1012 |
|
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1013 |
local |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1014 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1015 |
fun future_proof done get_context fork_proof state = |
28410 | 1016 |
let |
29381
45d77aeb1608
future_terminal_proof: no fork for interactive mode, assert_backward;
wenzelm
parents:
29364
diff
changeset
|
1017 |
val _ = assert_backward state; |
28410 | 1018 |
val (goal_ctxt, (_, goal)) = find_goal state; |
32786 | 1019 |
val {statement as (kind, _, prop), messages, using, goal, before_qed, after_qed} = goal; |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1020 |
val goal_txt = prop :: map Thm.term_of (Assumption.all_assms_of goal_ctxt); |
28410 | 1021 |
|
29383 | 1022 |
val _ = is_relevant state andalso error "Cannot fork relevant proof"; |
1023 |
||
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1024 |
val prop' = Logic.protect prop; |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1025 |
val statement' = (kind, [[], [prop']], prop'); |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1026 |
val goal' = Thm.adjust_maxidx_thm (Thm.maxidx_of goal) |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1027 |
(Drule.comp_no_flatten (goal, Thm.nprems_of goal) 1 Drule.protectI); |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1028 |
|
33386 | 1029 |
fun after_local' [[th]] = put_thms false (Auto_Bind.thisN, SOME [th]); |
1030 |
fun after_global' [[th]] = ProofContext.put_thms false (Auto_Bind.thisN, SOME [th]); |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1031 |
val after_qed' = (after_local', after_global'); |
33386 | 1032 |
val this_name = ProofContext.full_name goal_ctxt (Binding.name Auto_Bind.thisN); |
28410 | 1033 |
|
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1034 |
val result_ctxt = |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1035 |
state |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1036 |
|> map_contexts (fold Variable.declare_term goal_txt) |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1037 |
|> map_goal I (K (statement', messages, using, goal', before_qed, after_qed')) |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1038 |
|> fork_proof; |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1039 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1040 |
val future_thm = result_ctxt |> Future.map (fn (_, x) => |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1041 |
ProofContext.get_fact_single (get_context x) (Facts.named this_name)); |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1042 |
val finished_goal = Goal.future_result goal_ctxt future_thm prop'; |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1043 |
val state' = |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1044 |
state |
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1045 |
|> map_goal I (K (statement, messages, using, finished_goal, NONE, after_qed)) |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1046 |
|> done; |
28973
c549650d1442
future proofs: pass actual futures to facilitate composite computations;
wenzelm
parents:
28627
diff
changeset
|
1047 |
in (Future.map #1 result_ctxt, state') end; |
28410 | 1048 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1049 |
in |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1050 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1051 |
fun local_future_proof x = future_proof local_done_proof context_of x; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1052 |
fun global_future_proof x = future_proof global_done_proof I x; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1053 |
|
17359 | 1054 |
end; |
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1055 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1056 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1057 |
(* terminal proofs *) |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1058 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1059 |
local |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1060 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1061 |
fun future_terminal_proof proof1 proof2 meths int state = |
32061
11f8ee55662d
parallel_proofs: more fine-grained control with optional parallel checking of nested Isar proofs;
wenzelm
parents:
32058
diff
changeset
|
1062 |
if int orelse is_relevant state orelse not (Goal.local_future_enabled ()) |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1063 |
then proof1 meths state |
32062
457f5bcd3d76
Proof.future_proof: declare all assumptions as well;
wenzelm
parents:
32061
diff
changeset
|
1064 |
else snd (proof2 (fn state' => Future.fork_pri ~1 (fn () => ((), proof1 meths state'))) state); |
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1065 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1066 |
in |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1067 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1068 |
fun local_future_terminal_proof x = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1069 |
future_terminal_proof local_terminal_proof local_future_proof x; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1070 |
|
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1071 |
fun global_future_terminal_proof x = |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1072 |
future_terminal_proof global_terminal_proof global_future_proof x; |
29350 | 1073 |
|
29346
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1074 |
end; |
fe6843aa4f5f
more precise is_relevant: requires original main goal, not initial goal state;
wenzelm
parents:
29090
diff
changeset
|
1075 |
|
29385
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1076 |
end; |
c96b91bab2e6
future_proof: refined version covers local_future_proof and global_future_proof;
wenzelm
parents:
29383
diff
changeset
|
1077 |