13163
|
1 |
(* Title: ZF/func.thy
|
|
2 |
ID: $Id$
|
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory
|
|
4 |
Copyright 1991 University of Cambridge
|
|
5 |
|
|
6 |
Functions in Zermelo-Fraenkel Set Theory
|
|
7 |
*)
|
|
8 |
|
|
9 |
theory func = domrange + equalities:
|
|
10 |
|
|
11 |
(*** The Pi operator -- dependent function space ***)
|
|
12 |
|
|
13 |
lemma Pi_iff:
|
|
14 |
"f: Pi(A,B) <-> function(f) & f<=Sigma(A,B) & A<=domain(f)"
|
|
15 |
by (unfold Pi_def, blast)
|
|
16 |
|
|
17 |
(*For upward compatibility with the former definition*)
|
|
18 |
lemma Pi_iff_old:
|
|
19 |
"f: Pi(A,B) <-> f<=Sigma(A,B) & (ALL x:A. EX! y. <x,y>: f)"
|
|
20 |
by (unfold Pi_def function_def, blast)
|
|
21 |
|
|
22 |
lemma fun_is_function: "f: Pi(A,B) ==> function(f)"
|
|
23 |
by (simp only: Pi_iff)
|
|
24 |
|
|
25 |
(*Functions are relations*)
|
|
26 |
lemma fun_is_rel: "f: Pi(A,B) ==> f <= Sigma(A,B)"
|
|
27 |
by (unfold Pi_def, blast)
|
|
28 |
|
|
29 |
lemma Pi_cong:
|
|
30 |
"[| A=A'; !!x. x:A' ==> B(x)=B'(x) |] ==> Pi(A,B) = Pi(A',B')"
|
|
31 |
by (simp add: Pi_def cong add: Sigma_cong)
|
|
32 |
|
|
33 |
(*Sigma_cong, Pi_cong NOT given to Addcongs: they cause
|
|
34 |
flex-flex pairs and the "Check your prover" error. Most
|
|
35 |
Sigmas and Pis are abbreviated as * or -> *)
|
|
36 |
|
|
37 |
(*Weakening one function type to another; see also Pi_type*)
|
|
38 |
lemma fun_weaken_type: "[| f: A->B; B<=D |] ==> f: A->D"
|
|
39 |
by (unfold Pi_def, best)
|
|
40 |
|
|
41 |
(*** Function Application ***)
|
|
42 |
|
|
43 |
lemma apply_equality2: "[| <a,b>: f; <a,c>: f; f: Pi(A,B) |] ==> b=c"
|
|
44 |
by (unfold Pi_def function_def, blast)
|
|
45 |
|
|
46 |
lemma function_apply_equality: "[| <a,b>: f; function(f) |] ==> f`a = b"
|
|
47 |
by (unfold apply_def function_def, blast)
|
|
48 |
|
|
49 |
lemma apply_equality: "[| <a,b>: f; f: Pi(A,B) |] ==> f`a = b"
|
|
50 |
apply (unfold Pi_def)
|
|
51 |
apply (blast intro: function_apply_equality)
|
|
52 |
done
|
|
53 |
|
|
54 |
(*Applying a function outside its domain yields 0*)
|
|
55 |
lemma apply_0: "a ~: domain(f) ==> f`a = 0"
|
|
56 |
apply (unfold apply_def)
|
|
57 |
apply (rule the_0, blast)
|
|
58 |
done
|
|
59 |
|
|
60 |
lemma Pi_memberD: "[| f: Pi(A,B); c: f |] ==> EX x:A. c = <x,f`x>"
|
|
61 |
apply (frule fun_is_rel)
|
|
62 |
apply (blast dest: apply_equality)
|
|
63 |
done
|
|
64 |
|
|
65 |
lemma function_apply_Pair: "[| function(f); a : domain(f)|] ==> <a,f`a>: f"
|
|
66 |
apply (simp add: function_def apply_def)
|
|
67 |
apply (rule theI2, auto)
|
|
68 |
done
|
|
69 |
|
|
70 |
lemma apply_Pair: "[| f: Pi(A,B); a:A |] ==> <a,f`a>: f"
|
|
71 |
apply (simp add: Pi_iff)
|
|
72 |
apply (blast intro: function_apply_Pair)
|
|
73 |
done
|
|
74 |
|
|
75 |
(*Conclusion is flexible -- use res_inst_tac or else apply_funtype below!*)
|
|
76 |
lemma apply_type [TC]: "[| f: Pi(A,B); a:A |] ==> f`a : B(a)"
|
|
77 |
by (blast intro: apply_Pair dest: fun_is_rel)
|
|
78 |
|
|
79 |
(*This version is acceptable to the simplifier*)
|
|
80 |
lemma apply_funtype: "[| f: A->B; a:A |] ==> f`a : B"
|
|
81 |
by (blast dest: apply_type)
|
|
82 |
|
|
83 |
lemma apply_iff: "f: Pi(A,B) ==> <a,b>: f <-> a:A & f`a = b"
|
|
84 |
apply (frule fun_is_rel)
|
|
85 |
apply (blast intro!: apply_Pair apply_equality)
|
|
86 |
done
|
|
87 |
|
|
88 |
(*Refining one Pi type to another*)
|
|
89 |
lemma Pi_type: "[| f: Pi(A,C); !!x. x:A ==> f`x : B(x) |] ==> f : Pi(A,B)"
|
|
90 |
apply (simp only: Pi_iff)
|
|
91 |
apply (blast dest: function_apply_equality)
|
|
92 |
done
|
|
93 |
|
|
94 |
(*Such functions arise in non-standard datatypes, ZF/ex/Ntree for instance*)
|
|
95 |
lemma Pi_Collect_iff:
|
|
96 |
"(f : Pi(A, %x. {y:B(x). P(x,y)}))
|
|
97 |
<-> f : Pi(A,B) & (ALL x: A. P(x, f`x))"
|
|
98 |
by (blast intro: Pi_type dest: apply_type)
|
|
99 |
|
|
100 |
lemma Pi_weaken_type:
|
|
101 |
"[| f : Pi(A,B); !!x. x:A ==> B(x)<=C(x) |] ==> f : Pi(A,C)"
|
|
102 |
by (blast intro: Pi_type dest: apply_type)
|
|
103 |
|
|
104 |
|
|
105 |
(** Elimination of membership in a function **)
|
|
106 |
|
|
107 |
lemma domain_type: "[| <a,b> : f; f: Pi(A,B) |] ==> a : A"
|
|
108 |
by (blast dest: fun_is_rel)
|
|
109 |
|
|
110 |
lemma range_type: "[| <a,b> : f; f: Pi(A,B) |] ==> b : B(a)"
|
|
111 |
by (blast dest: fun_is_rel)
|
|
112 |
|
|
113 |
lemma Pair_mem_PiD: "[| <a,b>: f; f: Pi(A,B) |] ==> a:A & b:B(a) & f`a = b"
|
|
114 |
by (blast intro: domain_type range_type apply_equality)
|
|
115 |
|
|
116 |
(*** Lambda Abstraction ***)
|
|
117 |
|
|
118 |
lemma lamI: "a:A ==> <a,b(a)> : (lam x:A. b(x))"
|
|
119 |
apply (unfold lam_def)
|
|
120 |
apply (erule RepFunI)
|
|
121 |
done
|
|
122 |
|
|
123 |
lemma lamE:
|
|
124 |
"[| p: (lam x:A. b(x)); !!x.[| x:A; p=<x,b(x)> |] ==> P
|
|
125 |
|] ==> P"
|
|
126 |
by (simp add: lam_def, blast)
|
|
127 |
|
|
128 |
lemma lamD: "[| <a,c>: (lam x:A. b(x)) |] ==> c = b(a)"
|
|
129 |
by (simp add: lam_def)
|
|
130 |
|
|
131 |
lemma lam_type [TC]:
|
|
132 |
"[| !!x. x:A ==> b(x): B(x) |] ==> (lam x:A. b(x)) : Pi(A,B)"
|
|
133 |
by (simp add: lam_def Pi_def function_def, blast)
|
|
134 |
|
|
135 |
lemma lam_funtype: "(lam x:A. b(x)) : A -> {b(x). x:A}"
|
|
136 |
by (blast intro: lam_type);
|
|
137 |
|
|
138 |
lemma beta [simp]: "a : A ==> (lam x:A. b(x)) ` a = b(a)"
|
|
139 |
by (blast intro: apply_equality lam_funtype lamI)
|
|
140 |
|
|
141 |
lemma lam_empty [simp]: "(lam x:0. b(x)) = 0"
|
|
142 |
by (simp add: lam_def)
|
|
143 |
|
|
144 |
lemma domain_lam [simp]: "domain(Lambda(A,b)) = A"
|
|
145 |
by (simp add: lam_def, blast)
|
|
146 |
|
|
147 |
(*congruence rule for lambda abstraction*)
|
|
148 |
lemma lam_cong [cong]:
|
|
149 |
"[| A=A'; !!x. x:A' ==> b(x)=b'(x) |] ==> Lambda(A,b) = Lambda(A',b')"
|
|
150 |
by (simp only: lam_def cong add: RepFun_cong)
|
|
151 |
|
|
152 |
lemma lam_theI:
|
|
153 |
"(!!x. x:A ==> EX! y. Q(x,y)) ==> EX f. ALL x:A. Q(x, f`x)"
|
|
154 |
apply (rule_tac x = "lam x: A. THE y. Q (x,y) " in exI)
|
|
155 |
apply (rule ballI)
|
|
156 |
apply (subst beta, assumption)
|
|
157 |
apply (blast intro: theI)
|
|
158 |
done
|
|
159 |
|
|
160 |
lemma lam_eqE: "[| (lam x:A. f(x)) = (lam x:A. g(x)); a:A |] ==> f(a)=g(a)"
|
|
161 |
by (fast intro!: lamI elim: equalityE lamE)
|
|
162 |
|
|
163 |
|
|
164 |
(*Empty function spaces*)
|
|
165 |
lemma Pi_empty1 [simp]: "Pi(0,A) = {0}"
|
|
166 |
by (unfold Pi_def function_def, blast)
|
|
167 |
|
|
168 |
(*The singleton function*)
|
|
169 |
lemma singleton_fun [simp]: "{<a,b>} : {a} -> {b}"
|
|
170 |
by (unfold Pi_def function_def, blast)
|
|
171 |
|
|
172 |
lemma Pi_empty2 [simp]: "(A->0) = (if A=0 then {0} else 0)"
|
|
173 |
by (unfold Pi_def function_def, force)
|
|
174 |
|
|
175 |
lemma fun_space_empty_iff [iff]: "(A->X)=0 \<longleftrightarrow> X=0 & (A \<noteq> 0)"
|
|
176 |
apply auto
|
|
177 |
apply (fast intro!: equals0I intro: lam_type)
|
|
178 |
done
|
|
179 |
|
|
180 |
|
|
181 |
(** Extensionality **)
|
|
182 |
|
|
183 |
(*Semi-extensionality!*)
|
|
184 |
|
|
185 |
lemma fun_subset:
|
|
186 |
"[| f : Pi(A,B); g: Pi(C,D); A<=C;
|
|
187 |
!!x. x:A ==> f`x = g`x |] ==> f<=g"
|
|
188 |
by (force dest: Pi_memberD intro: apply_Pair)
|
|
189 |
|
|
190 |
lemma fun_extension:
|
|
191 |
"[| f : Pi(A,B); g: Pi(A,D);
|
|
192 |
!!x. x:A ==> f`x = g`x |] ==> f=g"
|
|
193 |
by (blast del: subsetI intro: subset_refl sym fun_subset)
|
|
194 |
|
|
195 |
lemma eta [simp]: "f : Pi(A,B) ==> (lam x:A. f`x) = f"
|
|
196 |
apply (rule fun_extension)
|
|
197 |
apply (auto simp add: lam_type apply_type beta)
|
|
198 |
done
|
|
199 |
|
|
200 |
lemma fun_extension_iff:
|
|
201 |
"[| f:Pi(A,B); g:Pi(A,C) |] ==> (ALL a:A. f`a = g`a) <-> f=g"
|
|
202 |
by (blast intro: fun_extension)
|
|
203 |
|
|
204 |
(*thm by Mark Staples, proof by lcp*)
|
|
205 |
lemma fun_subset_eq: "[| f:Pi(A,B); g:Pi(A,C) |] ==> f <= g <-> (f = g)"
|
|
206 |
by (blast dest: apply_Pair
|
|
207 |
intro: fun_extension apply_equality [symmetric])
|
|
208 |
|
|
209 |
|
|
210 |
(*Every element of Pi(A,B) may be expressed as a lambda abstraction!*)
|
|
211 |
lemma Pi_lamE:
|
|
212 |
assumes major: "f: Pi(A,B)"
|
|
213 |
and minor: "!!b. [| ALL x:A. b(x):B(x); f = (lam x:A. b(x)) |] ==> P"
|
|
214 |
shows "P"
|
|
215 |
apply (rule minor)
|
|
216 |
apply (rule_tac [2] eta [symmetric])
|
|
217 |
apply (blast intro: major apply_type)+
|
|
218 |
done
|
|
219 |
|
|
220 |
|
|
221 |
(** Images of functions **)
|
|
222 |
|
|
223 |
lemma image_lam: "C <= A ==> (lam x:A. b(x)) `` C = {b(x). x:C}"
|
|
224 |
by (unfold lam_def, blast)
|
|
225 |
|
|
226 |
lemma image_fun: "[| f : Pi(A,B); C <= A |] ==> f``C = {f`x. x:C}"
|
|
227 |
apply (erule eta [THEN subst])
|
|
228 |
apply (simp add: image_lam subset_iff)
|
|
229 |
done
|
|
230 |
|
|
231 |
lemma Pi_image_cons:
|
|
232 |
"[| f: Pi(A,B); x: A |] ==> f `` cons(x,y) = cons(f`x, f``y)"
|
|
233 |
by (blast dest: apply_equality apply_Pair)
|
|
234 |
|
124
|
235 |
|
13163
|
236 |
(*** properties of "restrict" ***)
|
|
237 |
|
|
238 |
lemma restrict_subset:
|
|
239 |
"[| f: Pi(C,B); A<=C |] ==> restrict(f,A) <= f"
|
|
240 |
apply (unfold restrict_def)
|
|
241 |
apply (blast intro: apply_Pair)
|
|
242 |
done
|
|
243 |
|
|
244 |
lemma function_restrictI:
|
|
245 |
"function(f) ==> function(restrict(f,A))"
|
|
246 |
by (unfold restrict_def function_def, blast)
|
|
247 |
|
|
248 |
lemma restrict_type2: "[| f: Pi(C,B); A<=C |] ==> restrict(f,A) : Pi(A,B)"
|
|
249 |
by (simp add: Pi_iff function_def restrict_def, blast)
|
|
250 |
|
|
251 |
lemma restrict: "a : A ==> restrict(f,A) ` a = f`a"
|
|
252 |
by (simp add: apply_def restrict_def)
|
|
253 |
|
|
254 |
lemma restrict_empty [simp]: "restrict(f,0) = 0"
|
|
255 |
apply (unfold restrict_def)
|
|
256 |
apply (simp (no_asm))
|
|
257 |
done
|
|
258 |
|
|
259 |
lemma domain_restrict_lam [simp]: "domain(restrict(Lambda(A,f),C)) = A Int C"
|
|
260 |
apply (unfold restrict_def lam_def)
|
|
261 |
apply (rule equalityI)
|
|
262 |
apply (auto simp add: domain_iff)
|
|
263 |
done
|
|
264 |
|
|
265 |
lemma restrict_restrict [simp]:
|
|
266 |
"restrict(restrict(r,A),B) = restrict(r, A Int B)"
|
|
267 |
by (unfold restrict_def, blast)
|
|
268 |
|
|
269 |
lemma domain_restrict [simp]: "domain(restrict(f,C)) = domain(f) Int C"
|
|
270 |
apply (unfold restrict_def)
|
|
271 |
apply (auto simp add: domain_def)
|
|
272 |
done
|
|
273 |
|
|
274 |
lemma restrict_idem [simp]: "f <= Sigma(A,B) ==> restrict(f,A) = f"
|
|
275 |
by (simp add: restrict_def, blast)
|
|
276 |
|
|
277 |
lemma restrict_if [simp]: "restrict(f,A) ` a = (if a : A then f`a else 0)"
|
|
278 |
by (simp add: restrict apply_0)
|
|
279 |
|
|
280 |
lemma restrict_lam_eq:
|
|
281 |
"A<=C ==> restrict(lam x:C. b(x), A) = (lam x:A. b(x))"
|
|
282 |
by (unfold restrict_def lam_def, auto)
|
|
283 |
|
|
284 |
lemma fun_cons_restrict_eq:
|
|
285 |
"f : cons(a, b) -> B ==> f = cons(<a, f ` a>, restrict(f, b))"
|
|
286 |
apply (rule equalityI)
|
|
287 |
prefer 2 apply (blast intro: apply_Pair restrict_subset [THEN subsetD])
|
|
288 |
apply (auto dest!: Pi_memberD simp add: restrict_def lam_def)
|
|
289 |
done
|
|
290 |
|
|
291 |
|
|
292 |
(*** Unions of functions ***)
|
|
293 |
|
|
294 |
(** The Union of a set of COMPATIBLE functions is a function **)
|
|
295 |
|
|
296 |
lemma function_Union:
|
|
297 |
"[| ALL x:S. function(x);
|
|
298 |
ALL x:S. ALL y:S. x<=y | y<=x |]
|
|
299 |
==> function(Union(S))"
|
|
300 |
by (unfold function_def, blast)
|
|
301 |
|
|
302 |
lemma fun_Union:
|
|
303 |
"[| ALL f:S. EX C D. f:C->D;
|
|
304 |
ALL f:S. ALL y:S. f<=y | y<=f |] ==>
|
|
305 |
Union(S) : domain(Union(S)) -> range(Union(S))"
|
|
306 |
apply (unfold Pi_def)
|
|
307 |
apply (blast intro!: rel_Union function_Union)
|
|
308 |
done
|
|
309 |
|
|
310 |
|
|
311 |
(** The Union of 2 disjoint functions is a function **)
|
|
312 |
|
|
313 |
lemmas Un_rls = Un_subset_iff SUM_Un_distrib1 prod_Un_distrib2
|
|
314 |
subset_trans [OF _ Un_upper1]
|
|
315 |
subset_trans [OF _ Un_upper2]
|
|
316 |
|
|
317 |
lemma fun_disjoint_Un:
|
|
318 |
"[| f: A->B; g: C->D; A Int C = 0 |]
|
|
319 |
==> (f Un g) : (A Un C) -> (B Un D)"
|
|
320 |
(*Prove the product and domain subgoals using distributive laws*)
|
|
321 |
apply (simp add: Pi_iff extension Un_rls)
|
|
322 |
apply (unfold function_def, blast)
|
|
323 |
done
|
|
324 |
|
|
325 |
lemma fun_disjoint_apply1:
|
|
326 |
"[| a:A; f: A->B; g: C->D; A Int C = 0 |]
|
|
327 |
==> (f Un g)`a = f`a"
|
|
328 |
apply (rule apply_Pair [THEN UnI1, THEN apply_equality], assumption+)
|
|
329 |
apply (blast intro: fun_disjoint_Un )
|
|
330 |
done
|
|
331 |
|
|
332 |
lemma fun_disjoint_apply2:
|
|
333 |
"[| c:C; f: A->B; g: C->D; A Int C = 0 |]
|
|
334 |
==> (f Un g)`c = g`c"
|
|
335 |
apply (rule apply_Pair [THEN UnI2, THEN apply_equality], assumption+)
|
|
336 |
apply (blast intro: fun_disjoint_Un )
|
|
337 |
done
|
|
338 |
|
|
339 |
(** Domain and range of a function/relation **)
|
|
340 |
|
|
341 |
lemma domain_of_fun: "f : Pi(A,B) ==> domain(f)=A"
|
|
342 |
by (unfold Pi_def, blast)
|
|
343 |
|
|
344 |
lemma apply_rangeI: "[| f : Pi(A,B); a: A |] ==> f`a : range(f)"
|
|
345 |
by (erule apply_Pair [THEN rangeI], assumption)
|
|
346 |
|
|
347 |
lemma range_of_fun: "f : Pi(A,B) ==> f : A->range(f)"
|
|
348 |
by (blast intro: Pi_type apply_rangeI)
|
|
349 |
|
|
350 |
(*** Extensions of functions ***)
|
|
351 |
|
|
352 |
lemma fun_extend:
|
|
353 |
"[| f: A->B; c~:A |] ==> cons(<c,b>,f) : cons(c,A) -> cons(b,B)"
|
|
354 |
apply (frule singleton_fun [THEN fun_disjoint_Un], blast)
|
|
355 |
apply (simp add: cons_eq)
|
|
356 |
done
|
|
357 |
|
|
358 |
lemma fun_extend3:
|
|
359 |
"[| f: A->B; c~:A; b: B |] ==> cons(<c,b>,f) : cons(c,A) -> B"
|
|
360 |
by (blast intro: fun_extend [THEN fun_weaken_type])
|
|
361 |
|
|
362 |
lemma fun_extend_apply1: "[| f: A->B; a:A; c~:A |] ==> cons(<c,b>,f)`a = f`a"
|
|
363 |
apply (rule apply_Pair [THEN consI2, THEN apply_equality])
|
|
364 |
apply (rule_tac [3] fun_extend, assumption+)
|
|
365 |
done
|
|
366 |
|
|
367 |
lemma fun_extend_apply2: "[| f: A->B; c~:A |] ==> cons(<c,b>,f)`c = b"
|
|
368 |
apply (rule consI1 [THEN apply_equality])
|
|
369 |
apply (rule fun_extend, assumption+)
|
|
370 |
done
|
|
371 |
|
|
372 |
lemmas singleton_apply = apply_equality [OF singletonI singleton_fun, simp]
|
|
373 |
|
|
374 |
(*For Finite.ML. Inclusion of right into left is easy*)
|
|
375 |
lemma cons_fun_eq:
|
|
376 |
"c ~: A ==> cons(c,A) -> B = (UN f: A->B. UN b:B. {cons(<c,b>, f)})"
|
|
377 |
apply (rule equalityI)
|
|
378 |
apply (safe elim!: fun_extend3)
|
|
379 |
(*Inclusion of left into right*)
|
|
380 |
apply (subgoal_tac "restrict (x, A) : A -> B")
|
|
381 |
prefer 2 apply (blast intro: restrict_type2)
|
|
382 |
apply (rule UN_I, assumption)
|
|
383 |
apply (rule apply_funtype [THEN UN_I])
|
|
384 |
apply assumption
|
|
385 |
apply (rule consI1)
|
|
386 |
apply (simp (no_asm))
|
|
387 |
apply (rule fun_extension)
|
|
388 |
apply assumption
|
|
389 |
apply (blast intro: fun_extend)
|
|
390 |
apply (erule consE)
|
|
391 |
apply (simp_all add: restrict fun_extend_apply1 fun_extend_apply2)
|
|
392 |
done
|
|
393 |
|
|
394 |
ML
|
|
395 |
{*
|
|
396 |
val Pi_iff = thm "Pi_iff";
|
|
397 |
val Pi_iff_old = thm "Pi_iff_old";
|
|
398 |
val fun_is_function = thm "fun_is_function";
|
|
399 |
val fun_is_rel = thm "fun_is_rel";
|
|
400 |
val Pi_cong = thm "Pi_cong";
|
|
401 |
val fun_weaken_type = thm "fun_weaken_type";
|
|
402 |
val apply_equality2 = thm "apply_equality2";
|
|
403 |
val function_apply_equality = thm "function_apply_equality";
|
|
404 |
val apply_equality = thm "apply_equality";
|
|
405 |
val apply_0 = thm "apply_0";
|
|
406 |
val Pi_memberD = thm "Pi_memberD";
|
|
407 |
val function_apply_Pair = thm "function_apply_Pair";
|
|
408 |
val apply_Pair = thm "apply_Pair";
|
|
409 |
val apply_type = thm "apply_type";
|
|
410 |
val apply_funtype = thm "apply_funtype";
|
|
411 |
val apply_iff = thm "apply_iff";
|
|
412 |
val Pi_type = thm "Pi_type";
|
|
413 |
val Pi_Collect_iff = thm "Pi_Collect_iff";
|
|
414 |
val Pi_weaken_type = thm "Pi_weaken_type";
|
|
415 |
val domain_type = thm "domain_type";
|
|
416 |
val range_type = thm "range_type";
|
|
417 |
val Pair_mem_PiD = thm "Pair_mem_PiD";
|
|
418 |
val lamI = thm "lamI";
|
|
419 |
val lamE = thm "lamE";
|
|
420 |
val lamD = thm "lamD";
|
|
421 |
val lam_type = thm "lam_type";
|
|
422 |
val lam_funtype = thm "lam_funtype";
|
|
423 |
val beta = thm "beta";
|
|
424 |
val lam_empty = thm "lam_empty";
|
|
425 |
val domain_lam = thm "domain_lam";
|
|
426 |
val lam_cong = thm "lam_cong";
|
|
427 |
val lam_theI = thm "lam_theI";
|
|
428 |
val lam_eqE = thm "lam_eqE";
|
|
429 |
val Pi_empty1 = thm "Pi_empty1";
|
|
430 |
val singleton_fun = thm "singleton_fun";
|
|
431 |
val Pi_empty2 = thm "Pi_empty2";
|
|
432 |
val fun_space_empty_iff = thm "fun_space_empty_iff";
|
|
433 |
val fun_subset = thm "fun_subset";
|
|
434 |
val fun_extension = thm "fun_extension";
|
|
435 |
val eta = thm "eta";
|
|
436 |
val fun_extension_iff = thm "fun_extension_iff";
|
|
437 |
val fun_subset_eq = thm "fun_subset_eq";
|
|
438 |
val Pi_lamE = thm "Pi_lamE";
|
|
439 |
val image_lam = thm "image_lam";
|
|
440 |
val image_fun = thm "image_fun";
|
|
441 |
val Pi_image_cons = thm "Pi_image_cons";
|
|
442 |
val restrict_subset = thm "restrict_subset";
|
|
443 |
val function_restrictI = thm "function_restrictI";
|
|
444 |
val restrict_type2 = thm "restrict_type2";
|
|
445 |
val restrict = thm "restrict";
|
|
446 |
val restrict_empty = thm "restrict_empty";
|
|
447 |
val domain_restrict_lam = thm "domain_restrict_lam";
|
|
448 |
val restrict_restrict = thm "restrict_restrict";
|
|
449 |
val domain_restrict = thm "domain_restrict";
|
|
450 |
val restrict_idem = thm "restrict_idem";
|
|
451 |
val restrict_if = thm "restrict_if";
|
|
452 |
val restrict_lam_eq = thm "restrict_lam_eq";
|
|
453 |
val fun_cons_restrict_eq = thm "fun_cons_restrict_eq";
|
|
454 |
val function_Union = thm "function_Union";
|
|
455 |
val fun_Union = thm "fun_Union";
|
|
456 |
val fun_disjoint_Un = thm "fun_disjoint_Un";
|
|
457 |
val fun_disjoint_apply1 = thm "fun_disjoint_apply1";
|
|
458 |
val fun_disjoint_apply2 = thm "fun_disjoint_apply2";
|
|
459 |
val domain_of_fun = thm "domain_of_fun";
|
|
460 |
val apply_rangeI = thm "apply_rangeI";
|
|
461 |
val range_of_fun = thm "range_of_fun";
|
|
462 |
val fun_extend = thm "fun_extend";
|
|
463 |
val fun_extend3 = thm "fun_extend3";
|
|
464 |
val fun_extend_apply1 = thm "fun_extend_apply1";
|
|
465 |
val fun_extend_apply2 = thm "fun_extend_apply2";
|
|
466 |
val singleton_apply = thm "singleton_apply";
|
|
467 |
val cons_fun_eq = thm "cons_fun_eq";
|
|
468 |
*}
|
|
469 |
|
|
470 |
end
|