author | paulson |
Wed, 27 Mar 1996 18:46:42 +0100 | |
changeset 1619 | cb62d89b7adb |
parent 1461 | 6bcb44e4d6e5 |
child 1675 | 36ba4da350c3 |
permissions | -rw-r--r-- |
1461 | 1 |
(* Title: HOLCF/lift3.ML |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
2 |
ID: $Id$ |
1461 | 3 |
Author: Franz Regensburger |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
4 |
Copyright 1993 Technische Universitaet Muenchen |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
5 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
6 |
Lemmas for lift3.thy |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
7 |
*) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
8 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
9 |
open Lift3; |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
10 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
11 |
(* -------------------------------------------------------------------------*) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
12 |
(* some lemmas restated for class pcpo *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
13 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
14 |
|
892 | 15 |
qed_goal "less_lift3b" Lift3.thy "~ Iup(x) << UU" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
16 |
(fn prems => |
1461 | 17 |
[ |
18 |
(rtac (inst_lift_pcpo RS ssubst) 1), |
|
19 |
(rtac less_lift2b 1) |
|
20 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
21 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
22 |
qed_goal "defined_Iup2" Lift3.thy "Iup(x) ~= UU" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
23 |
(fn prems => |
1461 | 24 |
[ |
25 |
(rtac (inst_lift_pcpo RS ssubst) 1), |
|
26 |
(rtac defined_Iup 1) |
|
27 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
28 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
29 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
30 |
(* continuity for Iup *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
31 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
32 |
|
892 | 33 |
qed_goal "contlub_Iup" Lift3.thy "contlub(Iup)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
34 |
(fn prems => |
1461 | 35 |
[ |
36 |
(rtac contlubI 1), |
|
37 |
(strip_tac 1), |
|
38 |
(rtac trans 1), |
|
39 |
(rtac (thelub_lift1a RS sym) 2), |
|
40 |
(fast_tac HOL_cs 3), |
|
41 |
(etac (monofun_Iup RS ch2ch_monofun) 2), |
|
42 |
(res_inst_tac [("f","Iup")] arg_cong 1), |
|
43 |
(rtac lub_equal 1), |
|
44 |
(atac 1), |
|
45 |
(rtac (monofun_Ilift2 RS ch2ch_monofun) 1), |
|
46 |
(etac (monofun_Iup RS ch2ch_monofun) 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
47 |
(asm_simp_tac Lift0_ss 1) |
1461 | 48 |
]); |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
49 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
50 |
qed_goal "cont_Iup" Lift3.thy "cont(Iup)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
51 |
(fn prems => |
1461 | 52 |
[ |
53 |
(rtac monocontlub2cont 1), |
|
54 |
(rtac monofun_Iup 1), |
|
55 |
(rtac contlub_Iup 1) |
|
56 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
57 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
58 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
59 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
60 |
(* continuity for Ilift *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
61 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
62 |
|
892 | 63 |
qed_goal "contlub_Ilift1" Lift3.thy "contlub(Ilift)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
64 |
(fn prems => |
1461 | 65 |
[ |
66 |
(rtac contlubI 1), |
|
67 |
(strip_tac 1), |
|
68 |
(rtac trans 1), |
|
69 |
(rtac (thelub_fun RS sym) 2), |
|
70 |
(etac (monofun_Ilift1 RS ch2ch_monofun) 2), |
|
71 |
(rtac ext 1), |
|
72 |
(res_inst_tac [("p","x")] liftE 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
73 |
(asm_simp_tac Lift0_ss 1), |
1461 | 74 |
(rtac (lub_const RS thelubI RS sym) 1), |
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
75 |
(asm_simp_tac Lift0_ss 1), |
1461 | 76 |
(etac contlub_cfun_fun 1) |
77 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
78 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
79 |
|
892 | 80 |
qed_goal "contlub_Ilift2" Lift3.thy "contlub(Ilift(f))" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
81 |
(fn prems => |
1461 | 82 |
[ |
83 |
(rtac contlubI 1), |
|
84 |
(strip_tac 1), |
|
85 |
(rtac disjE 1), |
|
86 |
(rtac (thelub_lift1a RS ssubst) 2), |
|
87 |
(atac 2), |
|
88 |
(atac 2), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
89 |
(asm_simp_tac Lift0_ss 2), |
1461 | 90 |
(rtac (thelub_lift1b RS ssubst) 3), |
91 |
(atac 3), |
|
92 |
(atac 3), |
|
93 |
(fast_tac HOL_cs 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
94 |
(asm_simp_tac Lift0_ss 2), |
1461 | 95 |
(rtac (chain_UU_I_inverse RS sym) 2), |
96 |
(rtac allI 2), |
|
97 |
(res_inst_tac [("p","Y(i)")] liftE 2), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
98 |
(asm_simp_tac Lift0_ss 2), |
1461 | 99 |
(rtac notE 2), |
100 |
(dtac spec 2), |
|
101 |
(etac spec 2), |
|
102 |
(atac 2), |
|
103 |
(rtac (contlub_cfun_arg RS ssubst) 1), |
|
104 |
(etac (monofun_Ilift2 RS ch2ch_monofun) 1), |
|
105 |
(rtac lub_equal2 1), |
|
106 |
(rtac (monofun_fapp2 RS ch2ch_monofun) 2), |
|
107 |
(etac (monofun_Ilift2 RS ch2ch_monofun) 2), |
|
108 |
(etac (monofun_Ilift2 RS ch2ch_monofun) 2), |
|
109 |
(rtac (chain_mono2 RS exE) 1), |
|
110 |
(atac 2), |
|
111 |
(etac exE 1), |
|
112 |
(etac exE 1), |
|
113 |
(rtac exI 1), |
|
114 |
(res_inst_tac [("s","Iup(x)"),("t","Y(i)")] ssubst 1), |
|
115 |
(atac 1), |
|
116 |
(rtac defined_Iup2 1), |
|
117 |
(rtac exI 1), |
|
118 |
(strip_tac 1), |
|
119 |
(res_inst_tac [("p","Y(i)")] liftE 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
120 |
(asm_simp_tac Lift0_ss 2), |
1461 | 121 |
(res_inst_tac [("P","Y(i) = UU")] notE 1), |
122 |
(fast_tac HOL_cs 1), |
|
123 |
(rtac (inst_lift_pcpo RS ssubst) 1), |
|
124 |
(atac 1) |
|
125 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
126 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
127 |
qed_goal "cont_Ilift1" Lift3.thy "cont(Ilift)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
128 |
(fn prems => |
1461 | 129 |
[ |
130 |
(rtac monocontlub2cont 1), |
|
131 |
(rtac monofun_Ilift1 1), |
|
132 |
(rtac contlub_Ilift1 1) |
|
133 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
134 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
135 |
qed_goal "cont_Ilift2" Lift3.thy "cont(Ilift(f))" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
136 |
(fn prems => |
1461 | 137 |
[ |
138 |
(rtac monocontlub2cont 1), |
|
139 |
(rtac monofun_Ilift2 1), |
|
140 |
(rtac contlub_Ilift2 1) |
|
141 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
142 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
143 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
144 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
145 |
(* continuous versions of lemmas for ('a)u *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
146 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
147 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
148 |
qed_goalw "Exh_Lift1" Lift3.thy [up_def] "z = UU | (? x. z = up`x)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
149 |
(fn prems => |
1461 | 150 |
[ |
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
151 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1), |
1461 | 152 |
(rtac (inst_lift_pcpo RS ssubst) 1), |
153 |
(rtac Exh_Lift 1) |
|
154 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
155 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
156 |
qed_goalw "inject_up" Lift3.thy [up_def] "up`x=up`y ==> x=y" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
157 |
(fn prems => |
1461 | 158 |
[ |
159 |
(cut_facts_tac prems 1), |
|
160 |
(rtac inject_Iup 1), |
|
161 |
(etac box_equals 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
162 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1), |
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
163 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1) |
1461 | 164 |
]); |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
165 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
166 |
qed_goalw "defined_up" Lift3.thy [up_def] " up`x ~= UU" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
167 |
(fn prems => |
1461 | 168 |
[ |
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
169 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1), |
1461 | 170 |
(rtac defined_Iup2 1) |
171 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
172 |
|
892 | 173 |
qed_goalw "liftE1" Lift3.thy [up_def] |
1461 | 174 |
"[| p=UU ==> Q; !!x. p=up`x==>Q|] ==>Q" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
175 |
(fn prems => |
1461 | 176 |
[ |
177 |
(rtac liftE 1), |
|
178 |
(resolve_tac prems 1), |
|
179 |
(etac (inst_lift_pcpo RS ssubst) 1), |
|
180 |
(resolve_tac (tl prems) 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
181 |
(asm_simp_tac (Lift0_ss addsimps [cont_Iup]) 1) |
1461 | 182 |
]); |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
183 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
184 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
185 |
qed_goalw "lift1" Lift3.thy [up_def,lift_def] "lift`f`UU=UU" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
186 |
(fn prems => |
1461 | 187 |
[ |
188 |
(rtac (inst_lift_pcpo RS ssubst) 1), |
|
189 |
(rtac (beta_cfun RS ssubst) 1), |
|
190 |
(REPEAT (resolve_tac (cont_lemmas @ [cont_Iup,cont_Ilift1, |
|
191 |
cont_Ilift2,cont2cont_CF1L]) 1)), |
|
192 |
(rtac (beta_cfun RS ssubst) 1), |
|
193 |
(REPEAT (resolve_tac (cont_lemmas @ [cont_Iup,cont_Ilift1, |
|
194 |
cont_Ilift2,cont2cont_CF1L]) 1)), |
|
195 |
(simp_tac (Lift0_ss addsimps [cont_Iup,cont_Ilift1,cont_Ilift2]) 1) |
|
196 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
197 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
198 |
qed_goalw "lift2" Lift3.thy [up_def,lift_def] "lift`f`(up`x)=f`x" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
199 |
(fn prems => |
1461 | 200 |
[ |
201 |
(rtac (beta_cfun RS ssubst) 1), |
|
202 |
(rtac cont_Iup 1), |
|
203 |
(rtac (beta_cfun RS ssubst) 1), |
|
204 |
(REPEAT (resolve_tac (cont_lemmas @ [cont_Iup,cont_Ilift1, |
|
205 |
cont_Ilift2,cont2cont_CF1L]) 1)), |
|
206 |
(rtac (beta_cfun RS ssubst) 1), |
|
207 |
(rtac cont_Ilift2 1), |
|
208 |
(simp_tac (Lift0_ss addsimps [cont_Iup,cont_Ilift1,cont_Ilift2]) 1) |
|
209 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
210 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
211 |
qed_goalw "less_lift4b" Lift3.thy [up_def,lift_def] "~ up`x << UU" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
212 |
(fn prems => |
1461 | 213 |
[ |
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
214 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1), |
1461 | 215 |
(rtac less_lift3b 1) |
216 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
217 |
|
892 | 218 |
qed_goalw "less_lift4c" Lift3.thy [up_def,lift_def] |
1461 | 219 |
"(up`x << up`y) = (x<<y)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
220 |
(fn prems => |
1461 | 221 |
[ |
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
222 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1), |
1461 | 223 |
(rtac less_lift2c 1) |
224 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
225 |
|
892 | 226 |
qed_goalw "thelub_lift2a" Lift3.thy [up_def,lift_def] |
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
227 |
"[| is_chain(Y); ? i x. Y(i) = up`x |] ==>\ |
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
228 |
\ lub(range(Y)) = up`(lub(range(%i. lift`(LAM x. x)`(Y i))))" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
229 |
(fn prems => |
1461 | 230 |
[ |
231 |
(cut_facts_tac prems 1), |
|
232 |
(rtac (beta_cfun RS ssubst) 1), |
|
233 |
(REPEAT (resolve_tac (cont_lemmas @ [cont_Iup,cont_Ilift1, |
|
234 |
cont_Ilift2,cont2cont_CF1L]) 1)), |
|
235 |
(rtac (beta_cfun RS ssubst) 1), |
|
236 |
(REPEAT (resolve_tac (cont_lemmas @ [cont_Iup,cont_Ilift1, |
|
237 |
cont_Ilift2,cont2cont_CF1L]) 1)), |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
238 |
|
1461 | 239 |
(rtac (beta_cfun RS ext RS ssubst) 1), |
240 |
(REPEAT (resolve_tac (cont_lemmas @ [cont_Iup,cont_Ilift1, |
|
241 |
cont_Ilift2,cont2cont_CF1L]) 1)), |
|
242 |
(rtac thelub_lift1a 1), |
|
243 |
(atac 1), |
|
244 |
(etac exE 1), |
|
245 |
(etac exE 1), |
|
246 |
(rtac exI 1), |
|
247 |
(rtac exI 1), |
|
248 |
(etac box_equals 1), |
|
249 |
(rtac refl 1), |
|
250 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1) |
|
251 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
252 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
253 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
254 |
|
892 | 255 |
qed_goalw "thelub_lift2b" Lift3.thy [up_def,lift_def] |
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
256 |
"[| is_chain(Y); ! i x. Y(i) ~= up`x |] ==> lub(range(Y)) = UU" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
257 |
(fn prems => |
1461 | 258 |
[ |
259 |
(cut_facts_tac prems 1), |
|
260 |
(rtac (inst_lift_pcpo RS ssubst) 1), |
|
261 |
(rtac thelub_lift1b 1), |
|
262 |
(atac 1), |
|
263 |
(strip_tac 1), |
|
264 |
(dtac spec 1), |
|
265 |
(dtac spec 1), |
|
266 |
(rtac swap 1), |
|
267 |
(atac 1), |
|
268 |
(dtac notnotD 1), |
|
269 |
(etac box_equals 1), |
|
270 |
(rtac refl 1), |
|
1277
caef3601c0b2
corrected some errors that occurred after introduction of local simpsets
regensbu
parents:
1274
diff
changeset
|
271 |
(simp_tac (Lift0_ss addsimps [cont_Iup]) 1) |
1461 | 272 |
]); |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
273 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
274 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
275 |
qed_goal "lift_lemma2" Lift3.thy " (? x.z = up`x) = (z~=UU)" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
276 |
(fn prems => |
1461 | 277 |
[ |
278 |
(rtac iffI 1), |
|
279 |
(etac exE 1), |
|
280 |
(hyp_subst_tac 1), |
|
281 |
(rtac defined_up 1), |
|
282 |
(res_inst_tac [("p","z")] liftE1 1), |
|
283 |
(etac notE 1), |
|
284 |
(atac 1), |
|
285 |
(etac exI 1) |
|
286 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
287 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
288 |
|
892 | 289 |
qed_goal "thelub_lift2a_rev" Lift3.thy |
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
290 |
"[| is_chain(Y); lub(range(Y)) = up`x |] ==> ? i x. Y(i) = up`x" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
291 |
(fn prems => |
1461 | 292 |
[ |
293 |
(cut_facts_tac prems 1), |
|
294 |
(rtac exE 1), |
|
295 |
(rtac chain_UU_I_inverse2 1), |
|
296 |
(rtac (lift_lemma2 RS iffD1) 1), |
|
297 |
(etac exI 1), |
|
298 |
(rtac exI 1), |
|
299 |
(rtac (lift_lemma2 RS iffD2) 1), |
|
300 |
(atac 1) |
|
301 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
302 |
|
892 | 303 |
qed_goal "thelub_lift2b_rev" Lift3.thy |
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
304 |
"[| is_chain(Y); lub(range(Y)) = UU |] ==> ! i x. Y(i) ~= up`x" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
305 |
(fn prems => |
1461 | 306 |
[ |
307 |
(cut_facts_tac prems 1), |
|
308 |
(rtac allI 1), |
|
309 |
(rtac (notex2all RS iffD1) 1), |
|
310 |
(rtac contrapos 1), |
|
311 |
(etac (lift_lemma2 RS iffD1) 2), |
|
312 |
(rtac notnotI 1), |
|
313 |
(rtac (chain_UU_I RS spec) 1), |
|
314 |
(atac 1), |
|
315 |
(atac 1) |
|
316 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
317 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
318 |
|
892 | 319 |
qed_goal "thelub_lift3" Lift3.thy |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
320 |
"is_chain(Y) ==> lub(range(Y)) = UU |\ |
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
321 |
\ lub(range(Y)) = up`(lub(range(%i. lift`(LAM x.x)`(Y i))))" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
322 |
(fn prems => |
1461 | 323 |
[ |
324 |
(cut_facts_tac prems 1), |
|
325 |
(rtac disjE 1), |
|
326 |
(rtac disjI1 2), |
|
327 |
(rtac thelub_lift2b 2), |
|
328 |
(atac 2), |
|
329 |
(atac 2), |
|
330 |
(rtac disjI2 2), |
|
331 |
(rtac thelub_lift2a 2), |
|
332 |
(atac 2), |
|
333 |
(atac 2), |
|
334 |
(fast_tac HOL_cs 1) |
|
335 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
336 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
892
diff
changeset
|
337 |
qed_goal "lift3" Lift3.thy "lift`up`x=x" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
338 |
(fn prems => |
1461 | 339 |
[ |
340 |
(res_inst_tac [("p","x")] liftE1 1), |
|
341 |
(asm_simp_tac ((simpset_of "Cfun3") addsimps [lift1,lift2]) 1), |
|
342 |
(asm_simp_tac ((simpset_of "Cfun3") addsimps [lift1,lift2]) 1) |
|
343 |
]); |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
344 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
345 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
346 |
(* install simplifier for ('a)u *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
347 |
(* ------------------------------------------------------------------------ *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
348 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
349 |
val lift_rews = [lift1,lift2,defined_up]; |
1274 | 350 |