1465
|
1 |
(* Title: HOL/Fun
|
923
|
2 |
ID: $Id$
|
1465
|
3 |
Author: Tobias Nipkow, Cambridge University Computer Laboratory
|
923
|
4 |
Copyright 1993 University of Cambridge
|
|
5 |
|
|
6 |
Lemmas about functions.
|
|
7 |
*)
|
|
8 |
|
|
9 |
goal Fun.thy "(f = g) = (!x. f(x)=g(x))";
|
|
10 |
by (rtac iffI 1);
|
1264
|
11 |
by (Asm_simp_tac 1);
|
|
12 |
by (rtac ext 1 THEN Asm_simp_tac 1);
|
923
|
13 |
qed "expand_fun_eq";
|
|
14 |
|
|
15 |
val prems = goal Fun.thy
|
|
16 |
"[| f(x)=u; !!x. P(x) ==> g(f(x)) = x; P(x) |] ==> x=g(u)";
|
|
17 |
by (rtac (arg_cong RS box_equals) 1);
|
|
18 |
by (REPEAT (resolve_tac (prems@[refl]) 1));
|
|
19 |
qed "apply_inverse";
|
|
20 |
|
|
21 |
|
|
22 |
(*** inj(f): f is a one-to-one function ***)
|
|
23 |
|
|
24 |
val prems = goalw Fun.thy [inj_def]
|
|
25 |
"[| !! x y. f(x) = f(y) ==> x=y |] ==> inj(f)";
|
4089
|
26 |
by (blast_tac (claset() addIs prems) 1);
|
923
|
27 |
qed "injI";
|
|
28 |
|
|
29 |
val [major] = goal Fun.thy "(!!x. g(f(x)) = x) ==> inj(f)";
|
|
30 |
by (rtac injI 1);
|
|
31 |
by (etac (arg_cong RS box_equals) 1);
|
|
32 |
by (rtac major 1);
|
|
33 |
by (rtac major 1);
|
|
34 |
qed "inj_inverseI";
|
|
35 |
|
|
36 |
val [major,minor] = goalw Fun.thy [inj_def]
|
|
37 |
"[| inj(f); f(x) = f(y) |] ==> x=y";
|
|
38 |
by (rtac (major RS spec RS spec RS mp) 1);
|
|
39 |
by (rtac minor 1);
|
|
40 |
qed "injD";
|
|
41 |
|
|
42 |
(*Useful with the simplifier*)
|
|
43 |
val [major] = goal Fun.thy "inj(f) ==> (f(x) = f(y)) = (x=y)";
|
|
44 |
by (rtac iffI 1);
|
|
45 |
by (etac (major RS injD) 1);
|
|
46 |
by (etac arg_cong 1);
|
|
47 |
qed "inj_eq";
|
|
48 |
|
3842
|
49 |
val [major] = goal Fun.thy "inj(f) ==> (@x. f(x)=f(y)) = y";
|
923
|
50 |
by (rtac (major RS injD) 1);
|
|
51 |
by (rtac selectI 1);
|
|
52 |
by (rtac refl 1);
|
|
53 |
qed "inj_select";
|
|
54 |
|
|
55 |
(*A one-to-one function has an inverse (given using select).*)
|
2912
|
56 |
val [major] = goalw Fun.thy [inv_def] "inj(f) ==> inv f (f x) = x";
|
923
|
57 |
by (EVERY1 [rtac (major RS inj_select)]);
|
2912
|
58 |
qed "inv_f_f";
|
923
|
59 |
|
|
60 |
(* Useful??? *)
|
|
61 |
val [oneone,minor] = goal Fun.thy
|
2912
|
62 |
"[| inj(f); !!y. y: range(f) ==> P(inv f y) |] ==> P(x)";
|
|
63 |
by (res_inst_tac [("t", "x")] (oneone RS (inv_f_f RS subst)) 1);
|
923
|
64 |
by (rtac (rangeI RS minor) 1);
|
|
65 |
qed "inj_transfer";
|
|
66 |
|
|
67 |
|
|
68 |
(*** inj_onto f A: f is one-to-one over A ***)
|
|
69 |
|
|
70 |
val prems = goalw Fun.thy [inj_onto_def]
|
|
71 |
"(!! x y. [| f(x) = f(y); x:A; y:A |] ==> x=y) ==> inj_onto f A";
|
4089
|
72 |
by (blast_tac (claset() addIs prems) 1);
|
923
|
73 |
qed "inj_ontoI";
|
|
74 |
|
|
75 |
val [major] = goal Fun.thy
|
|
76 |
"(!!x. x:A ==> g(f(x)) = x) ==> inj_onto f A";
|
|
77 |
by (rtac inj_ontoI 1);
|
|
78 |
by (etac (apply_inverse RS trans) 1);
|
|
79 |
by (REPEAT (eresolve_tac [asm_rl,major] 1));
|
|
80 |
qed "inj_onto_inverseI";
|
|
81 |
|
|
82 |
val major::prems = goalw Fun.thy [inj_onto_def]
|
|
83 |
"[| inj_onto f A; f(x)=f(y); x:A; y:A |] ==> x=y";
|
|
84 |
by (rtac (major RS bspec RS bspec RS mp) 1);
|
|
85 |
by (REPEAT (resolve_tac prems 1));
|
|
86 |
qed "inj_ontoD";
|
|
87 |
|
|
88 |
goal Fun.thy "!!x y.[| inj_onto f A; x:A; y:A |] ==> (f(x)=f(y)) = (x=y)";
|
4089
|
89 |
by (blast_tac (claset() addSDs [inj_ontoD]) 1);
|
923
|
90 |
qed "inj_onto_iff";
|
|
91 |
|
|
92 |
val major::prems = goal Fun.thy
|
|
93 |
"[| inj_onto f A; ~x=y; x:A; y:A |] ==> ~ f(x)=f(y)";
|
|
94 |
by (rtac contrapos 1);
|
|
95 |
by (etac (major RS inj_ontoD) 2);
|
|
96 |
by (REPEAT (resolve_tac prems 1));
|
|
97 |
qed "inj_onto_contraD";
|
|
98 |
|
3341
|
99 |
goalw Fun.thy [inj_onto_def]
|
|
100 |
"!!A B. [| A<=B; inj_onto f B |] ==> inj_onto f A";
|
|
101 |
by (Blast_tac 1);
|
|
102 |
qed "subset_inj_onto";
|
|
103 |
|
923
|
104 |
|
|
105 |
(*** Lemmas about inj ***)
|
|
106 |
|
2922
|
107 |
goalw Fun.thy [o_def]
|
|
108 |
"!!f g. [| inj(f); inj_onto g (range f) |] ==> inj(g o f)";
|
4089
|
109 |
by (fast_tac (claset() addIs [injI] addEs [injD, inj_ontoD]) 1);
|
923
|
110 |
qed "comp_inj";
|
|
111 |
|
|
112 |
val [prem] = goal Fun.thy "inj(f) ==> inj_onto f A";
|
4089
|
113 |
by (blast_tac (claset() addIs [prem RS injD, inj_ontoI]) 1);
|
923
|
114 |
qed "inj_imp";
|
|
115 |
|
2912
|
116 |
val [prem] = goalw Fun.thy [inv_def] "y : range(f) ==> f(inv f y) = y";
|
923
|
117 |
by (EVERY1 [rtac (prem RS rangeE), rtac selectI, etac sym]);
|
2912
|
118 |
qed "f_inv_f";
|
923
|
119 |
|
|
120 |
val prems = goal Fun.thy
|
2912
|
121 |
"[| inv f x=inv f y; x: range(f); y: range(f) |] ==> x=y";
|
|
122 |
by (rtac (arg_cong RS box_equals) 1);
|
|
123 |
by (REPEAT (resolve_tac (prems @ [f_inv_f]) 1));
|
|
124 |
qed "inv_injective";
|
|
125 |
|
2935
|
126 |
goal Fun.thy "!!f. [| inj(f); A<=range(f) |] ==> inj_onto (inv f) A";
|
4089
|
127 |
by (fast_tac (claset() addIs [inj_ontoI]
|
2912
|
128 |
addEs [inv_injective,injD]) 1);
|
|
129 |
qed "inj_onto_inv";
|
923
|
130 |
|
4059
|
131 |
goalw thy [inj_onto_def]
|
|
132 |
"!!f. [| inj_onto f C; A<=C; B<=C |] ==> f``(A Int B) = f``A Int f``B";
|
|
133 |
by (Blast_tac 1);
|
|
134 |
qed "inj_onto_image_Int";
|
|
135 |
|
|
136 |
goalw thy [inj_onto_def]
|
|
137 |
"!!f. [| inj_onto f C; A<=C; B<=C |] ==> f``(A-B) = f``A - f``B";
|
|
138 |
by (Blast_tac 1);
|
|
139 |
qed "inj_onto_image_set_diff";
|
|
140 |
|
|
141 |
goalw thy [inj_def] "!!f. inj f ==> f``(A Int B) = f``A Int f``B";
|
|
142 |
by (Blast_tac 1);
|
|
143 |
qed "image_Int";
|
|
144 |
|
|
145 |
goalw thy [inj_def] "!!f. inj f ==> f``(A-B) = f``A - f``B";
|
|
146 |
by (Blast_tac 1);
|
|
147 |
qed "image_set_diff";
|
|
148 |
|
923
|
149 |
|
4089
|
150 |
val set_cs = claset() delrules [equalityI];
|