Prove that if f is injective, then $f(A \cap B) = f(A)\cap f(B)$
My answer:
i) $f(A \cap B) \subset f(A) \cap f( B )$
Take an $x \in A \cap B$.
$x \in A \cap B \implies x \in A \land x \in B$
$x \in A \implies f(x) \in f(A) $
$x \in B \implies f(x) \in f(B) $
So, $x \in A \cap B \implies f(x) \in f(A) \land f(x) \in f(B) $
But, $x \in A \cap B \implies f(x) \in f(A \cap B)$
So, $f(x) \in f(A \cap B) \implies f(x) \in f(A) \land f(x) \in f(B)$
Therefore, $f(A \cap B ) \subset f(A) \cap f(B)$
ii) $f(A) \cap f( B ) \subset f(A \cap B) $
f is injective, so $f(x) = f(y) \implies x=y$
Take an $x \in A, y \in B : f(x) = f(y)$
$x \in A \implies f(x) \in f(A) $
$y \in B \implies f(y) \in f(B) $
But $x = y \implies x \in B \implies f(x) \in f(B) $
Since $f(x) \in f(A) \land f(x) \in f(B) \implies f(x) \in f(A \cap B)$
So $f(A) \cap f( B ) \subset f(A \cap B) $
Is that ok?