Show given any $x\in\mathbb{R}$ show there exists a unique $n\in\mathbb{Z}$ such that $n-1\leq x Show given any $x\in\mathbb{R}$ show there exists a unique $n\in\mathbb{Z}$ such that $n-1\leq x <n$. I already know that there exists a $n\in\mathbb{N}$ such that $x<n$ by the archimedean property. But to prove that $n-1\leq x$ part I'm not sure. I think I have to create some set such that $n-1$ is a lower bound. But I'm not sure.
 A: Hint: Let $x\ge 0$. By what you wrote,  the set $A_x$ of positive integers such that $n\gt x$ is non-empty. Thus $A_x$ has a smallest element. Call that $n$, and show that it does the job. 
For negative $x$, use the previous argument to show there is an integer $m$ such that $m-1\le |x|\lt m$. Then $-m\lt x\le -m+1$. If $x\ne -m+1$, we are finished. If $x=-m+1$, make a minor adjustment.  
We leave dealing with uniqueness to you.
Remark: We don't need to give special treatment to negative $x$ if we first prove the following small extension of the Least Number Principle: Any non-empty set of integers which is bounded below has a smallest element.   
A: You use the Archimedean property twice. Given $x$, the first use gives you an $N$ with $x+1\le N$. Now consider $-x$. The second use of the property gives you an $M$ such that $-x\le M$. This means that $-M\le x< N$. Hence, the set $\{m\in\mathbb Z\mid x< m\}$ is nonempty ($N$ is in it) and is bounded below (by $-M$). So it has a first element. Call it $n$, and note $x<n$. Minimality of $n$ means that $n-1$ is not in the set, so $n-1\le x$. We are done.
A: I'll try to give a proof to the fact that $\forall x \in \mathbb{R} \exists! m \in \mathbb{Z} \left( m - 1 \leq x < m \right)$ using a slightly different approach. First there is the following Lemma.
$\textit{Lemma 1}$. Every nonempty set of integers that is bounded below has a smallest element.
$\textit{Proof of Lemma 1}$. Suppose $S$ is an arbitrary nonempty set of integers that is bounded below. Then using the Axiom of Completeness it is easy to show that $S$ has a greatest lower bound. Let $s = \text{inf} \: S$, and $L = \left\{ x\in \mathbb{R} \mid \forall n \in S \left( x \leq n \right) \right\}$ be the set of all lower bounds for $S$. Clearly $s \in L$. Now consider $s + 1 \in \mathbb{R}$. It is not difficult to show that $s + 1 \notin L$. Then we can find some $n \in S$ such that $s + 1 > n$, so $s \geq n$. Now if $s > n$ then since $s \in L$ we must have $n \notin S$, which is a contradiction. Therefore $s = n \in S$, and since $s \in L$ we can conclude that $s$ is the smallest element of $S$, as required. QED
$\textit{Proof of orignal claim}$. Suppose $x \in \mathbb{R}$. Let $S = \left\{ m \in \mathbb{Z} \mid m > x \right\}$. Clearly $S$ is bounded below. Moreover by the Archimedean Property there is an $n \in \mathbb{Z^+} \subseteq \mathbb{Z}$ such that $n > x$. So $S \neq \emptyset$.
$\textit{Existence}$. By $\textit{Lemma 1}$ we can let some $m \in S$ be the smallest element of $S$. Now suppose $m - 1 > x$. Then since $m - 1 \in \mathbb{Z}$ we get that $m - 1 \in S$. But since $m - 1 < m$ we find a contradiction to the fact that $m$ is the smallest element of $S$. Thus it must be the case that $m - 1 \leq x$, and since $x < m$ we can conclude that $m - 1 \leq x < m$, as required.
$\textit{Uniqueness}$. Suppose $n \in \mathbb{Z}$ and that $n - 1 \leq x < n$. Suppose $n \neq m$. If $n < m$ then since $n \in \mathbb{Z}$ and $n > x$ we get that  $n \in S$, and since $n < m$ we find a contradiction to the fact that $m$ is the smallest element of $S$. Now if $n > m$ then $n - 1 \geq m$, so $x \geq m$, which contradicts the fact that $x < m$. Therefore since in either case we found a contradiction we must have that $n = m$, as required. QED
