Let S be the set of all integers, x, with x< a. That set clearly is non-empty and has a as upper bound. By the "well ordered" property of the integers, any non-empty set of integers, having an upper bound, has a largest member. Let n be the largest member of this set. What can you say about n+1?