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 ledger for this page: which of the ZFC axioms each construction and each result actually consumes
Remark
Each construction here is licensed by named axioms, and this is the account of which ones.
-
The Axiom of Extensionality: is consumed by every construction on the page. An axiom that produces a set specifies its members with a biconditional; Extensionality is what turns "a set with these members" into "the set with these members", and so licenses each definite article and each piece of notation introduced below.
-
The Axiom Schema of Separation: for each formula , is consumed by There is exactly one set with no elements, written , by the intersection of a nonempty set, by the trimming step that yields The power set , by the difference of two sets, and by The Cartesian product . It is also what There is no set with for every set is proved from.
-
The Axiom of Pairing: is consumed by unordered pairs and singletons, hence by ordered pairs and by everything built from them.
-
The Axiom of Union: is consumed by The union of a set, and the binary union , and through the ambient double power set also by The Cartesian product .
-
The Axiom of Power Set: is consumed by The power set and, through the same ambient set, by The Cartesian product . It is assumed here in its implication form, so each of those two constructions consumes Separation as well.
-
The Axiom of Foundation: is consumed by Under Foundation, for every set , there are no sets with , and there are no sets with and, through it, by the injectivity of the successor operation. No other result on this page uses it, and no definition does.
-
The Axiom of Infinity: there is a set containing a set with no elements and closed under is consumed by nothing on this page. It is stated here because it belongs to the system, and it is what the construction of the natural numbers rests on.
-
The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set is consumed by nothing on this page either. Every set formed here is separated inside a set already in hand, which is exactly what Separation licenses.
-
The Axiom of Choice is the one axiom of ZFC that is not stated on this page. This library states it at The Axiom of Choice ↗. No construction and no result on this page uses it.
Two redundancies in the list are worth recording, because they explain why the ledger above is not the shortest possible one. Separation is derivable from Replacement together with a set that has no elements, by a derivation that splits on whether the separating condition holds anywhere in the ambient set; The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set carries it. Pairing is derivable from Replacement applied to a set with at least two elements, such as the double power set of the empty set. Both are nevertheless assumed here, because each is used constantly and deriving it every time would obscure what a construction actually costs.
The empty set runs the other way. It is often taken as an axiom, and here it is derived instead, from Separation together with the logical fact that the domain of discourse is nonempty; There is exactly one set with no elements, written carries the derivation.
Depends on
- The Axiom of Extensionality: $\forall x\,\forall y\,(\forall z\,(z \in x \leftrightarrow z \in y) \to x = y)$
- The Axiom Schema of Separation: for each formula $\varphi$, $\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar p)))$
- The Axiom of Pairing: $\forall x\,\forall y\,\exists z\,\forall t\,(t \in z \leftrightarrow (t = x \vee t = y))$
- The Axiom of Union: $\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow \exists s\,(s \in x \wedge z \in s))$
- The Axiom of Power Set: $\forall x\,\exists y\,\forall z\,(\forall t\,(t \in z \to t \in x) \to z \in y)$
- The Axiom Schema of Replacement: for each formula $\varphi$, if $\varphi$ defines a class function on $A$ then its image on $A$ is a set
- The Axiom of Infinity: there is a set containing a set with no elements and closed under $y \mapsto y \cup \{y\}$
- The Axiom of Foundation: $\forall S\,(\exists t\,(t \in S) \to \exists s\,(s \in S \wedge \neg\exists u\,(u \in s \wedge u \in S)))$
- There is exactly one set with no elements, written $\varnothing$
- The power set $\mathcal{P}(x) = \{\, z : z \subseteq x \,\}$
- The union $\bigcup x$ of a set, and the binary union $a \cup b := \bigcup \{a,b\}$
- The intersection $\bigcap x$ of a nonempty set, the binary intersection $a \cap b := \bigcap\{a,b\}$, and disjointness
- The Cartesian product $A \times B := \{\, z \in \mathcal{P}(\mathcal{P}(A \cup B)) : \exists a \in A\ \exists b \in B\ z = (a,b) \,\}$
- There is no set $U$ with $y \in U$ for every set $y$
- Under Foundation, $x \notin x$ for every set $x$, there are no sets with $x \in y \in x$, and there are no sets with $x \in y \in z \in x$
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: 24 results over 8 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
- Zermelo-Fraenkel set theory (Wikipedia) (standard reference, not scraped)
- Axiom of pairing (Wikipedia) (standard reference, not scraped)
- B. Kaya, MATH 320 Set Theory (METU), §1 (standard reference, not scraped)