I musti proof the following:
" let $f: A \to B$, if $f$ is injection then $\forall a\in B \exists ! b\in A (f(b) = a)$"
proof: by contraddiction, therefore the negation of $\forall a\in B \exists ! b\in A (f(b) = a) $ is $\forall a \in B \exists c \in A (f(c) = a$ and $ c \neq b)$, but by hypothesis $f$ is bijection, injection and surjection, so $c \neq b$ then $f(c) \neq f(b)$, but $f(b) = a $ and $f(c) = a $ then $a \neq a$.. a absurd!!
Is correct?
Thanks in advance!