With $f:X \rightarrow Y; A, B \subseteq X; C, D \subseteq Y$, I'm given these identities:
1. $f(A\cap B) \subseteq f(A) \cap f(B)$
2. $f(A\setminus B) \subseteq f(A) \setminus f(B)$
3. $f^{-1}(C\cap D) \subseteq f^{-1}(C) \cap f^{-1}(D)$
4. $A \subseteq f^{-1}(f(A))$
5.$f^{-1}(f^{-1}(C)) = C \cap f(X) \subseteq C$
Here's what I need to do:
a)Find examples of functions and non-empty sets A, B for which 1. and/or 2. aren't equal (i.e. they are $\subset$, but not $=$)
I believe this is the case for any non-injective function for which $a \neq b$ but $f(a) = f(b)$ , like $f(x) = |x|$, with $a = 1$ and $b=-1$. I'd like to hear some more examples of functions like this.
b)Here I need to find the same thing like a) but for identities 4 and 5, however I'm not sure what even to look for.
c) Prove 1 or 2 and 3 or 4.
Here's my not so successful attempt at proving 1:
$f(A \cap B) = \{y \in Y : y = f(x) \wedge x \in A \cap B\} = \{y \in Y : y = f(x) \wedge (x \in A \wedge x \in B)\} = \{y \in Y : (y = f(x) \wedge x \in A) \wedge (y = f(x) \wedge x \in B)\} = \{y \in Y : y = f(x) \wedge x \in A\} \cap \{y \in Y : y = f(x) \wedge x \in B\} = f(A) \cap f(B)$
And I made an analogous "proof" for 2, however, obviously it's not right as I get that $f(A \cap B) = f(A) \cap f(B)$ instead of $\subseteq$. And for the second part of c) (i.e. 3 and 4), I'm not even sure how to start.
Any help at solving a) b) and c) is highly appreciated.