author | huffman |
Wed, 08 Jun 2005 02:27:19 +0200 | |
changeset 16321 | ef32a42f4079 |
parent 16224 | 57094b83774e |
child 16385 | a9dec1969348 |
permissions | -rw-r--r-- |
2276 | 1 |
(* Title: HOLCF/domain/theorems.ML |
2445
51993fea433f
removed Holcfb.thy and Holcfb.ML, moving classical3 to HOL.ML as classical2
oheimb
parents:
2276
diff
changeset
|
2 |
ID: $Id$ |
12030 | 3 |
Author: David von Oheimb |
15742 | 4 |
New proofs/tactics by Brian Huffman |
2445
51993fea433f
removed Holcfb.thy and Holcfb.ML, moving classical3 to HOL.ML as classical2
oheimb
parents:
2276
diff
changeset
|
5 |
|
12030 | 6 |
Proof generator for domain section. |
1274 | 7 |
*) |
8 |
||
2446
c2a9bf6c0948
The previous log message was wrong. The correct one is:
oheimb
parents:
2445
diff
changeset
|
9 |
|
1274 | 10 |
structure Domain_Theorems = struct |
11 |
||
12 |
local |
|
13 |
||
14 |
open Domain_Library; |
|
15 |
infixr 0 ===>;infixr 0 ==>;infix 0 == ; |
|
16 |
infix 1 ===; infix 1 ~= ; infix 1 <<; infix 1 ~<<; |
|
17 |
infix 9 ` ; infix 9 `% ; infix 9 `%%; infixr 9 oo; |
|
18 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
19 |
(* ----- general proof facilities ------------------------------------------- *) |
1274 | 20 |
|
14820 | 21 |
fun inferT sg pre_tm = |
15531 | 22 |
#1 (Sign.infer_types (Sign.pp sg) sg (K NONE) (K NONE) [] true ([pre_tm],propT)); |
1274 | 23 |
|
24 |
fun pg'' thy defs t = let val sg = sign_of thy; |
|
2033 | 25 |
val ct = Thm.cterm_of sg (inferT sg t); |
26 |
in prove_goalw_cterm defs ct end; |
|
1274 | 27 |
fun pg' thy defs t tacsf=pg'' thy defs t (fn [] => tacsf |
2033 | 28 |
| prems=> (cut_facts_tac prems 1)::tacsf); |
1274 | 29 |
|
2033 | 30 |
fun case_UU_tac rews i v = case_tac (v^"=UU") i THEN |
31 |
asm_simp_tac (HOLCF_ss addsimps rews) i; |
|
1274 | 32 |
|
33 |
val chain_tac = REPEAT_DETERM o resolve_tac |
|
5291 | 34 |
[chain_iterate, ch2ch_Rep_CFunR, ch2ch_Rep_CFunL]; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
35 |
|
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
36 |
(* ----- general proofs ----------------------------------------------------- *) |
1274 | 37 |
|
1644 | 38 |
val all2E = prove_goal HOL.thy "[| !x y . P x y; P x y ==> R |] ==> R" |
39 |
(fn prems =>[ |
|
2033 | 40 |
resolve_tac prems 1, |
41 |
cut_facts_tac prems 1, |
|
42 |
fast_tac HOL_cs 1]); |
|
1274 | 43 |
|
10230 | 44 |
val dist_eqI = prove_goal Porder.thy "!!x::'a::po. ~ x << y ==> x ~= y" |
45 |
(fn prems => [ |
|
46 |
(blast_tac (claset() addDs [antisym_less_inverse]) 1)]); |
|
4755 | 47 |
(* |
48 |
infixr 0 y; |
|
49 |
val b = 0; |
|
50 |
fun _ y t = by t; |
|
51 |
fun g defs t = let val sg = sign_of thy; |
|
52 |
val ct = Thm.cterm_of sg (inferT sg t); |
|
53 |
in goalw_cterm defs ct end; |
|
54 |
*) |
|
1274 | 55 |
|
56 |
in |
|
57 |
||
4043 | 58 |
fun theorems (((dname,_),cons) : eq, eqs : eq list) thy = |
1274 | 59 |
let |
60 |
||
4030 | 61 |
val dummy = writeln ("Proving isomorphism properties of domain "^dname^" ..."); |
1274 | 62 |
val pg = pg' thy; |
63 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
64 |
(* ----- getting the axioms and definitions --------------------------------- *) |
1274 | 65 |
|
15531 | 66 |
local fun ga s dn = get_thm thy (dn ^ "." ^ s, NONE) in |
4043 | 67 |
val ax_abs_iso = ga "abs_iso" dname; |
68 |
val ax_rep_iso = ga "rep_iso" dname; |
|
69 |
val ax_when_def = ga "when_def" dname; |
|
70 |
val axs_con_def = map (fn (con,_) => ga (extern_name con^"_def") dname) cons; |
|
71 |
val axs_dis_def = map (fn (con,_) => ga ( dis_name con^"_def") dname) cons; |
|
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
72 |
val axs_mat_def = map (fn (con,_) => ga ( mat_name con^"_def") dname) cons; |
15570 | 73 |
val axs_sel_def = List.concat(map (fn (_,args) => |
4043 | 74 |
map (fn arg => ga (sel_of arg ^"_def") dname) args) |
75 |
cons); |
|
76 |
val ax_copy_def = ga "copy_def" dname; |
|
1274 | 77 |
end; (* local *) |
78 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
79 |
(* ----- theorems concerning the isomorphism -------------------------------- *) |
1274 | 80 |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
81 |
val dc_abs = %%:(dname^"_abs"); |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
82 |
val dc_rep = %%:(dname^"_rep"); |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
83 |
val dc_copy = %%:(dname^"_copy"); |
1274 | 84 |
val x_name = "x"; |
85 |
||
15742 | 86 |
val iso_locale = iso_intro OF [ax_abs_iso, ax_rep_iso]; |
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
87 |
val abs_strict = ax_rep_iso RS (allI RS retraction_strict); |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
88 |
val rep_strict = ax_abs_iso RS (allI RS retraction_strict); |
15742 | 89 |
val abs_defin' = iso_locale RS iso_abs_defin'; |
90 |
val rep_defin' = iso_locale RS iso_rep_defin'; |
|
12037 | 91 |
val iso_rews = map standard [ax_abs_iso,ax_rep_iso,abs_strict,rep_strict]; |
1274 | 92 |
|
15742 | 93 |
(* ----- generating beta reduction rules from definitions-------------------- *) |
94 |
||
95 |
local |
|
96 |
fun k NONE = cont_const | k (SOME x) = x; |
|
97 |
||
98 |
fun ap NONE NONE = NONE |
|
99 |
| ap x y = SOME (standard (cont2cont_Rep_CFun OF [k x, k y])); |
|
100 |
||
101 |
fun var 0 = [SOME cont_id] |
|
102 |
| var n = NONE :: var (n-1); |
|
103 |
||
104 |
fun zip [] [] = [] |
|
105 |
| zip [] (y::ys) = (ap NONE y ) :: zip [] ys |
|
106 |
| zip (x::xs) [] = (ap x NONE) :: zip xs [] |
|
107 |
| zip (x::xs) (y::ys) = (ap x y ) :: zip xs ys |
|
108 |
||
109 |
fun lam [] = ([], cont_const) |
|
110 |
| lam (x::ys) = let val x' = k x |
|
111 |
val Lx = x' RS cont2cont_LAM |
|
112 |
in (map (fn y => SOME (k y RS Lx)) ys, x') |
|
113 |
end; |
|
114 |
||
115 |
fun term_conts (Bound n) = (var n, []) |
|
116 |
| term_conts (Const _) = ([],[]) |
|
117 |
| term_conts (Const _ $ Abs (_,_,t)) = let |
|
118 |
val (cs,ls) = term_conts t |
|
119 |
val (cs',l) = lam cs |
|
120 |
in (cs',l::ls) |
|
121 |
end |
|
122 |
| term_conts (Const _ $ f $ t) |
|
123 |
= (zip (fst (term_conts f)) (fst (term_conts t)), []) |
|
124 |
| term_conts t = let val dummy = prin t in ([],[]) end; |
|
125 |
||
126 |
fun arglist (Const _ $ Abs (s,_,t)) = let |
|
127 |
val (vars,body) = arglist t |
|
128 |
in (s :: vars, body) end |
|
129 |
| arglist t = ([],t); |
|
130 |
fun bind_fun vars t = Library.foldr mk_All (vars,t); |
|
131 |
fun bound_vars 0 = [] | bound_vars i = (Bound (i-1) :: bound_vars (i-1)); |
|
132 |
in |
|
133 |
fun appl_of_def def = let |
|
134 |
val (_ $ con $ lam) = concl_of def |
|
135 |
val (vars, rhs) = arglist lam |
|
136 |
val lhs = Library.foldl (op `) (con, bound_vars (length vars)); |
|
137 |
val appl = bind_fun vars (lhs == rhs) |
|
138 |
val ([],cs) = term_conts lam |
|
139 |
val betas = map (fn c => mk_meta_eq (c RS beta_cfun)) cs |
|
140 |
in pg (def::betas) appl [rtac reflexive_thm 1] end; |
|
141 |
end; |
|
142 |
||
143 |
val when_appl = appl_of_def ax_when_def; |
|
144 |
val con_appls = map appl_of_def axs_con_def; |
|
145 |
||
146 |
local |
|
147 |
fun arg2typ n arg = let val t = TVar (("'a",n),["Pcpo.pcpo"]) |
|
148 |
in (n+1, if is_lazy arg then mk_uT t else t) end; |
|
149 |
fun args2typ n [] = (n,oneT) |
|
150 |
| args2typ n [arg] = arg2typ n arg |
|
151 |
| args2typ n (arg::args) = let val (n1,t1) = arg2typ n arg; |
|
152 |
val (n2,t2) = args2typ n1 args |
|
153 |
in (n2, mk_sprodT (t1, t2)) end; |
|
154 |
fun cons2typ n [] = (n,oneT) |
|
155 |
| cons2typ n [con] = args2typ n (snd con) |
|
156 |
| cons2typ n (con::cons) = let val (n1,t1) = args2typ n (snd con); |
|
157 |
val (n2,t2) = cons2typ n1 cons |
|
158 |
in (n2, mk_ssumT (t1, t2)) end; |
|
159 |
in |
|
160 |
fun cons2ctyp cons = ctyp_of (sign_of thy) (snd (cons2typ 1 cons)); |
|
161 |
end; |
|
162 |
||
1274 | 163 |
local |
15742 | 164 |
val iso_swap = iso_locale RS iso_iso_swap; |
1274 | 165 |
fun one_con (con,args) = let val vns = map vname args in |
15742 | 166 |
Library.foldr mk_ex (vns, foldr' mk_conj ((%:x_name === con_app2 con %: vns):: |
167 |
map (defined o %:) (nonlazy args))) end; |
|
168 |
val exh = foldr' mk_disj ((%:x_name===UU)::map one_con cons); |
|
169 |
val my_ctyp = cons2ctyp cons; |
|
170 |
val thm1 = instantiate' [SOME my_ctyp] [] exh_start; |
|
171 |
val thm2 = rewrite_rule (map mk_meta_eq ex_defined_iffs) thm1; |
|
172 |
val thm3 = rewrite_rule [mk_meta_eq conj_assoc] thm2; |
|
1274 | 173 |
in |
15742 | 174 |
val exhaust = pg con_appls (mk_trp exh)[ |
175 |
(* first 3 rules replace "x = UU \/ P" with "rep$x = UU \/ P" *) |
|
176 |
rtac disjE 1, |
|
177 |
etac (rep_defin' RS disjI1) 2, |
|
178 |
etac disjI2 2, |
|
179 |
rewrite_goals_tac [mk_meta_eq iso_swap], |
|
180 |
rtac thm3 1]; |
|
181 |
val casedist = standard (rewrite_rule exh_casedists (exhaust RS exh_casedist0)); |
|
1274 | 182 |
end; |
183 |
||
184 |
local |
|
15570 | 185 |
fun bind_fun t = Library.foldr mk_All (when_funs cons,t); |
1829 | 186 |
fun bound_fun i _ = Bound (length cons - i); |
15570 | 187 |
val when_app = Library.foldl (op `) (%%:(dname^"_when"), mapn bound_fun 1 cons); |
1274 | 188 |
in |
15742 | 189 |
val when_strict = pg [when_appl, mk_meta_eq rep_strict] |
190 |
(bind_fun(mk_trp(strict when_app))) |
|
191 |
[resolve_tac [sscase1,ssplit1,strictify1] 1]; |
|
192 |
val when_apps = let fun one_when n (con,args) = pg (when_appl :: con_appls) |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
193 |
(bind_fun (lift_defined %: (nonlazy args, |
2033 | 194 |
mk_trp(when_app`(con_app con args) === |
5291 | 195 |
mk_cRep_CFun(bound_fun n 0,map %# args)))))[ |
15742 | 196 |
asm_simp_tac (HOLCF_ss addsimps [ax_abs_iso]) 1]; |
2033 | 197 |
in mapn one_when 1 cons end; |
1274 | 198 |
end; |
199 |
val when_rews = when_strict::when_apps; |
|
200 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
201 |
(* ----- theorems concerning the constructors, discriminators and selectors - *) |
1274 | 202 |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
203 |
val dis_rews = let |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
204 |
val dis_stricts = map (fn (con,_) => pg axs_dis_def (mk_trp( |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
205 |
strict(%%:(dis_name con)))) [ |
15742 | 206 |
rtac when_strict 1]) cons; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
207 |
val dis_apps = let fun one_dis c (con,args)= pg axs_dis_def |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
208 |
(lift_defined %: (nonlazy args, |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
209 |
(mk_trp((%%:(dis_name c))`(con_app con args) === |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
210 |
%%:(if con=c then "TT" else "FF"))))) [ |
2033 | 211 |
asm_simp_tac (HOLCF_ss addsimps when_rews) 1]; |
15570 | 212 |
in List.concat(map (fn (c,_) => map (one_dis c) cons) cons) end; |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
213 |
val dis_defins = map (fn (con,args) => pg [] (defined(%:x_name) ==> |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
214 |
defined(%%:(dis_name con)`%x_name)) [ |
4043 | 215 |
rtac casedist 1, |
2033 | 216 |
contr_tac 1, |
8149
941afb897532
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
oheimb
parents:
7906
diff
changeset
|
217 |
DETERM_UNTIL_SOLVED (CHANGED(asm_simp_tac |
2033 | 218 |
(HOLCF_ss addsimps dis_apps) 1))]) cons; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
219 |
in dis_stricts @ dis_defins @ dis_apps end; |
1274 | 220 |
|
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
221 |
val mat_rews = let |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
222 |
val mat_stricts = map (fn (con,_) => pg axs_mat_def (mk_trp( |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
223 |
strict(%%:(mat_name con)))) [ |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
224 |
rtac when_strict 1]) cons; |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
225 |
val mat_apps = let fun one_mat c (con,args)= pg axs_mat_def |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
226 |
(lift_defined %: (nonlazy args, |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
227 |
(mk_trp((%%:(mat_name c))`(con_app con args) === |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
228 |
(if con=c then (%%:"return")`(mk_ctuple (map %# args)) else %%:"fail"))))) [ |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
229 |
asm_simp_tac (HOLCF_ss addsimps when_rews) 1]; |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
230 |
in List.concat(map (fn (c,_) => map (one_mat c) cons) cons) end; |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
231 |
in mat_stricts @ mat_apps end; |
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
232 |
|
15570 | 233 |
val con_stricts = List.concat(map (fn (con,args) => map (fn vn => |
15742 | 234 |
pg con_appls |
2033 | 235 |
(mk_trp(con_app2 con (fn arg => if vname arg = vn |
236 |
then UU else %# arg) args === UU))[ |
|
237 |
asm_simp_tac (HOLCF_ss addsimps [abs_strict]) 1] |
|
238 |
) (nonlazy args)) cons); |
|
1274 | 239 |
val con_defins = map (fn (con,args) => pg [] |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
240 |
(lift_defined %: (nonlazy args, |
2033 | 241 |
mk_trp(defined(con_app con args)))) ([ |
2445
51993fea433f
removed Holcfb.thy and Holcfb.ML, moving classical3 to HOL.ML as classical2
oheimb
parents:
2276
diff
changeset
|
242 |
rtac rev_contrapos 1, |
2033 | 243 |
eres_inst_tac [("f",dis_name con)] cfun_arg_cong 1, |
244 |
asm_simp_tac (HOLCF_ss addsimps dis_rews) 1] )) cons; |
|
1274 | 245 |
val con_rews = con_stricts @ con_defins; |
246 |
||
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
247 |
val sel_stricts = let fun one_sel sel = pg axs_sel_def (mk_trp(strict(%%:sel))) [ |
2033 | 248 |
simp_tac (HOLCF_ss addsimps when_rews) 1]; |
15570 | 249 |
in List.concat(map (fn (_,args) =>map (fn arg => one_sel (sel_of arg)) args) cons) end; |
1274 | 250 |
val sel_apps = let fun one_sel c n sel = map (fn (con,args) => |
2033 | 251 |
let val nlas = nonlazy args; |
252 |
val vns = map vname args; |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
253 |
in pg axs_sel_def (lift_defined %: |
15570 | 254 |
(List.filter (fn v => con=c andalso (v<>List.nth(vns,n))) nlas, |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
255 |
mk_trp((%%:sel)`(con_app con args) === |
15570 | 256 |
(if con=c then %:(List.nth(vns,n)) else UU)))) |
2033 | 257 |
( (if con=c then [] |
258 |
else map(case_UU_tac(when_rews@con_stricts)1) nlas) |
|
15570 | 259 |
@(if con=c andalso ((List.nth(vns,n)) mem nlas) |
2033 | 260 |
then[case_UU_tac (when_rews @ con_stricts) 1 |
15570 | 261 |
(List.nth(vns,n))] else []) |
2033 | 262 |
@ [asm_simp_tac(HOLCF_ss addsimps when_rews)1])end) cons; |
15570 | 263 |
in List.concat(map (fn (c,args) => |
264 |
List.concat(mapn (fn n => fn arg => one_sel c n (sel_of arg)) 0 args)) cons) end; |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
265 |
val sel_defins = if length cons=1 then map (fn arg => pg [](defined(%:x_name)==> |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
266 |
defined(%%:(sel_of arg)`%x_name)) [ |
4043 | 267 |
rtac casedist 1, |
2033 | 268 |
contr_tac 1, |
8149
941afb897532
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
oheimb
parents:
7906
diff
changeset
|
269 |
DETERM_UNTIL_SOLVED (CHANGED(asm_simp_tac |
2033 | 270 |
(HOLCF_ss addsimps sel_apps) 1))]) |
271 |
(filter_out is_lazy (snd(hd cons))) else []; |
|
1274 | 272 |
val sel_rews = sel_stricts @ sel_defins @ sel_apps; |
273 |
||
274 |
val distincts_le = let |
|
275 |
fun dist (con1, args1) (con2, args2) = pg [] |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
276 |
(lift_defined %: ((nonlazy args1), |
2033 | 277 |
(mk_trp (con_app con1 args1 ~<< con_app con2 args2))))([ |
2445
51993fea433f
removed Holcfb.thy and Holcfb.ML, moving classical3 to HOL.ML as classical2
oheimb
parents:
2276
diff
changeset
|
278 |
rtac rev_contrapos 1, |
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
279 |
eres_inst_tac[("f",dis_name con1)] monofun_cfun_arg 1] |
2033 | 280 |
@map(case_UU_tac (con_stricts @ dis_rews)1)(nonlazy args2) |
281 |
@[asm_simp_tac (HOLCF_ss addsimps dis_rews) 1]); |
|
1274 | 282 |
fun distinct (con1,args1) (con2,args2) = |
2267 | 283 |
let val arg1 = (con1, args1) |
284 |
val arg2 = (con2, |
|
285 |
ListPair.map (fn (arg,vn) => upd_vname (K vn) arg) |
|
286 |
(args2, variantlist(map vname args2,map vname args1))) |
|
2033 | 287 |
in [dist arg1 arg2, dist arg2 arg1] end; |
1274 | 288 |
fun distincts [] = [] |
289 |
| distincts (c::cs) = (map (distinct c) cs) :: distincts cs; |
|
290 |
in distincts cons end; |
|
15570 | 291 |
val dist_les = List.concat (List.concat distincts_le); |
4043 | 292 |
val dist_eqs = let |
1274 | 293 |
fun distinct (_,args1) ((_,args2),leqs) = let |
2033 | 294 |
val (le1,le2) = (hd leqs, hd(tl leqs)); |
295 |
val (eq1,eq2) = (le1 RS dist_eqI, le2 RS dist_eqI) in |
|
296 |
if nonlazy args1 = [] then [eq1, eq1 RS not_sym] else |
|
297 |
if nonlazy args2 = [] then [eq2, eq2 RS not_sym] else |
|
298 |
[eq1, eq2] end; |
|
4221 | 299 |
open BasisLibrary (*restore original List*) |
1274 | 300 |
fun distincts [] = [] |
4062 | 301 |
| distincts ((c,leqs)::cs) = List.concat |
2267 | 302 |
(ListPair.map (distinct c) ((map #1 cs),leqs)) @ |
303 |
distincts cs; |
|
12037 | 304 |
in map standard (distincts (cons~~distincts_le)) end; |
1274 | 305 |
|
306 |
local |
|
16321
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
307 |
fun pgterm rel con args = |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
308 |
let |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
309 |
fun append s = upd_vname(fn v => v^s); |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
310 |
val (largs,rargs) = (args, map (append "'") args); |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
311 |
val concl = mk_trp (foldr' mk_conj (ListPair.map rel (map %# largs, map %# rargs))); |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
312 |
val prem = mk_trp (rel(con_app con largs,con_app con rargs)); |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
313 |
val prop = prem ===> lift_defined %: (nonlazy largs, concl); |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
314 |
in pg con_appls prop end; |
15570 | 315 |
val cons' = List.filter (fn (_,args) => args<>[]) cons; |
1274 | 316 |
in |
16321
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
317 |
val inverts = |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
318 |
let |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
319 |
val abs_less = ax_abs_iso RS (allI RS injection_less) RS iffD1; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
320 |
val simps = [up_less, spair_less]; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
321 |
val tacs = [ |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
322 |
dtac abs_less 1, |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
323 |
REPEAT (dresolve_tac [sinl_less RS iffD1, sinr_less RS iffD1] 1), |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
324 |
asm_full_simp_tac (HOLCF_ss addsimps simps) 1]; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
325 |
in map (fn (con,args) => pgterm (op <<) con args tacs) cons' end; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
326 |
val injects = |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
327 |
let |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
328 |
val abs_eq = ax_abs_iso RS (allI RS injection_eq) RS iffD1; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
329 |
val simps = [up_eq, spair_eq]; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
330 |
val tacs = [ |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
331 |
dtac abs_eq 1, |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
332 |
REPEAT (dresolve_tac [sinl_inject, sinr_inject] 1), |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
333 |
asm_full_simp_tac (HOLCF_ss addsimps simps) 1]; |
ef32a42f4079
faster proofs of inverts and injects lemmas, with fewer strictness hypotheses
huffman
parents:
16224
diff
changeset
|
334 |
in map (fn (con,args) => pgterm (op ===) con args tacs) cons' end; |
1274 | 335 |
end; |
336 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
337 |
(* ----- theorems concerning one induction step ----------------------------- *) |
1274 | 338 |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
339 |
val copy_strict = pg[ax_copy_def](mk_trp(strict(dc_copy`%"f"))) [ |
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
340 |
asm_simp_tac(HOLCF_ss addsimps [abs_strict, when_strict]) 1]; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
341 |
val copy_apps = map (fn (con,args) => pg [ax_copy_def] |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
342 |
(lift_defined %: (nonlazy_rec args, |
2033 | 343 |
mk_trp(dc_copy`%"f"`(con_app con args) === |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
344 |
(con_app2 con (app_rec_arg (cproj (%:"f") eqs)) args)))) |
2033 | 345 |
(map (case_UU_tac (abs_strict::when_strict::con_stricts) |
346 |
1 o vname) |
|
15570 | 347 |
(List.filter (fn a => not (is_rec a orelse is_lazy a)) args) |
2033 | 348 |
@[asm_simp_tac (HOLCF_ss addsimps when_apps) 1, |
15742 | 349 |
simp_tac (HOLCF_ss addsimps con_appls) 1]))cons; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
350 |
val copy_stricts = map (fn (con,args) => pg [] (mk_trp(dc_copy`UU` |
2033 | 351 |
(con_app con args) ===UU)) |
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
352 |
(let val rews = copy_strict::copy_apps@con_rews |
2033 | 353 |
in map (case_UU_tac rews 1) (nonlazy args) @ [ |
354 |
asm_simp_tac (HOLCF_ss addsimps rews) 1] end)) |
|
15570 | 355 |
(List.filter (fn (_,args)=>exists is_nonlazy_rec args) cons); |
1274 | 356 |
val copy_rews = copy_strict::copy_apps @ copy_stricts; |
4043 | 357 |
in thy |> Theory.add_path (Sign.base_name dname) |
8438 | 358 |
|> (#1 o (PureThy.add_thmss (map Thm.no_attributes [ |
4043 | 359 |
("iso_rews" , iso_rews ), |
360 |
("exhaust" , [exhaust] ), |
|
361 |
("casedist" , [casedist]), |
|
362 |
("when_rews", when_rews ), |
|
363 |
("con_rews", con_rews), |
|
364 |
("sel_rews", sel_rews), |
|
365 |
("dis_rews", dis_rews), |
|
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
366 |
("match_rews", mat_rews), |
4043 | 367 |
("dist_les", dist_les), |
368 |
("dist_eqs", dist_eqs), |
|
369 |
("inverts" , inverts ), |
|
370 |
("injects" , injects ), |
|
8438 | 371 |
("copy_rews", copy_rews)]))) |
12037 | 372 |
|> Theory.parent_path |> rpair (iso_rews @ when_rews @ con_rews @ sel_rews @ dis_rews @ |
373 |
dist_les @ dist_eqs @ copy_rews) |
|
1274 | 374 |
end; (* let *) |
375 |
||
4043 | 376 |
fun comp_theorems (comp_dnam, eqs: eq list) thy = |
1274 | 377 |
let |
4008 | 378 |
val dnames = map (fst o fst) eqs; |
379 |
val conss = map snd eqs; |
|
380 |
val comp_dname = Sign.full_name (sign_of thy) comp_dnam; |
|
381 |
||
12037 | 382 |
val d = writeln("Proving induction properties of domain "^comp_dname^" ..."); |
1274 | 383 |
val pg = pg' thy; |
384 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
385 |
(* ----- getting the composite axiom and definitions ------------------------ *) |
1274 | 386 |
|
15531 | 387 |
local fun ga s dn = get_thm thy (dn ^ "." ^ s, NONE) in |
4043 | 388 |
val axs_reach = map (ga "reach" ) dnames; |
389 |
val axs_take_def = map (ga "take_def" ) dnames; |
|
390 |
val axs_finite_def = map (ga "finite_def") dnames; |
|
391 |
val ax_copy2_def = ga "copy_def" comp_dnam; |
|
392 |
val ax_bisim_def = ga "bisim_def" comp_dnam; |
|
393 |
end; (* local *) |
|
394 |
||
15531 | 395 |
local fun gt s dn = get_thm thy (dn ^ "." ^ s, NONE); |
396 |
fun gts s dn = get_thms thy (dn ^ "." ^ s, NONE) in |
|
4043 | 397 |
val cases = map (gt "casedist" ) dnames; |
15570 | 398 |
val con_rews = List.concat (map (gts "con_rews" ) dnames); |
399 |
val copy_rews = List.concat (map (gts "copy_rews") dnames); |
|
1274 | 400 |
end; (* local *) |
401 |
||
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
402 |
fun dc_take dn = %%:(dn^"_take"); |
1274 | 403 |
val x_name = idx_name dnames "x"; |
404 |
val P_name = idx_name dnames "P"; |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
405 |
val n_eqs = length eqs; |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
406 |
|
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
407 |
(* ----- theorems concerning finite approximation and finite induction ------ *) |
1274 | 408 |
|
409 |
local |
|
16224
57094b83774e
Domain package generates match functions for new datatypes, for use with the fixrec package
huffman
parents:
15742
diff
changeset
|
410 |
val iterate_Cprod_ss = simpset_of Fix.thy; |
1274 | 411 |
val copy_con_rews = copy_rews @ con_rews; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
412 |
val copy_take_defs =(if n_eqs = 1 then [] else [ax_copy2_def]) @ axs_take_def; |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
413 |
val take_stricts=pg copy_take_defs(mk_trp(foldr' mk_conj(map(fn((dn,args),_)=> |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
414 |
strict(dc_take dn $ %:"n")) eqs))) ([ |
13454 | 415 |
induct_tac "n" 1, |
4030 | 416 |
simp_tac iterate_Cprod_ss 1, |
2033 | 417 |
asm_simp_tac (iterate_Cprod_ss addsimps copy_rews)1]); |
1274 | 418 |
val take_stricts' = rewrite_rule copy_take_defs take_stricts; |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
419 |
val take_0s = mapn(fn n=> fn dn => pg axs_take_def(mk_trp((dc_take dn $ %%:"0") |
2033 | 420 |
`%x_name n === UU))[ |
421 |
simp_tac iterate_Cprod_ss 1]) 1 dnames; |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
422 |
val c_UU_tac = case_UU_tac (take_stricts'::copy_con_rews) 1; |
1274 | 423 |
val take_apps = pg copy_take_defs (mk_trp(foldr' mk_conj |
15570 | 424 |
(List.concat(map (fn ((dn,_),cons) => map (fn (con,args) => Library.foldr mk_all |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
425 |
(map vname args,(dc_take dn $ (%%:"Suc" $ %:"n"))`(con_app con args) === |
15570 | 426 |
con_app2 con (app_rec_arg (fn n=>dc_take (List.nth(dnames,n))$ %:"n")) |
2033 | 427 |
args)) cons) eqs)))) ([ |
428 |
simp_tac iterate_Cprod_ss 1, |
|
13454 | 429 |
induct_tac "n" 1, |
2033 | 430 |
simp_tac(iterate_Cprod_ss addsimps copy_con_rews) 1, |
431 |
asm_full_simp_tac (HOLCF_ss addsimps |
|
15570 | 432 |
(List.filter (has_fewer_prems 1) copy_rews)) 1, |
2033 | 433 |
TRY(safe_tac HOL_cs)] @ |
15570 | 434 |
(List.concat(map (fn ((dn,_),cons) => map (fn (con,args) => |
2033 | 435 |
if nonlazy_rec args = [] then all_tac else |
436 |
EVERY(map c_UU_tac (nonlazy_rec args)) THEN |
|
437 |
asm_full_simp_tac (HOLCF_ss addsimps copy_rews)1 |
|
438 |
) cons) eqs))); |
|
1274 | 439 |
in |
12037 | 440 |
val take_rews = map standard (atomize take_stricts @ take_0s @ atomize take_apps); |
1274 | 441 |
end; (* local *) |
442 |
||
443 |
local |
|
15570 | 444 |
fun one_con p (con,args) = Library.foldr mk_All (map vname args, |
2033 | 445 |
lift_defined (bound_arg (map vname args)) (nonlazy args, |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
446 |
lift (fn arg => %:(P_name (1+rec_of arg)) $ bound_arg args arg) |
15570 | 447 |
(List.filter is_rec args,mk_trp(%:p $ con_app2 con (bound_arg args) args)))); |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
448 |
fun one_eq ((p,cons),concl) = (mk_trp(%:p $ UU) ===> |
15570 | 449 |
Library.foldr (op ===>) (map (one_con p) cons,concl)); |
450 |
fun ind_term concf = Library.foldr one_eq (mapn (fn n => fn x => (P_name n, x))1conss, |
|
2033 | 451 |
mk_trp(foldr' mk_conj (mapn concf 1 dnames))); |
1274 | 452 |
val take_ss = HOL_ss addsimps take_rews; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
453 |
fun quant_tac i = EVERY(mapn(fn n=> fn _=> res_inst_tac[("x",x_name n)]spec i) |
2033 | 454 |
1 dnames); |
15570 | 455 |
fun ind_prems_tac prems = EVERY(List.concat (map (fn cons => ( |
2033 | 456 |
resolve_tac prems 1 :: |
15570 | 457 |
List.concat (map (fn (_,args) => |
2033 | 458 |
resolve_tac prems 1 :: |
459 |
map (K(atac 1)) (nonlazy args) @ |
|
15570 | 460 |
map (K(atac 1)) (List.filter is_rec args)) |
2033 | 461 |
cons))) conss)); |
1274 | 462 |
local |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
463 |
(* check whether every/exists constructor of the n-th part of the equation: |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
464 |
it has a possibly indirectly recursive argument that isn't/is possibly |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
465 |
indirectly lazy *) |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
466 |
fun rec_to quant nfn rfn ns lazy_rec (n,cons) = quant (exists (fn arg => |
2033 | 467 |
is_rec arg andalso not(rec_of arg mem ns) andalso |
468 |
((rec_of arg = n andalso nfn(lazy_rec orelse is_lazy arg)) orelse |
|
469 |
rec_of arg <> n andalso rec_to quant nfn rfn (rec_of arg::ns) |
|
15570 | 470 |
(lazy_rec orelse is_lazy arg) (n, (List.nth(conss,rec_of arg)))) |
2033 | 471 |
) o snd) cons; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
472 |
fun all_rec_to ns = rec_to forall not all_rec_to ns; |
4030 | 473 |
fun warn (n,cons) = if all_rec_to [] false (n,cons) then (warning |
15570 | 474 |
("domain "^List.nth(dnames,n)^" is empty!"); true) else false; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
475 |
fun lazy_rec_to ns = rec_to exists Id lazy_rec_to ns; |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
476 |
|
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
477 |
in val n__eqs = mapn (fn n => fn (_,cons) => (n,cons)) 0 eqs; |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
478 |
val is_emptys = map warn n__eqs; |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
479 |
val is_finite = forall (not o lazy_rec_to [] false) n__eqs; |
1274 | 480 |
end; |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
481 |
in (* local *) |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
482 |
val finite_ind = pg'' thy [] (ind_term (fn n => fn dn => %:(P_name n)$ |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
483 |
(dc_take dn $ %:"n" `%(x_name n)))) (fn prems => [ |
2033 | 484 |
quant_tac 1, |
2445
51993fea433f
removed Holcfb.thy and Holcfb.ML, moving classical3 to HOL.ML as classical2
oheimb
parents:
2276
diff
changeset
|
485 |
simp_tac HOL_ss 1, |
13454 | 486 |
induct_tac "n" 1, |
2033 | 487 |
simp_tac (take_ss addsimps prems) 1, |
488 |
TRY(safe_tac HOL_cs)] |
|
15570 | 489 |
@ List.concat(map (fn (cons,cases) => [ |
2033 | 490 |
res_inst_tac [("x","x")] cases 1, |
491 |
asm_simp_tac (take_ss addsimps prems) 1] |
|
15570 | 492 |
@ List.concat(map (fn (con,args) => |
2033 | 493 |
asm_simp_tac take_ss 1 :: |
494 |
map (fn arg => |
|
495 |
case_UU_tac (prems@con_rews) 1 ( |
|
15570 | 496 |
List.nth(dnames,rec_of arg)^"_take n$"^vname arg)) |
497 |
(List.filter is_nonlazy_rec args) @ [ |
|
2033 | 498 |
resolve_tac prems 1] @ |
499 |
map (K (atac 1)) (nonlazy args) @ |
|
15570 | 500 |
map (K (etac spec 1)) (List.filter is_rec args)) |
2033 | 501 |
cons)) |
4043 | 502 |
(conss~~cases))); |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
503 |
|
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
504 |
val take_lemmas =mapn(fn n=> fn(dn,ax_reach)=> pg'' thy axs_take_def(mk_All("n", |
2033 | 505 |
mk_trp(dc_take dn $ Bound 0 `%(x_name n) === |
506 |
dc_take dn $ Bound 0 `%(x_name n^"'"))) |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
507 |
===> mk_trp(%:(x_name n) === %:(x_name n^"'"))) (fn prems => [ |
2033 | 508 |
res_inst_tac[("t",x_name n )](ax_reach RS subst) 1, |
509 |
res_inst_tac[("t",x_name n^"'")](ax_reach RS subst) 1, |
|
510 |
stac fix_def2 1, |
|
511 |
REPEAT(CHANGED(rtac(contlub_cfun_arg RS ssubst)1 |
|
512 |
THEN chain_tac 1)), |
|
513 |
stac contlub_cfun_fun 1, |
|
514 |
stac contlub_cfun_fun 2, |
|
515 |
rtac lub_equal 3, |
|
516 |
chain_tac 1, |
|
517 |
rtac allI 1, |
|
518 |
resolve_tac prems 1])) 1 (dnames~~axs_reach); |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
519 |
|
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
520 |
(* ----- theorems concerning finiteness and induction ----------------------- *) |
1274 | 521 |
|
522 |
val (finites,ind) = if is_finite then |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
523 |
let |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
524 |
fun take_enough dn = mk_ex ("n",dc_take dn $ Bound 0 ` %:"x" === %:"x"); |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
525 |
val finite_lemmas1a = map (fn dn => pg [] (mk_trp(defined (%:"x")) ===> |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
526 |
mk_trp(mk_disj(mk_all("n",dc_take dn $ Bound 0 ` %:"x" === UU), |
2033 | 527 |
take_enough dn)) ===> mk_trp(take_enough dn)) [ |
528 |
etac disjE 1, |
|
529 |
etac notE 1, |
|
530 |
resolve_tac take_lemmas 1, |
|
531 |
asm_simp_tac take_ss 1, |
|
532 |
atac 1]) dnames; |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
533 |
val finite_lemma1b = pg [] (mk_trp (mk_all("n",foldr' mk_conj (mapn |
2033 | 534 |
(fn n => fn ((dn,args),_) => mk_constrainall(x_name n,Type(dn,args), |
535 |
mk_disj(dc_take dn $ Bound 1 ` Bound 0 === UU, |
|
536 |
dc_take dn $ Bound 1 ` Bound 0 === Bound 0))) 1 eqs)))) ([ |
|
537 |
rtac allI 1, |
|
13454 | 538 |
induct_tac "n" 1, |
2033 | 539 |
simp_tac take_ss 1, |
540 |
TRY(safe_tac(empty_cs addSEs[conjE] addSIs[conjI]))] @ |
|
15570 | 541 |
List.concat(mapn (fn n => fn (cons,cases) => [ |
2033 | 542 |
simp_tac take_ss 1, |
543 |
rtac allI 1, |
|
544 |
res_inst_tac [("x",x_name n)] cases 1, |
|
545 |
asm_simp_tac take_ss 1] @ |
|
15570 | 546 |
List.concat(map (fn (con,args) => |
2033 | 547 |
asm_simp_tac take_ss 1 :: |
15570 | 548 |
List.concat(map (fn vn => [ |
2033 | 549 |
eres_inst_tac [("x",vn)] all_dupE 1, |
550 |
etac disjE 1, |
|
551 |
asm_simp_tac (HOL_ss addsimps con_rews) 1, |
|
552 |
asm_simp_tac take_ss 1]) |
|
553 |
(nonlazy_rec args))) |
|
554 |
cons)) |
|
4043 | 555 |
1 (conss~~cases))); |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
556 |
val finites = map (fn (dn,l1b) => pg axs_finite_def (mk_trp( |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
557 |
%%:(dn^"_finite") $ %:"x"))[ |
2033 | 558 |
case_UU_tac take_rews 1 "x", |
559 |
eresolve_tac finite_lemmas1a 1, |
|
560 |
step_tac HOL_cs 1, |
|
561 |
step_tac HOL_cs 1, |
|
562 |
cut_facts_tac [l1b] 1, |
|
563 |
fast_tac HOL_cs 1]) (dnames~~atomize finite_lemma1b); |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
564 |
in |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
565 |
(finites, |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
566 |
pg'' thy[](ind_term (fn n => fn dn => %:(P_name n) $ %:(x_name n)))(fn prems => |
2033 | 567 |
TRY(safe_tac HOL_cs) :: |
15570 | 568 |
List.concat (map (fn (finite,fin_ind) => [ |
2033 | 569 |
rtac(rewrite_rule axs_finite_def finite RS exE)1, |
570 |
etac subst 1, |
|
571 |
rtac fin_ind 1, |
|
572 |
ind_prems_tac prems]) |
|
573 |
(finites~~(atomize finite_ind)) )) |
|
1274 | 574 |
) end (* let *) else |
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
575 |
(mapn (fn n => fn dn => read_instantiate_sg (sign_of thy) |
2033 | 576 |
[("P",dn^"_finite "^x_name n)] excluded_middle) 1 dnames, |
15570 | 577 |
pg'' thy [] (Library.foldr (op ===>) (mapn (fn n => K(mk_trp(%%:"adm" $ %:(P_name n)))) |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
578 |
1 dnames, ind_term (fn n => fn dn => %:(P_name n) $ %:(x_name n)))) |
2033 | 579 |
(fn prems => map (fn ax_reach => rtac (ax_reach RS subst) 1) |
580 |
axs_reach @ [ |
|
581 |
quant_tac 1, |
|
582 |
rtac (adm_impl_admw RS wfix_ind) 1, |
|
4030 | 583 |
REPEAT_DETERM(rtac adm_all2 1), |
584 |
REPEAT_DETERM(TRY(rtac adm_conj 1) THEN |
|
585 |
rtac adm_subst 1 THEN |
|
2033 | 586 |
cont_tacR 1 THEN resolve_tac prems 1), |
587 |
strip_tac 1, |
|
588 |
rtac (rewrite_rule axs_take_def finite_ind) 1, |
|
589 |
ind_prems_tac prems]) |
|
4755 | 590 |
handle ERROR => (warning "Cannot prove infinite induction rule"; refl)) |
1274 | 591 |
end; (* local *) |
592 |
||
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
593 |
(* ----- theorem concerning coinduction ------------------------------------- *) |
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
594 |
|
1274 | 595 |
local |
596 |
val xs = mapn (fn n => K (x_name n)) 1 dnames; |
|
1637
b8a8ae2e5de1
Updated: 01-Mar-96 when functional strictified, copy_def based on when_def
oheimb
parents:
1512
diff
changeset
|
597 |
fun bnd_arg n i = Bound(2*(n_eqs - n)-i-1); |
1274 | 598 |
val take_ss = HOL_ss addsimps take_rews; |
4755 | 599 |
val sproj = prj (fn s => K("fst("^s^")")) (fn s => K("snd("^s^")")); |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
600 |
val coind_lemma=pg[ax_bisim_def](mk_trp(mk_imp(%%:(comp_dname^"_bisim") $ %:"R", |
15570 | 601 |
Library.foldr (fn (x,t)=> mk_all(x,mk_all(x^"'",t))) (xs, |
602 |
Library.foldr mk_imp (mapn (fn n => K(proj (%:"R") eqs n $ |
|
2033 | 603 |
bnd_arg n 0 $ bnd_arg n 1)) 0 dnames, |
604 |
foldr' mk_conj (mapn (fn n => fn dn => |
|
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
605 |
(dc_take dn $ %:"n" `bnd_arg n 0 === |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
606 |
(dc_take dn $ %:"n" `bnd_arg n 1)))0 dnames)))))) |
2033 | 607 |
([ rtac impI 1, |
13454 | 608 |
induct_tac "n" 1, |
2033 | 609 |
simp_tac take_ss 1, |
610 |
safe_tac HOL_cs] @ |
|
15570 | 611 |
List.concat(mapn (fn n => fn x => [ |
2033 | 612 |
rotate_tac (n+1) 1, |
613 |
etac all2E 1, |
|
4755 | 614 |
eres_inst_tac [("P1", sproj "R" eqs n^ |
2033 | 615 |
" "^x^" "^x^"'")](mp RS disjE) 1, |
616 |
TRY(safe_tac HOL_cs), |
|
617 |
REPEAT(CHANGED(asm_simp_tac take_ss 1))]) |
|
618 |
0 xs)); |
|
1274 | 619 |
in |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
620 |
val coind = pg [] (mk_trp(%%:(comp_dname^"_bisim") $ %:"R") ===> |
15570 | 621 |
Library.foldr (op ===>) (mapn (fn n => fn x => |
11531
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
622 |
mk_trp(proj (%:"R") eqs n $ %:x $ %:(x^"'"))) 0 xs, |
d038246a62f2
Renamed functions % and %% to avoid clash with syntax for proof terms.
berghofe
parents:
10835
diff
changeset
|
623 |
mk_trp(foldr' mk_conj (map (fn x => %:x === %:(x^"'")) xs)))) ([ |
2033 | 624 |
TRY(safe_tac HOL_cs)] @ |
15570 | 625 |
List.concat(map (fn take_lemma => [ |
2033 | 626 |
rtac take_lemma 1, |
627 |
cut_facts_tac [coind_lemma] 1, |
|
628 |
fast_tac HOL_cs 1]) |
|
629 |
take_lemmas)); |
|
1274 | 630 |
end; (* local *) |
631 |
||
4043 | 632 |
in thy |> Theory.add_path comp_dnam |
8438 | 633 |
|> (#1 o (PureThy.add_thmss (map Thm.no_attributes [ |
4043 | 634 |
("take_rews" , take_rews ), |
635 |
("take_lemmas", take_lemmas), |
|
636 |
("finites" , finites ), |
|
637 |
("finite_ind", [finite_ind]), |
|
638 |
("ind" , [ind ]), |
|
8438 | 639 |
("coind" , [coind ])]))) |
12037 | 640 |
|> Theory.parent_path |> rpair take_rews |
1274 | 641 |
end; (* let *) |
642 |
end; (* local *) |
|
643 |
end; (* struct *) |