Please solve this question

5. (5.1.52) Using a proof by induction, prove the following statement: Let A and B be sets such that A>B. Then any function f:AB is not injective. [Hint: Note that B1, else f would not be a function. Then, since A>B,A2.]