Set of Integers Bounded Above by Integer has Greatest Element

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

Let $\varnothing \subset S \subseteq \Z$ such that $S$ is bounded above.

Then $S$ has a greatest element.

Also see

 * Integers Bounded Below has Smallest Element
 * Well-Ordering Principle