author | wenzelm |
Tue, 13 Sep 2005 22:19:23 +0200 | |
changeset 17339 | ab97ccef124a |
parent 17111 | d2ea9c974570 |
child 17357 | ee2bdca144c7 |
permissions | -rw-r--r-- |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
1 |
(* Title: Pure/Isar/obtain.ML |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
2 |
ID: $Id$ |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
3 |
Author: Markus Wenzel, TU Muenchen |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
4 |
|
8543 | 5 |
The 'obtain' language element -- generalized existence at the level of |
6 |
proof texts. |
|
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
7 |
|
9468 | 8 |
<chain_facts> |
9 |
obtain x where "P x" <proof> == |
|
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
10 |
|
12970 | 11 |
have "!!thesis. (!!x. P x ==> thesis) ==> thesis" |
12 |
proof succeed |
|
9468 | 13 |
fix thesis |
12970 | 14 |
assume that [intro?]: "!!x. P x ==> thesis" |
15 |
<chain_facts> show thesis <proof (insert that)> |
|
16 |
qed |
|
10379
93630e0c5ae9
improved handling of "that": insert into goal, only declare as Pure "intro";
wenzelm
parents:
9481
diff
changeset
|
17 |
fix x assm (obtained) "P x" |
8094 | 18 |
*) |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
19 |
|
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
20 |
signature OBTAIN = |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
21 |
sig |
11890 | 22 |
val obtain: (string list * string option) list -> |
17111 | 23 |
((string * Attrib.src list) * (string * (string list * string list)) list) list |
12970 | 24 |
-> (Proof.context -> string * (string * thm list) list -> unit) * |
25 |
(Proof.context -> thm -> unit) -> Proof.state -> Proof.state Seq.seq |
|
11890 | 26 |
val obtain_i: (string list * typ option) list -> |
27 |
((string * Proof.context attribute list) * (term * (term list * term list)) list) list |
|
12970 | 28 |
-> (Proof.context -> string * (string * thm list) list -> unit) * |
29 |
(Proof.context -> thm -> unit) -> Proof.state -> Proof.state Seq.seq |
|
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
30 |
end; |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
31 |
|
10379
93630e0c5ae9
improved handling of "that": insert into goal, only declare as Pure "intro";
wenzelm
parents:
9481
diff
changeset
|
32 |
structure Obtain: OBTAIN = |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
33 |
struct |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
34 |
|
8094 | 35 |
|
11816 | 36 |
(** export_obtain **) |
9468 | 37 |
|
11816 | 38 |
fun export_obtain state parms rule _ cprops thm = |
9468 | 39 |
let |
17111 | 40 |
val {thy, prop, maxidx, ...} = Thm.rep_thm thm; |
41 |
val cparms = map (Thm.cterm_of thy) parms; |
|
9468 | 42 |
|
43 |
val thm' = thm |
|
11816 | 44 |
|> Drule.implies_intr_goals cprops |
9468 | 45 |
|> Drule.forall_intr_list cparms |
46 |
|> Drule.forall_elim_vars (maxidx + 1); |
|
11816 | 47 |
val elim_tacs = replicate (length cprops) (Tactic.etac Drule.triv_goal); |
9468 | 48 |
|
49 |
val concl = Logic.strip_assums_concl prop; |
|
50 |
val bads = parms inter (Term.term_frees concl); |
|
51 |
in |
|
52 |
if not (null bads) then |
|
9481 | 53 |
raise Proof.STATE ("Conclusion contains obtained parameters: " ^ |
12055 | 54 |
space_implode " " (map (ProofContext.string_of_term (Proof.context_of state)) bads), state) |
17111 | 55 |
else if not (ObjectLogic.is_judgment thy (Logic.strip_assums_concl prop)) then |
10379
93630e0c5ae9
improved handling of "that": insert into goal, only declare as Pure "intro";
wenzelm
parents:
9481
diff
changeset
|
56 |
raise Proof.STATE ("Conclusions of 'obtain' context must be object-logic judgments", state) |
9468 | 57 |
else (Tactic.rtac thm' THEN' RANGE elim_tacs) 1 rule |
58 |
end; |
|
59 |
||
60 |
||
61 |
||
8094 | 62 |
(** obtain(_i) **) |
63 |
||
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
64 |
val thatN = "that"; |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
65 |
|
17111 | 66 |
fun gen_obtain prep_att prep_vars prep_propp raw_vars raw_asms print state = |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
67 |
let |
9468 | 68 |
val _ = Proof.assert_forward_or_chain state; |
69 |
val chain_facts = if Proof.is_chain state then Proof.the_facts state else []; |
|
10464 | 70 |
val thy = Proof.theory_of state; |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
71 |
|
8543 | 72 |
(*obtain vars*) |
11890 | 73 |
val (vars_ctxt, vars) = foldl_map prep_vars (Proof.context_of state, raw_vars); |
15570 | 74 |
val xs = List.concat (map fst vars); |
10582 | 75 |
val fix_ctxt = vars_ctxt |> ProofContext.fix_i vars; |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
76 |
|
8543 | 77 |
(*obtain asms*) |
11890 | 78 |
val (asms_ctxt, proppss) = prep_propp (fix_ctxt, map snd raw_asms); |
15570 | 79 |
val asm_props = List.concat (map (map fst) proppss); |
17111 | 80 |
val asms = map fst (Attrib.map_specs (prep_att thy) raw_asms) ~~ proppss; |
10464 | 81 |
|
10582 | 82 |
val _ = ProofContext.warn_extra_tfrees fix_ctxt asms_ctxt; |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
83 |
|
12970 | 84 |
(*obtain statements*) |
16606 | 85 |
val thesisN = Term.variant xs AutoBind.thesisN; |
12970 | 86 |
val bind_thesis = ProofContext.bind_skolem fix_ctxt [thesisN]; |
17111 | 87 |
val bound_thesis = bind_thesis (ObjectLogic.fixed_judgment thy thesisN); |
12970 | 88 |
val bound_thesis_raw as (bound_thesis_name, _) = |
89 |
Term.dest_Free (bind_thesis (Free (thesisN, propT))); |
|
90 |
val bound_thesis_var = |
|
16787 | 91 |
fold_aterms (fn Free (x, T) => (fn v => if x = bound_thesis_name then (x, T) else v) |
92 |
| _ => I) bound_thesis bound_thesis_raw; |
|
9468 | 93 |
|
10582 | 94 |
fun occs_var x = Library.get_first (fn t => |
95 |
ProofContext.find_free t (ProofContext.get_skolem fix_ctxt x)) asm_props; |
|
96 |
val raw_parms = map occs_var xs; |
|
15570 | 97 |
val parms = List.mapPartial I raw_parms; |
10582 | 98 |
val parm_names = |
15570 | 99 |
List.mapPartial (fn (SOME (Free a), x) => SOME (a, x) | _ => NONE) (raw_parms ~~ xs); |
10582 | 100 |
|
101 |
val that_prop = |
|
102 |
Term.list_all_free (map #1 parm_names, Logic.list_implies (asm_props, bound_thesis)) |
|
103 |
|> Library.curry Logic.list_rename_params (map #2 parm_names); |
|
12970 | 104 |
val obtain_prop = |
105 |
Logic.list_rename_params ([AutoBind.thesisN], |
|
106 |
Term.list_all_free ([bound_thesis_var], Logic.mk_implies (that_prop, bound_thesis))); |
|
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
107 |
|
17111 | 108 |
fun after_qed _ = |
109 |
Proof.local_qed false NONE print |
|
110 |
#> Seq.map (fn st => st |
|
9468 | 111 |
|> Proof.fix_i vars |
17111 | 112 |
|> Proof.assm_i (export_obtain state parms (Proof.the_fact st)) asms); |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
113 |
in |
8094 | 114 |
state |
9468 | 115 |
|> Proof.enter_forward |
17034 | 116 |
|> Proof.have_i (K Seq.single) true [(("", []), [(obtain_prop, ([], []))])] |
17111 | 117 |
|> Proof.proof (SOME (Method.Basic (K Method.succeed))) |> Seq.hd |
15531 | 118 |
|> Proof.fix_i [([thesisN], NONE)] |
119 |
|> Proof.assume_i [((thatN, [ContextRules.intro_query_local NONE]), [(that_prop, ([], []))])] |
|
16842 | 120 |
|> `Proof.the_facts |
121 |
||> Proof.from_facts chain_facts |
|
122 |
||> Proof.show_i (K I) after_qed false [(("", []), [(bound_thesis, ([], []))])] false |
|
17111 | 123 |
|-> (fn facts => Proof.refine (Method.Basic (K (Method.insert facts)))) |
7674
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
124 |
end; |
99305245f6bd
The 'obtain' language element -- achieves (eliminated) existential
wenzelm
parents:
diff
changeset
|
125 |
|
17111 | 126 |
val obtain = gen_obtain Attrib.local_attribute ProofContext.read_vars ProofContext.read_propp; |
127 |
val obtain_i = gen_obtain (K I) ProofContext.cert_vars ProofContext.cert_propp; |
|
8094 | 128 |
|
129 |
end; |