Theorem 1 For any , we have .
Solution
Let the subset of elements in for which holds be denoted as . By axiom (ii), we know , so , and is non-empty. If , i.e., , we will prove that it must be the case that . If not, then we would have . From this and axiom (iii), it follows that , which is a contradiction. Therefore, by the induction axiom (iv), we conclude . Proof completed.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.