author | huffman |
Sat, 27 Feb 2010 20:56:19 -0800 | |
changeset 35466 | 9fcfd5763181 |
parent 35464 | 2ae3362ba8ee |
child 35468 | 09bc6a2e2296 |
permissions | -rw-r--r-- |
32126 | 1 |
(* Title: HOLCF/Tools/Domain/domain_theorems.ML |
23152 | 2 |
Author: David von Oheimb |
32740 | 3 |
Author: Brian Huffman |
23152 | 4 |
|
5 |
Proof generator for domain command. |
|
6 |
*) |
|
7 |
||
26342 | 8 |
val HOLCF_ss = @{simpset}; |
23152 | 9 |
|
31005 | 10 |
signature DOMAIN_THEOREMS = |
11 |
sig |
|
35444 | 12 |
val theorems: |
13 |
Domain_Library.eq * Domain_Library.eq list |
|
14 |
-> typ * (binding * (bool * binding option * typ) list * mixfix) list |
|
15 |
-> theory -> thm list * theory; |
|
16 |
||
31005 | 17 |
val comp_theorems: bstring * Domain_Library.eq list -> theory -> thm list * theory; |
32740 | 18 |
val quiet_mode: bool Unsynchronized.ref; |
19 |
val trace_domain: bool Unsynchronized.ref; |
|
31005 | 20 |
end; |
21 |
||
31023 | 22 |
structure Domain_Theorems :> DOMAIN_THEOREMS = |
31005 | 23 |
struct |
23152 | 24 |
|
32740 | 25 |
val quiet_mode = Unsynchronized.ref false; |
26 |
val trace_domain = Unsynchronized.ref false; |
|
29402 | 27 |
|
28 |
fun message s = if !quiet_mode then () else writeln s; |
|
29 |
fun trace s = if !trace_domain then tracing s else (); |
|
30 |
||
25805 | 31 |
val adm_impl_admw = @{thm adm_impl_admw}; |
25895
0eaadfa8889e
converted adm_all and adm_ball to rule_format; cleaned up
huffman
parents:
25805
diff
changeset
|
32 |
val adm_all = @{thm adm_all}; |
25805 | 33 |
val adm_conj = @{thm adm_conj}; |
34 |
val adm_subst = @{thm adm_subst}; |
|
33396 | 35 |
val ch2ch_fst = @{thm ch2ch_fst}; |
36 |
val ch2ch_snd = @{thm ch2ch_snd}; |
|
25805 | 37 |
val ch2ch_Rep_CFunL = @{thm ch2ch_Rep_CFunL}; |
38 |
val ch2ch_Rep_CFunR = @{thm ch2ch_Rep_CFunR}; |
|
39 |
val chain_iterate = @{thm chain_iterate}; |
|
40 |
val contlub_cfun_fun = @{thm contlub_cfun_fun}; |
|
33396 | 41 |
val contlub_fst = @{thm contlub_fst}; |
42 |
val contlub_snd = @{thm contlub_snd}; |
|
43 |
val contlubE = @{thm contlubE}; |
|
44 |
val cont_const = @{thm cont_const}; |
|
45 |
val cont_id = @{thm cont_id}; |
|
46 |
val cont2cont_fst = @{thm cont2cont_fst}; |
|
47 |
val cont2cont_snd = @{thm cont2cont_snd}; |
|
48 |
val cont2cont_Rep_CFun = @{thm cont2cont_Rep_CFun}; |
|
25805 | 49 |
val fix_def2 = @{thm fix_def2}; |
50 |
val lub_equal = @{thm lub_equal}; |
|
51 |
val retraction_strict = @{thm retraction_strict}; |
|
52 |
val wfix_ind = @{thm wfix_ind}; |
|
35464 | 53 |
val iso_intro = @{thm iso.intro}; |
23152 | 54 |
|
55 |
open Domain_Library; |
|
56 |
infixr 0 ===>; |
|
57 |
infixr 0 ==>; |
|
58 |
infix 0 == ; |
|
59 |
infix 1 ===; |
|
60 |
infix 1 ~= ; |
|
61 |
infix 1 <<; |
|
62 |
infix 1 ~<<; |
|
63 |
infix 9 ` ; |
|
64 |
infix 9 `% ; |
|
65 |
infix 9 `%%; |
|
66 |
infixr 9 oo; |
|
67 |
||
68 |
(* ----- general proof facilities ------------------------------------------- *) |
|
69 |
||
24503 | 70 |
fun legacy_infer_term thy t = |
71 |
let val ctxt = ProofContext.set_mode ProofContext.mode_schematic (ProofContext.init thy) |
|
72 |
in singleton (Syntax.check_terms ctxt) (Sign.intern_term thy t) end; |
|
73 |
||
23152 | 74 |
fun pg'' thy defs t tacs = |
75 |
let |
|
24503 | 76 |
val t' = legacy_infer_term thy t; |
23152 | 77 |
val asms = Logic.strip_imp_prems t'; |
78 |
val prop = Logic.strip_imp_concl t'; |
|
26711 | 79 |
fun tac {prems, context} = |
23152 | 80 |
rewrite_goals_tac defs THEN |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
81 |
EVERY (tacs {prems = map (rewrite_rule defs) prems, context = context}) |
23152 | 82 |
in Goal.prove_global thy [] asms prop tac end; |
83 |
||
84 |
fun pg' thy defs t tacsf = |
|
85 |
let |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
86 |
fun tacs {prems, context} = |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
87 |
if null prems then tacsf context |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
88 |
else cut_facts_tac prems 1 :: tacsf context; |
23152 | 89 |
in pg'' thy defs t tacs end; |
90 |
||
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
91 |
(* FIXME!!!!!!!!! *) |
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
92 |
(* We should NEVER re-parse variable names as strings! *) |
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
93 |
(* The names can conflict with existing constants or other syntax! *) |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
94 |
fun case_UU_tac ctxt rews i v = |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
95 |
InductTacs.case_tac ctxt (v^"=UU") i THEN |
23152 | 96 |
asm_simp_tac (HOLCF_ss addsimps rews) i; |
97 |
||
98 |
val chain_tac = |
|
99 |
REPEAT_DETERM o resolve_tac |
|
33396 | 100 |
[chain_iterate, ch2ch_Rep_CFunR, ch2ch_Rep_CFunL, ch2ch_fst, ch2ch_snd]; |
23152 | 101 |
|
102 |
(* ----- general proofs ----------------------------------------------------- *) |
|
103 |
||
29064 | 104 |
val all2E = @{lemma "!x y . P x y ==> (P x y ==> R) ==> R" by simp} |
23152 | 105 |
|
35444 | 106 |
fun theorems |
107 |
(((dname, _), cons) : eq, eqs : eq list) |
|
108 |
(dom_eqn : typ * (binding * (bool * binding option * typ) list * mixfix) list) |
|
109 |
(thy : theory) = |
|
23152 | 110 |
let |
111 |
||
29402 | 112 |
val _ = message ("Proving isomorphism properties of domain "^dname^" ..."); |
33801 | 113 |
val map_tab = Domain_Isomorphism.get_map_tab thy; |
114 |
||
23152 | 115 |
|
116 |
(* ----- getting the axioms and definitions --------------------------------- *) |
|
117 |
||
118 |
local |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26342
diff
changeset
|
119 |
fun ga s dn = PureThy.get_thm thy (dn ^ "." ^ s); |
23152 | 120 |
in |
121 |
val ax_abs_iso = ga "abs_iso" dname; |
|
122 |
val ax_rep_iso = ga "rep_iso" dname; |
|
123 |
val ax_when_def = ga "when_def" dname; |
|
35288 | 124 |
fun get_def mk_name (con, _, _) = ga (mk_name con^"_def") dname; |
23152 | 125 |
val axs_pat_def = map (get_def pat_name) cons; |
126 |
val ax_copy_def = ga "copy_def" dname; |
|
127 |
end; (* local *) |
|
128 |
||
35444 | 129 |
(* ----- define constructors ------------------------------------------------ *) |
130 |
||
131 |
val lhsT = fst dom_eqn; |
|
132 |
||
133 |
val rhsT = |
|
134 |
let |
|
135 |
fun mk_arg_typ (lazy, sel, T) = if lazy then mk_uT T else T; |
|
136 |
fun mk_con_typ (bind, args, mx) = |
|
137 |
if null args then oneT else foldr1 mk_sprodT (map mk_arg_typ args); |
|
138 |
fun mk_eq_typ (_, cons) = foldr1 mk_ssumT (map mk_con_typ cons); |
|
139 |
in |
|
140 |
mk_eq_typ dom_eqn |
|
141 |
end; |
|
142 |
||
143 |
val rep_const = Const(dname^"_rep", lhsT ->> rhsT); |
|
144 |
||
145 |
val abs_const = Const(dname^"_abs", rhsT ->> lhsT); |
|
146 |
||
147 |
val (result, thy) = |
|
148 |
Domain_Constructors.add_domain_constructors |
|
149 |
(Long_Name.base_name dname) dom_eqn |
|
35459
3d8acfae6fb8
move proofs of when_rews intro domain_constructors.ML
huffman
parents:
35458
diff
changeset
|
150 |
(rep_const, abs_const) (ax_rep_iso, ax_abs_iso) ax_when_def thy; |
35444 | 151 |
|
35451 | 152 |
val con_appls = #con_betas result; |
35457
d63655b88369
move proofs of casedist into domain_constructors.ML
huffman
parents:
35456
diff
changeset
|
153 |
val {exhaust, casedist, ...} = result; |
35458
deaf221c4a59
moved proofs of dist_les and dist_eqs to domain_constructors.ML
huffman
parents:
35457
diff
changeset
|
154 |
val {con_compacts, con_rews, inverts, injects, dist_les, dist_eqs, ...} = result; |
35457
d63655b88369
move proofs of casedist into domain_constructors.ML
huffman
parents:
35456
diff
changeset
|
155 |
val {sel_rews, ...} = result; |
35459
3d8acfae6fb8
move proofs of when_rews intro domain_constructors.ML
huffman
parents:
35458
diff
changeset
|
156 |
val when_rews = #cases result; |
3d8acfae6fb8
move proofs of when_rews intro domain_constructors.ML
huffman
parents:
35458
diff
changeset
|
157 |
val when_strict = hd when_rews; |
35461
34360a1e3537
move proofs of dis_rews to domain_constructors.ML; change dis_defins to iff-style
huffman
parents:
35460
diff
changeset
|
158 |
val dis_rews = #dis_rews result; |
35466
9fcfd5763181
move proofs of match_rews to domain_constructors.ML
huffman
parents:
35464
diff
changeset
|
159 |
val mat_rews = #match_rews result; |
35444 | 160 |
|
23152 | 161 |
(* ----- theorems concerning the isomorphism -------------------------------- *) |
162 |
||
35444 | 163 |
val pg = pg' thy; |
164 |
||
23152 | 165 |
val dc_copy = %%:(dname^"_copy"); |
166 |
||
167 |
val abs_strict = ax_rep_iso RS (allI RS retraction_strict); |
|
168 |
val rep_strict = ax_abs_iso RS (allI RS retraction_strict); |
|
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
34974
diff
changeset
|
169 |
val iso_rews = map Drule.export_without_context [ax_abs_iso, ax_rep_iso, abs_strict, rep_strict]; |
23152 | 170 |
|
171 |
(* ----- theorems concerning the constructors, discriminators and selectors - *) |
|
172 |
||
173 |
local |
|
174 |
fun ps args = mapn (fn n => fn _ => %:("pat" ^ string_of_int n)) 1 args; |
|
175 |
||
35288 | 176 |
fun pat_lhs (con,_,args) = mk_branch (list_comb (%%:(pat_name con), ps args)); |
23152 | 177 |
|
35288 | 178 |
fun pat_rhs (con,_,[]) = mk_return ((%:"rhs") ` HOLogic.unit) |
179 |
| pat_rhs (con,_,args) = |
|
26012 | 180 |
(mk_branch (mk_ctuple_pat (ps args))) |
23152 | 181 |
`(%:"rhs")`(mk_ctuple (map %# args)); |
182 |
||
183 |
fun pat_strict c = |
|
184 |
let |
|
25132 | 185 |
val axs = @{thm branch_def} :: axs_pat_def; |
23152 | 186 |
val goal = mk_trp (strict (pat_lhs c ` (%:"rhs"))); |
187 |
val tacs = [simp_tac (HOLCF_ss addsimps [when_strict]) 1]; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
188 |
in pg axs goal (K tacs) end; |
23152 | 189 |
|
35288 | 190 |
fun pat_app c (con, _, args) = |
23152 | 191 |
let |
25132 | 192 |
val axs = @{thm branch_def} :: axs_pat_def; |
23152 | 193 |
val lhs = (pat_lhs c)`(%:"rhs")`(con_app con args); |
35288 | 194 |
val rhs = if con = first c then pat_rhs c else mk_fail; |
23152 | 195 |
val goal = lift_defined %: (nonlazy args, mk_trp (lhs === rhs)); |
196 |
val tacs = [asm_simp_tac (HOLCF_ss addsimps when_rews) 1]; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
197 |
in pg axs goal (K tacs) end; |
23152 | 198 |
|
29402 | 199 |
val _ = trace " Proving pat_stricts..."; |
23152 | 200 |
val pat_stricts = map pat_strict cons; |
29402 | 201 |
val _ = trace " Proving pat_apps..."; |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
202 |
val pat_apps = maps (fn c => map (pat_app c) cons) cons; |
23152 | 203 |
in |
204 |
val pat_rews = pat_stricts @ pat_apps; |
|
205 |
end; |
|
206 |
||
207 |
(* ----- theorems concerning one induction step ----------------------------- *) |
|
208 |
||
209 |
val copy_strict = |
|
210 |
let |
|
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
211 |
val _ = trace " Proving copy_strict..."; |
23152 | 212 |
val goal = mk_trp (strict (dc_copy `% "f")); |
33504
b4210cc3ac97
map functions for various types, with ep_pair/deflation/finite_deflation lemmas
huffman
parents:
33427
diff
changeset
|
213 |
val rules = [abs_strict, rep_strict] @ @{thms domain_map_stricts}; |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
214 |
val tacs = [asm_simp_tac (HOLCF_ss addsimps rules) 1]; |
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
215 |
in |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
216 |
SOME (pg [ax_copy_def] goal (K tacs)) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
217 |
handle |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
218 |
THM (s, _, _) => (trace s; NONE) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
219 |
| ERROR s => (trace s; NONE) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
220 |
end; |
23152 | 221 |
|
222 |
local |
|
35288 | 223 |
fun copy_app (con, _, args) = |
23152 | 224 |
let |
225 |
val lhs = dc_copy`%"f"`(con_app con args); |
|
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
226 |
fun one_rhs arg = |
33971 | 227 |
if Datatype_Aux.is_rec_type (dtyp_of arg) |
33801 | 228 |
then Domain_Axioms.copy_of_dtyp map_tab |
229 |
(proj (%:"f") eqs) (dtyp_of arg) ` (%# arg) |
|
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
230 |
else (%# arg); |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
231 |
val rhs = con_app2 con one_rhs args; |
35059
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
232 |
fun is_rec arg = Datatype_Aux.is_rec_type (dtyp_of arg); |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
233 |
fun is_nonlazy_rec arg = is_rec arg andalso not (is_lazy arg); |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
234 |
fun nonlazy_rec args = map vname (filter is_nonlazy_rec args); |
23152 | 235 |
val goal = lift_defined %: (nonlazy_rec args, mk_trp (lhs === rhs)); |
33317 | 236 |
val args' = filter_out (fn a => is_rec a orelse is_lazy a) args; |
33504
b4210cc3ac97
map functions for various types, with ep_pair/deflation/finite_deflation lemmas
huffman
parents:
33427
diff
changeset
|
237 |
val stricts = abs_strict :: rep_strict :: @{thms domain_map_stricts}; |
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
238 |
(* FIXME! case_UU_tac *) |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
239 |
fun tacs1 ctxt = map (case_UU_tac ctxt stricts 1 o vname) args'; |
33504
b4210cc3ac97
map functions for various types, with ep_pair/deflation/finite_deflation lemmas
huffman
parents:
33427
diff
changeset
|
240 |
val rules = [ax_abs_iso] @ @{thms domain_map_simps}; |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
241 |
val tacs2 = [asm_simp_tac (HOLCF_ss addsimps rules) 1]; |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
242 |
in pg (ax_copy_def::con_appls) goal (fn ctxt => (tacs1 ctxt @ tacs2)) end; |
23152 | 243 |
in |
29402 | 244 |
val _ = trace " Proving copy_apps..."; |
23152 | 245 |
val copy_apps = map copy_app cons; |
246 |
end; |
|
247 |
||
248 |
local |
|
35288 | 249 |
fun one_strict (con, _, args) = |
23152 | 250 |
let |
251 |
val goal = mk_trp (dc_copy`UU`(con_app con args) === UU); |
|
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
252 |
val rews = the_list copy_strict @ copy_apps @ con_rews; |
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
253 |
(* FIXME! case_UU_tac *) |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
254 |
fun tacs ctxt = map (case_UU_tac ctxt rews 1) (nonlazy args) @ |
23152 | 255 |
[asm_simp_tac (HOLCF_ss addsimps rews) 1]; |
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
256 |
in |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
257 |
SOME (pg [] goal tacs) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
258 |
handle |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
259 |
THM (s, _, _) => (trace s; NONE) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
260 |
| ERROR s => (trace s; NONE) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
261 |
end; |
23152 | 262 |
|
35288 | 263 |
fun has_nonlazy_rec (_, _, args) = exists is_nonlazy_rec args; |
23152 | 264 |
in |
29402 | 265 |
val _ = trace " Proving copy_stricts..."; |
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
266 |
val copy_stricts = map_filter one_strict (filter has_nonlazy_rec cons); |
23152 | 267 |
end; |
268 |
||
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
269 |
val copy_rews = the_list copy_strict @ copy_apps @ copy_stricts; |
23152 | 270 |
|
271 |
in |
|
272 |
thy |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30280
diff
changeset
|
273 |
|> Sign.add_path (Long_Name.base_name dname) |
31004 | 274 |
|> snd o PureThy.add_thmss [ |
275 |
((Binding.name "iso_rews" , iso_rews ), [Simplifier.simp_add]), |
|
276 |
((Binding.name "exhaust" , [exhaust] ), []), |
|
277 |
((Binding.name "casedist" , [casedist] ), [Induct.cases_type dname]), |
|
278 |
((Binding.name "when_rews" , when_rews ), [Simplifier.simp_add]), |
|
279 |
((Binding.name "compacts" , con_compacts), [Simplifier.simp_add]), |
|
33427 | 280 |
((Binding.name "con_rews" , con_rews ), |
281 |
[Simplifier.simp_add, Fixrec.fixrec_simp_add]), |
|
31004 | 282 |
((Binding.name "sel_rews" , sel_rews ), [Simplifier.simp_add]), |
283 |
((Binding.name "dis_rews" , dis_rews ), [Simplifier.simp_add]), |
|
284 |
((Binding.name "pat_rews" , pat_rews ), [Simplifier.simp_add]), |
|
285 |
((Binding.name "dist_les" , dist_les ), [Simplifier.simp_add]), |
|
286 |
((Binding.name "dist_eqs" , dist_eqs ), [Simplifier.simp_add]), |
|
287 |
((Binding.name "inverts" , inverts ), [Simplifier.simp_add]), |
|
288 |
((Binding.name "injects" , injects ), [Simplifier.simp_add]), |
|
289 |
((Binding.name "copy_rews" , copy_rews ), [Simplifier.simp_add]), |
|
33427 | 290 |
((Binding.name "match_rews", mat_rews ), |
291 |
[Simplifier.simp_add, Fixrec.fixrec_simp_add])] |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24503
diff
changeset
|
292 |
|> Sign.parent_path |
28536 | 293 |
|> pair (iso_rews @ when_rews @ con_rews @ sel_rews @ dis_rews @ |
23152 | 294 |
pat_rews @ dist_les @ dist_eqs @ copy_rews) |
295 |
end; (* let *) |
|
296 |
||
297 |
fun comp_theorems (comp_dnam, eqs: eq list) thy = |
|
298 |
let |
|
27232 | 299 |
val global_ctxt = ProofContext.init thy; |
33801 | 300 |
val map_tab = Domain_Isomorphism.get_map_tab thy; |
27232 | 301 |
|
23152 | 302 |
val dnames = map (fst o fst) eqs; |
303 |
val conss = map snd eqs; |
|
28965 | 304 |
val comp_dname = Sign.full_bname thy comp_dnam; |
23152 | 305 |
|
29402 | 306 |
val _ = message ("Proving induction properties of domain "^comp_dname^" ..."); |
23152 | 307 |
val pg = pg' thy; |
308 |
||
309 |
(* ----- getting the composite axiom and definitions ------------------------ *) |
|
310 |
||
311 |
local |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26342
diff
changeset
|
312 |
fun ga s dn = PureThy.get_thm thy (dn ^ "." ^ s); |
23152 | 313 |
in |
314 |
val axs_reach = map (ga "reach" ) dnames; |
|
315 |
val axs_take_def = map (ga "take_def" ) dnames; |
|
316 |
val axs_finite_def = map (ga "finite_def") dnames; |
|
317 |
val ax_copy2_def = ga "copy_def" comp_dnam; |
|
35444 | 318 |
(* TEMPORARILY DISABLED |
23152 | 319 |
val ax_bisim_def = ga "bisim_def" comp_dnam; |
35444 | 320 |
TEMPORARILY DISABLED *) |
23152 | 321 |
end; |
322 |
||
323 |
local |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26342
diff
changeset
|
324 |
fun gt s dn = PureThy.get_thm thy (dn ^ "." ^ s); |
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26342
diff
changeset
|
325 |
fun gts s dn = PureThy.get_thms thy (dn ^ "." ^ s); |
23152 | 326 |
in |
327 |
val cases = map (gt "casedist" ) dnames; |
|
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
328 |
val con_rews = maps (gts "con_rews" ) dnames; |
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
329 |
val copy_rews = maps (gts "copy_rews") dnames; |
23152 | 330 |
end; |
331 |
||
332 |
fun dc_take dn = %%:(dn^"_take"); |
|
333 |
val x_name = idx_name dnames "x"; |
|
334 |
val P_name = idx_name dnames "P"; |
|
335 |
val n_eqs = length eqs; |
|
336 |
||
337 |
(* ----- theorems concerning finite approximation and finite induction ------ *) |
|
338 |
||
339 |
local |
|
32149
ef59550a55d3
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32126
diff
changeset
|
340 |
val iterate_Cprod_ss = global_simpset_of @{theory Fix}; |
23152 | 341 |
val copy_con_rews = copy_rews @ con_rews; |
342 |
val copy_take_defs = |
|
343 |
(if n_eqs = 1 then [] else [ax_copy2_def]) @ axs_take_def; |
|
29402 | 344 |
val _ = trace " Proving take_stricts..."; |
35057 | 345 |
fun one_take_strict ((dn, args), _) = |
23152 | 346 |
let |
35057 | 347 |
val goal = mk_trp (strict (dc_take dn $ %:"n")); |
348 |
val rules = [ |
|
349 |
@{thm monofun_fst [THEN monofunE]}, |
|
350 |
@{thm monofun_snd [THEN monofunE]}]; |
|
351 |
val tacs = [ |
|
352 |
rtac @{thm UU_I} 1, |
|
353 |
rtac @{thm below_eq_trans} 1, |
|
354 |
resolve_tac axs_reach 2, |
|
355 |
rtac @{thm monofun_cfun_fun} 1, |
|
356 |
REPEAT (resolve_tac rules 1), |
|
357 |
rtac @{thm iterate_below_fix} 1]; |
|
358 |
in pg axs_take_def goal (K tacs) end; |
|
359 |
val take_stricts = map one_take_strict eqs; |
|
23152 | 360 |
fun take_0 n dn = |
361 |
let |
|
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
362 |
val goal = mk_trp ((dc_take dn $ @{term "0::nat"}) `% x_name n === UU); |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
363 |
in pg axs_take_def goal (K [simp_tac iterate_Cprod_ss 1]) end; |
23152 | 364 |
val take_0s = mapn take_0 1 dnames; |
29402 | 365 |
val _ = trace " Proving take_apps..."; |
35288 | 366 |
fun one_take_app dn (con, _, args) = |
23152 | 367 |
let |
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
368 |
fun mk_take n = dc_take (List.nth (dnames, n)) $ %:"n"; |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
369 |
fun one_rhs arg = |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
370 |
if Datatype_Aux.is_rec_type (dtyp_of arg) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
371 |
then Domain_Axioms.copy_of_dtyp map_tab |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
372 |
mk_take (dtyp_of arg) ` (%# arg) |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
373 |
else (%# arg); |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
374 |
val lhs = (dc_take dn $ (%%:"Suc" $ %:"n"))`(con_app con args); |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
375 |
val rhs = con_app2 con one_rhs args; |
35059
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
376 |
fun is_rec arg = Datatype_Aux.is_rec_type (dtyp_of arg); |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
377 |
fun is_nonlazy_rec arg = is_rec arg andalso not (is_lazy arg); |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
378 |
fun nonlazy_rec args = map vname (filter is_nonlazy_rec args); |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
379 |
val goal = lift_defined %: (nonlazy_rec args, mk_trp (lhs === rhs)); |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
380 |
val tacs = [asm_simp_tac (HOLCF_ss addsimps copy_con_rews) 1]; |
acbc346e5310
correct definedness side conditions for copy_apps and take_apps
huffman
parents:
35058
diff
changeset
|
381 |
in pg copy_take_defs goal (K tacs) end; |
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
382 |
fun one_take_apps ((dn, _), cons) = map (one_take_app dn) cons; |
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
383 |
val take_apps = maps one_take_apps eqs; |
23152 | 384 |
in |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
34974
diff
changeset
|
385 |
val take_rews = map Drule.export_without_context |
35058
d0cc1650b378
handle case where copy_stricts cannot be proven; rewrite proof script for take_apps
huffman
parents:
35057
diff
changeset
|
386 |
(take_stricts @ take_0s @ take_apps); |
23152 | 387 |
end; (* local *) |
388 |
||
389 |
local |
|
35288 | 390 |
fun one_con p (con, _, args) = |
23152 | 391 |
let |
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
392 |
val P_names = map P_name (1 upto (length dnames)); |
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
393 |
val vns = Name.variant_list P_names (map vname args); |
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
394 |
val nonlazy_vns = map snd (filter_out (is_lazy o fst) (args ~~ vns)); |
23152 | 395 |
fun ind_hyp arg = %:(P_name (1 + rec_of arg)) $ bound_arg args arg; |
396 |
val t1 = mk_trp (%:p $ con_app2 con (bound_arg args) args); |
|
33317 | 397 |
val t2 = lift ind_hyp (filter is_rec args, t1); |
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
398 |
val t3 = lift_defined (bound_arg vns) (nonlazy_vns, t2); |
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
399 |
in Library.foldr mk_All (vns, t3) end; |
23152 | 400 |
|
401 |
fun one_eq ((p, cons), concl) = |
|
402 |
mk_trp (%:p $ UU) ===> Logic.list_implies (map (one_con p) cons, concl); |
|
403 |
||
404 |
fun ind_term concf = Library.foldr one_eq |
|
405 |
(mapn (fn n => fn x => (P_name n, x)) 1 conss, |
|
406 |
mk_trp (foldr1 mk_conj (mapn concf 1 dnames))); |
|
407 |
val take_ss = HOL_ss addsimps take_rews; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
408 |
fun quant_tac ctxt i = EVERY |
27239 | 409 |
(mapn (fn n => fn _ => res_inst_tac ctxt [(("x", 0), x_name n)] spec i) 1 dnames); |
23152 | 410 |
|
411 |
fun ind_prems_tac prems = EVERY |
|
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
412 |
(maps (fn cons => |
23152 | 413 |
(resolve_tac prems 1 :: |
35288 | 414 |
maps (fn (_,_,args) => |
23152 | 415 |
resolve_tac prems 1 :: |
416 |
map (K(atac 1)) (nonlazy args) @ |
|
33317 | 417 |
map (K(atac 1)) (filter is_rec args)) |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
418 |
cons)) |
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
419 |
conss); |
23152 | 420 |
local |
421 |
(* check whether every/exists constructor of the n-th part of the equation: |
|
422 |
it has a possibly indirectly recursive argument that isn't/is possibly |
|
423 |
indirectly lazy *) |
|
424 |
fun rec_to quant nfn rfn ns lazy_rec (n,cons) = quant (exists (fn arg => |
|
425 |
is_rec arg andalso not(rec_of arg mem ns) andalso |
|
426 |
((rec_of arg = n andalso nfn(lazy_rec orelse is_lazy arg)) orelse |
|
427 |
rec_of arg <> n andalso rec_to quant nfn rfn (rec_of arg::ns) |
|
428 |
(lazy_rec orelse is_lazy arg) (n, (List.nth(conss,rec_of arg)))) |
|
35288 | 429 |
) o third) cons; |
23152 | 430 |
fun all_rec_to ns = rec_to forall not all_rec_to ns; |
431 |
fun warn (n,cons) = |
|
432 |
if all_rec_to [] false (n,cons) |
|
433 |
then (warning ("domain "^List.nth(dnames,n)^" is empty!"); true) |
|
434 |
else false; |
|
435 |
fun lazy_rec_to ns = rec_to exists I lazy_rec_to ns; |
|
436 |
||
437 |
in |
|
438 |
val n__eqs = mapn (fn n => fn (_,cons) => (n,cons)) 0 eqs; |
|
439 |
val is_emptys = map warn n__eqs; |
|
440 |
val is_finite = forall (not o lazy_rec_to [] false) n__eqs; |
|
441 |
end; |
|
442 |
in (* local *) |
|
29402 | 443 |
val _ = trace " Proving finite_ind..."; |
23152 | 444 |
val finite_ind = |
445 |
let |
|
446 |
fun concf n dn = %:(P_name n) $ (dc_take dn $ %:"n" `%(x_name n)); |
|
447 |
val goal = ind_term concf; |
|
448 |
||
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
449 |
fun tacf {prems, context} = |
23152 | 450 |
let |
451 |
val tacs1 = [ |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
452 |
quant_tac context 1, |
23152 | 453 |
simp_tac HOL_ss 1, |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
454 |
InductTacs.induct_tac context [[SOME "n"]] 1, |
23152 | 455 |
simp_tac (take_ss addsimps prems) 1, |
456 |
TRY (safe_tac HOL_cs)]; |
|
457 |
fun arg_tac arg = |
|
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
458 |
(* FIXME! case_UU_tac *) |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
459 |
case_UU_tac context (prems @ con_rews) 1 |
23152 | 460 |
(List.nth (dnames, rec_of arg) ^ "_take n$" ^ vname arg); |
35288 | 461 |
fun con_tacs (con, _, args) = |
23152 | 462 |
asm_simp_tac take_ss 1 :: |
33317 | 463 |
map arg_tac (filter is_nonlazy_rec args) @ |
23152 | 464 |
[resolve_tac prems 1] @ |
33317 | 465 |
map (K (atac 1)) (nonlazy args) @ |
466 |
map (K (etac spec 1)) (filter is_rec args); |
|
23152 | 467 |
fun cases_tacs (cons, cases) = |
27239 | 468 |
res_inst_tac context [(("x", 0), "x")] cases 1 :: |
23152 | 469 |
asm_simp_tac (take_ss addsimps prems) 1 :: |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
470 |
maps con_tacs cons; |
23152 | 471 |
in |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
472 |
tacs1 @ maps cases_tacs (conss ~~ cases) |
23152 | 473 |
end; |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
474 |
in pg'' thy [] goal tacf |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
475 |
handle ERROR _ => (warning "Proof of finite_ind failed."; TrueI) |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
476 |
end; |
23152 | 477 |
|
29402 | 478 |
val _ = trace " Proving take_lemmas..."; |
23152 | 479 |
val take_lemmas = |
480 |
let |
|
481 |
fun take_lemma n (dn, ax_reach) = |
|
482 |
let |
|
483 |
val lhs = dc_take dn $ Bound 0 `%(x_name n); |
|
484 |
val rhs = dc_take dn $ Bound 0 `%(x_name n^"'"); |
|
485 |
val concl = mk_trp (%:(x_name n) === %:(x_name n^"'")); |
|
486 |
val goal = mk_All ("n", mk_trp (lhs === rhs)) ===> concl; |
|
33396 | 487 |
val rules = [contlub_fst RS contlubE RS ssubst, |
488 |
contlub_snd RS contlubE RS ssubst]; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
489 |
fun tacf {prems, context} = [ |
27239 | 490 |
res_inst_tac context [(("t", 0), x_name n )] (ax_reach RS subst) 1, |
491 |
res_inst_tac context [(("t", 0), x_name n^"'")] (ax_reach RS subst) 1, |
|
23152 | 492 |
stac fix_def2 1, |
493 |
REPEAT (CHANGED |
|
33396 | 494 |
(resolve_tac rules 1 THEN chain_tac 1)), |
23152 | 495 |
stac contlub_cfun_fun 1, |
496 |
stac contlub_cfun_fun 2, |
|
497 |
rtac lub_equal 3, |
|
498 |
chain_tac 1, |
|
499 |
rtac allI 1, |
|
500 |
resolve_tac prems 1]; |
|
501 |
in pg'' thy axs_take_def goal tacf end; |
|
502 |
in mapn take_lemma 1 (dnames ~~ axs_reach) end; |
|
503 |
||
504 |
(* ----- theorems concerning finiteness and induction ----------------------- *) |
|
505 |
||
29402 | 506 |
val _ = trace " Proving finites, ind..."; |
23152 | 507 |
val (finites, ind) = |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
508 |
( |
23152 | 509 |
if is_finite |
510 |
then (* finite case *) |
|
511 |
let |
|
512 |
fun take_enough dn = mk_ex ("n",dc_take dn $ Bound 0 ` %:"x" === %:"x"); |
|
513 |
fun dname_lemma dn = |
|
514 |
let |
|
515 |
val prem1 = mk_trp (defined (%:"x")); |
|
516 |
val disj1 = mk_all ("n", dc_take dn $ Bound 0 ` %:"x" === UU); |
|
517 |
val prem2 = mk_trp (mk_disj (disj1, take_enough dn)); |
|
518 |
val concl = mk_trp (take_enough dn); |
|
519 |
val goal = prem1 ===> prem2 ===> concl; |
|
520 |
val tacs = [ |
|
521 |
etac disjE 1, |
|
522 |
etac notE 1, |
|
523 |
resolve_tac take_lemmas 1, |
|
524 |
asm_simp_tac take_ss 1, |
|
525 |
atac 1]; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
526 |
in pg [] goal (K tacs) end; |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
527 |
val _ = trace " Proving finite_lemmas1a"; |
23152 | 528 |
val finite_lemmas1a = map dname_lemma dnames; |
529 |
||
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
530 |
val _ = trace " Proving finite_lemma1b"; |
23152 | 531 |
val finite_lemma1b = |
532 |
let |
|
533 |
fun mk_eqn n ((dn, args), _) = |
|
534 |
let |
|
535 |
val disj1 = dc_take dn $ Bound 1 ` Bound 0 === UU; |
|
536 |
val disj2 = dc_take dn $ Bound 1 ` Bound 0 === Bound 0; |
|
537 |
in |
|
538 |
mk_constrainall |
|
539 |
(x_name n, Type (dn,args), mk_disj (disj1, disj2)) |
|
540 |
end; |
|
541 |
val goal = |
|
542 |
mk_trp (mk_all ("n", foldr1 mk_conj (mapn mk_eqn 1 eqs))); |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
543 |
fun arg_tacs ctxt vn = [ |
27239 | 544 |
eres_inst_tac ctxt [(("x", 0), vn)] all_dupE 1, |
23152 | 545 |
etac disjE 1, |
546 |
asm_simp_tac (HOL_ss addsimps con_rews) 1, |
|
547 |
asm_simp_tac take_ss 1]; |
|
35288 | 548 |
fun con_tacs ctxt (con, _, args) = |
23152 | 549 |
asm_simp_tac take_ss 1 :: |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
550 |
maps (arg_tacs ctxt) (nonlazy_rec args); |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
551 |
fun foo_tacs ctxt n (cons, cases) = |
23152 | 552 |
simp_tac take_ss 1 :: |
553 |
rtac allI 1 :: |
|
27239 | 554 |
res_inst_tac ctxt [(("x", 0), x_name n)] cases 1 :: |
23152 | 555 |
asm_simp_tac take_ss 1 :: |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
556 |
maps (con_tacs ctxt) cons; |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
557 |
fun tacs ctxt = |
23152 | 558 |
rtac allI 1 :: |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
559 |
InductTacs.induct_tac ctxt [[SOME "n"]] 1 :: |
23152 | 560 |
simp_tac take_ss 1 :: |
561 |
TRY (safe_tac (empty_cs addSEs [conjE] addSIs [conjI])) :: |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
562 |
flat (mapn (foo_tacs ctxt) 1 (conss ~~ cases)); |
23152 | 563 |
in pg [] goal tacs end; |
564 |
||
565 |
fun one_finite (dn, l1b) = |
|
566 |
let |
|
567 |
val goal = mk_trp (%%:(dn^"_finite") $ %:"x"); |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
568 |
fun tacs ctxt = [ |
35443
2e0f9516947e
change domain package's treatment of variable names in theorems to be like datatype package
huffman
parents:
35288
diff
changeset
|
569 |
(* FIXME! case_UU_tac *) |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
570 |
case_UU_tac ctxt take_rews 1 "x", |
23152 | 571 |
eresolve_tac finite_lemmas1a 1, |
572 |
step_tac HOL_cs 1, |
|
573 |
step_tac HOL_cs 1, |
|
574 |
cut_facts_tac [l1b] 1, |
|
575 |
fast_tac HOL_cs 1]; |
|
576 |
in pg axs_finite_def goal tacs end; |
|
577 |
||
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
578 |
val _ = trace " Proving finites"; |
27232 | 579 |
val finites = map one_finite (dnames ~~ atomize global_ctxt finite_lemma1b); |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
580 |
val _ = trace " Proving ind"; |
23152 | 581 |
val ind = |
582 |
let |
|
583 |
fun concf n dn = %:(P_name n) $ %:(x_name n); |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
584 |
fun tacf {prems, context} = |
23152 | 585 |
let |
586 |
fun finite_tacs (finite, fin_ind) = [ |
|
587 |
rtac(rewrite_rule axs_finite_def finite RS exE)1, |
|
588 |
etac subst 1, |
|
589 |
rtac fin_ind 1, |
|
590 |
ind_prems_tac prems]; |
|
591 |
in |
|
592 |
TRY (safe_tac HOL_cs) :: |
|
27232 | 593 |
maps finite_tacs (finites ~~ atomize global_ctxt finite_ind) |
23152 | 594 |
end; |
595 |
in pg'' thy [] (ind_term concf) tacf end; |
|
596 |
in (finites, ind) end (* let *) |
|
597 |
||
598 |
else (* infinite case *) |
|
599 |
let |
|
600 |
fun one_finite n dn = |
|
27239 | 601 |
read_instantiate global_ctxt [(("P", 0), dn ^ "_finite " ^ x_name n)] excluded_middle; |
23152 | 602 |
val finites = mapn one_finite 1 dnames; |
603 |
||
604 |
val goal = |
|
605 |
let |
|
26012 | 606 |
fun one_adm n _ = mk_trp (mk_adm (%:(P_name n))); |
23152 | 607 |
fun concf n dn = %:(P_name n) $ %:(x_name n); |
608 |
in Logic.list_implies (mapn one_adm 1 dnames, ind_term concf) end; |
|
33396 | 609 |
val cont_rules = |
610 |
[cont_id, cont_const, cont2cont_Rep_CFun, |
|
611 |
cont2cont_fst, cont2cont_snd]; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
612 |
fun tacf {prems, context} = |
23152 | 613 |
map (fn ax_reach => rtac (ax_reach RS subst) 1) axs_reach @ [ |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
614 |
quant_tac context 1, |
23152 | 615 |
rtac (adm_impl_admw RS wfix_ind) 1, |
25895
0eaadfa8889e
converted adm_all and adm_ball to rule_format; cleaned up
huffman
parents:
25805
diff
changeset
|
616 |
REPEAT_DETERM (rtac adm_all 1), |
23152 | 617 |
REPEAT_DETERM ( |
618 |
TRY (rtac adm_conj 1) THEN |
|
619 |
rtac adm_subst 1 THEN |
|
33396 | 620 |
REPEAT (resolve_tac cont_rules 1) THEN |
621 |
resolve_tac prems 1), |
|
23152 | 622 |
strip_tac 1, |
623 |
rtac (rewrite_rule axs_take_def finite_ind) 1, |
|
624 |
ind_prems_tac prems]; |
|
625 |
val ind = (pg'' thy [] goal tacf |
|
626 |
handle ERROR _ => |
|
33396 | 627 |
(warning "Cannot prove infinite induction rule"; TrueI)); |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
628 |
in (finites, ind) end |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
629 |
) |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
630 |
handle THM _ => |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
631 |
(warning "Induction proofs failed (THM raised)."; ([], TrueI)) |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
632 |
| ERROR _ => |
33810
38375b16ffd9
nicer warning message for indirect-recursive domain definitions
huffman
parents:
33801
diff
changeset
|
633 |
(warning "Cannot prove induction rule"; ([], TrueI)); |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
634 |
|
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
635 |
|
23152 | 636 |
end; (* local *) |
637 |
||
638 |
(* ----- theorem concerning coinduction ------------------------------------- *) |
|
639 |
||
35444 | 640 |
(* COINDUCTION TEMPORARILY DISABLED |
23152 | 641 |
local |
642 |
val xs = mapn (fn n => K (x_name n)) 1 dnames; |
|
643 |
fun bnd_arg n i = Bound(2*(n_eqs - n)-i-1); |
|
644 |
val take_ss = HOL_ss addsimps take_rews; |
|
645 |
val sproj = prj (fn s => K("fst("^s^")")) (fn s => K("snd("^s^")")); |
|
29402 | 646 |
val _ = trace " Proving coind_lemma..."; |
23152 | 647 |
val coind_lemma = |
648 |
let |
|
649 |
fun mk_prj n _ = proj (%:"R") eqs n $ bnd_arg n 0 $ bnd_arg n 1; |
|
650 |
fun mk_eqn n dn = |
|
651 |
(dc_take dn $ %:"n" ` bnd_arg n 0) === |
|
652 |
(dc_take dn $ %:"n" ` bnd_arg n 1); |
|
653 |
fun mk_all2 (x,t) = mk_all (x, mk_all (x^"'", t)); |
|
654 |
val goal = |
|
655 |
mk_trp (mk_imp (%%:(comp_dname^"_bisim") $ %:"R", |
|
656 |
Library.foldr mk_all2 (xs, |
|
657 |
Library.foldr mk_imp (mapn mk_prj 0 dnames, |
|
658 |
foldr1 mk_conj (mapn mk_eqn 0 dnames))))); |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
659 |
fun x_tacs ctxt n x = [ |
23152 | 660 |
rotate_tac (n+1) 1, |
661 |
etac all2E 1, |
|
27239 | 662 |
eres_inst_tac ctxt [(("P", 1), sproj "R" eqs n^" "^x^" "^x^"'")] (mp RS disjE) 1, |
23152 | 663 |
TRY (safe_tac HOL_cs), |
664 |
REPEAT (CHANGED (asm_simp_tac take_ss 1))]; |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
665 |
fun tacs ctxt = [ |
23152 | 666 |
rtac impI 1, |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
667 |
InductTacs.induct_tac ctxt [[SOME "n"]] 1, |
23152 | 668 |
simp_tac take_ss 1, |
669 |
safe_tac HOL_cs] @ |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
670 |
flat (mapn (x_tacs ctxt) 0 xs); |
23152 | 671 |
in pg [ax_bisim_def] goal tacs end; |
672 |
in |
|
29402 | 673 |
val _ = trace " Proving coind..."; |
23152 | 674 |
val coind = |
675 |
let |
|
676 |
fun mk_prj n x = mk_trp (proj (%:"R") eqs n $ %:x $ %:(x^"'")); |
|
677 |
fun mk_eqn x = %:x === %:(x^"'"); |
|
678 |
val goal = |
|
679 |
mk_trp (%%:(comp_dname^"_bisim") $ %:"R") ===> |
|
680 |
Logic.list_implies (mapn mk_prj 0 xs, |
|
681 |
mk_trp (foldr1 mk_conj (map mk_eqn xs))); |
|
682 |
val tacs = |
|
683 |
TRY (safe_tac HOL_cs) :: |
|
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
684 |
maps (fn take_lemma => [ |
23152 | 685 |
rtac take_lemma 1, |
686 |
cut_facts_tac [coind_lemma] 1, |
|
687 |
fast_tac HOL_cs 1]) |
|
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26012
diff
changeset
|
688 |
take_lemmas; |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
27153
diff
changeset
|
689 |
in pg [] goal (K tacs) end; |
23152 | 690 |
end; (* local *) |
35444 | 691 |
COINDUCTION TEMPORARILY DISABLED *) |
23152 | 692 |
|
32172 | 693 |
val inducts = Project_Rule.projections (ProofContext.init thy) ind; |
30829 | 694 |
fun ind_rule (dname, rule) = ((Binding.empty, [rule]), [Induct.induct_type dname]); |
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
695 |
val induct_failed = (Thm.prop_of ind = Thm.prop_of TrueI); |
30829 | 696 |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24503
diff
changeset
|
697 |
in thy |> Sign.add_path comp_dnam |
31004 | 698 |
|> snd o PureThy.add_thmss [ |
699 |
((Binding.name "take_rews" , take_rews ), [Simplifier.simp_add]), |
|
700 |
((Binding.name "take_lemmas", take_lemmas ), []), |
|
701 |
((Binding.name "finites" , finites ), []), |
|
702 |
((Binding.name "finite_ind" , [finite_ind]), []), |
|
35444 | 703 |
((Binding.name "ind" , [ind] ), [])(*, |
704 |
((Binding.name "coind" , [coind] ), [])*)] |
|
31232
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
705 |
|> (if induct_failed then I |
689aa7da48cc
define copy functions using combinators; add checking for failed proofs of induction rules
huffman
parents:
31160
diff
changeset
|
706 |
else snd o PureThy.add_thmss (map ind_rule (dnames ~~ inducts))) |
28536 | 707 |
|> Sign.parent_path |> pair take_rews |
23152 | 708 |
end; (* let *) |
709 |
end; (* struct *) |