Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableverified 2026-08-06 (claude-opus-5)
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.

Separation and Replacement build subsets of sets already in hand, which is exactly what blocks Russell's construction

Remark

An unrestricted comprehension principle would assert, for every formula φ(x) of the language (The first-order language of set theory: ∈, =, formulas with parameters, and class abbreviations), that ∃y ∀x (x∈y↔φ(x)). Taking φ(x):=x∉x turns that assertion into precisely the set There is no R with x∈R↔x∉x for every x shows cannot exist, so the principle is refutable in plain first-order logic; no appeal to any axiom below is needed to reject it.

The Axiom Schema of Separation: for each formula φ, ∀pˉ ∀x ∃y ∀z (z∈y↔(z∈x∧φ(z,pˉ))) asserts something weaker in a specific way: it does not produce a set from a formula alone, but only from a formula together with a set x already in hand, and the set it produces is a subset of that x. Running Russell's argument against it therefore yields no contradiction but a theorem. Given any set x, the separated set r:={ z∈x:z∉z } exists; asking whether r∈r shows that r∈x is impossible, since r∈x would give r∈r↔r∉r. So every set x has a subset that is not one of its elements, and no set contains every set, which is There is no set U with y∈U for every set y.

The same restriction is what makes The Axiom Schema of Replacement: for each formula φ, if φ defines a class function on A then its image on A is a set safe. It does not assert that an arbitrary class is a set either: its hypothesis is that a formula behaves like a function on a set A already in hand, and its conclusion is about the image of that particular set. Both schemas therefore build only from material already given, and neither can be turned on the universe at large.

What is given up is small and is worth naming exactly: from these axioms alone nothing whatever can be constructed, which is why The Axiom of Infinity: there is a set containing a set with no elements and closed under y↦y∪{y} is assumed outright rather than derived, and why There is exactly one set with no elements, written ∅ needs the logical fact that the domain of discourse is nonempty before Separation has anything to act on.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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