>>630より 再度転記 T Jech 著 · 1997 · The Third Millennium Edition, revised and ... 2002. (Springer monographs in mathematics) Thomas Jechの 証明 P48 Theorem 5.1 (Zermelo’s Well-Ordering Theorem) Every set can be well-orderd. Proof： Let A be a set. To well-order A, it suffices to construct a transfinite one-to-one sequence （aα: α < θ) that enumerates A. That we can do by induction, using a choice fiunction f for the family S of all nonempty subsets of A. We let for everv α aα=f(A-{aξ：ξ<α}) if A-{aξ：ξ<α} is nonempt. Let θ be the least ordinal such that A = {αξ: ξ < θ}. Clearly,（aα：α< θ) enume
