3 Well-Ordering Principle In this question we walk you through one possible method to prove the well-ordering principle using induction. Recall that the well-ordering principle can be stated as follows: For every non-empty subset of the set of natural numbers N, there is a smallest element x ES; i.e. Ex: Vy ES:x