Weak Inequality of Integers iff Strict Inequality with Integer plus One

Theorem

Let $a, b \in \Z$ be integers.

The following statements are equivalent:

$(1): \quad a \le b$

$(2): \quad a < b + 1$

where:

$\le$ is the ordering on the integers

$<$ is the strict ordering on the integers.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.