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.
Each Feferman–Levy real layer is countable
Statement
For every , the real layer is countable in the Feferman–Levy model .
Facts & Assumptions
Given: One fixed and the corresponding layer in .
Each real layer has a ground-model cardinal bound supplies in a specified surjection .
Every finite ground aleph is countable in the Feferman–Levy model says that is countable in .
A nonempty set is at most countable iff it is a surjective image of says that every nonempty countable set is the range of a surjection from , without Choice.
Proof
The ordinal is nonempty. By F2 and F3, fix in one surjection , and form . Both factors are sets of , and ordinary ordered-pair Separation produces their composition. For each , its -preimage is nonempty, so take its least ordinal member ; then the -preimage of is a nonempty set of naturals and has a least member . Thus , so . This fixes one witness for one already fixed ; it does not choose a family indexed by .
The layer is nonempty because it contains the interpretation of the constantly-zero Boolean name. Sending each to its least -preimage gives an injection into , so is at most countable. The least-preimage clauses are definable and involve one fixed map; no choice function for the family is formed.