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.
Mostowski collapse for extensional relations
Statement
Every well-founded setlike extensional relation on a definable class is isomorphic to membership on a unique transitive definable class , by a unique definable isomorphism . For a set domain , the isomorphism and its image are sets. This holds without ambient Foundation.
Facts & Assumptions
Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.
For a well-founded setlike extensional relation on a definable class , its collapse map is injective. (An extensional collapse is injective)
For a well-founded setlike relation on , the collapse map is the unique definable function satisfying . Its existence and uniqueness follow from well-founded recursion. (Extensional relations and collapse maps)
Proof
Use the collapse map and let . It is injective by the extensional-collapse lemma and surjective onto this range by definition. If , its defining equation gives for some ; hence . Thus is transitive.
If then . Conversely, if , the collapse equation gives with ; injectivity gives . This proves preservation and reflection of the relation.
For any other isomorphism onto a transitive class , each member of lies in and so is for a unique . Relation reflection then says exactly . Consequently , the same recursion as . Uniqueness of the collapse map gives , and thus . When is a set, Replacement forms both its graph and image.
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
- Marks, Set Theory, Berkeley edition — Theorem 6.11 p.32. (standard reference, not scraped)