Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 a has a member disjoint from a (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.

[F1]

In ZF without Foundation, every Vα is transitive and α≤β implies Vα⊆Vβ. Also Vα∩Ord⁡=α, and both α and Vα belong to Vα+1∖Vα. (Transitivity and growth of hierarchy stages)

[F2]

For every set a, TC⁡(a) is transitive, contains a as a subset, and is contained in every transitive set T with a⊆T. Moreover a⊆b implies TC⁡(a)⊆TC⁡(b), and TC⁡(TC⁡(a))=TC⁡(a). In particular a∈TC⁡({a}). (Minimality and closure laws of TC)

[F3]

Let R be well-founded and setlike on a definable class X. If a definable property P is progressive, meaning that for every x∈X, [∀yRx P(y)]⇒P(x), then P(x) holds for all x∈X. Set parameters in P are allowed. This holds without Foundation. (Induction on well-founded setlike relations)

Proof

1.1F2F3

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 TC⁡({x}) have a minimal member, contradicting progressiveness.

1.2given

Assume (ii). If a nonempty set a had no member disjoint from a, the property P(x) meaning x∉a would be progressive: if all y∈x were outside a and x∈a, the no-minimal-member assumption would supply y∈x∩a, a contradiction. Membership induction gives x∉a for all x, impossible since a is nonempty.

1.3F1

Under (ii), prove (iii) by membership induction. If each y∈x lies in a stage, it has a unique least stage index h(y), found by minimizing below any witness. Replacement collects these indices; let β=sup⁡{h(y):y∈x}. Nesting puts every y∈x in Vβ, so x∈Vβ+1. For x=∅ the supremum is zero and the same conclusion holds.

2.1F1∎

Assume (iii) and let a be nonempty. The least stage index h(x) exists for each x∈a; it is a successor β+1, since zero is empty and a limit is a union. If y∈x, then x∈Vβ+1 implies y∈Vβ, hence h(y)≤β<h(x). Minimize h on the set a using Replacement. A member x of least height has x∩a=∅, 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