Proof
Given some basic theorems of set theory, the proof is simple. Let . First, we verify that α is a set.
- X × X is a set, as can be seen in axiom of power set.
- The power set of X × X is a set, by the axiom of power set.
- The class W of all reflexive well-orderings of subsets of X is a definable subclass of the preceding set, so it is a set by the axiom schema of separation.
- The class of all order types of well-orderings in W is a set by the axiom schema of replacement, as
-
- (Domain(w), w) (β, ≤)
- can be described by a simple formula.
-
But this last set is exactly α.
Now because a transitive set of ordinals is again an ordinal, α is an ordinal. Furthermore, if there were an injection from α into X, then we would get the contradiction that α ∈ α. It is claimed that α is the least such ordinal with no injection into X. Given β < α, β ∈ α so there is an injection from β into X.
Read more about this topic: Hartogs Number
Famous quotes containing the word proof:
“The moment a man begins to talk about technique that’s proof that he is fresh out of ideas.”
—Raymond Chandler (1888–1959)
“If any proof were needed of the progress of the cause for which I have worked, it is here tonight. The presence on the stage of these college women, and in the audience of all those college girls who will some day be the nation’s greatest strength, will tell their own story to the world.”
—Susan B. Anthony (1820–1906)
“Right and proof are two crutches for everything bent and crooked that limps along.”
—Franz Grillparzer (1791–1872)