Description: The class of well-founded sets models the Axiom of Extensionality ax-ext . Part of Corollary II.2.5 of Kunen2 p. 112.
This is the first of a series of theorems showing that all the axioms of ZFC hold in the class of well-founded sets, which we here denote by W . More precisely, for each axiom of ZFC, we obtain a provable statement if we restrict all quantifiers to W (including implicit universal quantifiers on free variables).
None of these proofs use the Axiom of Regularity. In particular, the Axiom of Regularity itself is proved to hold in W without using Regularity. Further, the Axiom of Choice is used only in the proof that Choice holds in W . This has the consequence that any theorem of ZF (possibly proved using Regularity) can be proved, without using Regularity, to hold in W . This gives us a relative consistency result: If ZF without Regularity is consistent, so is ZF itself. Similarly, if ZFC without Regularity is consistent, so is ZFC itself. These consistency results are metatheorems and are part of Theorem II.2.13 of Kunen2 p. 114.
(Contributed by Eric Schmidt, 11-Sep-2025) (Revised by Eric Schmidt, 29-Sep-2025)
| Ref | Expression | ||
|---|---|---|---|
| Hypothesis | wfax.1 | |- W = U. ( R1 " On ) |
|
| Assertion | wfaxext | |- A. x e. W A. y e. W ( A. z e. W ( z e. x <-> z e. y ) -> x = y ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wfax.1 | |- W = U. ( R1 " On ) |
|
| 2 | trwf | |- Tr U. ( R1 " On ) |
|
| 3 | treq | |- ( W = U. ( R1 " On ) -> ( Tr W <-> Tr U. ( R1 " On ) ) ) |
|
| 4 | 1 3 | ax-mp | |- ( Tr W <-> Tr U. ( R1 " On ) ) |
| 5 | 2 4 | mpbir | |- Tr W |
| 6 | traxext | |- ( Tr W -> A. x e. W A. y e. W ( A. z e. W ( z e. x <-> z e. y ) -> x = y ) ) |
|
| 7 | 5 6 | ax-mp | |- A. x e. W A. y e. W ( A. z e. W ( z e. x <-> z e. y ) -> x = y ) |