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