Set of all Sets
Jump to navigation
Jump to search
The validity of the material on this page is questionable.
This is circular: We need to demonstrate the contradiction and then demonstrate why ZF (specifically the AoF) prevents it happening.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.
Theorem
Forming the set $\mathcal S$ of all sets leads to a contradiction.
Proof
Let $\mathcal S$ be the set of all sets.
Then $\mathcal S$ must be an element of itself, in symbols, $\mathcal S \owns \mathcal S$.
Thus we have an infinite descending sequence of membership:
- $\mathcal S \owns \mathcal S \owns \mathcal S \owns \cdots$
But by the axiom of foundation, no such sequence exists, a contradiction.
$\blacksquare$
This is circular: We need to demonstrate the contradiction and then demonstrate why ZF (specifically the AoF) prevents it happening.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.
To discuss this proof in more detail, feel free to use the talk page.
If you are able to fix this page, then when you have done so you can remove this instance of {{Questionable}} from the code.
If you would welcome a second opinion as to whether your correction is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
