I am studying basic real analysis using Foundations of Mathematical Analysis by Richard Johnsonbaugh and W. E. Pfaffenberger.
Well-Ordering Theorem:
If $X$ is a nonvoid subset of the positive integers, then $X$ contains a least element; that is, there exists $a \in X$ such that $a \leq x$ for all $x \in X$.
Question:
Use the Well-Ordering Theorem to prove that no $m$ exists such that $n < m < n+1$ for positive integers $m$ and $n$.
Work so far:
I probably want to construct a non-empty set $X$, but I don't know what form $X$ should have. Any hints would be appreciated.
Let $X_n=\{m\in\mathbb{Z},m>0:n<m<n+1\}$ and $Z=\{n\in\mathbb{Z},n>0:X_n\neq\emptyset\}$. You're trying to prove that $Z$ is empty.
Suppose that $Z$ were nonempty. Then, there would be $a\in Z$ such that $a\leq z$ for all $z\in Z$. Consider $X_a$. By definition, $X_a$ would be nonempty so there would exist $z^*$ such that $a<z^*<a+1$. But then $z^*-1<a<z^*$ so that $z^*-1\in Z$ so you would have both $a>z^*-1$ (from $z^*-1<a<z^*$) and $a\leq z^*-1$ (from $z^*-1\in Z$). This is the desired contradiction.