0
|
1 |
(* Title: HOL/fun
|
|
2 |
ID: $Id$
|
|
3 |
Author: Tobias Nipkow, Cambridge University Computer Laboratory
|
|
4 |
Copyright 1993 University of Cambridge
|
|
5 |
|
|
6 |
Lemmas about functions.
|
|
7 |
*)
|
|
8 |
|
|
9 |
goal Set.thy "(f = g) = (!x. f(x)=g(x))";
|
|
10 |
by (rtac iffI 1);
|
|
11 |
by(asm_simp_tac HOL_ss 1);
|
|
12 |
by(rtac ext 1 THEN asm_simp_tac HOL_ss 1);
|
|
13 |
val expand_fun_eq = result();
|
|
14 |
|
|
15 |
val prems = goal Set.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 |
val apply_inverse = result();
|
|
20 |
|
|
21 |
|
|
22 |
(*** Range of a function ***)
|
|
23 |
|
|
24 |
(*Frequently b does not have the syntactic form of f(x).*)
|
|
25 |
val [prem] = goalw Set.thy [range_def] "b=f(x) ==> b : range(f)";
|
|
26 |
by (EVERY1 [rtac CollectI, rtac exI, rtac prem]);
|
|
27 |
val range_eqI = result();
|
|
28 |
|
|
29 |
val rangeI = refl RS range_eqI;
|
|
30 |
|
|
31 |
val [major,minor] = goalw Set.thy [range_def]
|
|
32 |
"[| b : range(%x.f(x)); !!x. b=f(x) ==> P |] ==> P";
|
|
33 |
by (rtac (major RS CollectD RS exE) 1);
|
|
34 |
by (etac minor 1);
|
|
35 |
val rangeE = result();
|
|
36 |
|
|
37 |
(*** Image of a set under a function ***)
|
|
38 |
|
|
39 |
val prems = goalw Set.thy [image_def] "[| b=f(x); x:A |] ==> b : f``A";
|
|
40 |
by (REPEAT (resolve_tac (prems @ [CollectI,bexI,prem]) 1));
|
|
41 |
val image_eqI = result();
|
|
42 |
|
|
43 |
val imageI = refl RS image_eqI;
|
|
44 |
|
33
|
45 |
(*The eta-expansion gives variable-name preservation.*)
|
0
|
46 |
val major::prems = goalw Set.thy [image_def]
|
|
47 |
"[| b : (%x.f(x))``A; !!x.[| b=f(x); x:A |] ==> P |] ==> P";
|
|
48 |
by (rtac (major RS CollectD RS bexE) 1);
|
|
49 |
by (REPEAT (ares_tac prems 1));
|
|
50 |
val imageE = result();
|
|
51 |
|
66
|
52 |
goalw Set.thy [o_def] "(f o g)``r = f``(g``r)";
|
0
|
53 |
by (rtac set_ext 1);
|
|
54 |
by (fast_tac (HOL_cs addIs [imageI] addSEs [imageE]) 1);
|
|
55 |
val image_compose = result();
|
|
56 |
|
|
57 |
goal Set.thy "f``(A Un B) = f``A Un f``B";
|
|
58 |
by (rtac set_ext 1);
|
|
59 |
by (fast_tac (HOL_cs addIs [imageI,UnCI] addSEs [imageE,UnE]) 1);
|
|
60 |
val image_Un = result();
|
|
61 |
|
|
62 |
(*** inj(f): f is a one-to-one function ***)
|
|
63 |
|
|
64 |
val prems = goalw Set.thy [inj_def]
|
|
65 |
"[| !! x y. f(x) = f(y) ==> x=y |] ==> inj(f)";
|
|
66 |
by (fast_tac (HOL_cs addIs prems) 1);
|
|
67 |
val injI = result();
|
|
68 |
|
|
69 |
val [major] = goal Set.thy "(!!x. g(f(x)) = x) ==> inj(f)";
|
|
70 |
by (rtac injI 1);
|
|
71 |
by (etac (arg_cong RS box_equals) 1);
|
|
72 |
by (rtac major 1);
|
|
73 |
by (rtac major 1);
|
|
74 |
val inj_inverseI = result();
|
|
75 |
|
|
76 |
val [major,minor] = goalw Set.thy [inj_def]
|
|
77 |
"[| inj(f); f(x) = f(y) |] ==> x=y";
|
|
78 |
by (rtac (major RS spec RS spec RS mp) 1);
|
|
79 |
by (rtac minor 1);
|
|
80 |
val injD = result();
|
|
81 |
|
|
82 |
(*Useful with the simplifier*)
|
|
83 |
val [major] = goal Set.thy "inj(f) ==> (f(x) = f(y)) = (x=y)";
|
|
84 |
by (rtac iffI 1);
|
|
85 |
by (etac (major RS injD) 1);
|
|
86 |
by (etac arg_cong 1);
|
|
87 |
val inj_eq = result();
|
|
88 |
|
|
89 |
val [major] = goal Set.thy "inj(f) ==> (@x.f(x)=f(y)) = y";
|
|
90 |
by (rtac (major RS injD) 1);
|
|
91 |
by (rtac selectI 1);
|
|
92 |
by (rtac refl 1);
|
|
93 |
val inj_select = result();
|
|
94 |
|
|
95 |
(*A one-to-one function has an inverse (given using select).*)
|
66
|
96 |
val [major] = goalw Set.thy [Inv_def] "inj(f) ==> Inv(f,f(x)) = x";
|
|
97 |
by (EVERY1 [rtac (major RS inj_select)]);
|
0
|
98 |
val Inv_f_f = result();
|
|
99 |
|
|
100 |
(* Useful??? *)
|
|
101 |
val [oneone,minor] = goal Set.thy
|
|
102 |
"[| inj(f); !!y. y: range(f) ==> P(Inv(f,y)) |] ==> P(x)";
|
|
103 |
by (res_inst_tac [("t", "x")] (oneone RS (Inv_f_f RS subst)) 1);
|
|
104 |
by (rtac (rangeI RS minor) 1);
|
|
105 |
val inj_transfer = result();
|
|
106 |
|
|
107 |
|
|
108 |
(*** inj_onto(f,A): f is one-to-one over A ***)
|
|
109 |
|
|
110 |
val prems = goalw Set.thy [inj_onto_def]
|
|
111 |
"(!! x y. [| f(x) = f(y); x:A; y:A |] ==> x=y) ==> inj_onto(f,A)";
|
|
112 |
by (fast_tac (HOL_cs addIs prems addSIs [ballI]) 1);
|
|
113 |
val inj_ontoI = result();
|
|
114 |
|
|
115 |
val [major] = goal Set.thy
|
|
116 |
"(!!x. x:A ==> g(f(x)) = x) ==> inj_onto(f,A)";
|
|
117 |
by (rtac inj_ontoI 1);
|
|
118 |
by (etac (apply_inverse RS trans) 1);
|
|
119 |
by (REPEAT (eresolve_tac [asm_rl,major] 1));
|
|
120 |
val inj_onto_inverseI = result();
|
|
121 |
|
|
122 |
val major::prems = goalw Set.thy [inj_onto_def]
|
|
123 |
"[| inj_onto(f,A); f(x)=f(y); x:A; y:A |] ==> x=y";
|
|
124 |
by (rtac (major RS bspec RS bspec RS mp) 1);
|
|
125 |
by (REPEAT (resolve_tac prems 1));
|
|
126 |
val inj_ontoD = result();
|
|
127 |
|
|
128 |
val major::prems = goal Set.thy
|
|
129 |
"[| inj_onto(f,A); ~x=y; x:A; y:A |] ==> ~ f(x)=f(y)";
|
|
130 |
by (rtac contrapos 1);
|
|
131 |
by (etac (major RS inj_ontoD) 2);
|
|
132 |
by (REPEAT (resolve_tac prems 1));
|
|
133 |
val inj_onto_contraD = result();
|
|
134 |
|
|
135 |
|
|
136 |
(*** Lemmas about inj ***)
|
|
137 |
|
66
|
138 |
val prems = goalw Set.thy [o_def]
|
0
|
139 |
"[| inj(f); inj_onto(g,range(f)) |] ==> inj(g o f)";
|
|
140 |
by (cut_facts_tac prems 1);
|
|
141 |
by (fast_tac (HOL_cs addIs [injI,rangeI]
|
|
142 |
addEs [injD,inj_ontoD]) 1);
|
|
143 |
val comp_inj = result();
|
|
144 |
|
|
145 |
val [prem] = goal Set.thy "inj(f) ==> inj_onto(f,A)";
|
|
146 |
by (fast_tac (HOL_cs addIs [prem RS injD, inj_ontoI]) 1);
|
|
147 |
val inj_imp = result();
|
|
148 |
|
66
|
149 |
val [prem] = goalw Set.thy [Inv_def] "y : range(f) ==> f(Inv(f,y)) = y";
|
|
150 |
by (EVERY1 [rtac (prem RS rangeE), rtac selectI, etac sym]);
|
0
|
151 |
val f_Inv_f = result();
|
|
152 |
|
|
153 |
val prems = goal Set.thy
|
|
154 |
"[| Inv(f,x)=Inv(f,y); x: range(f); y: range(f) |] ==> x=y";
|
|
155 |
by (rtac (arg_cong RS box_equals) 1);
|
|
156 |
by (REPEAT (resolve_tac (prems @ [f_Inv_f]) 1));
|
|
157 |
val Inv_injective = result();
|
|
158 |
|
|
159 |
val prems = goal Set.thy
|
|
160 |
"[| inj(f); A<=range(f) |] ==> inj_onto(Inv(f), A)";
|
|
161 |
by (cut_facts_tac prems 1);
|
|
162 |
by (fast_tac (HOL_cs addIs [inj_ontoI]
|
|
163 |
addEs [Inv_injective,injD,subsetD]) 1);
|
|
164 |
val inj_onto_Inv = result();
|
|
165 |
|
|
166 |
|
|
167 |
(*** Set reasoning tools ***)
|
|
168 |
|
|
169 |
val set_cs = HOL_cs
|
|
170 |
addSIs [ballI, subsetI, InterI, INT_I, INT1_I, CollectI,
|
|
171 |
ComplI, IntI, DiffI, UnCI, insertCI]
|
|
172 |
addIs [bexI, UnionI, UN_I, UN1_I, imageI, rangeI]
|
|
173 |
addSEs [bexE, UnionE, UN_E, UN1_E, DiffE,
|
|
174 |
CollectE, ComplE, IntE, UnE, insertE, imageE, rangeE, emptyE]
|
|
175 |
addEs [ballE, InterD, InterE, INT_D, INT_E, make_elim INT1_D,
|
|
176 |
subsetD, subsetCE];
|
|
177 |
|
|
178 |
fun cfast_tac prems = cut_facts_tac prems THEN' fast_tac set_cs;
|
|
179 |
|
|
180 |
|
|
181 |
fun prover s = prove_goal Set.thy s (fn _=>[fast_tac set_cs 1]);
|
|
182 |
|
|
183 |
val mem_simps = map prover
|
|
184 |
[ "(a : A Un B) = (a:A | a:B)",
|
|
185 |
"(a : A Int B) = (a:A & a:B)",
|
|
186 |
"(a : Compl(B)) = (~a:B)",
|
|
187 |
"(a : A-B) = (a:A & ~a:B)",
|
|
188 |
"(a : {b}) = (a=b)",
|
|
189 |
"(a : {x.P(x)}) = P(a)" ];
|
|
190 |
|
|
191 |
val set_ss = HOL_ss addsimps mem_simps;
|