Sur- in- bijections and cardinality. I think about surjection, injection and bijections from $A$ to $B$ as $\ge$, $\le$, and $=$ respectively in terms of cardinality. Is this correct? And extrapolating from that, are these theorems correct?
If there exist two surjections $f:A\rightarrow B$ and $g:B\rightarrow A$, then $|A|=|B|$ ($|A|\ge|B|$ and $|B|\ge|A|$).
If there exists a surjection $f:A\rightarrow B$ and an injection $g:A\rightarrow B$, then  $|A|=|B|$ ($|A|\ge|B|$ and $|A|\le|B|$).
Are these theorems correct?
I know the case for two injections is true.
 A: If you assume the axiom of choice, then the existence of a surjection $f:A\to B$
implies an injection $e:B\to A$:  for $b\in B$ choose $e(b)\in f^{-1}(b)$.
Together with the what you know about injections, this gives you everything you want.
A: Nowadays it is commonly accepted to assume the axiom of choice, in which case surjections can always be inverted to injections.
However if one does not assume the axiom of choice then there are surjections which cannot be reversed. In the common models we know where choice fails there are sets which can be mapped onto each other but there is no bijection between them.
The following cases are consistent:


*

*There are $A$ and $B$ such that we can map $A$ onto $B$, but there is no injection between $A$ and $B$ (in either direction).

*There are $A$ and $B$ such that $A$ can be mapped onto $B$ and $A$ can be injected into $B$, but there is no bijection between $A$ and $B$.


Note that if there is an injection from $A$ to $B$ then there is a surjection from $B$ onto $A$, therefore the second case we have two sets and surjections between them, but no bijection.
So while it is intuitively reasonable (and to some degree, correct) to think about surjections as a measure of size, formally it fails to upholds the requirements we have from a notion of size (i.e. being a partial order, since this notion lacks antisymmetry as the second case shows).
