Set of Integers Bounded Above by Integer has Greatest Element

Theorem
Let $\Z$ be the set of integers.

Let $\leq$ be the ordering on the integers.

Let $\varnothing \subset S \subseteq \Z$ such that $S$ is bounded above in $(\Z, \leq)$.

Then $S$ has a greatest element.

Also see

 * Set of Integers Bounded Below by Integer has Smallest Element
 * Well-Ordering Principle