author | berghofe |
Fri, 13 Dec 2002 14:20:47 +0100 | |
changeset 13749 | 6844c38d74df |
parent 11260 | b736de4cb913 |
child 15531 | 08c8dad8e399 |
permissions | -rw-r--r-- |
2817 | 1 |
(* Examples taken from |
2 |
H. Barendregt. Introduction to Generalised Type Systems. |
|
3 |
J. Functional Programming. |
|
4 |
*) |
|
5 |
||
6 |
fun strip_asms_tac thms i = |
|
7 |
REPEAT(resolve_tac[strip_b,strip_s]i THEN DEPTH_SOLVE_1(ares_tac thms i)); |
|
8 |
||
4583 | 9 |
val imp_elim = prove_goal Base.thy "[| f:A->B; a:A; f^a:B ==> PROP P |] ==> PROP P" |
2817 | 10 |
(fn asms => [REPEAT(resolve_tac (app::asms) 1)]); |
11 |
||
4583 | 12 |
val pi_elim = prove_goal Base.thy |
2817 | 13 |
"[| F:Prod(A,B); a:A; F^a:B(a) ==> PROP P |] ==> PROP P" |
14 |
(fn asms => [REPEAT(resolve_tac (app::asms) 1)]); |
|
15 |
||
16 |
(* SIMPLE TYPES *) |
|
17 |
||
4583 | 18 |
goal Base.thy "A:* |- A->A : ?T"; |
2817 | 19 |
by (DEPTH_SOLVE (ares_tac simple 1)); |
20 |
uresult(); |
|
21 |
||
4583 | 22 |
goal Base.thy "A:* |- Lam a:A. a : ?T"; |
2817 | 23 |
by (DEPTH_SOLVE (ares_tac simple 1)); |
24 |
uresult(); |
|
25 |
||
4583 | 26 |
goal Base.thy "A:* B:* b:B |- Lam x:A. b : ?T"; |
2817 | 27 |
by (DEPTH_SOLVE (ares_tac simple 1)); |
28 |
uresult(); |
|
29 |
||
4583 | 30 |
goal Base.thy "A:* b:A |- (Lam a:A. a)^b: ?T"; |
2817 | 31 |
by (DEPTH_SOLVE (ares_tac simple 1)); |
32 |
uresult(); |
|
33 |
||
4583 | 34 |
goal Base.thy "A:* B:* c:A b:B |- (Lam x:A. b)^ c: ?T"; |
2817 | 35 |
by (DEPTH_SOLVE (ares_tac simple 1)); |
36 |
uresult(); |
|
37 |
||
4583 | 38 |
goal Base.thy "A:* B:* |- Lam a:A. Lam b:B. a : ?T"; |
2817 | 39 |
by (DEPTH_SOLVE (ares_tac simple 1)); |
40 |
uresult(); |
|
41 |
||
42 |
(* SECOND-ORDER TYPES *) |
|
43 |
||
4583 | 44 |
goal L2.thy "|- Lam A:*. Lam a:A. a : ?T"; |
2817 | 45 |
by (DEPTH_SOLVE (ares_tac L2 1)); |
46 |
uresult(); |
|
47 |
||
4583 | 48 |
goal L2.thy "A:* |- (Lam B:*.Lam b:B. b)^A : ?T"; |
2817 | 49 |
by (DEPTH_SOLVE (ares_tac L2 1)); |
50 |
uresult(); |
|
51 |
||
4583 | 52 |
goal L2.thy "A:* b:A |- (Lam B:*.Lam b:B. b) ^ A ^ b: ?T"; |
2817 | 53 |
by (DEPTH_SOLVE (ares_tac L2 1)); |
54 |
uresult(); |
|
55 |
||
4583 | 56 |
goal L2.thy "|- Lam B:*.Lam a:(Pi A:*.A).a ^ ((Pi A:*.A)->B) ^ a: ?T"; |
2817 | 57 |
by (DEPTH_SOLVE (ares_tac L2 1)); |
58 |
uresult(); |
|
59 |
||
60 |
(* Weakly higher-order proposiional logic *) |
|
61 |
||
4583 | 62 |
goal Lomega.thy "|- Lam A:*.A->A : ?T"; |
2817 | 63 |
by (DEPTH_SOLVE (ares_tac Lomega 1)); |
64 |
uresult(); |
|
65 |
||
4583 | 66 |
goal Lomega.thy "B:* |- (Lam A:*.A->A) ^ B : ?T"; |
2817 | 67 |
by (DEPTH_SOLVE (ares_tac Lomega 1)); |
68 |
uresult(); |
|
69 |
||
4583 | 70 |
goal Lomega.thy "B:* b:B |- (Lam y:B. b): ?T"; |
2817 | 71 |
by (DEPTH_SOLVE (ares_tac Lomega 1)); |
72 |
uresult(); |
|
73 |
||
4583 | 74 |
goal Lomega.thy "A:* F:*->* |- F^(F^A): ?T"; |
2817 | 75 |
by (DEPTH_SOLVE (ares_tac Lomega 1)); |
76 |
uresult(); |
|
77 |
||
4583 | 78 |
goal Lomega.thy "A:* |- Lam F:*->*.F^(F^A): ?T"; |
2817 | 79 |
by (DEPTH_SOLVE (ares_tac Lomega 1)); |
80 |
uresult(); |
|
81 |
||
82 |
(* LF *) |
|
83 |
||
4583 | 84 |
goal LP.thy "A:* |- A -> * : ?T"; |
2817 | 85 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
86 |
uresult(); |
|
87 |
||
4583 | 88 |
goal LP.thy "A:* P:A->* a:A |- P^a: ?T"; |
2817 | 89 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
90 |
uresult(); |
|
91 |
||
4583 | 92 |
goal LP.thy "A:* P:A->A->* a:A |- Pi a:A. P^a^a: ?T"; |
2817 | 93 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
94 |
uresult(); |
|
95 |
||
4583 | 96 |
goal LP.thy "A:* P:A->* Q:A->* |- Pi a:A. P^a -> Q^a: ?T"; |
2817 | 97 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
98 |
uresult(); |
|
99 |
||
4583 | 100 |
goal LP.thy "A:* P:A->* |- Pi a:A. P^a -> P^a: ?T"; |
2817 | 101 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
102 |
uresult(); |
|
103 |
||
4583 | 104 |
goal LP.thy "A:* P:A->* |- Lam a:A. Lam x:P^a. x: ?T"; |
2817 | 105 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
106 |
uresult(); |
|
107 |
||
4583 | 108 |
goal LP.thy "A:* P:A->* Q:* |- (Pi a:A. P^a->Q) -> (Pi a:A. P^a) -> Q : ?T"; |
2817 | 109 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
110 |
uresult(); |
|
111 |
||
4583 | 112 |
goal LP.thy "A:* P:A->* Q:* a0:A |- \ |
3836 | 113 |
\ Lam x:Pi a:A. P^a->Q. Lam y:Pi a:A. P^a. x^a0^(y^a0): ?T"; |
2817 | 114 |
by (DEPTH_SOLVE (ares_tac LP 1)); |
115 |
uresult(); |
|
116 |
||
117 |
(* OMEGA-ORDER TYPES *) |
|
118 |
||
4583 | 119 |
goal L2.thy "A:* B:* |- Pi C:*.(A->B->C)->C : ?T"; |
2817 | 120 |
by (DEPTH_SOLVE (ares_tac L2 1)); |
121 |
uresult(); |
|
122 |
||
11260
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
123 |
goal Lomega2.thy "|- Lam A:*.Lam B:*.Pi C:*.(A->B->C)->C : ?T"; |
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
124 |
by (DEPTH_SOLVE (ares_tac Lomega2 1)); |
2817 | 125 |
uresult(); |
126 |
||
11260
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
127 |
goal Lomega2.thy "|- Lam A:*.Lam B:*.Lam x:A. Lam y:B. x : ?T"; |
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
128 |
by (DEPTH_SOLVE (ares_tac Lomega2 1)); |
2817 | 129 |
uresult(); |
130 |
||
11260
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
131 |
goal Lomega2.thy "A:* B:* |- ?p : (A->B) -> ((B->Pi P:*.P)->(A->Pi P:*.P))"; |
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
132 |
by (strip_asms_tac Lomega2 1); |
2817 | 133 |
by (rtac lam_ss 1); |
11260
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
134 |
by (DEPTH_SOLVE_1(ares_tac Lomega2 1)); |
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
135 |
by (DEPTH_SOLVE_1(ares_tac Lomega2 2)); |
2817 | 136 |
by (rtac lam_ss 1); |
11260
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
137 |
by (DEPTH_SOLVE_1(ares_tac Lomega2 1)); |
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
138 |
by (DEPTH_SOLVE_1(ares_tac Lomega2 2)); |
2817 | 139 |
by (rtac lam_ss 1); |
140 |
by (assume_tac 1); |
|
11260
b736de4cb913
renaming of theory LOmega to lomega2 in order to prevent a possible
paulson
parents:
4583
diff
changeset
|
141 |
by (DEPTH_SOLVE_1(ares_tac Lomega2 2)); |
2817 | 142 |
by (etac pi_elim 1); |
143 |
by (assume_tac 1); |
|
144 |
by (etac pi_elim 1); |
|
145 |
by (assume_tac 1); |
|
146 |
by (assume_tac 1); |
|
147 |
uresult(); |
|
148 |
||
149 |
(* Second-order Predicate Logic *) |
|
150 |
||
4583 | 151 |
goal LP2.thy "A:* P:A->* |- Lam a:A. P^a->(Pi A:*.A) : ?T"; |
2817 | 152 |
by (DEPTH_SOLVE (ares_tac LP2 1)); |
153 |
uresult(); |
|
154 |
||
4583 | 155 |
goal LP2.thy "A:* P:A->A->* |- \ |
3836 | 156 |
\ (Pi a:A. Pi b:A. P^a^b->P^b^a->Pi P:*.P) -> Pi a:A. P^a^a->Pi P:*.P : ?T"; |
2817 | 157 |
by (DEPTH_SOLVE (ares_tac LP2 1)); |
158 |
uresult(); |
|
159 |
||
160 |
(* Antisymmetry implies irreflexivity: *) |
|
4583 | 161 |
goal LP2.thy "A:* P:A->A->* |- \ |
3836 | 162 |
\ ?p: (Pi a:A. Pi b:A. P^a^b->P^b^a->Pi P:*.P) -> Pi a:A. P^a^a->Pi P:*.P"; |
2817 | 163 |
by (strip_asms_tac LP2 1); |
164 |
by (rtac lam_ss 1); |
|
165 |
by (DEPTH_SOLVE_1(ares_tac LP2 1)); |
|
166 |
by (DEPTH_SOLVE_1(ares_tac LP2 2)); |
|
167 |
by (rtac lam_ss 1); |
|
168 |
by (assume_tac 1); |
|
169 |
by (DEPTH_SOLVE_1(ares_tac LP2 2)); |
|
170 |
by (rtac lam_ss 1); |
|
171 |
by (DEPTH_SOLVE_1(ares_tac LP2 1)); |
|
172 |
by (DEPTH_SOLVE_1(ares_tac LP2 2)); |
|
173 |
by (REPEAT(EVERY[etac pi_elim 1, assume_tac 1, TRY(assume_tac 1)])); |
|
174 |
uresult(); |
|
175 |
||
176 |
(* LPomega *) |
|
177 |
||
4583 | 178 |
goal LPomega.thy "A:* |- Lam P:A->A->*.Lam a:A. P^a^a : ?T"; |
2817 | 179 |
by (DEPTH_SOLVE (ares_tac LPomega 1)); |
180 |
uresult(); |
|
181 |
||
4583 | 182 |
goal LPomega.thy "|- Lam A:*.Lam P:A->A->*.Lam a:A. P^a^a : ?T"; |
2817 | 183 |
by (DEPTH_SOLVE (ares_tac LPomega 1)); |
184 |
uresult(); |
|
185 |
||
186 |
(* CONSTRUCTIONS *) |
|
187 |
||
4583 | 188 |
goal CC.thy "|- Lam A:*.Lam P:A->*.Lam a:A. P^a->Pi P:*.P: ?T"; |
2817 | 189 |
by (DEPTH_SOLVE (ares_tac CC 1)); |
190 |
uresult(); |
|
191 |
||
4583 | 192 |
goal CC.thy "|- Lam A:*.Lam P:A->*.Pi a:A. P^a: ?T"; |
2817 | 193 |
by (DEPTH_SOLVE (ares_tac CC 1)); |
194 |
uresult(); |
|
195 |
||
4583 | 196 |
goal CC.thy "A:* P:A->* a:A |- ?p : (Pi a:A. P^a)->P^a"; |
2817 | 197 |
by (strip_asms_tac CC 1); |
198 |
by (rtac lam_ss 1); |
|
199 |
by (DEPTH_SOLVE_1(ares_tac CC 1)); |
|
200 |
by (DEPTH_SOLVE_1(ares_tac CC 2)); |
|
201 |
by (EVERY[etac pi_elim 1, assume_tac 1, assume_tac 1]); |
|
202 |
uresult(); |
|
203 |
||
204 |
(* Some random examples *) |
|
205 |
||
4583 | 206 |
goal LP2.thy "A:* c:A f:A->A |- \ |
2817 | 207 |
\ Lam a:A. Pi P:A->*.P^c -> (Pi x:A. P^x->P^(f^x)) -> P^a : ?T"; |
208 |
by (DEPTH_SOLVE(ares_tac LP2 1)); |
|
209 |
uresult(); |
|
210 |
||
4583 | 211 |
goal CC.thy "Lam A:*.Lam c:A. Lam f:A->A. \ |
2817 | 212 |
\ Lam a:A. Pi P:A->*.P^c -> (Pi x:A. P^x->P^(f^x)) -> P^a : ?T"; |
213 |
by (DEPTH_SOLVE(ares_tac CC 1)); |
|
214 |
uresult(); |
|
215 |
||
216 |
(* Symmetry of Leibnitz equality *) |
|
4583 | 217 |
goal LP2.thy "A:* a:A b:A |- ?p: (Pi P:A->*.P^a->P^b) -> (Pi P:A->*.P^b->P^a)"; |
2817 | 218 |
by (strip_asms_tac LP2 1); |
219 |
by (rtac lam_ss 1); |
|
220 |
by (DEPTH_SOLVE_1(ares_tac LP2 1)); |
|
221 |
by (DEPTH_SOLVE_1(ares_tac LP2 2)); |
|
3836 | 222 |
by (eres_inst_tac [("a","Lam x:A. Pi Q:A->*.Q^x->Q^a")] pi_elim 1); |
2817 | 223 |
by (DEPTH_SOLVE_1(ares_tac LP2 1)); |
224 |
by (rewtac beta); |
|
225 |
by (etac imp_elim 1); |
|
226 |
by (rtac lam_bs 1); |
|
227 |
by (DEPTH_SOLVE_1(ares_tac LP2 1)); |
|
228 |
by (DEPTH_SOLVE_1(ares_tac LP2 2)); |
|
229 |
by (rtac lam_ss 1); |
|
230 |
by (DEPTH_SOLVE_1(ares_tac LP2 1)); |
|
231 |
by (DEPTH_SOLVE_1(ares_tac LP2 2)); |
|
232 |
by (assume_tac 1); |
|
233 |
by (assume_tac 1); |
|
234 |
uresult(); |