wenzelm@5820
|
1 |
(* Title: Pure/Isar/proof.ML
|
wenzelm@5820
|
2 |
ID: $Id$
|
wenzelm@5820
|
3 |
Author: Markus Wenzel, TU Muenchen
|
wenzelm@5820
|
4 |
|
wenzelm@19000
|
5 |
The Isar/VM proof language interpreter: maintains a structured flow of
|
wenzelm@19000
|
6 |
context elements, goals, refinements, and facts.
|
wenzelm@5820
|
7 |
*)
|
wenzelm@5820
|
8 |
|
wenzelm@5820
|
9 |
signature PROOF =
|
wenzelm@5820
|
10 |
sig
|
wenzelm@17756
|
11 |
type context (*= Context.proof*)
|
wenzelm@17756
|
12 |
type method (*= Method.method*)
|
wenzelm@5820
|
13 |
type state
|
wenzelm@17359
|
14 |
val init: context -> state
|
wenzelm@17359
|
15 |
val level: state -> int
|
wenzelm@17359
|
16 |
val assert_bottom: bool -> state -> state
|
wenzelm@5820
|
17 |
val context_of: state -> context
|
wenzelm@5820
|
18 |
val theory_of: state -> theory
|
wenzelm@16450
|
19 |
val sign_of: state -> theory (*obsolete*)
|
wenzelm@13377
|
20 |
val map_context: (context -> context) -> state -> state
|
wenzelm@17976
|
21 |
val add_binds_i: (indexname * term option) list -> state -> state
|
wenzelm@19078
|
22 |
val put_thms: bool -> string * thm list option -> state -> state
|
wenzelm@19078
|
23 |
val put_thms_internal: string * thm list option -> state -> state
|
wenzelm@6091
|
24 |
val the_facts: state -> thm list
|
wenzelm@9469
|
25 |
val the_fact: state -> thm
|
wenzelm@17450
|
26 |
val put_facts: thm list option -> state -> state
|
wenzelm@6891
|
27 |
val assert_forward: state -> state
|
wenzelm@17359
|
28 |
val assert_chain: state -> state
|
wenzelm@9469
|
29 |
val assert_forward_or_chain: state -> state
|
wenzelm@5820
|
30 |
val assert_backward: state -> state
|
wenzelm@8206
|
31 |
val assert_no_chain: state -> state
|
wenzelm@5820
|
32 |
val enter_forward: state -> state
|
wenzelm@17359
|
33 |
val get_goal: state -> context * (thm list * thm)
|
wenzelm@19995
|
34 |
val schematic_goal: state -> bool
|
wenzelm@16539
|
35 |
val show_main_goal: bool ref
|
wenzelm@6529
|
36 |
val verbose: bool ref
|
wenzelm@12423
|
37 |
val pretty_state: int -> state -> Pretty.T list
|
wenzelm@10360
|
38 |
val pretty_goals: bool -> state -> Pretty.T list
|
wenzelm@17112
|
39 |
val refine: Method.text -> state -> state Seq.seq
|
wenzelm@17112
|
40 |
val refine_end: Method.text -> state -> state Seq.seq
|
wenzelm@18908
|
41 |
val refine_insert: thm list -> state -> state
|
wenzelm@20208
|
42 |
val goal_tac: thm -> int -> tactic
|
wenzelm@17359
|
43 |
val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq
|
wenzelm@5936
|
44 |
val match_bind: (string list * string) list -> state -> state
|
wenzelm@5936
|
45 |
val match_bind_i: (term list * term) list -> state -> state
|
wenzelm@8617
|
46 |
val let_bind: (string list * string) list -> state -> state
|
wenzelm@8617
|
47 |
val let_bind_i: (term list * term) list -> state -> state
|
wenzelm@19846
|
48 |
val fix: (string * string option * mixfix) list -> state -> state
|
wenzelm@19846
|
49 |
val fix_i: (string * typ option * mixfix) list -> state -> state
|
wenzelm@20224
|
50 |
val assm: Assumption.export ->
|
wenzelm@19585
|
51 |
((string * Attrib.src list) * (string * string list) list) list -> state -> state
|
wenzelm@20224
|
52 |
val assm_i: Assumption.export ->
|
wenzelm@19585
|
53 |
((string * attribute list) * (term * term list) list) list -> state -> state
|
wenzelm@19585
|
54 |
val assume: ((string * Attrib.src list) * (string * string list) list) list -> state -> state
|
wenzelm@19585
|
55 |
val assume_i: ((string * attribute list) * (term * term list) list) list -> state -> state
|
wenzelm@19585
|
56 |
val presume: ((string * Attrib.src list) * (string * string list) list) list -> state -> state
|
wenzelm@19585
|
57 |
val presume_i: ((string * attribute list) * (term * term list) list) list -> state -> state
|
wenzelm@19846
|
58 |
val def: ((string * Attrib.src list) *
|
wenzelm@19846
|
59 |
((string * mixfix) * (string * string list))) list -> state -> state
|
wenzelm@19846
|
60 |
val def_i: ((string * attribute list) *
|
wenzelm@19846
|
61 |
((string * mixfix) * (term * term list))) list -> state -> state
|
wenzelm@17359
|
62 |
val chain: state -> state
|
wenzelm@17359
|
63 |
val chain_facts: thm list -> state -> state
|
wenzelm@17359
|
64 |
val get_thmss: state -> (thmref * Attrib.src list) list -> thm list
|
wenzelm@14564
|
65 |
val simple_note_thms: string -> thm list -> state -> state
|
wenzelm@17359
|
66 |
val note_thmss: ((string * Attrib.src list) *
|
wenzelm@17112
|
67 |
(thmref * Attrib.src list) list) list -> state -> state
|
wenzelm@18728
|
68 |
val note_thmss_i: ((string * attribute list) *
|
wenzelm@18728
|
69 |
(thm list * attribute list) list) list -> state -> state
|
wenzelm@17112
|
70 |
val from_thmss: ((thmref * Attrib.src list) list) list -> state -> state
|
wenzelm@18728
|
71 |
val from_thmss_i: ((thm list * attribute list) list) list -> state -> state
|
wenzelm@17112
|
72 |
val with_thmss: ((thmref * Attrib.src list) list) list -> state -> state
|
wenzelm@18728
|
73 |
val with_thmss_i: ((thm list * attribute list) list) list -> state -> state
|
wenzelm@18548
|
74 |
val using: ((thmref * Attrib.src list) list) list -> state -> state
|
wenzelm@18728
|
75 |
val using_i: ((thm list * attribute list) list) list -> state -> state
|
wenzelm@18548
|
76 |
val unfolding: ((thmref * Attrib.src list) list) list -> state -> state
|
wenzelm@18728
|
77 |
val unfolding_i: ((thm list * attribute list) list) list -> state -> state
|
wenzelm@17112
|
78 |
val invoke_case: string * string option list * Attrib.src list -> state -> state
|
wenzelm@18728
|
79 |
val invoke_case_i: string * string option list * attribute list -> state -> state
|
wenzelm@17359
|
80 |
val begin_block: state -> state
|
wenzelm@17359
|
81 |
val next_block: state -> state
|
wenzelm@20309
|
82 |
val end_block: state -> state
|
wenzelm@17112
|
83 |
val proof: Method.text option -> state -> state Seq.seq
|
wenzelm@17112
|
84 |
val defer: int option -> state -> state Seq.seq
|
wenzelm@17112
|
85 |
val prefer: int -> state -> state Seq.seq
|
wenzelm@17112
|
86 |
val apply: Method.text -> state -> state Seq.seq
|
wenzelm@17112
|
87 |
val apply_end: Method.text -> state -> state Seq.seq
|
wenzelm@17359
|
88 |
val goal_names: string option -> string -> string list -> string
|
wenzelm@17359
|
89 |
val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
|
wenzelm@18728
|
90 |
(theory -> 'a -> attribute) ->
|
wenzelm@17359
|
91 |
(context * 'b list -> context * (term list list * (context -> context))) ->
|
wenzelm@18124
|
92 |
string -> Method.text option -> (thm list list -> state -> state Seq.seq) ->
|
wenzelm@17359
|
93 |
((string * 'a list) * 'b) list -> state -> state
|
wenzelm@17359
|
94 |
val local_qed: Method.text option * bool -> state -> state Seq.seq
|
wenzelm@17359
|
95 |
val global_goal: (context -> (string * string) * (string * thm list) list -> unit) ->
|
wenzelm@18728
|
96 |
(theory -> 'a -> attribute) ->
|
wenzelm@17450
|
97 |
(context * 'b list -> context * (term list list * (context -> context))) ->
|
wenzelm@18124
|
98 |
string -> Method.text option -> (thm list list -> theory -> theory) ->
|
wenzelm@17859
|
99 |
string option -> string * 'a list -> ((string * 'a list) * 'b) list -> context -> state
|
wenzelm@18808
|
100 |
val global_qed: Method.text option * bool -> state -> context * theory
|
wenzelm@17359
|
101 |
val local_terminal_proof: Method.text * Method.text option -> state -> state Seq.seq
|
wenzelm@17359
|
102 |
val local_default_proof: state -> state Seq.seq
|
wenzelm@17359
|
103 |
val local_immediate_proof: state -> state Seq.seq
|
wenzelm@17359
|
104 |
val local_done_proof: state -> state Seq.seq
|
wenzelm@17359
|
105 |
val local_skip_proof: bool -> state -> state Seq.seq
|
wenzelm@18808
|
106 |
val global_terminal_proof: Method.text * Method.text option -> state -> context * theory
|
wenzelm@18808
|
107 |
val global_default_proof: state -> context * theory
|
wenzelm@18808
|
108 |
val global_immediate_proof: state -> context * theory
|
wenzelm@18808
|
109 |
val global_done_proof: state -> context * theory
|
wenzelm@18808
|
110 |
val global_skip_proof: bool -> state -> context * theory
|
wenzelm@18124
|
111 |
val have: Method.text option -> (thm list list -> state -> state Seq.seq) ->
|
wenzelm@19585
|
112 |
((string * Attrib.src list) * (string * string list) list) list -> bool -> state -> state
|
wenzelm@18124
|
113 |
val have_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
|
wenzelm@19585
|
114 |
((string * attribute list) * (term * term list) list) list -> bool -> state -> state
|
wenzelm@18124
|
115 |
val show: Method.text option -> (thm list list -> state -> state Seq.seq) ->
|
wenzelm@19585
|
116 |
((string * Attrib.src list) * (string * string list) list) list -> bool -> state -> state
|
wenzelm@18124
|
117 |
val show_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
|
wenzelm@19585
|
118 |
((string * attribute list) * (term * term list) list) list -> bool -> state -> state
|
wenzelm@18124
|
119 |
val theorem: string -> Method.text option -> (thm list list -> theory -> theory) ->
|
wenzelm@17359
|
120 |
string option -> string * Attrib.src list ->
|
wenzelm@19585
|
121 |
((string * Attrib.src list) * (string * string list) list) list -> context -> state
|
wenzelm@18124
|
122 |
val theorem_i: string -> Method.text option -> (thm list list -> theory -> theory) ->
|
wenzelm@18728
|
123 |
string option -> string * attribute list ->
|
wenzelm@19585
|
124 |
((string * attribute list) * (term * term list) list) list -> context -> state
|
wenzelm@5820
|
125 |
end;
|
wenzelm@5820
|
126 |
|
wenzelm@13377
|
127 |
structure Proof: PROOF =
|
wenzelm@5820
|
128 |
struct
|
wenzelm@5820
|
129 |
|
wenzelm@20309
|
130 |
type context = Context.proof;
|
wenzelm@17112
|
131 |
type method = Method.method;
|
wenzelm@16813
|
132 |
|
wenzelm@5820
|
133 |
|
wenzelm@5820
|
134 |
(** proof state **)
|
wenzelm@5820
|
135 |
|
wenzelm@17359
|
136 |
(* datatype state *)
|
wenzelm@5820
|
137 |
|
wenzelm@17112
|
138 |
datatype mode = Forward | Chain | Backward;
|
wenzelm@5820
|
139 |
|
wenzelm@17359
|
140 |
datatype state =
|
wenzelm@17359
|
141 |
State of node Stack.T
|
wenzelm@17359
|
142 |
and node =
|
wenzelm@7176
|
143 |
Node of
|
wenzelm@7176
|
144 |
{context: context,
|
wenzelm@7176
|
145 |
facts: thm list option,
|
wenzelm@7176
|
146 |
mode: mode,
|
wenzelm@17359
|
147 |
goal: goal option}
|
wenzelm@17359
|
148 |
and goal =
|
wenzelm@17359
|
149 |
Goal of
|
wenzelm@19774
|
150 |
{statement: string * term list list, (*goal kind and statement, starting with vars*)
|
wenzelm@17359
|
151 |
using: thm list, (*goal facts*)
|
wenzelm@17359
|
152 |
goal: thm, (*subgoals ==> statement*)
|
wenzelm@17859
|
153 |
before_qed: Method.text option,
|
wenzelm@18124
|
154 |
after_qed:
|
wenzelm@18124
|
155 |
(thm list list -> state -> state Seq.seq) *
|
wenzelm@18124
|
156 |
(thm list list -> theory -> theory)};
|
wenzelm@17359
|
157 |
|
wenzelm@17859
|
158 |
fun make_goal (statement, using, goal, before_qed, after_qed) =
|
wenzelm@17859
|
159 |
Goal {statement = statement, using = using, goal = goal,
|
wenzelm@17859
|
160 |
before_qed = before_qed, after_qed = after_qed};
|
wenzelm@5820
|
161 |
|
wenzelm@7176
|
162 |
fun make_node (context, facts, mode, goal) =
|
wenzelm@7176
|
163 |
Node {context = context, facts = facts, mode = mode, goal = goal};
|
wenzelm@7176
|
164 |
|
wenzelm@17359
|
165 |
fun map_node f (Node {context, facts, mode, goal}) =
|
wenzelm@17359
|
166 |
make_node (f (context, facts, mode, goal));
|
wenzelm@7176
|
167 |
|
wenzelm@17359
|
168 |
fun init ctxt = State (Stack.init (make_node (ctxt, NONE, Forward, NONE)));
|
wenzelm@5820
|
169 |
|
wenzelm@17359
|
170 |
fun current (State st) = Stack.top st |> (fn Node node => node);
|
wenzelm@17359
|
171 |
fun map_current f (State st) = State (Stack.map (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@16450
|
198 |
val sign_of = theory_of;
|
wenzelm@5820
|
199 |
|
wenzelm@17359
|
200 |
fun map_context f =
|
wenzelm@17359
|
201 |
map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
|
wenzelm@5820
|
202 |
|
wenzelm@17359
|
203 |
fun map_context_result f state =
|
wenzelm@17859
|
204 |
f (context_of state) ||> (fn ctxt => map_context (K ctxt) state);
|
wenzelm@5820
|
205 |
|
wenzelm@10809
|
206 |
val add_binds_i = map_context o ProofContext.add_binds_i;
|
wenzelm@19078
|
207 |
val put_thms = map_context oo ProofContext.put_thms;
|
wenzelm@19078
|
208 |
val put_thms_internal = map_context o ProofContext.put_thms_internal;
|
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@19078
|
225 |
put_thms_internal (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@17859
|
286 |
val Goal {statement, using, goal, before_qed, after_qed} = goal;
|
wenzelm@17859
|
287 |
val goal' = make_goal (g (statement, 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@19188
|
294 |
fun set_goal goal = map_goal I (fn (statement, using, _, before_qed, after_qed) =>
|
wenzelm@19188
|
295 |
(statement, using, goal, before_qed, after_qed));
|
wenzelm@19188
|
296 |
|
wenzelm@17859
|
297 |
fun using_facts using = map_goal I (fn (statement, _, goal, before_qed, after_qed) =>
|
wenzelm@17859
|
298 |
(statement, using, goal, before_qed, after_qed));
|
wenzelm@17359
|
299 |
|
wenzelm@17359
|
300 |
local
|
wenzelm@17359
|
301 |
fun find i state =
|
wenzelm@17359
|
302 |
(case try current_goal state of
|
wenzelm@17359
|
303 |
SOME (ctxt, goal) => (ctxt, (i, goal))
|
wenzelm@18678
|
304 |
| NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present"));
|
wenzelm@17359
|
305 |
in val find_goal = find 0 end;
|
wenzelm@17359
|
306 |
|
wenzelm@17359
|
307 |
fun get_goal state =
|
wenzelm@17359
|
308 |
let val (ctxt, (_, {using, goal, ...})) = find_goal state
|
wenzelm@17359
|
309 |
in (ctxt, (using, goal)) end;
|
wenzelm@5820
|
310 |
|
wenzelm@19995
|
311 |
fun schematic_goal state =
|
wenzelm@19995
|
312 |
let
|
wenzelm@19995
|
313 |
val (_, (_, {statement = (_, propss), ...})) = find_goal state;
|
wenzelm@19995
|
314 |
val tvars = fold (fold Term.add_tvars) propss [];
|
wenzelm@19995
|
315 |
val vars = fold (fold Term.add_vars) propss [];
|
wenzelm@19995
|
316 |
in not (null tvars andalso null vars) end;
|
wenzelm@19995
|
317 |
|
wenzelm@5820
|
318 |
|
wenzelm@5820
|
319 |
|
wenzelm@12423
|
320 |
(** pretty_state **)
|
wenzelm@5820
|
321 |
|
nipkow@13869
|
322 |
val show_main_goal = ref false;
|
wenzelm@16539
|
323 |
val verbose = ProofContext.verbose;
|
nipkow@13698
|
324 |
|
wenzelm@14876
|
325 |
val pretty_goals_local = Display.pretty_goals_aux o ProofContext.pp;
|
wenzelm@12085
|
326 |
|
skalberg@15531
|
327 |
fun pretty_facts _ _ NONE = []
|
skalberg@15531
|
328 |
| pretty_facts s ctxt (SOME ths) =
|
wenzelm@12055
|
329 |
[Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""];
|
wenzelm@6756
|
330 |
|
wenzelm@17359
|
331 |
fun pretty_state nr state =
|
wenzelm@5820
|
332 |
let
|
wenzelm@17359
|
333 |
val {context, facts, mode, goal = _} = current state;
|
wenzelm@17359
|
334 |
val ref (_, _, bg) = Display.current_goals_markers;
|
wenzelm@5820
|
335 |
|
wenzelm@5820
|
336 |
fun levels_up 0 = ""
|
wenzelm@17359
|
337 |
| levels_up 1 = "1 level up"
|
wenzelm@17359
|
338 |
| levels_up i = string_of_int i ^ " levels up";
|
wenzelm@5820
|
339 |
|
wenzelm@11556
|
340 |
fun subgoals 0 = ""
|
wenzelm@17359
|
341 |
| subgoals 1 = "1 subgoal"
|
wenzelm@17359
|
342 |
| subgoals n = string_of_int n ^ " subgoals";
|
wenzelm@12146
|
343 |
|
wenzelm@17359
|
344 |
fun description strs =
|
wenzelm@17359
|
345 |
(case filter_out (equal "") strs of [] => ""
|
wenzelm@17359
|
346 |
| strs' => enclose " (" ")" (commas strs'));
|
wenzelm@12146
|
347 |
|
wenzelm@17859
|
348 |
fun prt_goal (SOME (ctxt, (i, {statement = (kind, _), using, goal, before_qed, after_qed}))) =
|
wenzelm@17359
|
349 |
pretty_facts "using " ctxt
|
wenzelm@17359
|
350 |
(if mode <> Backward orelse null using then NONE else SOME using) @
|
wenzelm@17359
|
351 |
[Pretty.str ("goal" ^ description [kind, levels_up (i div 2),
|
wenzelm@17359
|
352 |
subgoals (Thm.nprems_of goal)] ^ ":")] @
|
wenzelm@17359
|
353 |
pretty_goals_local ctxt bg (true, ! show_main_goal) (! Display.goals_limit) goal
|
wenzelm@17359
|
354 |
| prt_goal NONE = [];
|
wenzelm@6848
|
355 |
|
wenzelm@17359
|
356 |
val prt_ctxt =
|
wenzelm@17359
|
357 |
if ! verbose orelse mode = Forward then ProofContext.pretty_context context
|
wenzelm@18670
|
358 |
else if mode = Backward then ProofContext.pretty_ctxt context
|
wenzelm@7575
|
359 |
else [];
|
wenzelm@17359
|
360 |
in
|
wenzelm@17359
|
361 |
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
|
wenzelm@17359
|
362 |
(if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")),
|
wenzelm@17359
|
363 |
Pretty.str ""] @
|
wenzelm@17359
|
364 |
(if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @
|
wenzelm@17359
|
365 |
(if ! verbose orelse mode = Forward then
|
wenzelm@17359
|
366 |
pretty_facts "" context facts @ prt_goal (try find_goal state)
|
wenzelm@17359
|
367 |
else if mode = Chain then pretty_facts "picking " context facts
|
wenzelm@17359
|
368 |
else prt_goal (try find_goal state))
|
wenzelm@17359
|
369 |
end;
|
wenzelm@5820
|
370 |
|
wenzelm@12085
|
371 |
fun pretty_goals main state =
|
wenzelm@19188
|
372 |
let val (ctxt, (_, goal)) = get_goal state
|
wenzelm@17359
|
373 |
in pretty_goals_local ctxt "" (false, main) (! Display.goals_limit) goal end;
|
wenzelm@10320
|
374 |
|
wenzelm@5820
|
375 |
|
wenzelm@5820
|
376 |
|
wenzelm@5820
|
377 |
(** proof steps **)
|
wenzelm@5820
|
378 |
|
wenzelm@17359
|
379 |
(* refine via method *)
|
wenzelm@5820
|
380 |
|
wenzelm@8234
|
381 |
local
|
wenzelm@8234
|
382 |
|
wenzelm@16146
|
383 |
fun goalN i = "goal" ^ string_of_int i;
|
wenzelm@16146
|
384 |
fun goals st = map goalN (1 upto Thm.nprems_of st);
|
wenzelm@16146
|
385 |
|
wenzelm@16146
|
386 |
fun no_goal_cases st = map (rpair NONE) (goals st);
|
wenzelm@16146
|
387 |
|
wenzelm@16146
|
388 |
fun goal_cases st =
|
wenzelm@18607
|
389 |
RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st));
|
wenzelm@16146
|
390 |
|
wenzelm@16450
|
391 |
fun check_theory thy state =
|
wenzelm@16450
|
392 |
if subthy (thy, theory_of state) then state
|
wenzelm@18678
|
393 |
else error ("Bad theory of method result: " ^ Context.str_of_thy thy);
|
wenzelm@5820
|
394 |
|
wenzelm@17112
|
395 |
fun apply_method current_context meth_fun state =
|
wenzelm@6848
|
396 |
let
|
wenzelm@17859
|
397 |
val (goal_ctxt, (_, {statement, using, goal, before_qed, after_qed})) = find_goal state;
|
wenzelm@17112
|
398 |
val meth = meth_fun (if current_context then context_of state else goal_ctxt);
|
wenzelm@16146
|
399 |
in
|
wenzelm@18228
|
400 |
Method.apply meth using goal |> Seq.map (fn (meth_cases, goal') =>
|
wenzelm@6848
|
401 |
state
|
wenzelm@17359
|
402 |
|> check_theory (Thm.theory_of_thm goal')
|
wenzelm@16146
|
403 |
|> map_goal
|
wenzelm@18475
|
404 |
(ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #>
|
wenzelm@18475
|
405 |
ProofContext.add_cases true meth_cases)
|
wenzelm@17859
|
406 |
(K (statement, using, goal', before_qed, after_qed)))
|
wenzelm@16146
|
407 |
end;
|
wenzelm@5820
|
408 |
|
wenzelm@19188
|
409 |
fun select_goals n meth state =
|
wenzelm@19224
|
410 |
state
|
wenzelm@19224
|
411 |
|> (#2 o #2 o get_goal)
|
wenzelm@19224
|
412 |
|> ALLGOALS Tactic.conjunction_tac
|
wenzelm@19224
|
413 |
|> Seq.maps (fn goal =>
|
wenzelm@19188
|
414 |
state
|
wenzelm@19224
|
415 |
|> Seq.lift set_goal (Goal.extract 1 n goal |> Seq.maps (Tactic.conjunction_tac 1))
|
wenzelm@19188
|
416 |
|> Seq.maps meth
|
wenzelm@19188
|
417 |
|> Seq.maps (fn state' => state'
|
wenzelm@19188
|
418 |
|> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal))
|
wenzelm@19224
|
419 |
|> Seq.maps (apply_method true (K Method.succeed)));
|
wenzelm@19188
|
420 |
|
wenzelm@17112
|
421 |
fun apply_text cc text state =
|
wenzelm@17112
|
422 |
let
|
wenzelm@17112
|
423 |
val thy = theory_of state;
|
wenzelm@17112
|
424 |
|
wenzelm@17112
|
425 |
fun eval (Method.Basic m) = apply_method cc m
|
wenzelm@17112
|
426 |
| eval (Method.Source src) = apply_method cc (Method.method thy src)
|
wenzelm@20031
|
427 |
| eval (Method.Source_i src) = apply_method cc (Method.method_i thy src)
|
wenzelm@17112
|
428 |
| eval (Method.Then txts) = Seq.EVERY (map eval txts)
|
wenzelm@17112
|
429 |
| eval (Method.Orelse txts) = Seq.FIRST (map eval txts)
|
wenzelm@17112
|
430 |
| eval (Method.Try txt) = Seq.TRY (eval txt)
|
wenzelm@19188
|
431 |
| eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt)
|
wenzelm@19188
|
432 |
| eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt);
|
wenzelm@17112
|
433 |
in eval text state end;
|
wenzelm@17112
|
434 |
|
wenzelm@8234
|
435 |
in
|
wenzelm@8234
|
436 |
|
wenzelm@17112
|
437 |
val refine = apply_text true;
|
wenzelm@17112
|
438 |
val refine_end = apply_text false;
|
wenzelm@8234
|
439 |
|
wenzelm@18908
|
440 |
fun refine_insert [] = I
|
wenzelm@18908
|
441 |
| refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths)));
|
wenzelm@18908
|
442 |
|
wenzelm@8234
|
443 |
end;
|
wenzelm@8234
|
444 |
|
wenzelm@5820
|
445 |
|
wenzelm@17359
|
446 |
(* refine via sub-proof *)
|
wenzelm@17359
|
447 |
|
wenzelm@20208
|
448 |
fun goal_tac rule =
|
wenzelm@18186
|
449 |
Tactic.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW
|
wenzelm@18186
|
450 |
(Tactic.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) =>
|
wenzelm@18186
|
451 |
if can Logic.unprotect (Logic.strip_assums_concl goal) then
|
wenzelm@18186
|
452 |
Tactic.etac Drule.protectI i
|
wenzelm@18186
|
453 |
else all_tac)));
|
wenzelm@11816
|
454 |
|
wenzelm@19915
|
455 |
fun refine_goals print_rule inner raw_rules state =
|
wenzelm@19915
|
456 |
let
|
wenzelm@19915
|
457 |
val (outer, (_, goal)) = get_goal state;
|
wenzelm@20208
|
458 |
fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st);
|
wenzelm@19915
|
459 |
in
|
wenzelm@19915
|
460 |
raw_rules
|
wenzelm@20309
|
461 |
|> ProofContext.goal_export inner outer
|
wenzelm@20309
|
462 |
|> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state)
|
wenzelm@19915
|
463 |
end;
|
wenzelm@6932
|
464 |
|
wenzelm@6932
|
465 |
|
wenzelm@17359
|
466 |
(* conclude_goal *)
|
wenzelm@17359
|
467 |
|
wenzelm@18503
|
468 |
fun conclude_goal state goal propss =
|
wenzelm@5820
|
469 |
let
|
wenzelm@19774
|
470 |
val thy = theory_of state;
|
wenzelm@5820
|
471 |
val ctxt = context_of state;
|
wenzelm@19774
|
472 |
val string_of_term = ProofContext.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@17359
|
477 |
(pretty_goals_local ctxt "" (true, ! show_main_goal) (! Display.goals_limit) goal @
|
wenzelm@19774
|
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@19774
|
484 |
val (results, th) = `(Conjunction.elim_precise (map length propss)) (Goal.conclude goal)
|
wenzelm@19774
|
485 |
handle THM _ => error ("Lost goal structure:\n" ^ string_of_thm goal);
|
wenzelm@19862
|
486 |
val _ = Unify.matches_list thy (flat propss) (map Thm.prop_of (flat results)) orelse
|
wenzelm@19774
|
487 |
error ("Proved a different theorem:\n" ^ string_of_thm th);
|
wenzelm@19774
|
488 |
in results end;
|
wenzelm@5820
|
489 |
|
wenzelm@5820
|
490 |
|
wenzelm@5820
|
491 |
|
wenzelm@5820
|
492 |
(*** structured proof commands ***)
|
wenzelm@5820
|
493 |
|
wenzelm@17112
|
494 |
(** context elements **)
|
wenzelm@5820
|
495 |
|
wenzelm@17112
|
496 |
(* bindings *)
|
wenzelm@5820
|
497 |
|
wenzelm@16813
|
498 |
local
|
wenzelm@16813
|
499 |
|
wenzelm@17359
|
500 |
fun gen_bind bind args state =
|
wenzelm@5820
|
501 |
state
|
wenzelm@5820
|
502 |
|> assert_forward
|
wenzelm@18308
|
503 |
|> map_context (bind args #> snd)
|
wenzelm@17359
|
504 |
|> put_facts NONE;
|
wenzelm@5820
|
505 |
|
wenzelm@16813
|
506 |
in
|
wenzelm@16813
|
507 |
|
wenzelm@8617
|
508 |
val match_bind = gen_bind (ProofContext.match_bind false);
|
wenzelm@8617
|
509 |
val match_bind_i = gen_bind (ProofContext.match_bind_i false);
|
wenzelm@8617
|
510 |
val let_bind = gen_bind (ProofContext.match_bind true);
|
wenzelm@8617
|
511 |
val let_bind_i = gen_bind (ProofContext.match_bind_i true);
|
wenzelm@5820
|
512 |
|
wenzelm@16813
|
513 |
end;
|
wenzelm@16813
|
514 |
|
wenzelm@5820
|
515 |
|
wenzelm@17359
|
516 |
(* fix *)
|
wenzelm@5820
|
517 |
|
wenzelm@12714
|
518 |
local
|
wenzelm@12714
|
519 |
|
wenzelm@18670
|
520 |
fun gen_fix add_fixes args =
|
wenzelm@17359
|
521 |
assert_forward
|
wenzelm@19846
|
522 |
#> map_context (snd o add_fixes args)
|
wenzelm@17359
|
523 |
#> put_facts NONE;
|
wenzelm@5820
|
524 |
|
wenzelm@16813
|
525 |
in
|
wenzelm@16813
|
526 |
|
wenzelm@18670
|
527 |
val fix = gen_fix ProofContext.add_fixes;
|
wenzelm@18670
|
528 |
val fix_i = gen_fix ProofContext.add_fixes_i;
|
wenzelm@5820
|
529 |
|
wenzelm@16813
|
530 |
end;
|
wenzelm@16813
|
531 |
|
wenzelm@5820
|
532 |
|
wenzelm@17359
|
533 |
(* assume etc. *)
|
wenzelm@5820
|
534 |
|
wenzelm@16813
|
535 |
local
|
wenzelm@16813
|
536 |
|
wenzelm@17112
|
537 |
fun gen_assume asm prep_att exp args state =
|
wenzelm@5820
|
538 |
state
|
wenzelm@5820
|
539 |
|> assert_forward
|
wenzelm@17112
|
540 |
|> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args))
|
wenzelm@17359
|
541 |
|> these_factss [] |> #2;
|
wenzelm@6932
|
542 |
|
wenzelm@16813
|
543 |
in
|
wenzelm@16813
|
544 |
|
wenzelm@18728
|
545 |
val assm = gen_assume ProofContext.add_assms Attrib.attribute;
|
wenzelm@18670
|
546 |
val assm_i = gen_assume ProofContext.add_assms_i (K I);
|
wenzelm@20224
|
547 |
val assume = assm Assumption.assume_export;
|
wenzelm@20224
|
548 |
val assume_i = assm_i Assumption.assume_export;
|
wenzelm@20224
|
549 |
val presume = assm Assumption.presume_export;
|
wenzelm@20224
|
550 |
val presume_i = assm_i Assumption.presume_export;
|
wenzelm@5820
|
551 |
|
wenzelm@16813
|
552 |
end;
|
wenzelm@16813
|
553 |
|
wenzelm@7271
|
554 |
|
wenzelm@17359
|
555 |
(* def *)
|
wenzelm@11891
|
556 |
|
wenzelm@16813
|
557 |
local
|
wenzelm@16813
|
558 |
|
wenzelm@19846
|
559 |
fun gen_def gen_fix prep_att prep_binds args state =
|
wenzelm@11891
|
560 |
let
|
wenzelm@11891
|
561 |
val _ = assert_forward state;
|
wenzelm@17112
|
562 |
val thy = theory_of state;
|
wenzelm@11891
|
563 |
|
wenzelm@19846
|
564 |
val ((raw_names, raw_atts), (vars, raw_rhss)) =
|
wenzelm@19846
|
565 |
args |> split_list |>> split_list ||> split_list;
|
wenzelm@19846
|
566 |
val xs = map #1 vars;
|
wenzelm@18308
|
567 |
val names = map (fn ("", x) => Thm.def_name x | (name, _) => name) (raw_names ~~ xs);
|
wenzelm@18308
|
568 |
val atts = map (map (prep_att thy)) raw_atts;
|
wenzelm@18308
|
569 |
val (rhss, state') = state |> map_context_result (prep_binds false (map swap raw_rhss));
|
wenzelm@18826
|
570 |
val eqs = LocalDefs.mk_def (context_of state') (xs ~~ rhss);
|
wenzelm@11891
|
571 |
in
|
wenzelm@18308
|
572 |
state'
|
wenzelm@19846
|
573 |
|> gen_fix (map (fn (x, mx) => (x, NONE, mx)) vars)
|
wenzelm@19585
|
574 |
|> assm_i LocalDefs.def_export ((names ~~ atts) ~~ map (fn eq => [(eq, [])]) eqs)
|
wenzelm@11891
|
575 |
end;
|
wenzelm@11891
|
576 |
|
wenzelm@16813
|
577 |
in
|
wenzelm@16813
|
578 |
|
wenzelm@18728
|
579 |
val def = gen_def fix Attrib.attribute ProofContext.match_bind;
|
wenzelm@18308
|
580 |
val def_i = gen_def fix_i (K I) ProofContext.match_bind_i;
|
wenzelm@11891
|
581 |
|
wenzelm@16813
|
582 |
end;
|
wenzelm@16813
|
583 |
|
wenzelm@11891
|
584 |
|
wenzelm@8374
|
585 |
|
wenzelm@17112
|
586 |
(** facts **)
|
wenzelm@5820
|
587 |
|
wenzelm@17359
|
588 |
(* chain *)
|
wenzelm@5820
|
589 |
|
wenzelm@17359
|
590 |
val chain =
|
wenzelm@17359
|
591 |
assert_forward
|
wenzelm@17359
|
592 |
#> tap the_facts
|
wenzelm@17359
|
593 |
#> enter_chain;
|
wenzelm@5820
|
594 |
|
wenzelm@17359
|
595 |
fun chain_facts facts =
|
wenzelm@17359
|
596 |
put_facts (SOME facts)
|
wenzelm@17359
|
597 |
#> chain;
|
wenzelm@5820
|
598 |
|
wenzelm@5820
|
599 |
|
wenzelm@17359
|
600 |
(* note etc. *)
|
wenzelm@17112
|
601 |
|
wenzelm@17166
|
602 |
fun no_binding args = map (pair ("", [])) args;
|
wenzelm@17112
|
603 |
|
wenzelm@17112
|
604 |
local
|
wenzelm@17112
|
605 |
|
wenzelm@17359
|
606 |
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state =
|
wenzelm@17112
|
607 |
state
|
wenzelm@17112
|
608 |
|> assert_forward
|
wenzelm@17112
|
609 |
|> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args))
|
wenzelm@17112
|
610 |
|> these_factss (more_facts state)
|
wenzelm@17359
|
611 |
||> opt_chain
|
wenzelm@17359
|
612 |
|> opt_result;
|
wenzelm@17112
|
613 |
|
wenzelm@17112
|
614 |
in
|
wenzelm@17112
|
615 |
|
wenzelm@18728
|
616 |
val note_thmss = gen_thmss ProofContext.note_thmss (K []) I #2 Attrib.attribute;
|
wenzelm@17359
|
617 |
val note_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) I #2 (K I);
|
wenzelm@17112
|
618 |
|
wenzelm@17112
|
619 |
val from_thmss =
|
wenzelm@18728
|
620 |
gen_thmss ProofContext.note_thmss (K []) chain #2 Attrib.attribute o no_binding;
|
wenzelm@17359
|
621 |
val from_thmss_i = gen_thmss ProofContext.note_thmss_i (K []) chain #2 (K I) o no_binding;
|
wenzelm@17112
|
622 |
|
wenzelm@17112
|
623 |
val with_thmss =
|
wenzelm@18728
|
624 |
gen_thmss ProofContext.note_thmss the_facts chain #2 Attrib.attribute o no_binding;
|
wenzelm@17359
|
625 |
val with_thmss_i = gen_thmss ProofContext.note_thmss_i the_facts chain #2 (K I) o no_binding;
|
wenzelm@17359
|
626 |
|
wenzelm@18808
|
627 |
val local_results =
|
wenzelm@18808
|
628 |
gen_thmss ProofContext.note_thmss_i (K []) I I (K I) o map (apsnd Thm.simple_fact);
|
wenzelm@18808
|
629 |
fun global_results kind = PureThy.note_thmss_i kind o map (apsnd Thm.simple_fact);
|
wenzelm@17359
|
630 |
|
wenzelm@17359
|
631 |
fun get_thmss state srcs = the_facts (note_thmss [(("", []), srcs)] state);
|
wenzelm@17359
|
632 |
fun simple_note_thms name thms = note_thmss_i [((name, []), [(thms, [])])];
|
wenzelm@17112
|
633 |
|
wenzelm@17112
|
634 |
end;
|
wenzelm@17112
|
635 |
|
wenzelm@17112
|
636 |
|
wenzelm@18548
|
637 |
(* using/unfolding *)
|
wenzelm@17112
|
638 |
|
wenzelm@17112
|
639 |
local
|
wenzelm@17112
|
640 |
|
wenzelm@18548
|
641 |
fun gen_using f g note prep_atts args state =
|
wenzelm@17112
|
642 |
state
|
wenzelm@17112
|
643 |
|> assert_backward
|
wenzelm@17166
|
644 |
|> map_context_result (note (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args)))
|
wenzelm@18843
|
645 |
|> (fn (named_facts, state') =>
|
wenzelm@18843
|
646 |
state' |> map_goal I (fn (statement, using, goal, before_qed, after_qed) =>
|
wenzelm@18843
|
647 |
let
|
wenzelm@18843
|
648 |
val ctxt = context_of state';
|
wenzelm@19482
|
649 |
val ths = maps snd named_facts;
|
wenzelm@18843
|
650 |
in (statement, f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end));
|
wenzelm@18548
|
651 |
|
wenzelm@18843
|
652 |
fun append_using _ ths using = using @ ths;
|
wenzelm@18878
|
653 |
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths);
|
wenzelm@18878
|
654 |
val unfold_goals = LocalDefs.unfold_goals;
|
wenzelm@17112
|
655 |
|
wenzelm@17112
|
656 |
in
|
wenzelm@17112
|
657 |
|
wenzelm@18843
|
658 |
val using = gen_using append_using (K (K I)) ProofContext.note_thmss Attrib.attribute;
|
wenzelm@18843
|
659 |
val using_i = gen_using append_using (K (K I)) ProofContext.note_thmss_i (K I);
|
wenzelm@18826
|
660 |
val unfolding = gen_using unfold_using unfold_goals ProofContext.note_thmss Attrib.attribute;
|
wenzelm@18826
|
661 |
val unfolding_i = gen_using unfold_using unfold_goals ProofContext.note_thmss_i (K I);
|
wenzelm@17112
|
662 |
|
wenzelm@17112
|
663 |
end;
|
wenzelm@17112
|
664 |
|
wenzelm@17112
|
665 |
|
wenzelm@17112
|
666 |
(* case *)
|
wenzelm@17112
|
667 |
|
wenzelm@17112
|
668 |
local
|
wenzelm@17112
|
669 |
|
wenzelm@17112
|
670 |
fun gen_invoke_case prep_att (name, xs, raw_atts) state =
|
wenzelm@17112
|
671 |
let
|
wenzelm@17112
|
672 |
val atts = map (prep_att (theory_of state)) raw_atts;
|
wenzelm@19078
|
673 |
val (asms, state') = state |> map_context_result (fn ctxt =>
|
wenzelm@19078
|
674 |
ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs));
|
wenzelm@19585
|
675 |
val assumptions = asms |> map (fn (a, ts) => ((a, atts), map (rpair []) ts));
|
wenzelm@17112
|
676 |
in
|
wenzelm@17112
|
677 |
state'
|
wenzelm@17359
|
678 |
|> map_context (ProofContext.qualified_names #> ProofContext.no_base_names)
|
wenzelm@17112
|
679 |
|> assume_i assumptions
|
wenzelm@17976
|
680 |
|> add_binds_i AutoBind.no_facts
|
wenzelm@17112
|
681 |
|> map_context (ProofContext.restore_naming (context_of state))
|
wenzelm@17112
|
682 |
|> `the_facts |-> simple_note_thms name
|
wenzelm@17112
|
683 |
end;
|
wenzelm@17112
|
684 |
|
wenzelm@17112
|
685 |
in
|
wenzelm@17112
|
686 |
|
wenzelm@18728
|
687 |
val invoke_case = gen_invoke_case Attrib.attribute;
|
wenzelm@17112
|
688 |
val invoke_case_i = gen_invoke_case (K I);
|
wenzelm@17112
|
689 |
|
wenzelm@17112
|
690 |
end;
|
wenzelm@17112
|
691 |
|
wenzelm@17112
|
692 |
|
wenzelm@17112
|
693 |
|
wenzelm@17359
|
694 |
(** proof structure **)
|
wenzelm@17359
|
695 |
|
wenzelm@17359
|
696 |
(* blocks *)
|
wenzelm@17359
|
697 |
|
wenzelm@17359
|
698 |
val begin_block =
|
wenzelm@17359
|
699 |
assert_forward
|
wenzelm@17359
|
700 |
#> open_block
|
wenzelm@17359
|
701 |
#> put_goal NONE
|
wenzelm@17359
|
702 |
#> open_block;
|
wenzelm@17359
|
703 |
|
wenzelm@17359
|
704 |
val next_block =
|
wenzelm@17359
|
705 |
assert_forward
|
wenzelm@17359
|
706 |
#> close_block
|
wenzelm@17359
|
707 |
#> open_block
|
wenzelm@17359
|
708 |
#> put_goal NONE
|
wenzelm@17359
|
709 |
#> put_facts NONE;
|
wenzelm@17359
|
710 |
|
wenzelm@17359
|
711 |
fun end_block state =
|
wenzelm@17359
|
712 |
state
|
wenzelm@17359
|
713 |
|> assert_forward
|
wenzelm@17359
|
714 |
|> close_block
|
wenzelm@17359
|
715 |
|> assert_current_goal false
|
wenzelm@17359
|
716 |
|> close_block
|
wenzelm@17359
|
717 |
|> export_facts state;
|
wenzelm@17359
|
718 |
|
wenzelm@17359
|
719 |
|
wenzelm@17359
|
720 |
(* sub-proofs *)
|
wenzelm@17359
|
721 |
|
wenzelm@17359
|
722 |
fun proof opt_text =
|
wenzelm@17359
|
723 |
assert_backward
|
wenzelm@17859
|
724 |
#> refine (the_default Method.default_text opt_text)
|
wenzelm@17359
|
725 |
#> Seq.map (using_facts [] #> enter_forward);
|
wenzelm@17359
|
726 |
|
wenzelm@17359
|
727 |
fun end_proof bot txt =
|
wenzelm@17359
|
728 |
assert_forward
|
wenzelm@17359
|
729 |
#> assert_bottom bot
|
wenzelm@17359
|
730 |
#> close_block
|
wenzelm@17359
|
731 |
#> assert_current_goal true
|
wenzelm@17359
|
732 |
#> using_facts []
|
wenzelm@17859
|
733 |
#> `before_qed #-> (refine o the_default Method.succeed_text)
|
wenzelm@17859
|
734 |
#> Seq.maps (refine (Method.finish_text txt));
|
wenzelm@17359
|
735 |
|
wenzelm@17359
|
736 |
|
wenzelm@17359
|
737 |
(* unstructured refinement *)
|
wenzelm@17359
|
738 |
|
wenzelm@17359
|
739 |
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i)));
|
wenzelm@17359
|
740 |
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i)));
|
wenzelm@17359
|
741 |
|
wenzelm@17359
|
742 |
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
|
wenzelm@17359
|
743 |
fun apply_end text = assert_forward #> refine_end text;
|
wenzelm@17359
|
744 |
|
wenzelm@17359
|
745 |
|
wenzelm@17359
|
746 |
|
wenzelm@17112
|
747 |
(** goals **)
|
wenzelm@17112
|
748 |
|
wenzelm@17359
|
749 |
(* goal names *)
|
wenzelm@5820
|
750 |
|
wenzelm@17359
|
751 |
fun prep_names prep_att stmt =
|
wenzelm@17359
|
752 |
let
|
wenzelm@17359
|
753 |
val (names_attss, propp) = split_list (Attrib.map_specs prep_att stmt);
|
wenzelm@17359
|
754 |
val (names, attss) = split_list names_attss;
|
wenzelm@17359
|
755 |
in ((names, attss), propp) end;
|
wenzelm@16813
|
756 |
|
wenzelm@17359
|
757 |
fun goal_names target name names =
|
wenzelm@17450
|
758 |
(case target of NONE => "" | SOME "" => "" | SOME loc => " (in " ^ loc ^ ")") ^
|
wenzelm@17359
|
759 |
(if name = "" then "" else " " ^ name) ^
|
wenzelm@17359
|
760 |
(case filter_out (equal "") names of [] => ""
|
wenzelm@17359
|
761 |
| nms => " " ^ enclose "(" ")" (space_implode " and " (Library.take (7, nms) @
|
wenzelm@17359
|
762 |
(if length nms > 7 then ["..."] else []))));
|
wenzelm@8991
|
763 |
|
wenzelm@17359
|
764 |
|
wenzelm@17359
|
765 |
(* generic goals *)
|
wenzelm@17359
|
766 |
|
wenzelm@19774
|
767 |
local
|
wenzelm@17359
|
768 |
|
wenzelm@19846
|
769 |
fun implicit_vars dest add props =
|
wenzelm@19846
|
770 |
let
|
wenzelm@19846
|
771 |
val (explicit_vars, props') = take_prefix (can dest) props |>> map dest;
|
wenzelm@19846
|
772 |
val vars = rev (subtract (op =) explicit_vars (fold add props []));
|
wenzelm@19846
|
773 |
val _ =
|
wenzelm@19846
|
774 |
if null vars then ()
|
wenzelm@19846
|
775 |
else warning ("Goal statement contains unbound schematic variable(s): " ^
|
wenzelm@19846
|
776 |
commas_quote (map (Term.string_of_vname o fst) vars));
|
wenzelm@19846
|
777 |
in (rev vars, props') end;
|
wenzelm@19774
|
778 |
|
wenzelm@19774
|
779 |
fun refine_terms n =
|
wenzelm@19774
|
780 |
refine (Method.Basic (K (Method.RAW_METHOD
|
wenzelm@19774
|
781 |
(K (HEADGOAL (PRECISE_CONJUNCTS n
|
wenzelm@19774
|
782 |
(HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI))))))))))
|
wenzelm@19774
|
783 |
#> Seq.hd;
|
wenzelm@19774
|
784 |
|
wenzelm@19774
|
785 |
in
|
wenzelm@17359
|
786 |
|
wenzelm@17859
|
787 |
fun generic_goal prepp kind before_qed after_qed raw_propp state =
|
wenzelm@5936
|
788 |
let
|
wenzelm@17359
|
789 |
val thy = theory_of state;
|
wenzelm@17359
|
790 |
val chaining = can assert_chain state;
|
wenzelm@17359
|
791 |
|
wenzelm@17359
|
792 |
val ((propss, after_ctxt), goal_state) =
|
wenzelm@5936
|
793 |
state
|
wenzelm@5936
|
794 |
|> assert_forward_or_chain
|
wenzelm@5936
|
795 |
|> enter_forward
|
wenzelm@17359
|
796 |
|> open_block
|
wenzelm@17859
|
797 |
|> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp)));
|
wenzelm@19482
|
798 |
val props = flat propss;
|
wenzelm@15703
|
799 |
|
wenzelm@19846
|
800 |
val (_, props') =
|
wenzelm@19846
|
801 |
implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props;
|
wenzelm@19846
|
802 |
val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props';
|
wenzelm@19774
|
803 |
|
wenzelm@19774
|
804 |
val propss' = map (Logic.mk_term o Var) vars :: propss;
|
wenzelm@19774
|
805 |
val goal = Goal.init (Thm.cterm_of thy (Logic.mk_conjunction_list2 propss'));
|
wenzelm@18124
|
806 |
val after_qed' = after_qed |>> (fn after_local =>
|
wenzelm@18124
|
807 |
fn results => map_context after_ctxt #> after_local results);
|
wenzelm@5820
|
808 |
in
|
wenzelm@17359
|
809 |
goal_state
|
wenzelm@19900
|
810 |
|> map_context (Variable.set_body true)
|
wenzelm@19774
|
811 |
|> put_goal (SOME (make_goal ((kind, propss'), [], goal, before_qed, after_qed')))
|
wenzelm@18475
|
812 |
|> map_context (ProofContext.add_cases false (AutoBind.cases thy props))
|
wenzelm@17359
|
813 |
|> map_context (ProofContext.auto_bind_goal props)
|
wenzelm@17359
|
814 |
|> K chaining ? (`the_facts #-> using_facts)
|
wenzelm@17359
|
815 |
|> put_facts NONE
|
wenzelm@17359
|
816 |
|> open_block
|
wenzelm@17359
|
817 |
|> put_goal NONE
|
wenzelm@5820
|
818 |
|> enter_backward
|
wenzelm@19774
|
819 |
|> K (not (null vars)) ? refine_terms (length propss')
|
wenzelm@17450
|
820 |
|> K (null props) ? (refine (Method.Basic Method.assumption) #> Seq.hd)
|
wenzelm@5820
|
821 |
end;
|
wenzelm@5820
|
822 |
|
wenzelm@17359
|
823 |
fun generic_qed state =
|
wenzelm@12503
|
824 |
let
|
wenzelm@18548
|
825 |
val (goal_ctxt, {statement = (_, stmt), using = _, goal, before_qed = _, after_qed}) =
|
wenzelm@17859
|
826 |
current_goal state;
|
wenzelm@8617
|
827 |
val outer_state = state |> close_block;
|
wenzelm@8617
|
828 |
val outer_ctxt = context_of outer_state;
|
wenzelm@8617
|
829 |
|
wenzelm@18503
|
830 |
val props =
|
wenzelm@19774
|
831 |
flat (tl stmt)
|
wenzelm@19915
|
832 |
|> Variable.exportT_terms goal_ctxt outer_ctxt;
|
wenzelm@17359
|
833 |
val results =
|
wenzelm@19774
|
834 |
tl (conclude_goal state goal stmt)
|
wenzelm@20309
|
835 |
|> burrow (ProofContext.export goal_ctxt outer_ctxt);
|
wenzelm@5820
|
836 |
in
|
wenzelm@8617
|
837 |
outer_state
|
wenzelm@17359
|
838 |
|> map_context (ProofContext.auto_bind_facts props)
|
wenzelm@18124
|
839 |
|> pair (after_qed, results)
|
wenzelm@5820
|
840 |
end;
|
wenzelm@5820
|
841 |
|
wenzelm@19774
|
842 |
end;
|
wenzelm@19774
|
843 |
|
wenzelm@5820
|
844 |
|
wenzelm@17359
|
845 |
(* local goals *)
|
wenzelm@5820
|
846 |
|
wenzelm@17859
|
847 |
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state =
|
wenzelm@17359
|
848 |
let
|
wenzelm@17359
|
849 |
val ((names, attss), propp) = prep_names (prep_att (theory_of state)) stmt;
|
wenzelm@17359
|
850 |
|
wenzelm@18124
|
851 |
fun after_qed' results =
|
wenzelm@18808
|
852 |
local_results ((names ~~ attss) ~~ results)
|
wenzelm@17359
|
853 |
#-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
|
wenzelm@18124
|
854 |
#> after_qed results;
|
wenzelm@17359
|
855 |
in
|
wenzelm@17359
|
856 |
state
|
wenzelm@18124
|
857 |
|> generic_goal prepp (kind ^ goal_names NONE "" names) before_qed (after_qed', K I) propp
|
wenzelm@19900
|
858 |
|> tap (Variable.warn_extra_tfrees (context_of state) o context_of)
|
wenzelm@17359
|
859 |
end;
|
wenzelm@17359
|
860 |
|
wenzelm@17359
|
861 |
fun local_qed txt =
|
wenzelm@20309
|
862 |
end_proof false txt #>
|
wenzelm@20309
|
863 |
Seq.maps (generic_qed #-> (fn ((after_qed, _), results) => after_qed results));
|
wenzelm@17359
|
864 |
|
wenzelm@17359
|
865 |
|
wenzelm@17359
|
866 |
(* global goals *)
|
wenzelm@17359
|
867 |
|
wenzelm@17359
|
868 |
fun global_goal print_results prep_att prepp
|
wenzelm@17859
|
869 |
kind before_qed after_qed target (name, raw_atts) stmt ctxt =
|
wenzelm@17359
|
870 |
let
|
wenzelm@17359
|
871 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@17359
|
872 |
val thy_ctxt = ProofContext.init thy;
|
wenzelm@17359
|
873 |
|
wenzelm@17359
|
874 |
val atts = map (prep_att thy) raw_atts;
|
wenzelm@17359
|
875 |
val ((names, attss), propp) = prep_names (prep_att thy) stmt;
|
wenzelm@17359
|
876 |
|
wenzelm@17450
|
877 |
fun store_results prfx res =
|
wenzelm@17450
|
878 |
K (prfx <> "") ? (Sign.add_path prfx #> Sign.no_base_names)
|
wenzelm@17450
|
879 |
#> global_results kind ((names ~~ attss) ~~ res)
|
wenzelm@17359
|
880 |
#-> (fn res' =>
|
wenzelm@17359
|
881 |
(print_results thy_ctxt ((kind, name), res') : unit;
|
wenzelm@19482
|
882 |
#2 o global_results kind [((name, atts), maps #2 res')]))
|
wenzelm@17450
|
883 |
#> Sign.restore_naming thy;
|
wenzelm@17450
|
884 |
|
wenzelm@18124
|
885 |
fun after_qed' results =
|
wenzelm@17450
|
886 |
(case target of NONE => I
|
wenzelm@17450
|
887 |
| SOME prfx => store_results (NameSpace.base prfx)
|
wenzelm@19915
|
888 |
(map (ProofContext.export_standard ctxt thy_ctxt
|
wenzelm@19915
|
889 |
#> map Drule.strip_shyps_warning) results))
|
wenzelm@18124
|
890 |
#> after_qed results;
|
wenzelm@17359
|
891 |
in
|
wenzelm@17359
|
892 |
init ctxt
|
wenzelm@18670
|
893 |
|> generic_goal (prepp #> ProofContext.auto_fixes) (kind ^ goal_names target name names)
|
wenzelm@18124
|
894 |
before_qed (K Seq.single, after_qed') propp
|
wenzelm@17359
|
895 |
end;
|
wenzelm@12065
|
896 |
|
wenzelm@18678
|
897 |
fun check_result msg sq =
|
wenzelm@17112
|
898 |
(case Seq.pull sq of
|
wenzelm@18678
|
899 |
NONE => error msg
|
wenzelm@19475
|
900 |
| SOME (s', sq') => Seq.cons s' sq');
|
wenzelm@17112
|
901 |
|
wenzelm@17359
|
902 |
fun global_qeds txt =
|
wenzelm@17359
|
903 |
end_proof true txt
|
wenzelm@20309
|
904 |
#> Seq.map (generic_qed #> (fn (((_, after_qed), results), state) =>
|
wenzelm@20309
|
905 |
after_qed results (theory_of state)
|
wenzelm@20309
|
906 |
|> (fn thy => (ProofContext.transfer thy (context_of state), thy))))
|
wenzelm@17112
|
907 |
|> Seq.DETERM; (*backtracking may destroy theory!*)
|
wenzelm@5820
|
908 |
|
wenzelm@18678
|
909 |
fun global_qed txt =
|
wenzelm@18678
|
910 |
global_qeds txt
|
wenzelm@18678
|
911 |
#> check_result "Failed to finish proof"
|
wenzelm@18678
|
912 |
#> Seq.hd;
|
wenzelm@17112
|
913 |
|
wenzelm@17112
|
914 |
|
wenzelm@17359
|
915 |
(* concluding steps *)
|
wenzelm@17112
|
916 |
|
wenzelm@17359
|
917 |
fun local_terminal_proof (text, opt_text) =
|
wenzelm@17359
|
918 |
proof (SOME text) #> Seq.maps (local_qed (opt_text, true));
|
wenzelm@17112
|
919 |
|
wenzelm@17112
|
920 |
val local_default_proof = local_terminal_proof (Method.default_text, NONE);
|
wenzelm@17112
|
921 |
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE);
|
wenzelm@17359
|
922 |
val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false));
|
wenzelm@17359
|
923 |
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE);
|
wenzelm@17112
|
924 |
|
wenzelm@18678
|
925 |
fun global_term_proof immed (text, opt_text) =
|
wenzelm@18678
|
926 |
proof (SOME text)
|
wenzelm@18678
|
927 |
#> check_result "Terminal proof method failed"
|
wenzelm@18678
|
928 |
#> Seq.maps (global_qeds (opt_text, immed))
|
wenzelm@18678
|
929 |
#> check_result "Failed to finish proof (after successful terminal method)"
|
wenzelm@18678
|
930 |
#> Seq.hd;
|
wenzelm@17112
|
931 |
|
wenzelm@17112
|
932 |
val global_terminal_proof = global_term_proof true;
|
wenzelm@17112
|
933 |
val global_default_proof = global_terminal_proof (Method.default_text, NONE);
|
wenzelm@17112
|
934 |
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE);
|
wenzelm@17112
|
935 |
val global_done_proof = global_term_proof false (Method.done_text, NONE);
|
wenzelm@17359
|
936 |
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE);
|
wenzelm@17112
|
937 |
|
wenzelm@17112
|
938 |
|
wenzelm@17359
|
939 |
(* common goal statements *)
|
wenzelm@17112
|
940 |
|
wenzelm@17359
|
941 |
local
|
wenzelm@17112
|
942 |
|
wenzelm@17859
|
943 |
fun gen_have prep_att prepp before_qed after_qed stmt int =
|
wenzelm@17859
|
944 |
local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt;
|
wenzelm@5820
|
945 |
|
wenzelm@17859
|
946 |
fun gen_show prep_att prepp before_qed after_qed stmt int state =
|
wenzelm@17359
|
947 |
let
|
wenzelm@17359
|
948 |
val testing = ref false;
|
wenzelm@17359
|
949 |
val rule = ref (NONE: thm option);
|
wenzelm@17359
|
950 |
fun fail_msg ctxt =
|
wenzelm@17359
|
951 |
"Local statement will fail to solve any pending goal" ::
|
wenzelm@17359
|
952 |
(case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th])
|
wenzelm@17359
|
953 |
|> cat_lines;
|
wenzelm@5820
|
954 |
|
wenzelm@17359
|
955 |
fun print_results ctxt res =
|
wenzelm@17359
|
956 |
if ! testing then () else ProofDisplay.print_results int ctxt res;
|
wenzelm@17359
|
957 |
fun print_rule ctxt th =
|
wenzelm@17359
|
958 |
if ! testing then rule := SOME th
|
wenzelm@17359
|
959 |
else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th)
|
wenzelm@17359
|
960 |
else ();
|
wenzelm@17359
|
961 |
val test_proof =
|
wenzelm@17359
|
962 |
(Seq.pull oo local_skip_proof) true
|
wenzelm@17359
|
963 |
|> setmp testing true
|
wenzelm@17359
|
964 |
|> setmp proofs 0
|
wenzelm@17359
|
965 |
|> capture;
|
wenzelm@6896
|
966 |
|
wenzelm@18124
|
967 |
fun after_qed' results =
|
wenzelm@19482
|
968 |
refine_goals print_rule (context_of state) (flat results)
|
wenzelm@18124
|
969 |
#> Seq.maps (after_qed results);
|
wenzelm@17359
|
970 |
in
|
wenzelm@17359
|
971 |
state
|
wenzelm@17859
|
972 |
|> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt
|
wenzelm@17359
|
973 |
|> K int ? (fn goal_state =>
|
wenzelm@17359
|
974 |
(case test_proof goal_state of
|
wenzelm@17359
|
975 |
Result (SOME _) => goal_state
|
wenzelm@18678
|
976 |
| Result NONE => error (fail_msg (context_of goal_state))
|
wenzelm@17359
|
977 |
| Exn Interrupt => raise Interrupt
|
wenzelm@17359
|
978 |
| Exn exn => raise EXCEPTION (exn, fail_msg (context_of goal_state))))
|
wenzelm@17359
|
979 |
end;
|
wenzelm@6896
|
980 |
|
wenzelm@17859
|
981 |
fun gen_theorem prep_att prepp kind before_qed after_qed target a =
|
wenzelm@17859
|
982 |
global_goal ProofDisplay.present_results prep_att prepp kind before_qed after_qed target a;
|
wenzelm@6896
|
983 |
|
wenzelm@17359
|
984 |
in
|
wenzelm@6896
|
985 |
|
wenzelm@18728
|
986 |
val have = gen_have Attrib.attribute ProofContext.bind_propp;
|
wenzelm@17359
|
987 |
val have_i = gen_have (K I) ProofContext.bind_propp_i;
|
wenzelm@18728
|
988 |
val show = gen_show Attrib.attribute ProofContext.bind_propp;
|
wenzelm@17359
|
989 |
val show_i = gen_show (K I) ProofContext.bind_propp_i;
|
wenzelm@18728
|
990 |
val theorem = gen_theorem Attrib.attribute ProofContext.bind_propp_schematic;
|
wenzelm@17359
|
991 |
val theorem_i = gen_theorem (K I) ProofContext.bind_propp_schematic_i;
|
wenzelm@6896
|
992 |
|
wenzelm@5820
|
993 |
end;
|
wenzelm@17359
|
994 |
|
wenzelm@17359
|
995 |
end;
|