The books states I have to make use of the Cantor-Berstein Theorem which states if $|A|\le|B|$ and $|B|\le|A|$ then $|A|=|B|$.
Attempt: Suppose $|A|\le|B|$, then $|A|\lt |B|$ or $|A|=|B|$. If this is true, then $|A| \not\lt|B|$ and $A\neq B$ is false. Hence $(|A|<|B|\lor A=B) \lor (|A|\not\lt|B|\land A\neq B)$ is true. Hence $(|A|<|B|\lor |A|\not\lt|B|\lor|A|\neq|B|)\land(|A|<|B|\lor|A|=|B|\lor|A|\neq|B|)$. Hence $(|A|\neq |B|)\land(|A|<|B|)$. Hence $|A|<|B|$. Hence $\neg(|B|<|A|)$. Hence $|B|\not\lt|A|$.
However, I did not use Cantor-Bernstein Theorem? Is my proof correct? What should I have done instead?
If $|B|<|A|$, then $|B|\le|A|$ and $|B|\neq|A|$ (according to textbook).
Assume $|A|\le|B|$, then by Cantor Bernstein Theorem if $|B|\le |A|$ and $|A|\le|B|$ then $|B|=|A|$; however, $|B|\neq|A|$. This is a contradition. Hence $|A|\not\le|B|$. Hence if $|B|\lt|A|$ then $|A|\not\le|B|$. Therefore by contraposition, if $|A|\le|B|$ then $|B|\not\lt|A|$.