Question

Assume that whenever C is a subset of A for which <' is a linear ordering on C, then C has an upper bound in A, and assume that < is a partial ordering on A. Using these assumptions, prove the well ordering theorem that says: for any set A, there is a well ordering on A.