Natural Number Addition is Cancellable for Ordering

Theorem

Let $\N$ be the natural numbers.

Let $<$ be the strict ordering on $\N$.

Let $+$ be addition on $\N$.


Then:

$\forall a, b, c \in \N_{>0}: a + c < b + c \implies a < b$
$\forall a, b, c \in \N_{>0}: a + b < a + c \implies b < c$


That is, $+$ is cancellable on $\N$ for $<$.


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.


This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.