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.
and ; and for a nonempty set , and
Statement
For all sets , and ,
Let be a set with . Then and are nonempty sets, and
Facts & Assumptions
Given: sets , , and a set with where the family forms are concerned.
holds if and only if or (, , , , and ).
holds if and only if and (, , , , and ).
is the set whose elements are exactly the elements of the elements of (The union of a set, and the binary union ).
For , is the set whose elements are exactly the sets belonging to every element of (The intersection of a nonempty set, the binary intersection , and disjointness).
For any parameters and any set , there is a set whose elements are exactly the elements of for which holds (The Axiom Schema of Separation: for each formula , ).
holds if and only if (The power set ).
means that every element of is an element of (Subset , proper subset , and the separation notation ).
If every satisfies if and only if , then (The Axiom of Extensionality: ).
Proof
Every is a subset of , so the class is the separated set , hence a set; and it has a member because does.
Every with is a subset of , since an element of lies in ; so is the separated set , hence a set, and it has a member because does.
holds exactly when , and or ; that is exactly when and , or and , which is .
holds exactly when , or and ; that is exactly when or , and or , which is .
holds exactly when and for some , that is, exactly when for some ; the sets with are precisely the elements of , so this holds exactly when lies in some element of that set, which is .
holds exactly when, for every , or . If then either , and the condition holds outright, or lies in every element of , and it holds again. Conversely, if the condition holds and , then for every , so ; hence in both cases.
The two finite laws and the two family laws are established, which is the statement.