Is my work correct? Prove the following is bijective.
The problem says:
Let A and B be sets. Show that there is a bijective map f: A x B --> B x A.
My professor helped me out and said that the function should be given by f((a,b)) = (b,a) (where a exists in A and b exists in B).
Here is the work I have so far.
Proof. (Injection) Let f((a1,b1)) = f((a2,b2)), where (a1,b1) , (a2,b2) exist in A x B. Then, (b1,a1) = (b2,a2), which implies f((b1,a1)) = f((b2,a2)), which implies (a1,b1) = (a2,b2). So, f is injective.
(Surjection) Fix (b,a) which exists in B x A. Put x = (a,b) and observe that f(x) = f((a,b)) = (b,a). So, f is surjective.
Since f is both injective and surjective, then f is bijective.
I feel like my Injection proof is wrong. Do any of you see anything wrong? Thanks in advance :)