- Thread starter
- #1

#### AutGuy98

##### New member

- Sep 11, 2019

- 20

Got what seems like a simple problem at first, but has been giving me difficulty in trying to prove. Please help me with it and show me what to do because I have no clue really. Here is what it asks:

Prove that if A is a countable set and the function f:A\impliesB is onto, then B is either countable or finite.

Thanks in advance to whomever helps me out with this. The assistance is greatly appreciated.