Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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)\varphi(x) of the language (The first-order language of set theory: \in, ==, formulas with parameters, and class abbreviations), that yx(xyφ(x))\exists y\,\forall x\,(x \in y \leftrightarrow \varphi(x)). Taking φ(x):=xx\varphi(x) := x \notin x turns that assertion into precisely the set There is no RR with xRxxx \in R \leftrightarrow x \notin x for every xx 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 φ\varphi, pˉxyz(zy(zxφ(z,pˉ)))\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar 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 xx already in hand, and the set it produces is a subset of that xx. Running Russell's argument against it therefore yields no contradiction but a theorem. Given any set xx, the separated set r:={zx:zz}r := \{\, z \in x : z \notin z \,\} exists; asking whether rrr \in r shows that rxr \in x is impossible, since rxr \in x would give rrrrr \in r \leftrightarrow r \notin r. So every set xx has a subset that is not one of its elements, and no set contains every set, which is There is no set UU with yUy \in U for every set yy.

The same restriction is what makes The Axiom Schema of Replacement: for each formula φ\varphi, if φ\varphi defines a class function on AA then its image on AA 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 AA 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 yy{y}y \mapsto y \cup \{y\} is assumed outright rather than derived, and why There is exactly one set with no elements, written \varnothing 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 7 results over 4 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources