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 Separation: for each formula φ, ∀pˉ ∀x ∃y ∀z (z∈y↔(z∈x∧φ(z,pˉ)))

Definition

Let φ(z,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 the variable y does not occur free. The Separation instance for φ is the sentence

∀pˉ ∀x ∃y ∀z (z∈y↔(z∈x∧φ(z,pˉ))).

The Axiom Schema of Separation is the collection of all these sentences, one for each such φ. In words: for any parameters pˉ and any set x, there is a set y whose elements are exactly the elements z of x for which φ(z,pˉ) holds.

It is a schema and not a single axiom because φ ranges over the formulas of the language, of which there are infinitely many, and the language provides no way to quantify over them.

Remarks

  • The side condition is not decoration. If y were allowed to occur free in φ, the instance φ(z,pˉ):=z∉y would assert that some y satisfies z∈y↔(z∈x∧z∉y) for every z, which is contradictory as soon as x has a member. Requiring y to be fresh is what keeps the schema consistent.

  • One parameter or a list. Some presentations state the schema with a single parameter p rather than a list pˉ; the two forms prove the same theorems, since a finite list can be coded once ordered pairs are available. The list form is used here because the instances below quantify over several sets at once.

  • A separated set is unique. The instance is stated with ↔, so any two sets it produces have the same elements and are equal by The Axiom of Extensionality: ∀x ∀y (∀z (z∈x↔z∈y)→x=y). That is what licenses the notation { z∈x:φ(z,pˉ) } introduced at Subset x⊆y, proper subset x⊊y, and the separation notation { z∈x:φ(z) }.

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