Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: 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.

The Axiom Schema of Replacement: for each formula φ, if φ defines a class function on A then its image on A is a set

Definition

Let φ(z,w,pˉ) be a formula of the language of set theory (The first-order language of set theory: ∈, =, formulas with parameters, and class abbreviations) in which A and B do not occur free. The Replacement instance for φ is the sentence

∀pˉ ∀A (∀z (z∈A→∃!w φ(z,w,pˉ))→∃B ∀w (w∈B↔∃z (z∈A∧φ(z,w,pˉ)))).

The Axiom Schema of Replacement is the collection of all these sentences, one for each such φ. In words: if for every z∈A there is exactly one w with φ(z,w,pˉ), then there is a set B whose elements are exactly those w.

Remarks

  • The class-function reading. A formula φ(z,w,pˉ) satisfying ∀z∈A ∃!w φ(z,w,pˉ) assigns to each z∈A a single w, so it behaves like a function on A without being a set of ordered pairs; it is called a class function on A. The instance says that the image of a set under a class function is a set. The hypothesis is required only on A: what φ does outside A is irrelevant.

  • Replacement yields Separation, given a set with no elements. Fix a set x and a formula ψ(z,pˉ). If some c∈x satisfies ψ(c,pˉ), then φ(z,w,pˉ,c):=(ψ(z,pˉ)∧w=z)∨(¬ψ(z,pˉ)∧w=c) assigns exactly one w to each z∈x, so an instance of this schema applied to x returns the set of those w; that set is exactly the one The Axiom Schema of Separation: for each formula φ, ∀pˉ ∀x ∃y ∀z (z∈y↔(z∈x∧φ(z,pˉ))) asserts, since the value c contributed by the second disjunct itself satisfies ψ. If instead no c∈x satisfies ψ(c,pˉ), the set to be produced has no elements, and a set with no elements is asserted outright by The Axiom of Infinity: there is a set containing a set with no elements and closed under y↦y∪{y}. The case split is not avoidable: the hypothesis of the schema demands a value at every z∈x, so the collection being separated cannot itself be taken as the domain. Separation is nevertheless stated separately, because every construction on this page uses Separation and no construction on this page needs the full strength of Replacement.

  • Where Replacement is genuinely needed. Nothing on this page consumes it; The axiom ledger for this page: which of the ZFC axioms each construction and each result actually consumes records that. It becomes indispensable for transfinite recursion and for the ordinal and cardinal hierarchies, where the sets constructed are not subsets of any set already in hand.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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