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.
Relativization agrees with induced set satisfaction
Statement
For every nonempty set , let be its membership structure. For every fixed pure membership formula and assignment , its set satisfaction agrees with the ambient evaluation of at those free-variable values and parameter . No transitivity of is required. For a definable proper class the corresponding relativized expression is only a formula-by-formula schema.
Facts & Assumptions
Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.
Fix a pure membership formula defining a class . This is eliminable notation for a predicate, not a class object. For a fixed pure membership formula , first rename its binders away from the parameter variables . Define by keeping atoms, commuting with Boolean constructors, and setting Copies of are inserted by capture-avoiding substitution and fresh internal bound variables. In the set case use the predicate , with a fresh parameter variable for . This operation is meaningful even for an empty class. It does not make the empty class an admitted structure: carriers of structures remain nonempty. For proper classes, evaluation of means a separate ambient formula for each fixed , not a uniform universe satisfaction relation. Conventions and prerequisites: prop-capture-avoiding-substitution. (Relativization to sets and definable classes)
For every set signature and -structure there is a unique set . Writing for membership, its clauses are The set is uniformly first-order definable from and the structure data. (Existence and uniqueness of set satisfaction)
Proof
All terms are variables. Equality and membership between two values in are exactly the ambient equality and membership, because the structure restricts the ambient relation. Atoms are unchanged by relativization, giving the atomic equivalence.
Negation and conjunction preserve the inductive equivalences. For , the ambient guard ranges over exactly the same witnesses as the satisfaction clause, and the induction hypothesis applies at . This proves both directions for quantifiers and hence all formulas. The parameter for cannot be captured because the construction uses fresh binders.
The argument used only restriction of membership and equality, never transitivity. Replacing the set guard by a fixed defining formula for a class still makes a separate ambient formula at each syntactic step; it does not assemble a truth relation with proper-class assignment domain.
Depends on
Used by
Dependency tree · two levels
4 results within two dependency steps 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
- Weiss, An Introduction to Set Theory (2014) — chapter 1 pp.20–21; chapter 11 opening p.103. (standard reference, not scraped)