proof: set countable iff there is a bijection In class we had the following definiton of a countable set:
A set $M$ is countable if there is a bijection between $\mathbb N$ and $M$.
In our exam today, we had the following thesis given:If $A$ is a countable set, then there is a bijection $\mathbb N\rightarrow A$. 
So I am really not sure if the thesis and therefore the equivalence in the definition is right. So is it correct? And how do you proove it? Thanks a lot!

Suppose $B$ and $C$ are arbitrary sets, and suppose the following statement holds: "There is a bijection between $B$ and $C$." Observe that it isn't specified whether there is a bijection $B\to C$ or whether there is a bijection $C\to B$. (This may be the source of your confusion.) As it turns out, there is no need to specify. If there is a bijection $B\to C$, then the inverse of that bijection is a bijection $C\to B$; likewise, the existence of a bijection $C\to B$ guarantees the existence of a bijection $B\to C$. All of the following statements, then, are equivalent:

"There is a bijection between $B$ and $C$." (No direction specified.)
"There is a bijection $B\to C$." (One direction specified.)
"There is a bijection $C\to B$." (Other direction specified.)
"There is a bijection $B\to C$ and a bijection $C\to B$." (Both directions specified.)

Consequently, saying that there is a bijection between $\Bbb N$ and $A$ (i.e.: $A$ is countable) is equivalent to saying that there is a bijection $A\to\Bbb N$, or saying that there is a bijection $\Bbb N\to A$, or saying there is a bijection $A\to\Bbb N$ and a bijection $\Bbb N\to A$.
