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