I'm having some trouble formulating a proof for this following problem:
A is a finite set and f a function with f : X → X. Suppose that f is onto.
Now Prove or Disprove: f is one to one.
This makes sense to me logically, and I believe it to be true. I've been trying to directly prove it, but maybe proof by contradiction is better?