Using the Well-Ordering Axiom to Prove the Well-Ordering Axiom, Superquiz 3 Problem 13

We use one statement of the Well-Ordering Axiom (every non-empty subset of the non-negative integers has a least element) to prove another version of the Well-Ordering Axiom (every non-empty subset of the set of integers less than or equal to -3 has a maximal element).