Strict Ordering on Integers is Asymmetric

Theorem
Let $\eqclass {a, b} {}$ denote an integer, as defined by the formal definition of integers.

Then:

That is, strict ordering on the integers is asymmetric.

Proof
By the formal definition of integers, we have that $a, b, c, d, e, f$ are all natural numbers.

To eliminate confusion between integer ordering and the ordering on the natural numbers, let $a \prec b$ denote that the natural number $a$ is less than the natural number $b$.

We have: