1 (* Title: Pure/Isar/proof.ML
2 Author: Markus Wenzel, TU Muenchen
4 The Isar/VM proof language interpreter: maintains a structured flow of
5 context elements, goals, refinements, and facts.
10 type context = Context.proof
11 type method = Method.method
13 val init: context -> state
14 val level: state -> int
15 val assert_bottom: bool -> state -> state
16 val context_of: state -> context
17 val theory_of: state -> theory
18 val map_context: (context -> context) -> state -> state
19 val map_contexts: (context -> context) -> state -> state
20 val add_binds_i: (indexname * term option) list -> state -> state
21 val put_thms: bool -> string * thm list option -> state -> state
22 val the_facts: state -> thm list
23 val the_fact: state -> thm
24 val put_facts: thm list option -> state -> state
25 val assert_forward: state -> state
26 val assert_chain: state -> state
27 val assert_forward_or_chain: state -> state
28 val assert_backward: state -> state
29 val assert_no_chain: state -> state
30 val enter_forward: state -> state
31 val goal_message: (unit -> Pretty.T) -> state -> state
32 val get_goal: state -> context * (thm list * thm)
33 val schematic_goal: state -> bool
34 val show_main_goal: bool ref
36 val pretty_state: int -> state -> Pretty.T list
37 val pretty_goals: bool -> state -> Pretty.T list
38 val refine: Method.text -> state -> state Seq.seq
39 val refine_end: Method.text -> state -> state Seq.seq
40 val refine_insert: thm list -> state -> state
41 val goal_tac: thm -> int -> tactic
42 val refine_goals: (context -> thm -> unit) -> context -> thm list -> state -> state Seq.seq
43 val match_bind: (string list * string) list -> state -> state
44 val match_bind_i: (term list * term) list -> state -> state
45 val let_bind: (string list * string) list -> state -> state
46 val let_bind_i: (term list * term) list -> state -> state
47 val fix: (Binding.T * string option * mixfix) list -> state -> state
48 val fix_i: (Binding.T * typ option * mixfix) list -> state -> state
49 val assm: Assumption.export ->
50 (Attrib.binding * (string * string list) list) list -> state -> state
51 val assm_i: Assumption.export ->
52 ((Binding.T * attribute list) * (term * term list) list) list -> state -> state
53 val assume: (Attrib.binding * (string * string list) list) list -> state -> state
54 val assume_i: ((Binding.T * attribute list) * (term * term list) list) list ->
56 val presume: (Attrib.binding * (string * string list) list) list -> state -> state
57 val presume_i: ((Binding.T * attribute list) * (term * term list) list) list ->
59 val def: (Attrib.binding * ((Binding.T * mixfix) * (string * string list))) list ->
61 val def_i: ((Binding.T * attribute list) *
62 ((Binding.T * mixfix) * (term * term list))) list -> state -> state
63 val chain: state -> state
64 val chain_facts: thm list -> state -> state
65 val get_thmss: state -> (Facts.ref * Attrib.src list) list -> thm list
66 val note_thmss: (Attrib.binding * (Facts.ref * Attrib.src list) list) list -> state -> state
67 val note_thmss_i: ((Binding.T * attribute list) *
68 (thm list * attribute list) list) list -> state -> state
69 val from_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state
70 val from_thmss_i: ((thm list * attribute list) list) list -> state -> state
71 val with_thmss: ((Facts.ref * Attrib.src list) list) list -> state -> state
72 val with_thmss_i: ((thm list * attribute list) list) list -> state -> state
73 val using: ((Facts.ref * Attrib.src list) list) list -> state -> state
74 val using_i: ((thm list * attribute list) list) list -> state -> state
75 val unfolding: ((Facts.ref * Attrib.src list) list) list -> state -> state
76 val unfolding_i: ((thm list * attribute list) list) list -> state -> state
77 val invoke_case: string * string option list * Attrib.src list -> state -> state
78 val invoke_case_i: string * string option list * attribute list -> state -> state
79 val begin_block: state -> state
80 val next_block: state -> state
81 val end_block: state -> state
82 val proof: Method.text option -> state -> state Seq.seq
83 val defer: int option -> state -> state Seq.seq
84 val prefer: int -> state -> state Seq.seq
85 val apply: Method.text -> state -> state Seq.seq
86 val apply_end: Method.text -> state -> state Seq.seq
87 val local_goal: (context -> ((string * string) * (string * thm list) list) -> unit) ->
88 (theory -> 'a -> attribute) ->
89 (context * 'b list -> context * (term list list * (context -> context))) ->
90 string -> Method.text option -> (thm list list -> state -> state Seq.seq) ->
91 ((Binding.T * 'a list) * 'b) list -> state -> state
92 val local_qed: Method.text option * bool -> state -> state Seq.seq
93 val theorem: Method.text option -> (thm list list -> context -> context) ->
94 (string * string list) list list -> context -> state
95 val theorem_i: Method.text option -> (thm list list -> context -> context) ->
96 (term * term list) list list -> context -> state
97 val global_qed: Method.text option * bool -> state -> context
98 val local_terminal_proof: Method.text * Method.text option -> state -> state Seq.seq
99 val local_default_proof: state -> state Seq.seq
100 val local_immediate_proof: state -> state Seq.seq
101 val local_done_proof: state -> state Seq.seq
102 val local_skip_proof: bool -> state -> state Seq.seq
103 val global_terminal_proof: Method.text * Method.text option -> state -> context
104 val global_default_proof: state -> context
105 val global_immediate_proof: state -> context
106 val global_done_proof: state -> context
107 val global_skip_proof: bool -> state -> context
108 val have: Method.text option -> (thm list list -> state -> state Seq.seq) ->
109 (Attrib.binding * (string * string list) list) list -> bool -> state -> state
110 val have_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
111 ((Binding.T * attribute list) * (term * term list) list) list -> bool -> state -> state
112 val show: Method.text option -> (thm list list -> state -> state Seq.seq) ->
113 (Attrib.binding * (string * string list) list) list -> bool -> state -> state
114 val show_i: Method.text option -> (thm list list -> state -> state Seq.seq) ->
115 ((Binding.T * attribute list) * (term * term list) list) list -> bool -> state -> state
116 val is_relevant: state -> bool
117 val future_proof: (state -> ('a * context) future) -> state -> 'a future * context
118 val future_terminal_proof: Method.text * Method.text option -> state -> context
121 structure Proof: PROOF =
124 type context = Context.proof;
125 type method = Method.method;
132 datatype mode = Forward | Chain | Backward;
135 State of node Stack.T
139 facts: thm list option,
144 {statement: (string * Position.T) * term list list * term,
145 (*goal kind and statement (starting with vars), initial proposition*)
146 messages: (unit -> Pretty.T) list, (*persistent messages (hints etc.)*)
147 using: thm list, (*goal facts*)
148 goal: thm, (*subgoals ==> statement*)
149 before_qed: Method.text option,
151 (thm list list -> state -> state Seq.seq) *
152 (thm list list -> context -> context)};
154 fun make_goal (statement, messages, using, goal, before_qed, after_qed) =
155 Goal {statement = statement, messages = messages, using = using, goal = goal,
156 before_qed = before_qed, after_qed = after_qed};
158 fun make_node (context, facts, mode, goal) =
159 Node {context = context, facts = facts, mode = mode, goal = goal};
161 fun map_node f (Node {context, facts, mode, goal}) =
162 make_node (f (context, facts, mode, goal));
165 ProofContext.set_stmt true #> ProofContext.reset_naming;
168 State (Stack.init (make_node (init_context ctxt, NONE, Forward, NONE)));
170 fun current (State st) = Stack.top st |> (fn Node node => node);
171 fun map_current f (State st) = State (Stack.map_top (map_node f) st);
172 fun map_all f (State st) = State (Stack.map_all (map_node f) st);
176 (** basic proof state operations **)
178 (* block structure *)
180 fun open_block (State st) = State (Stack.push st);
182 fun close_block (State st) = State (Stack.pop st)
183 handle Empty => error "Unbalanced block parentheses";
185 fun level (State st) = Stack.level st;
187 fun assert_bottom b state =
188 let val b' = (level state <= 2) in
189 if b andalso not b' then error "Not at bottom of proof!"
190 else if not b andalso b' then error "Already at bottom of proof!"
197 val context_of = #context o current;
198 val theory_of = ProofContext.theory_of o context_of;
201 map_current (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
203 fun map_context_result f state =
204 f (context_of state) ||> (fn ctxt => map_context (K ctxt) state);
206 fun map_contexts f = map_all (fn (ctxt, facts, mode, goal) => (f ctxt, facts, mode, goal));
208 val add_binds_i = map_context o ProofContext.add_binds_i;
209 val put_thms = map_context oo ProofContext.put_thms;
214 val get_facts = #facts o current;
216 fun the_facts state =
217 (case get_facts state of SOME facts => facts
218 | NONE => error "No current facts available");
221 (case the_facts state of [thm] => thm
222 | _ => error "Single theorem expected");
224 fun put_facts facts =
225 map_current (fn (ctxt, _, mode, goal) => (ctxt, facts, mode, goal)) #>
226 put_thms true (AutoBind.thisN, facts);
228 fun these_factss more_facts (named_factss, state) =
229 (named_factss, state |> put_facts (SOME (maps snd named_factss @ more_facts)));
231 fun export_facts inner outer =
232 (case get_facts inner of
233 NONE => put_facts NONE outer
236 |> ProofContext.export (context_of inner) (context_of outer)
237 |> (fn ths => put_facts (SOME ths) outer));
242 val get_mode = #mode o current;
243 fun put_mode mode = map_current (fn (ctxt, facts, _, goal) => (ctxt, facts, mode, goal));
245 val mode_name = (fn Forward => "state" | Chain => "chain" | Backward => "prove");
247 fun assert_mode pred state =
248 let val mode = get_mode state in
249 if pred mode then state
250 else error ("Illegal application of proof command in " ^ quote (mode_name mode) ^ " mode")
253 val assert_forward = assert_mode (fn mode => mode = Forward);
254 val assert_chain = assert_mode (fn mode => mode = Chain);
255 val assert_forward_or_chain = assert_mode (fn mode => mode = Forward orelse mode = Chain);
256 val assert_backward = assert_mode (fn mode => mode = Backward);
257 val assert_no_chain = assert_mode (fn mode => mode <> Chain);
259 val enter_forward = put_mode Forward;
260 val enter_chain = put_mode Chain;
261 val enter_backward = put_mode Backward;
266 fun current_goal state =
267 (case current state of
268 {context, goal = SOME (Goal goal), ...} => (context, goal)
269 | _ => error "No current goal!");
271 fun assert_current_goal g state =
272 let val g' = can current_goal state in
273 if g andalso not g' then error "No goal in this block!"
274 else if not g andalso g' then error "Goal present in this block!"
278 fun put_goal goal = map_current (fn (ctxt, using, mode, _) => (ctxt, using, mode, goal));
280 val before_qed = #before_qed o #2 o current_goal;
285 fun map_goal f g (State (Node {context, facts, mode, goal = SOME goal}, nodes)) =
287 val Goal {statement, messages, using, goal, before_qed, after_qed} = goal;
288 val goal' = make_goal (g (statement, messages, using, goal, before_qed, after_qed));
289 in State (make_node (f context, facts, mode, SOME goal'), nodes) end
290 | map_goal f g (State (nd, node :: nodes)) =
291 let val State (node', nodes') = map_goal f g (State (node, nodes))
292 in map_context f (State (nd, node' :: nodes')) end
293 | map_goal _ _ state = state;
295 fun set_goal goal = map_goal I (fn (statement, _, using, _, before_qed, after_qed) =>
296 (statement, [], using, goal, before_qed, after_qed));
298 fun goal_message msg = map_goal I (fn (statement, messages, using, goal, before_qed, after_qed) =>
299 (statement, msg :: messages, using, goal, before_qed, after_qed));
301 fun using_facts using = map_goal I (fn (statement, _, _, goal, before_qed, after_qed) =>
302 (statement, [], using, goal, before_qed, after_qed));
306 (case try current_goal state of
307 SOME (ctxt, goal) => (ctxt, (i, goal))
308 | NONE => find (i + 1) (close_block state handle ERROR _ => error "No goal present"));
309 in val find_goal = find 0 end;
312 let val (ctxt, (_, {using, goal, ...})) = find_goal state
313 in (ctxt, (using, goal)) end;
315 fun schematic_goal state =
316 let val (_, (_, {statement = (_, _, prop), ...})) = find_goal state in
317 Term.exists_subterm Term.is_Var prop orelse
318 Term.exists_type (Term.exists_subtype Term.is_TVar) prop
325 val show_main_goal = ref false;
326 val verbose = ProofContext.verbose;
328 val pretty_goals_local = Display.pretty_goals_aux o Syntax.pp;
330 fun pretty_facts _ _ NONE = []
331 | pretty_facts s ctxt (SOME ths) =
332 [Pretty.big_list (s ^ "this:") (map (ProofContext.pretty_thm ctxt) ths), Pretty.str ""];
334 fun pretty_state nr state =
336 val {context, facts, mode, goal = _} = current state;
339 | levels_up 1 = "1 level up"
340 | levels_up i = string_of_int i ^ " levels up";
343 | subgoals 1 = "1 subgoal"
344 | subgoals n = string_of_int n ^ " subgoals";
346 fun description strs =
347 (case filter_out (fn s => s = "") strs of [] => ""
348 | strs' => enclose " (" ")" (commas strs'));
350 fun prt_goal (SOME (ctxt, (i,
351 {statement = ((_, pos), _, _), messages, using, goal, before_qed, after_qed}))) =
352 pretty_facts "using " ctxt
353 (if mode <> Backward orelse null using then NONE else SOME using) @
354 [Pretty.str ("goal" ^
355 description [levels_up (i div 2), subgoals (Thm.nprems_of goal)] ^ ":")] @
356 pretty_goals_local ctxt Markup.subgoal
357 (true, ! show_main_goal) (! Display.goals_limit) goal @
358 (map (fn msg => Position.setmp_thread_data pos msg ()) (rev messages))
359 | prt_goal NONE = [];
362 if ! verbose orelse mode = Forward then ProofContext.pretty_context context
363 else if mode = Backward then ProofContext.pretty_ctxt context
366 [Pretty.str ("proof (" ^ mode_name mode ^ "): step " ^ string_of_int nr ^
367 (if ! verbose then ", depth " ^ string_of_int (level state div 2 - 1) else "")),
369 (if null prt_ctxt then [] else prt_ctxt @ [Pretty.str ""]) @
370 (if ! verbose orelse mode = Forward then
371 pretty_facts "" context facts @ prt_goal (try find_goal state)
372 else if mode = Chain then pretty_facts "picking " context facts
373 else prt_goal (try find_goal state))
376 fun pretty_goals main state =
377 let val (ctxt, (_, goal)) = get_goal state
378 in pretty_goals_local ctxt Markup.none (false, main) (! Display.goals_limit) goal end;
384 (* refine via method *)
388 fun goalN i = "goal" ^ string_of_int i;
389 fun goals st = map goalN (1 upto Thm.nprems_of st);
391 fun no_goal_cases st = map (rpair NONE) (goals st);
394 RuleCases.make_common true (Thm.theory_of_thm st, Thm.prop_of st) (map (rpair []) (goals st));
396 fun apply_method current_context pos meth state =
398 val (goal_ctxt, (_, {statement, messages = _, using, goal, before_qed, after_qed})) =
400 val ctxt = if current_context then context_of state else goal_ctxt;
402 Method.apply pos meth ctxt using goal |> Seq.map (fn (meth_cases, goal') =>
405 (ProofContext.add_cases false (no_goal_cases goal @ goal_cases goal') #>
406 ProofContext.add_cases true meth_cases)
407 (K (statement, [], using, goal', before_qed, after_qed)))
410 fun select_goals n meth state =
412 |> (#2 o #2 o get_goal)
413 |> ALLGOALS Goal.conjunction_tac
414 |> Seq.maps (fn goal =>
416 |> Seq.lift set_goal (Goal.extract 1 n goal |> Seq.maps (Goal.conjunction_tac 1))
418 |> Seq.maps (fn state' => state'
419 |> Seq.lift set_goal (Goal.retrofit 1 n (#2 (#2 (get_goal state'))) goal))
420 |> Seq.maps (apply_method true Position.none (K Method.succeed)));
422 fun apply_text cc text state =
424 val thy = theory_of state;
425 val pos_of = #2 o Args.dest_src;
427 fun eval (Method.Basic (m, pos)) = apply_method cc pos m
428 | eval (Method.Source src) = apply_method cc (pos_of src) (Method.method thy src)
429 | eval (Method.Source_i src) = apply_method cc (pos_of src) (Method.method_i thy src)
430 | eval (Method.Then txts) = Seq.EVERY (map eval txts)
431 | eval (Method.Orelse txts) = Seq.FIRST (map eval txts)
432 | eval (Method.Try txt) = Seq.TRY (eval txt)
433 | eval (Method.Repeat1 txt) = Seq.REPEAT1 (eval txt)
434 | eval (Method.SelectGoals (n, txt)) = select_goals n (eval txt);
435 in eval text state end;
439 val refine = apply_text true;
440 val refine_end = apply_text false;
442 fun refine_insert [] = I
443 | refine_insert ths = Seq.hd o refine (Method.Basic (K (Method.insert ths), Position.none));
448 (* refine via sub-proof *)
451 Goal.norm_hhf_tac THEN' Tactic.rtac rule THEN_ALL_NEW
452 (Goal.norm_hhf_tac THEN' (SUBGOAL (fn (goal, i) =>
453 if can Logic.unprotect (Logic.strip_assums_concl goal) then
454 Tactic.etac Drule.protectI i
457 fun refine_goals print_rule inner raw_rules state =
459 val (outer, (_, goal)) = get_goal state;
460 fun refine rule st = (print_rule outer rule; FINDGOAL (goal_tac rule) st);
463 |> ProofContext.goal_export inner outer
464 |> (fn rules => Seq.lift set_goal (EVERY (map refine rules) goal) state)
470 fun conclude_goal ctxt goal propss =
472 val thy = ProofContext.theory_of ctxt;
473 val string_of_term = Syntax.string_of_term ctxt;
474 val string_of_thm = ProofContext.string_of_thm ctxt;
476 val ngoals = Thm.nprems_of goal;
477 val _ = ngoals = 0 orelse error (Pretty.string_of (Pretty.chunks
478 (pretty_goals_local ctxt Markup.none (true, ! show_main_goal) (! Display.goals_limit) goal @
479 [Pretty.str (string_of_int ngoals ^ " unsolved goal(s)!")])));
481 val extra_hyps = Assumption.extra_hyps ctxt goal;
482 val _ = null extra_hyps orelse
483 error ("Additional hypotheses:\n" ^ cat_lines (map string_of_term extra_hyps));
485 fun lost_structure () = error ("Lost goal structure:\n" ^ string_of_thm goal);
487 val th = Goal.conclude
488 (if length (flat propss) > 1 then Thm.norm_proof goal else goal)
489 handle THM _ => lost_structure ();
490 val goal_propss = filter_out null propss;
492 Conjunction.elim_balanced (length goal_propss) th
493 |> map2 Conjunction.elim_balanced (map length goal_propss)
494 handle THM _ => lost_structure ();
495 val _ = Unify.matches_list thy (flat goal_propss) (map Thm.prop_of (flat results)) orelse
496 error ("Proved a different theorem:\n" ^ string_of_thm th);
497 val _ = Thm.check_shyps (Variable.sorts_of ctxt) th;
499 fun recover_result ([] :: pss) thss = [] :: recover_result pss thss
500 | recover_result (_ :: pss) (ths :: thss) = ths :: recover_result pss thss
501 | recover_result [] [] = []
502 | recover_result _ _ = lost_structure ();
503 in recover_result propss results end;
507 (*** structured proof commands ***)
509 (** context elements **)
515 fun gen_bind bind args state =
518 |> map_context (bind args #> snd)
523 val match_bind = gen_bind (ProofContext.match_bind false);
524 val match_bind_i = gen_bind (ProofContext.match_bind_i false);
525 val let_bind = gen_bind (ProofContext.match_bind true);
526 val let_bind_i = gen_bind (ProofContext.match_bind_i true);
535 fun gen_fix add_fixes args =
537 #> map_context (snd o add_fixes args)
542 val fix = gen_fix ProofContext.add_fixes;
543 val fix_i = gen_fix ProofContext.add_fixes_i;
552 fun gen_assume asm prep_att exp args state =
555 |> map_context_result (asm exp (Attrib.map_specs (prep_att (theory_of state)) args))
556 |> these_factss [] |> #2;
560 val assm = gen_assume ProofContext.add_assms Attrib.attribute;
561 val assm_i = gen_assume ProofContext.add_assms_i (K I);
562 val assume = assm Assumption.assume_export;
563 val assume_i = assm_i Assumption.assume_export;
564 val presume = assm Assumption.presume_export;
565 val presume_i = assm_i Assumption.presume_export;
574 fun gen_def prep_att prep_vars prep_binds args state =
576 val _ = assert_forward state;
577 val thy = theory_of state;
578 val ctxt = context_of state;
580 val (raw_name_atts, (raw_vars, raw_rhss)) = args |> split_list ||> split_list;
581 val name_atts = map (apsnd (map (prep_att thy))) raw_name_atts;
584 |> map_context_result (prep_vars (map (fn (x, mx) => (x, NONE, mx)) raw_vars))
585 |>> map (fn (x, _, mx) => (x, mx))
587 map_context_result (prep_binds false (map swap raw_rhss))
588 #-> (fn rhss => map_context_result (LocalDefs.add_defs (vars ~~ (name_atts ~~ rhss)))))
589 |-> (put_facts o SOME o map (#2 o #2))
594 val def = gen_def Attrib.attribute ProofContext.read_vars ProofContext.match_bind;
595 val def_i = gen_def (K I) ProofContext.cert_vars ProofContext.match_bind_i;
605 fun clean_facts ctxt =
606 put_facts (SOME (filter_out Thm.is_dummy (the_facts ctxt))) ctxt;
613 fun chain_facts facts =
614 put_facts (SOME facts)
620 fun no_binding args = map (pair (Binding.empty, [])) args;
624 fun gen_thmss note_ctxt more_facts opt_chain opt_result prep_atts args state =
627 |> map_context_result (note_ctxt (Attrib.map_facts (prep_atts (theory_of state)) args))
628 |> these_factss (more_facts state)
634 val note_thmss = gen_thmss (ProofContext.note_thmss "") (K []) I #2 Attrib.attribute;
635 val note_thmss_i = gen_thmss (ProofContext.note_thmss_i "") (K []) I #2 (K I);
638 gen_thmss (ProofContext.note_thmss "") (K []) chain #2 Attrib.attribute o no_binding;
639 val from_thmss_i = gen_thmss (ProofContext.note_thmss_i "") (K []) chain #2 (K I) o no_binding;
642 gen_thmss (ProofContext.note_thmss "") the_facts chain #2 Attrib.attribute o no_binding;
643 val with_thmss_i = gen_thmss (ProofContext.note_thmss_i "") the_facts chain #2 (K I) o no_binding;
646 gen_thmss (ProofContext.note_thmss_i "") (K []) I I (K I) o map (apsnd Thm.simple_fact);
648 fun get_thmss state srcs = the_facts (note_thmss [((Binding.empty, []), srcs)] state);
653 (* using/unfolding *)
657 fun gen_using f g note prep_atts args state =
660 |> map_context_result
661 (note "" (Attrib.map_facts (prep_atts (theory_of state)) (no_binding args)))
662 |> (fn (named_facts, state') =>
663 state' |> map_goal I (fn (statement, _, using, goal, before_qed, after_qed) =>
665 val ctxt = context_of state';
666 val ths = maps snd named_facts;
667 in (statement, [], f ctxt ths using, g ctxt ths goal, before_qed, after_qed) end));
669 fun append_using _ ths using = using @ filter_out Thm.is_dummy ths;
670 fun unfold_using ctxt ths = map (LocalDefs.unfold ctxt ths);
671 val unfold_goals = LocalDefs.unfold_goals;
675 val using = gen_using append_using (K (K I)) ProofContext.note_thmss Attrib.attribute;
676 val using_i = gen_using append_using (K (K I)) ProofContext.note_thmss_i (K I);
677 val unfolding = gen_using unfold_using unfold_goals ProofContext.note_thmss Attrib.attribute;
678 val unfolding_i = gen_using unfold_using unfold_goals ProofContext.note_thmss_i (K I);
687 fun gen_invoke_case prep_att (name, xs, raw_atts) state =
689 val atts = map (prep_att (theory_of state)) raw_atts;
690 val (asms, state') = state |> map_context_result (fn ctxt =>
691 ctxt |> ProofContext.apply_case (ProofContext.get_case ctxt name xs));
692 val assumptions = asms |> map (fn (a, ts) => ((Binding.name a, atts), map (rpair []) ts));
695 |> map_context (ProofContext.qualified_names #> ProofContext.no_base_names)
696 |> assume_i assumptions
697 |> add_binds_i AutoBind.no_facts
698 |> map_context (ProofContext.restore_naming (context_of state))
699 |> `the_facts |-> (fn thms => note_thmss_i [((Binding.name name, []), [(thms, [])])])
704 val invoke_case = gen_invoke_case Attrib.attribute;
705 val invoke_case_i = gen_invoke_case (K I);
711 (** proof structure **)
728 fun end_block state =
732 |> assert_current_goal false
734 |> export_facts state;
741 #> refine (the_default Method.default_text opt_text)
742 #> Seq.map (using_facts [] #> enter_forward);
744 fun end_proof bot txt state =
749 |> assert_current_goal true
751 |> `before_qed |-> (refine o the_default Method.succeed_text)
752 |> Seq.maps (refine (Method.finish_text txt (Position.thread_data ())));
755 (* unstructured refinement *)
757 fun defer i = assert_no_chain #> refine (Method.Basic (K (Method.defer i), Position.none));
758 fun prefer i = assert_no_chain #> refine (Method.Basic (K (Method.prefer i), Position.none));
760 fun apply text = assert_backward #> refine text #> Seq.map (using_facts []);
761 fun apply_end text = assert_forward #> refine_end text;
771 fun implicit_vars dest add props =
773 val (explicit_vars, props') = take_prefix (can dest) props |>> map dest;
774 val vars = rev (subtract (op =) explicit_vars (fold add props []));
777 else warning ("Goal statement contains unbound schematic variable(s): " ^
778 commas_quote (map (Term.string_of_vname o fst) vars));
779 in (rev vars, props') end;
782 refine (Method.Basic (K (Method.RAW_METHOD
783 (K (HEADGOAL (PRECISE_CONJUNCTS n
784 (HEADGOAL (CONJUNCTS (ALLGOALS (rtac Drule.termI)))))))), Position.none))
789 fun generic_goal prepp kind before_qed after_qed raw_propp state =
791 val thy = theory_of state;
792 val cert = Thm.cterm_of thy;
793 val chaining = can assert_chain state;
794 val pos = Position.thread_data ();
796 val ((propss, after_ctxt), goal_state) =
798 |> assert_forward_or_chain
801 |> map_context_result (fn ctxt => swap (prepp (ctxt, raw_propp)));
802 val props = flat propss;
805 implicit_vars (dest_TVar o Logic.dest_type o Logic.dest_term) Term.add_tvars props;
806 val (vars, _) = implicit_vars (dest_Var o Logic.dest_term) Term.add_vars props';
808 val propss' = map (Logic.mk_term o Var) vars :: propss;
809 val goal_propss = filter_out null propss';
811 cert (Logic.mk_conjunction_balanced (map Logic.mk_conjunction_balanced goal_propss))
812 |> Thm.weaken_sorts (Variable.sorts_of (context_of goal_state));
813 val statement = ((kind, pos), propss', Thm.term_of goal);
814 val after_qed' = after_qed |>> (fn after_local =>
815 fn results => map_context after_ctxt #> after_local results);
818 |> map_context (init_context #> Variable.set_body true)
819 |> put_goal (SOME (make_goal (statement, [], [], Goal.init goal, before_qed, after_qed')))
820 |> map_context (ProofContext.auto_bind_goal props)
821 |> chaining ? (`the_facts #-> using_facts)
826 |> not (null vars) ? refine_terms (length goal_propss)
827 |> null props ? (refine (Method.Basic (Method.assumption, Position.none)) #> Seq.hd)
830 fun generic_qed after_ctxt state =
832 val (goal_ctxt, {statement, goal, after_qed, ...}) = current_goal state;
833 val outer_state = state |> close_block;
834 val outer_ctxt = context_of outer_state;
836 val ((_, pos), stmt, _) = statement;
839 |> Variable.exportT_terms goal_ctxt outer_ctxt;
841 tl (conclude_goal goal_ctxt goal stmt)
842 |> burrow (ProofContext.export goal_ctxt outer_ctxt);
844 val (after_local, after_global) = after_qed;
845 fun after_local' x y = Position.setmp_thread_data_seq pos (fn () => after_local x y) ();
846 fun after_global' x y = Position.setmp_thread_data pos (fn () => after_global x y) ();
849 |> map_context (after_ctxt props)
850 |> pair ((after_local', after_global'), results)
858 fun local_goal print_results prep_att prepp kind before_qed after_qed stmt state =
860 val thy = theory_of state;
861 val ((names, attss), propp) =
862 Attrib.map_specs (prep_att thy) stmt |> split_list |>> split_list;
864 fun after_qed' results =
865 local_results ((names ~~ attss) ~~ results)
866 #-> (fn res => tap (fn st => print_results (context_of st) ((kind, ""), res) : unit))
867 #> after_qed results;
870 |> generic_goal prepp kind before_qed (after_qed', K I) propp
871 |> tap (Variable.warn_extra_tfrees (context_of state) o context_of)
875 end_proof false txt #>
876 Seq.maps (generic_qed ProofContext.auto_bind_facts #->
877 (fn ((after_qed, _), results) => after_qed results));
882 fun global_goal prepp before_qed after_qed propp ctxt =
884 |> generic_goal (prepp #> ProofContext.auto_fixes) ""
885 before_qed (K Seq.single, after_qed) propp;
887 val theorem = global_goal ProofContext.bind_propp_schematic;
888 val theorem_i = global_goal ProofContext.bind_propp_schematic_i;
890 fun check_result msg sq =
893 | SOME (s', sq') => Seq.cons s' sq');
895 fun global_qeds txt =
897 #> Seq.map (generic_qed (K I) #> (fn (((_, after_qed), results), state) =>
898 after_qed results (context_of state)))
899 |> Seq.DETERM; (*backtracking may destroy theory!*)
903 #> check_result "Failed to finish proof"
907 (* concluding steps *)
909 fun local_terminal_proof (text, opt_text) =
910 proof (SOME text) #> Seq.maps (local_qed (opt_text, true));
912 val local_default_proof = local_terminal_proof (Method.default_text, NONE);
913 val local_immediate_proof = local_terminal_proof (Method.this_text, NONE);
914 val local_done_proof = proof (SOME Method.done_text) #> Seq.maps (local_qed (NONE, false));
915 fun local_skip_proof int = local_terminal_proof (Method.sorry_text int, NONE);
917 fun global_term_proof immed (text, opt_text) =
919 #> check_result "Terminal proof method failed"
920 #> Seq.maps (global_qeds (opt_text, immed))
921 #> check_result "Failed to finish proof (after successful terminal method)"
924 val global_terminal_proof = global_term_proof true;
925 val global_default_proof = global_terminal_proof (Method.default_text, NONE);
926 val global_immediate_proof = global_terminal_proof (Method.this_text, NONE);
927 val global_done_proof = global_term_proof false (Method.done_text, NONE);
928 fun global_skip_proof int = global_terminal_proof (Method.sorry_text int, NONE);
931 (* common goal statements *)
935 fun gen_have prep_att prepp before_qed after_qed stmt int =
936 local_goal (ProofDisplay.print_results int) prep_att prepp "have" before_qed after_qed stmt;
938 fun gen_show prep_att prepp before_qed after_qed stmt int state =
940 val testing = ref false;
941 val rule = ref (NONE: thm option);
943 "Local statement will fail to solve any pending goal" ::
944 (case ! rule of NONE => [] | SOME th => [ProofDisplay.string_of_rule ctxt "Failed" th])
947 fun print_results ctxt res =
948 if ! testing then () else ProofDisplay.print_results int ctxt res;
949 fun print_rule ctxt th =
950 if ! testing then rule := SOME th
951 else if int then priority (ProofDisplay.string_of_rule ctxt "Successful" th)
954 (Seq.pull oo local_skip_proof) true
955 |> setmp_noncritical testing true
958 fun after_qed' results =
959 refine_goals print_rule (context_of state) (flat results)
960 #> Seq.maps (after_qed results);
963 |> local_goal print_results prep_att prepp "show" before_qed after_qed' stmt
964 |> int ? (fn goal_state =>
965 (case test_proof goal_state of
966 Exn.Result (SOME _) => goal_state
967 | Exn.Result NONE => error (fail_msg (context_of goal_state))
968 | Exn.Exn Exn.Interrupt => raise Exn.Interrupt
969 | Exn.Exn exn => raise Exn.EXCEPTIONS ([exn, ERROR (fail_msg (context_of goal_state))])))
974 val have = gen_have Attrib.attribute ProofContext.bind_propp;
975 val have_i = gen_have (K I) ProofContext.bind_propp_i;
976 val show = gen_show Attrib.attribute ProofContext.bind_propp;
977 val show_i = gen_show (K I) ProofContext.bind_propp_i;
982 (* fork global proofs *)
986 fun is_original state =
987 (case try find_goal state of
989 | SOME (_, (_, {statement = (_, _, prop), goal, ...})) =>
990 Logic.protect prop aconv Thm.concl_of goal);
994 fun is_relevant state =
995 can (assert_bottom false) state orelse
996 can assert_forward state orelse
997 not (is_original state) orelse
998 schematic_goal state;
1000 fun future_proof fork_proof state =
1002 val _ = is_relevant state andalso error "Cannot fork relevant proof";
1004 val (goal_ctxt, (_, goal)) = find_goal state;
1005 val {statement as (kind, propss, prop), messages, using, goal, before_qed, after_qed} = goal;
1007 val prop' = Logic.protect prop;
1008 val statement' = (kind, [[], [prop']], prop');
1009 val goal' = Thm.adjust_maxidx_thm (Thm.maxidx_of goal)
1010 (Drule.comp_no_flatten (goal, Thm.nprems_of goal) 1 Drule.protectI);
1011 fun after_qed' [[th]] = ProofContext.put_thms false (AutoBind.thisN, SOME [th]);
1012 val this_name = ProofContext.full_bname goal_ctxt AutoBind.thisN;
1016 |> map_contexts (Variable.auto_fixes prop)
1017 |> map_goal I (K (statement', messages, using, goal', before_qed, (#1 after_qed, after_qed')))
1020 val future_thm = result_ctxt |> Future.map (fn (_, ctxt) =>
1021 ProofContext.get_fact_single ctxt (Facts.named this_name));
1022 val finished_goal = Goal.future_result goal_ctxt future_thm prop';
1025 |> map_goal I (K (statement, messages, using, finished_goal, NONE, after_qed))
1026 |> global_done_proof;
1027 in (Future.map #1 result_ctxt, state') end;
1031 fun future_terminal_proof meths state =
1032 if is_relevant state then global_terminal_proof meths state
1033 else #2 (state |> future_proof (fn state' =>
1034 Future.fork_pri ~1 (fn () => ((), global_terminal_proof meths state'))));