If b is in A, then b is the smallest element. Otherwise, b+1 is a lower bound on A, and you repeat the argument--if b+1 is in A, then b+1 is the smallest element, otherwise b+2 is a lower bound on A. This won't continue forever, because A is nonempty. Pick any a in A, and this process will terminate in no more than b-a steps.