Does proving only one-one or onto suffice for showing biection in order isomorphism?

34 Views Asked by At

In order to show that $P \cong Q$ we show that $a \leq b \Rightarrow \phi(a) \leq \phi(b)$ and then we show bijection. Note here, $P,Q$ are ordered sets. My professor told me that here showing only onto suffices the condition for bijection. Can someone explain why?