For every function f, subset A of the domain and subset B of the codomain prove that If f is injective we have A = f −1(fA) and if f is surjective we have f(f −1B) = B.
This is unreadable.
It should read for the first one
Proof:for every
:
(this is always true). So,
Lemma:
Proof: Suppose that and let . Since there exists some such that . But, since we see that and so which condtradicts 's injectivity. The conclusion follows
Now, then
so
from where it follows that
Let then and so from where it follows that