Hey all, I would appreciate some help with the following proof:

Let A be a nonempty subset of Z and b is an element of the Integers, such that for each a which is an element of A, b <= a. Then A has a smallest element.

I think the Well-Ordering Principle is supposed to be used here..thanks for the help!