In determining whether a given relation is a well ordering, it is not necessaryto verify
Chapter 3, Problem 17(choose chapter or problem)
In determining whether a given relation is a well ordering, it is not necessaryto verify all the conditions for a linear order as well as the additional conditionfor a well ordering:(a) Prove that a partial order R on a set A is a well ordering everynonempty subset of A has a smallest element.(b) Prove that a relation R on a set A is a well ordering every nonemptysubset B of A contains a unique element that is R-related to every elementof B
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer