How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Equivalent forms of Foundation
Statement
Over ZF without Foundation the following are equivalent: (i) every nonempty set has a member disjoint from (Foundation); (ii) the membership induction schema, that every definable progressive property holds of every set; (iii) every set belongs to some cumulative-hierarchy stage. All schemas allow set parameters.
Facts & Assumptions
Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.
In ZF without Foundation, every is transitive and implies . Also , and both and belong to . (Transitivity and growth of hierarchy stages)
For every set , is transitive, contains as a subset, and is contained in every transitive set with . Moreover implies , and . In particular . (Minimality and closure laws of TC)
Let be well-founded and setlike on a definable class . If a definable property is progressive, meaning that for every , , then holds for all . Set parameters in are allowed. This holds without Foundation. (Induction on well-founded setlike relations)
Proof
Assume Foundation. Membership on the universe is setlike and has the minimal-element property, so well-founded induction proves (ii). Equivalently the counterexamples inside the transitive set have a minimal member, contradicting progressiveness.
Assume (ii). If a nonempty set had no member disjoint from , the property meaning would be progressive: if all were outside and , the no-minimal-member assumption would supply , a contradiction. Membership induction gives for all , impossible since is nonempty.
Under (ii), prove (iii) by membership induction. If each lies in a stage, it has a unique least stage index , found by minimizing below any witness. Replacement collects these indices; let . Nesting puts every in , so . For the supremum is zero and the same conclusion holds.
Assume (iii) and let be nonempty. The least stage index exists for each ; it is a successor , since zero is empty and a limit is a union. If , then implies , hence . Minimize on the set using Replacement. A member of least height has , proving Foundation. These heights were defined from stages alone, without membership rank.
Depends on
Used by
Dependency tree · two levels
7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Marks, Set Theory, Berkeley edition — 7.7 pp.34–35; Weiss Theorem 38 p.98. (standard reference, not scraped)