author  berghofe 
Wed, 11 Jul 2007 12:01:10 +0200  
changeset 23782  4dd0ba632e40 
parent 23639  961d1061e540 
child 23806  d67aac3992c3 
permissions  rwrr 
5820  1 
(* Title: Pure/Isar/proof.ML 
2 
ID: $Id$ 

3 
Author: Markus Wenzel, TU Muenchen 

4 

19000  5 
The Isar/VM proof language interpreter: maintains a structured flow of 
6 
context elements, goals, refinements, and facts. 

5820  7 
*) 
8 

9 
signature PROOF = 

10 
sig 

23639  11 
type context = Context.proof 
12 
type method = Method.method 

5820  13 
type state 
17359  14 
val init: context > state 
15 
val level: state > int 

16 
val assert_bottom: bool > state > state 

5820  17 
val context_of: state > context 
18 
val theory_of: state > theory 

13377  19 
val map_context: (context > context) > state > state 
17976  20 
val add_binds_i: (indexname * term option) list > state > state 
21442  21 
val put_thms: string * thm list option > state > state 
6091  22 
val the_facts: state > thm list 
9469  23 
val the_fact: state > thm 
17450  24 
val put_facts: thm list option > state > state 
6891  25 
val assert_forward: state > state 
17359  26 
val assert_chain: state > state 
9469  27 
val assert_forward_or_chain: state > state 
5820  28 
val assert_backward: state > state 
8206  29 
val assert_no_chain: state > state 
5820  30 
val enter_forward: state > state 
17359  31 
val get_goal: state > context * (thm list * thm) 
19995  32 
val schematic_goal: state > bool 
16539  33 
val show_main_goal: bool ref 
6529  34 
val verbose: bool ref 
12423  35 
val pretty_state: int > state > Pretty.T list 
10360  36 
val pretty_goals: bool > state > Pretty.T list 
17112  37 
val refine: Method.text > state > state Seq.seq 
38 
val refine_end: Method.text > state > state Seq.seq 

18908  39 
val refine_insert: thm list > state > state 
20208  40 
val goal_tac: thm > int > tactic 
17359  41 
val refine_goals: (context > thm > unit) > context > thm list > state > state Seq.seq 
5936  42 
val match_bind: (string list * string) list > state > state 
43 
val match_bind_i: (term list * term) list > state > state 

8617
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

44 
val let_bind: (string list * string) list > state > state 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

45 
val let_bind_i: (term list * term) list > state > state 
19846  46 
val fix: (string * string option * mixfix) list > state > state 
47 
val fix_i: (string * typ option * mixfix) list > state > state 

20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

48 
val assm: Assumption.export > 
19585  49 
((string * Attrib.src list) * (string * string list) list) list > state > state 
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

50 
val assm_i: Assumption.export > 
19585  51 
((string * attribute list) * (term * term list) list) list > state > state 
52 
val assume: ((string * Attrib.src list) * (string * string list) list) list > state > state 

53 
val assume_i: ((string * attribute list) * (term * term list) list) list > state > state 

54 
val presume: ((string * Attrib.src list) * (string * string list) list) list > state > state 

55 
val presume_i: ((string * attribute list) * (term * term list) list) list > state > state 

19846  56 
val def: ((string * Attrib.src list) * 
57 
((string * mixfix) * (string * string list))) list > state > state 

58 
val def_i: ((string * attribute list) * 

59 
((string * mixfix) * (term * term list))) list > state > state 

17359  60 
val chain: state > state 
61 
val chain_facts: thm list > state > state 

62 
val get_thmss: state > (thmref * Attrib.src list) list > thm list 

63 
val note_thmss: ((string * Attrib.src list) * 

17112  64 
(thmref * Attrib.src list) list) list > state > state 
18728  65 
val note_thmss_i: ((string * attribute list) * 
66 
(thm list * attribute list) list) list > state > state 

17112  67 
val from_thmss: ((thmref * Attrib.src list) list) list > state > state 
18728  68 
val from_thmss_i: ((thm list * attribute list) list) list > state > state 
17112  69 
val with_thmss: ((thmref * Attrib.src list) list) list > state > state 
18728  70 
val with_thmss_i: ((thm list * attribute list) list) list > state > state 
18548  71 
val using: ((thmref * Attrib.src list) list) list > state > state 
18728  72 
val using_i: ((thm list * attribute list) list) list > state > state 
18548  73 
val unfolding: ((thmref * Attrib.src list) list) list > state > state 
18728  74 
val unfolding_i: ((thm list * attribute list) list) list > state > state 
17112  75 
val invoke_case: string * string option list * Attrib.src list > state > state 
18728  76 
val invoke_case_i: string * string option list * attribute list > state > state 
17359  77 
val begin_block: state > state 
78 
val next_block: state > state 

20309  79 
val end_block: state > state 
17112  80 
val proof: Method.text option > state > state Seq.seq 
81 
val defer: int option > state > state Seq.seq 

82 
val prefer: int > state > state Seq.seq 

83 
val apply: Method.text > state > state Seq.seq 

84 
val apply_end: Method.text > state > state Seq.seq 

17359  85 
val local_goal: (context > ((string * string) * (string * thm list) list) > unit) > 
18728  86 
(theory > 'a > attribute) > 
17359  87 
(context * 'b list > context * (term list list * (context > context))) > 
18124  88 
string > Method.text option > (thm list list > state > state Seq.seq) > 
17359  89 
((string * 'a list) * 'b) list > state > state 
90 
val local_qed: Method.text option * bool > state > state Seq.seq 

21442  91 
val theorem: Method.text option > (thm list list > context > context) > 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

92 
(string * string list) list list > context > state 
21442  93 
val theorem_i: Method.text option > (thm list list > context > context) > 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

94 
(term * term list) list list > context > state 
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

95 
val global_qed: Method.text option * bool > state > context 
17359  96 
val local_terminal_proof: Method.text * Method.text option > state > state Seq.seq 
97 
val local_default_proof: state > state Seq.seq 

98 
val local_immediate_proof: state > state Seq.seq 

99 
val local_done_proof: state > state Seq.seq 

100 
val local_skip_proof: bool > state > state Seq.seq 

20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

101 
val global_terminal_proof: Method.text * Method.text option > state > context 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

102 
val global_default_proof: state > context 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

103 
val global_immediate_proof: state > context 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

104 
val global_done_proof: state > context 
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

105 
val global_skip_proof: bool > state > context 
18124  106 
val have: Method.text option > (thm list list > state > state Seq.seq) > 
19585  107 
((string * Attrib.src list) * (string * string list) list) list > bool > state > state 
18124  108 
val have_i: Method.text option > (thm list list > state > state Seq.seq) > 
19585  109 
((string * attribute list) * (term * term list) list) list > bool > state > state 
18124  110 
val show: Method.text option > (thm list list > state > state Seq.seq) > 
19585  111 
((string * Attrib.src list) * (string * string list) list) list > bool > state > state 
18124  112 
val show_i: Method.text option > (thm list list > state > state Seq.seq) > 
19585  113 
((string * attribute list) * (term * term list) list) list > bool > state > state 
5820  114 
end; 
115 

13377  116 
structure Proof: PROOF = 
5820  117 
struct 
118 

20309  119 
type context = Context.proof; 
17112  120 
type method = Method.method; 
16813  121 

5820  122 

123 
(** proof state **) 

124 

17359  125 
(* datatype state *) 
5820  126 

17112  127 
datatype mode = Forward  Chain  Backward; 
5820  128 

17359  129 
datatype state = 
130 
State of node Stack.T 

131 
and node = 

7176  132 
Node of 
133 
{context: context, 

134 
facts: thm list option, 

135 
mode: mode, 

17359  136 
goal: goal option} 
137 
and goal = 

138 
Goal of 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

139 
{statement: string * term list list, (*goal kind and statement, starting with vars*) 
17359  140 
using: thm list, (*goal facts*) 
141 
goal: thm, (*subgoals ==> statement*) 

17859  142 
before_qed: Method.text option, 
18124  143 
after_qed: 
144 
(thm list list > state > state Seq.seq) * 

20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

145 
(thm list list > context > context)}; 
17359  146 

17859  147 
fun make_goal (statement, using, goal, before_qed, after_qed) = 
148 
Goal {statement = statement, using = using, goal = goal, 

149 
before_qed = before_qed, after_qed = after_qed}; 

5820  150 

7176  151 
fun make_node (context, facts, mode, goal) = 
152 
Node {context = context, facts = facts, mode = mode, goal = goal}; 

153 

17359  154 
fun map_node f (Node {context, facts, mode, goal}) = 
155 
make_node (f (context, facts, mode, goal)); 

5820  156 

21727  157 
val init_context = 
158 
ProofContext.set_stmt true #> ProofContext.reset_naming; 

159 

21466
6ffb8f455b84
init: enter inner statement mode, which prevents local notes from being named internally;
wenzelm
parents:
21451
diff
changeset

160 
fun init ctxt = 
21727  161 
State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE))); 
5820  162 

17359  163 
fun current (State st) = Stack.top st > (fn Node node => node); 
21274  164 
fun map_current f (State st) = State (Stack.map_top (map_node f) st); 
12045  165 

5820  166 

167 

168 
(** basic proof state operations **) 

169 

17359  170 
(* block structure *) 
171 

172 
fun open_block (State st) = State (Stack.push st); 

173 

18678  174 
fun close_block (State st) = State (Stack.pop st) 
175 
handle Empty => error "Unbalanced block parentheses"; 

17359  176 

177 
fun level (State st) = Stack.level st; 

178 

179 
fun assert_bottom b state = 

180 
let val b' = (level state <= 2) in 

18678  181 
if b andalso not b' then error "Not at bottom of proof!" 
182 
else if not b andalso b' then error "Already at bottom of proof!" 

17359  183 
else state 
184 
end; 

185 

186 

5820  187 
(* context *) 
188 

17359  189 
val context_of = #context o current; 
5820  190 
val theory_of = ProofContext.theory_of o context_of; 
191 

17359  192 
fun map_context f = 
193 
map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal)); 

5820  194 

17359  195 
fun map_context_result f state = 
17859  196 
f (context_of state) > (fn ctxt => map_context (K ctxt) state); 
5820  197 

10809  198 
val add_binds_i = map_context o ProofContext.add_binds_i; 
21442  199 
val put_thms = map_context o ProofContext.put_thms; 
5820  200 

201 

202 
(* facts *) 

203 

17359  204 
val get_facts = #facts o current; 
205 

206 
fun the_facts state = 

207 
(case get_facts state of SOME facts => facts 

18678  208 
 NONE => error "No current facts available"); 
5820  209 

9469  210 
fun the_fact state = 
17359  211 
(case the_facts state of [thm] => thm 
18678  212 
 _ => error "Single theorem expected"); 
7605  213 

17359  214 
fun put_facts facts = 
19078  215 
map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #> 
21442  216 
put_thms (AutoBind.thisN, facts); 
5820  217 

17359  218 
fun these_factss more_facts (named_factss, state) = 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

219 
(named_factss, state > put_facts (SOME (maps snd named_factss @ more_facts))); 
5820  220 

17359  221 
fun export_facts inner outer = 
222 
(case get_facts inner of 

20309  223 
NONE => put_facts NONE outer 
17359  224 
 SOME thms => 
225 
thms 

20309  226 
> ProofContext.export (context_of inner) (context_of outer) 
227 
> (fn ths => put_facts (SOME ths) outer)); 

5820  228 

229 

230 
(* mode *) 

231 

17359  232 
val get_mode = #mode o current; 
5820  233 
fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal)); 
234 

17359  235 
val mode_name = (fn Forward => "state"  Chain => "chain"  Backward => "prove"); 
5820  236 

237 
fun assert_mode pred state = 

238 
let val mode = get_mode state in 

239 
if pred mode then state 

18678  240 
else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode") 
5820  241 
end; 
242 

19308  243 
val assert_forward = assert_mode (fn mode => mode = Forward); 
244 
val assert_chain = assert_mode (fn mode => mode = Chain); 

245 
val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain); 

246 
val assert_backward = assert_mode (fn mode => mode = Backward); 

247 
val assert_no_chain = assert_mode (fn mode => mode <> Chain); 

5820  248 

17359  249 
val enter_forward = put_mode Forward; 
250 
val enter_chain = put_mode Chain; 

251 
val enter_backward = put_mode Backward; 

5820  252 

17359  253 

254 
(* current goal *) 

255 

256 
fun current_goal state = 

257 
(case current state of 

258 
{context, goal = SOME (Goal goal), ...} => (context, goal) 

18678  259 
 _ => error "No current goal!"); 
5820  260 

17359  261 
fun assert_current_goal g state = 
262 
let val g' = can current_goal state in 

18678  263 
if g andalso not g' then error "No goal in this block!" 
264 
else if not g andalso g' then error "Goal present in this block!" 

17359  265 
else state 
266 
end; 

6776  267 

17359  268 
fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal)); 
269 

17859  270 
val before_qed = #before_qed o #2 o current_goal; 
271 

17359  272 

273 
(* nested goal *) 

5820  274 

17359  275 
fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) = 
276 
let 

17859  277 
val Goal {statement, using, goal, before_qed, after_qed} = goal; 
278 
val goal' = make_goal (g (statement, using, goal, before_qed, after_qed)); 

17359  279 
in State (make_node (f context, facts, mode, SOME goal'), nodes) end 
280 
 map_goal f g (State (nd, node :: nodes)) = 

281 
let val State (node', nodes') = map_goal f g (State (node, nodes)) 

282 
in map_context f (State (nd, node' :: nodes')) end 

283 
 map_goal _ _ state = state; 

5820  284 

19188  285 
fun set_goal goal = map_goal I (fn (statement, using, _, before_qed, after_qed) => 
286 
(statement, using, goal, before_qed, after_qed)); 

287 

17859  288 
fun using_facts using = map_goal I (fn (statement, _, goal, before_qed, after_qed) => 
289 
(statement, using, goal, before_qed, after_qed)); 

17359  290 

291 
local 

292 
fun find i state = 

293 
(case try current_goal state of 

294 
SOME (ctxt, goal) => (ctxt, (i, goal)) 

18678  295 
 NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present")); 
17359  296 
in val find_goal = find 0 end; 
297 

298 
fun get_goal state = 

299 
let val (ctxt, (_, {using, goal, ...})) = find_goal state 

300 
in (ctxt, (using, goal)) end; 

5820  301 

19995  302 
fun schematic_goal state = 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

303 
let val (_, (_, {statement = (_, propss), ...})) = find_goal state in 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

304 
exists (exists (Term.exists_subterm Term.is_Var)) propss orelse 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

305 
exists (exists (Term.exists_type (Term.exists_subtype Term.is_TVar))) propss 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

306 
end; 
19995  307 

5820  308 

309 

12423  310 
(** pretty_state **) 
5820  311 

13869  312 
val show_main_goal = ref false; 
16539  313 
val verbose = ProofContext.verbose; 
13698  314 

14876  315 
val pretty_goals_local = Display.pretty_goals_aux o ProofContext.pp; 
12085  316 

15531  317 
fun pretty_facts _ _ NONE = [] 
318 
 pretty_facts s ctxt (SOME ths) = 

12055  319 
[Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""]; 
6756  320 

17359  321 
fun pretty_state nr state = 
5820  322 
let 
17359  323 
val {context, facts, mode, goal = _} = current state; 
5820  324 

325 
fun levels_up 0 = "" 

17359  326 
 levels_up 1 = "1 level up" 
327 
 levels_up i = string_of_int i ^ " levels up"; 

5820  328 

11556  329 
fun subgoals 0 = "" 
17359  330 
 subgoals 1 = "1 subgoal" 
331 
 subgoals n = string_of_int n ^ " subgoals"; 

332 

333 
fun description strs = 

334 
(case filter_out (equal "") strs of [] => "" 

335 
 strs' => enclose " (" ")" (commas strs')); 

12146  336 

21451  337 
fun prt_goal (SOME (ctxt, (i, {statement = _, using, goal, before_qed, after_qed}))) = 
17359  338 
pretty_facts "using " ctxt 
339 
(if mode <> Backward orelse null using then NONE else SOME using) @ 

21442  340 
[Pretty.str ("goal" ^ 
341 
description [levels_up (i div 2), subgoals (Thm.nprems_of goal)] ^ ":")] @ 

23639  342 
pretty_goals_local ctxt Markup.subgoal 
343 
(true, ! show_main_goal) (! Display.goals_limit) goal 

17359  344 
 prt_goal NONE = []; 
6848  345 

17359  346 
val prt_ctxt = 
347 
if ! verbose orelse mode = Forward then ProofContext.pretty_context context 

18670  348 
else if mode = Backward then ProofContext.pretty_ctxt context 
7575  349 
else []; 
17359  350 
in 
351 
[Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^ 

352 
(if ! verbose then ", depth " ^ string_of_int (level state div 2  1) else "")), 

353 
Pretty.str ""] @ 

354 
(if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @ 

355 
(if ! verbose orelse mode = Forward then 

356 
pretty_facts "" context facts @ prt_goal (try find_goal state) 

357 
else if mode = Chain then pretty_facts "picking " context facts 

358 
else prt_goal (try find_goal state)) 

359 
end; 

5820  360 

12085  361 
fun pretty_goals main state = 
19188  362 
let val (ctxt, (_, goal)) = get_goal state 
23639  363 
in pretty_goals_local ctxt Markup.none (false, main) (! Display.goals_limit) goal end; 
10320  364 

5820  365 

366 

367 
(** proof steps **) 

368 

17359  369 
(* refine via method *) 
5820  370 

8234  371 
local 
372 

16146  373 
fun goalN i = "goal" ^ string_of_int i; 
374 
fun goals st = map goalN (1 upto Thm.nprems_of st); 

375 

376 
fun no_goal_cases st = map (rpair NONE) (goals st); 

377 

378 
fun goal_cases st = 

18607  379 
RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st)); 
16146  380 

23360  381 
fun apply_method current_context pos meth_fun state = 
6848  382 
let 
17859  383 
val (goal_ctxt, (_, {statement, using, goal, before_qed, after_qed})) = find_goal state; 
23360  384 
val ctxt = ContextPosition.put pos (if current_context then context_of state else goal_ctxt); 
385 
val meth = meth_fun ctxt; 

16146  386 
in 
18228  387 
Method.apply meth using goal > Seq.map (fn (meth_cases, goal') => 
6848  388 
state 
16146  389 
> map_goal 
18475  390 
(ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #> 
391 
ProofContext.add_cases true meth_cases) 

17859  392 
(K (statement, using, goal', before_qed, after_qed))) 
16146  393 
end; 
5820  394 

19188  395 
fun select_goals n meth state = 
19224  396 
state 
397 
> (#2 o #2 o get_goal) 

21687  398 
> ALLGOALS Goal.conjunction_tac 
19224  399 
> Seq.maps (fn goal => 
19188  400 
state 
21687  401 
> Seq.lift set_goal (Goal.extract 1 n goal > Seq.maps (Goal.conjunction_tac 1)) 
19188  402 
> Seq.maps meth 
403 
> Seq.maps (fn state' => state' 

404 
> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal)) 

23360  405 
> Seq.maps (apply_method true Position.none (K Method.succeed))); 
19188  406 

17112  407 
fun apply_text cc text state = 
408 
let 

409 
val thy = theory_of state; 

23360  410 
val pos_of = #2 o Args.dest_src; 
17112  411 

23360  412 
fun eval (Method.Basic (m, pos)) = apply_method cc pos m 
413 
 eval (Method.Source src) = apply_method cc (pos_of src) (Method.method thy src) 

414 
 eval (Method.Source_i src) = apply_method cc (pos_of src) (Method.method_i thy src) 

17112  415 
 eval (Method.Then txts) = Seq.EVERY (map eval txts) 
416 
 eval (Method.Orelse txts) = Seq.FIRST (map eval txts) 

417 
 eval (Method.Try txt) = Seq.TRY (eval txt) 

19188  418 
 eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt) 
419 
 eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt); 

17112  420 
in eval text state end; 
421 

8234  422 
in 
423 

17112  424 
val refine = apply_text true; 
425 
val refine_end = apply_text false; 

8234  426 

18908  427 
fun refine_insert [] = I 
23360  428 
 refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths), Position.none)); 
18908  429 

8234  430 
end; 
431 

5820  432 

17359  433 
(* refine via subproof *) 
434 

20208  435 
fun goal_tac rule = 
21687  436 
Goal.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW 
437 
(Goal.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) => 

18186  438 
if can Logic.unprotect (Logic.strip_assums_concl goal) then 
439 
Tactic.etac Drule.protectI i 

440 
else all_tac))); 

11816  441 

19915  442 
fun refine_goals print_rule inner raw_rules state = 
443 
let 

444 
val (outer, (_, goal)) = get_goal state; 

20208  445 
fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st); 
19915  446 
in 
447 
raw_rules 

20309  448 
> ProofContext.goal_export inner outer 
449 
> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state) 

19915  450 
end; 
17359  451 

6932  452 

17359  453 
(* conclude_goal *) 
6932  454 

18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset

455 
fun conclude_goal state goal propss = 
5820  456 
let 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

457 
val thy = theory_of state; 
5820  458 
val ctxt = context_of state; 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

459 
val string_of_term = ProofContext.string_of_term ctxt; 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

460 
val string_of_thm = ProofContext.string_of_thm ctxt; 
5820  461 

17359  462 
val ngoals = Thm.nprems_of goal; 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

463 
val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks 
23639  464 
(pretty_goals_local ctxt Markup.none (true, ! show_main_goal) (! Display.goals_limit) goal @ 
465 
[Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")]))); 

20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

466 

9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

467 
val extra_hyps = Assumption.extra_hyps ctxt goal; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

468 
val _ = null extra_hyps orelse 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

469 
error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps)); 
5820  470 

23418  471 
fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal); 
472 

23782
4dd0ba632e40
Proof terms for metaconjunctions are now normalized before
berghofe
parents:
23639
diff
changeset

473 
val ns = map length propss; 
4dd0ba632e40
Proof terms for metaconjunctions are now normalized before
berghofe
parents:
23639
diff
changeset

474 
val th = Goal.conclude 
4dd0ba632e40
Proof terms for metaconjunctions are now normalized before
berghofe
parents:
23639
diff
changeset

475 
(if Library.foldl op + (0, ns) > 1 then Thm.norm_proof goal else goal) 
4dd0ba632e40
Proof terms for metaconjunctions are now normalized before
berghofe
parents:
23639
diff
changeset

476 
handle THM _ => lost_structure (); 
23418  477 
val goal_propss = filter_out null propss; 
478 
val results = 

479 
Conjunction.elim_balanced (length goal_propss) th 

480 
> map2 Conjunction.elim_balanced (map length goal_propss) 

481 
handle THM _ => lost_structure (); 

482 
val _ = Unify.matches_list thy (flat goal_propss) (map Thm.prop_of (flat results)) orelse 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

483 
error ("Proved a different theorem:\n" ^ string_of_thm th); 
23418  484 

485 
fun recover_result ([] :: pss) thss = [] :: recover_result pss thss 

486 
 recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss 

487 
 recover_result [] [] = [] 

488 
 recover_result _ _ = lost_structure (); 

489 
in recover_result propss results end; 

5820  490 

491 

492 

493 
(*** structured proof commands ***) 

494 

17112  495 
(** context elements **) 
5820  496 

17112  497 
(* bindings *) 
5820  498 

16813  499 
local 
500 

17359  501 
fun gen_bind bind args state = 
5820  502 
state 
503 
> assert_forward 

18308  504 
> map_context (bind args #> snd) 
17359  505 
> put_facts NONE; 
5820  506 

16813  507 
in 
508 

8617
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

509 
val match_bind = gen_bind (ProofContext.match_bind false); 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

510 
val match_bind_i = gen_bind (ProofContext.match_bind_i false); 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

511 
val let_bind = gen_bind (ProofContext.match_bind true); 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

512 
val let_bind_i = gen_bind (ProofContext.match_bind_i true); 
5820  513 

16813  514 
end; 
515 

5820  516 

17359  517 
(* fix *) 
9196  518 

12714  519 
local 
520 

18670  521 
fun gen_fix add_fixes args = 
17359  522 
assert_forward 
19846  523 
#> map_context (snd o add_fixes args) 
17359  524 
#> put_facts NONE; 
5820  525 

16813  526 
in 
527 

18670  528 
val fix = gen_fix ProofContext.add_fixes; 
529 
val fix_i = gen_fix ProofContext.add_fixes_i; 

5820  530 

16813  531 
end; 
532 

5820  533 

17359  534 
(* assume etc. *) 
5820  535 

16813  536 
local 
537 

17112  538 
fun gen_assume asm prep_att exp args state = 
5820  539 
state 
540 
> assert_forward 

17112  541 
> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args)) 
17359  542 
> these_factss [] > #2; 
6932  543 

16813  544 
in 
545 

18728  546 
val assm = gen_assume ProofContext.add_assms Attrib.attribute; 
18670  547 
val assm_i = gen_assume ProofContext.add_assms_i (K I); 
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

548 
val assume = assm Assumption.assume_export; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

549 
val assume_i = assm_i Assumption.assume_export; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

550 
val presume = assm Assumption.presume_export; 
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20208
diff
changeset

551 
val presume_i = assm_i Assumption.presume_export; 
5820  552 

16813  553 
end; 
554 

7271  555 

17359  556 
(* def *) 
11891  557 

16813  558 
local 
559 

20913  560 
fun gen_def prep_att prep_vars prep_binds args state = 
11891  561 
let 
562 
val _ = assert_forward state; 

17112  563 
val thy = theory_of state; 
20913  564 
val ctxt = context_of state; 
11891  565 

20913  566 
val (raw_name_atts, (raw_vars, raw_rhss)) = args > split_list > split_list; 
567 
val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts; 

11891  568 
in 
20913  569 
state 
570 
> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars)) 

571 
>> map (fn (x, _, mx) => (x, mx)) 

572 
> (fn vars => 

573 
map_context_result (prep_binds false (map swap raw_rhss)) 

574 
#> (fn rhss => map_context_result (LocalDefs.add_defs (vars ~~ (name_atts ~~ rhss))))) 

575 
> (put_facts o SOME o map (#2 o #2)) 

11891  576 
end; 
577 

16813  578 
in 
579 

20913  580 
val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind; 
581 
val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i; 

11891  582 

16813  583 
end; 
584 

11891  585 

8374  586 

17112  587 
(** facts **) 
5820  588 

17359  589 
(* chain *) 
5820  590 

17359  591 
val chain = 
592 
assert_forward 

593 
#> tap the_facts 

594 
#> enter_chain; 

5820  595 

17359  596 
fun chain_facts facts = 
597 
put_facts (SOME facts) 

598 
#> chain; 

5820  599 

600 

17359  601 
(* note etc. *) 
17112  602 

17166  603 
fun no_binding args = map (pair ("", [])) args; 
17112  604 

605 
local 

606 

17359  607 
fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state = 
17112  608 
state 
609 
> assert_forward 

610 
> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args)) 

611 
> these_factss (more_facts state) 

17359  612 
> opt_chain 
613 
> opt_result; 

17112  614 

615 
in 

616 

21442  617 
val note_thmss = gen_thmss (ProofContext.note_thmss "") (K []) I #2 Attrib.attribute; 
618 
val note_thmss_i = gen_thmss (ProofContext.note_thmss_i "") (K []) I #2 (K I); 

17112  619 

620 
val from_thmss = 

21442  621 
gen_thmss (ProofContext.note_thmss "") (K []) chain #2 Attrib.attribute o no_binding; 
622 
val from_thmss_i = gen_thmss (ProofContext.note_thmss_i "") (K []) chain #2 (K I) o no_binding; 

17112  623 

624 
val with_thmss = 

21442  625 
gen_thmss (ProofContext.note_thmss "") the_facts chain #2 Attrib.attribute o no_binding; 
626 
val with_thmss_i = gen_thmss (ProofContext.note_thmss_i "") the_facts chain #2 (K I) o no_binding; 

17359  627 

18808  628 
val local_results = 
21442  629 
gen_thmss (ProofContext.note_thmss_i "") (K []) I I (K I) o map (apsnd Thm.simple_fact); 
17359  630 

631 
fun get_thmss state srcs = the_facts (note_thmss [(("", []), srcs)] state); 

17112  632 

633 
end; 

634 

635 

18548  636 
(* using/unfolding *) 
17112  637 

638 
local 

639 

18548  640 
fun gen_using f g note prep_atts args state = 
17112  641 
state 
642 
> assert_backward 

21442  643 
> map_context_result 
644 
(note "" (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args))) 

18843  645 
> (fn (named_facts, state') => 
646 
state' > map_goal I (fn (statement, using, goal, before_qed, after_qed) => 

647 
let 

648 
val ctxt = context_of state'; 

19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

649 
val ths = maps snd named_facts; 
18843  650 
in (statement, f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end)); 
18548  651 

18843  652 
fun append_using _ ths using = using @ ths; 
18878  653 
fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths); 
654 
val unfold_goals = LocalDefs.unfold_goals; 

17112  655 

656 
in 

657 

18843  658 
val using = gen_using append_using (K (K I)) ProofContext.note_thmss Attrib.attribute; 
659 
val using_i = gen_using append_using (K (K I)) ProofContext.note_thmss_i (K I); 

18826  660 
val unfolding = gen_using unfold_using unfold_goals ProofContext.note_thmss Attrib.attribute; 
661 
val unfolding_i = gen_using unfold_using unfold_goals ProofContext.note_thmss_i (K I); 

17112  662 

663 
end; 

664 

665 

666 
(* case *) 

667 

668 
local 

669 

670 
fun gen_invoke_case prep_att (name, xs, raw_atts) state = 

671 
let 

672 
val atts = map (prep_att (theory_of state)) raw_atts; 

19078  673 
val (asms, state') = state > map_context_result (fn ctxt => 
674 
ctxt > ProofContext.apply_case (ProofContext.get_case ctxt name xs)); 

19585  675 
val assumptions = asms > map (fn (a, ts) => ((a, atts), map (rpair []) ts)); 
17112  676 
in 
677 
state' 

17359  678 
> map_context (ProofContext.qualified_names #> ProofContext.no_base_names) 
17112  679 
> assume_i assumptions 
17976  680 
> add_binds_i AutoBind.no_facts 
17112  681 
> map_context (ProofContext.restore_naming (context_of state)) 
21449  682 
> `the_facts > (fn thms => note_thmss_i [((name, []), [(thms, [])])]) 
17112  683 
end; 
684 

685 
in 

686 

18728  687 
val invoke_case = gen_invoke_case Attrib.attribute; 
17112  688 
val invoke_case_i = gen_invoke_case (K I); 
689 

690 
end; 

691 

692 

693 

17359  694 
(** proof structure **) 
695 

696 
(* blocks *) 

697 

698 
val begin_block = 

699 
assert_forward 

700 
#> open_block 

701 
#> put_goal NONE 

702 
#> open_block; 

703 

704 
val next_block = 

705 
assert_forward 

706 
#> close_block 

707 
#> open_block 

708 
#> put_goal NONE 

709 
#> put_facts NONE; 

710 

711 
fun end_block state = 

712 
state 

713 
> assert_forward 

714 
> close_block 

715 
> assert_current_goal false 

716 
> close_block 

717 
> export_facts state; 

718 

719 

720 
(* subproofs *) 

721 

722 
fun proof opt_text = 

723 
assert_backward 

17859  724 
#> refine (the_default Method.default_text opt_text) 
17359  725 
#> Seq.map (using_facts [] #> enter_forward); 
726 

23360  727 
fun end_proof bot txt state = 
728 
state 

729 
> assert_forward 

730 
> assert_bottom bot 

731 
> close_block 

732 
> assert_current_goal true 

733 
> using_facts [] 

734 
> `before_qed > (refine o the_default Method.succeed_text) 

735 
> Seq.maps (refine (Method.finish_text txt (ContextPosition.get (context_of state)))); 

17359  736 

737 

738 
(* unstructured refinement *) 

739 

23360  740 
fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i), Position.none)); 
741 
fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i), Position.none)); 

17359  742 

743 
fun apply text = assert_backward #> refine text #> Seq.map (using_facts []); 

744 
fun apply_end text = assert_forward #> refine_end text; 

745 

746 

747 

17112  748 
(** goals **) 
749 

17359  750 
(* generic goals *) 
751 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

752 
local 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

753 

19846  754 
fun implicit_vars dest add props = 
755 
let 

756 
val (explicit_vars, props') = take_prefix (can dest) props >> map dest; 

757 
val vars = rev (subtract (op =) explicit_vars (fold add props [])); 

758 
val _ = 

759 
if null vars then () 

760 
else warning ("Goal statement contains unbound schematic variable(s): " ^ 

761 
commas_quote (map (Term.string_of_vname o fst) vars)); 

762 
in (rev vars, props') end; 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

763 

5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

764 
fun refine_terms n = 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

765 
refine (Method.Basic (K (Method.RAW_METHOD 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

766 
(K (HEADGOAL (PRECISE_CONJUNCTS n 
23360  767 
(HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI)))))))), Position.none)) 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

768 
#> Seq.hd; 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

769 

5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

770 
in 
17359  771 

17859  772 
fun generic_goal prepp kind before_qed after_qed raw_propp state = 
5820  773 
let 
17359  774 
val thy = theory_of state; 
23418  775 
val cert = Thm.cterm_of thy; 
17359  776 
val chaining = can assert_chain state; 
777 

778 
val ((propss, after_ctxt), goal_state) = 

5936  779 
state 
780 
> assert_forward_or_chain 

781 
> enter_forward 

17359  782 
> open_block 
17859  783 
> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp))); 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

784 
val props = flat propss; 
15703  785 

19846  786 
val (_, props') = 
787 
implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props; 

788 
val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props'; 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

789 

5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

790 
val propss' = map (Logic.mk_term o Var) vars :: propss; 
23418  791 
val goal_propss = filter_out null propss'; 
792 
val goal = Goal.init (cert 

793 
(Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss))); 

18124  794 
val after_qed' = after_qed >> (fn after_local => 
795 
fn results => map_context after_ctxt #> after_local results); 

5820  796 
in 
17359  797 
goal_state 
21727  798 
> map_context (init_context #> Variable.set_body true) 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

799 
> put_goal (SOME (make_goal ((kind, propss'), [], goal, before_qed, after_qed'))) 
18475  800 
> map_context (ProofContext.add_cases false (AutoBind.cases thy props)) 
17359  801 
> map_context (ProofContext.auto_bind_goal props) 
21565  802 
> chaining ? (`the_facts #> using_facts) 
17359  803 
> put_facts NONE 
804 
> open_block 

805 
> put_goal NONE 

5820  806 
> enter_backward 
23418  807 
> not (null vars) ? refine_terms (length goal_propss) 
23360  808 
> null props ? (refine (Method.Basic (Method.assumption, Position.none)) #> Seq.hd) 
5820  809 
end; 
810 

17359  811 
fun generic_qed state = 
12503  812 
let 
18548  813 
val (goal_ctxt, {statement = (_, stmt), using = _, goal, before_qed = _, after_qed}) = 
17859  814 
current_goal state; 
8617
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

815 
val outer_state = state > close_block; 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

816 
val outer_ctxt = context_of outer_state; 
33e2bd53aec3
support HindleyMilner polymorphisms in binds and facts;
wenzelm
parents:
8582
diff
changeset

817 

18503
841137f20307
goal/qed: proper treatment of two levels of conjunctions;
wenzelm
parents:
18475
diff
changeset

818 
val props = 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

819 
flat (tl stmt) 
19915  820 
> Variable.exportT_terms goal_ctxt outer_ctxt; 
17359  821 
val results = 
19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

822 
tl (conclude_goal state goal stmt) 
20309  823 
> burrow (ProofContext.export goal_ctxt outer_ctxt); 
17359  824 
in 
825 
outer_state 

826 
> map_context (ProofContext.auto_bind_facts props) 

18124  827 
> pair (after_qed, results) 
17359  828 
end; 
829 

19774
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

830 
end; 
5fe7731d0836
allow nontrivial schematic goals (via embedded term vars);
wenzelm
parents:
19585
diff
changeset

831 

9469  832 

17359  833 
(* local goals *) 
834 

17859  835 
fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state = 
17359  836 
let 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

837 
val thy = theory_of state; 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

838 
val ((names, attss), propp) = 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

839 
Attrib.map_specs (prep_att thy) stmt > split_list >> split_list; 
17359  840 

18124  841 
fun after_qed' results = 
18808  842 
local_results ((names ~~ attss) ~~ results) 
17359  843 
#> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit)) 
18124  844 
#> after_qed results; 
5820  845 
in 
17359  846 
state 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

847 
> generic_goal prepp kind before_qed (after_qed', K I) propp 
19900
21a99d88d925
ProofContext: moved variable operations to struct Variable;
wenzelm
parents:
19862
diff
changeset

848 
> tap (Variable.warn_extra_tfrees (context_of state) o context_of) 
5820  849 
end; 
850 

17359  851 
fun local_qed txt = 
20309  852 
end_proof false txt #> 
853 
Seq.maps (generic_qed #> (fn ((after_qed, _), results) => after_qed results)); 

5820  854 

855 

17359  856 
(* global goals *) 
857 

21442  858 
fun global_goal prepp before_qed after_qed propp ctxt = 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

859 
init ctxt 
21442  860 
> generic_goal (prepp #> ProofContext.auto_fixes) "" 
21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

861 
before_qed (K Seq.single, after_qed) propp; 
17359  862 

21362
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

863 
val theorem = global_goal ProofContext.bind_propp_schematic; 
3a2ab1dce297
simplified Proof.theorem(_i) interface  removed target support;
wenzelm
parents:
21274
diff
changeset

864 
val theorem_i = global_goal ProofContext.bind_propp_schematic_i; 
12065  865 

18678  866 
fun check_result msg sq = 
17112  867 
(case Seq.pull sq of 
18678  868 
NONE => error msg 
19475  869 
 SOME (s', sq') => Seq.cons s' sq'); 
17112  870 

17359  871 
fun global_qeds txt = 
872 
end_proof true txt 

20309  873 
#> Seq.map (generic_qed #> (fn (((_, after_qed), results), state) => 
20363
f34c5dbe74d5
global goals/qeds: after_qed operates on Proof.context (potentially local_theory);
wenzelm
parents:
20341
diff
changeset

874 
after_qed results (context_of state))) 
17112  875 
> Seq.DETERM; (*backtracking may destroy theory!*) 
876 

18678  877 
fun global_qed txt = 
878 
global_qeds txt 

879 
#> check_result "Failed to finish proof" 

880 
#> Seq.hd; 

12959  881 

5820  882 

17359  883 
(* concluding steps *) 
17112  884 

17359  885 
fun local_terminal_proof (text, opt_text) = 
886 
proof (SOME text) #> Seq.maps (local_qed (opt_text, true)); 

17112  887 

888 
val local_default_proof = local_terminal_proof (Method.default_text, NONE); 

889 
val local_immediate_proof = local_terminal_proof (Method.this_text, NONE); 

17359  890 
val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false)); 
891 
fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE); 

17112  892 

18678  893 
fun global_term_proof immed (text, opt_text) = 
894 
proof (SOME text) 

895 
#> check_result "Terminal proof method failed" 

896 
#> Seq.maps (global_qeds (opt_text, immed)) 

897 
#> check_result "Failed to finish proof (after successful terminal method)" 

898 
#> Seq.hd; 

17112  899 

900 
val global_terminal_proof = global_term_proof true; 

901 
val global_default_proof = global_terminal_proof (Method.default_text, NONE); 

902 
val global_immediate_proof = global_terminal_proof (Method.this_text, NONE); 

903 
val global_done_proof = global_term_proof false (Method.done_text, NONE); 

17359  904 
fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE); 
5820  905 

6896  906 

17359  907 
(* common goal statements *) 
908 

909 
local 

910 

17859  911 
fun gen_have prep_att prepp before_qed after_qed stmt int = 
912 
local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt; 

6896  913 

17859  914 
fun gen_show prep_att prepp before_qed after_qed stmt int state = 
17359  915 
let 
916 
val testing = ref false; 

917 
val rule = ref (NONE: thm option); 

918 
fun fail_msg ctxt = 

919 
"Local statement will fail to solve any pending goal" :: 

920 
(case ! rule of NONE => []  SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th]) 

921 
> cat_lines; 

6896  922 

17359  923 
fun print_results ctxt res = 
924 
if ! testing then () else ProofDisplay.print_results int ctxt res; 

925 
fun print_rule ctxt th = 

926 
if ! testing then rule := SOME th 

927 
else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th) 

928 
else (); 

929 
val test_proof = 

930 
(Seq.pull oo local_skip_proof) true 

931 
> setmp testing true 

932 
> setmp proofs 0 

933 
> capture; 

6896  934 

18124  935 
fun after_qed' results = 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19475
diff
changeset

936 
refine_goals print_rule (context_of state) (flat results) 
18124  937 
#> Seq.maps (after_qed results); 
17359  938 
in 
939 
state 

17859  940 
> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt 
21565  941 
> int ? (fn goal_state => 
17359  942 
(case test_proof goal_state of 
943 
Result (SOME _) => goal_state 

18678  944 
 Result NONE => error (fail_msg (context_of goal_state)) 
17359  945 
 Exn Interrupt => raise Interrupt 
946 
 Exn exn => raise EXCEPTION (exn, fail_msg (context_of goal_state)))) 

947 
end; 

948 

949 
in 

950 

18728  951 
val have = gen_have Attrib.attribute ProofContext.bind_propp; 
17359  952 
val have_i = gen_have (K I) ProofContext.bind_propp_i; 
18728  953 
val show = gen_show Attrib.attribute ProofContext.bind_propp; 
17359  954 
val show_i = gen_show (K I) ProofContext.bind_propp_i; 
6896  955 

5820  956 
end; 
17359  957 

958 
end; 