This was a question on my last test. The whole class got it wrong. I understand the falacy of my argument because there might be other functions f defined other than the bijection I stipulated. Can anyone help solve this? Thanks.
Suppose f: A B is a function between two finite sets A and B with the same cardinality. Prove that f is 1-1 iff f is onto.