Let $\Bbb R$ be axiomatically defined as a complete ordered field. Consider proved the basic properties of sum, product and order like $1>0$, $-(-a)=a$, etc.
Now, an inductive subset of $\Bbb R$ is a set $I$ such that $1\in I$ and $\forall n(n\in I\to n+1\in I)$.
$\Bbb N$ is defined as the intersection of all inductive subsets. I have proved so far:
- $\Bbb N\subset[1,\infty)$. (Easy)
- For every $x,y\in\Bbb N$ we have that $x+y,xy\in\Bbb N$. (I have done this by defining the sets $A=\{z\in\Bbb R:x+z\in\Bbb N\}$ and $B=\{z\in\Bbb R:xz\in\Bbb N\}$. I have proved that $A$ and $B$ are inductive.)
Now I want to prove that if $x,y\in\Bbb N$ and $x<y$ then $y-x\in\Bbb N$. I have tried doing this in a similar way as with the sum and the product, but no result so far. Any ideas?
Let $$ A=\{\,x\in \Bbb R\mid \forall y\in \Bbb N\colon y>x\to y-x\in\Bbb N\,\}$$ and show that $A$ is inductive.