The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc. Submit other issues on GitHub.
Proof by Induction
Let be a Well-ordered set and
s.t. for every , if for all , then .
Then
Proof
If not, then let .
Then for , we have by choice of .
By assumption on , we have .