Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 R on a definable class X is isomorphic to membership on a unique transitive definable class Y, by a unique definable isomorphism π:XY. For a set domain X, 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.

[F1]

For a well-founded setlike extensional relation R on a definable class X, its collapse map π is injective. (An extensional collapse is injective)

[F2]

For a well-founded setlike relation R on X, the collapse map is the unique definable function satisfying π(x)={π(y):yRx}. Its existence and uniqueness follow from well-founded recursion. (Extensional relations and collapse maps)

Proof

1.1

Use the collapse map and let Y={π(x):xX}. It is injective by the extensional-collapse lemma and surjective onto this range by definition. If zπ(x), its defining equation gives z=π(y) for some yRx; hence zY. Thus Y is transitive.

F1F2
2.1

If yRx then π(y)π(x). Conversely, if π(y)π(x), the collapse equation gives zRx with π(z)=π(y); injectivity gives z=y. This proves preservation and reflection of the relation.

F1F2step 1.1
3.1

For any other isomorphism j onto a transitive class Z, each member of j(x) lies in Z and so is j(y) for a unique yX. Relation reflection then says exactly yRx. Consequently j(x)={j(y):yRx}, the same recursion as π. Uniqueness of the collapse map gives j=π, and thus Z=Y. When X is a set, Replacement forms both its graph and image.

F2step 2.1

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