Divisor Relation is Antisymmetric

Theorem
Divides is a antisymmetric relation on $\Z_{>0}$, the set of positive integers.

That is:
 * $\forall a, \ \in \Z_{>0}: a \mathop \backslash b \land b \mathop \backslash a \implies a = b$

Proof
Let $a, \ \in \Z_{> 0}$ such that $a \mathop \backslash b$ and $b \mathop \backslash a$.

Then:

If we restrict ourselves to the domain of positive integers, we can see:


 * $\forall a, b \in \Z_{>0}: a \mathop \backslash b \land b \mathop \backslash a \implies a = b$