---
tag: 1CWS7995GH
kind: statement
role: proposition
name: Axiom schema versus class existence theorem
sources:
  - wikipedia: en:528491@r1330985339
    locator: Von Neumann–Bernays–Gödel set theory, section Classes in set theory > Axiom schema versus class existence theorem
    note: adopted
    mention: wikipedia://en/528491#FPE8
    sections: [Statement]
inventory: [83D3SQ1RVN]
---

## Statement

Once classes are added to the language of ZFC, it is easy to transform ZFC into a set theory with classes. First, the axiom schema of class comprehension is added. This axiom schema states: For every formula $\phi(x_1, \ldots, x_n)$ that quantifies only over sets, there exists a class $A$ consisting of the $n$-tuples satisfying the formula—that is, $\forall x_1 \cdots \,\forall x_n [(x_1, \ldots , x_n) \in A \iff \phi(x_1, \ldots, x_n)].$ Then the axiom schema of replacement is replaced by a single axiom that uses a class. Finally, ZFC's [[axiom of extensionality|0TB16T2C97]] is modified to handle classes: If two classes have the same elements, then they are identical. The other axioms of ZFC are not modified.

This theory is not finitely axiomatized. ZFC's replacement schema has been replaced by a single axiom, but the axiom schema of class comprehension has been introduced.

To produce a theory with finitely many axioms, the axiom schema of class comprehension is first replaced with finitely many class existence axioms. Then these axioms are used to prove the class existence theorem, which implies every instance of the axiom schema. The proof of this theorem requires only seven class existence axioms, which are used to convert the construction of a formula into the construction of a class satisfying the formula.