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.
Every natural number and are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with in the finite sense equal to in the cardinal sense
Statement
Work in ZF; no choice principle is used. Let be the von Neumann naturals (The natural numbers (von Neumann)), and let , and be the natural-number operations (Exponentiation of natural numbers, , and its agreement with the integer power in for the power). Then:
(a) Every natural number is a cardinal (Cardinal (initial ordinal) and cardinality), and is a cardinal.
(b) Every infinite cardinal is a limit ordinal (Successor and limit ordinals).
(c) One notation, one meaning. If is finite (Finite, countably infinite, countable, uncountable) then is well-orderable and the natural number of The cardinality of a finite set is the cardinal of A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used.
(d) One arithmetic. For , read as cardinals,
the natural-number power being that of Exponentiation of natural numbers, , and its agreement with the integer power in and the cardinal exponential being defined in ZF here because the function set it counts is finite. Moreover and are also the ordinal sum and product of and (On the ordinal and are the Peano operations: is closed under ordinal , and exponentiation, and for naturals the ordinal and are the natural-number sum and product). No agreement is claimed between the cardinal power and the ordinal power; On the ordinal and are the Peano operations: is closed under ordinal , and exponentiation, and for naturals the ordinal and are the natural-number sum and product itself claims none for exponentiation, and none is needed below.
Facts & Assumptions
Given: The von Neumann naturals , the finite counting operations of The cardinality of a finite set, and the cardinal operations of Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations, in ZF.
If with then (claim 3 of The pigeonhole principle on ); and for every (claim 4).
is a transitive set and if and only if , so (On the order is membership: ).
Every natural number is an ordinal, and is an ordinal ( is the least limit ordinal claim (ii), Ordinal (von Neumann)).
Every element of an ordinal is an ordinal, , iff or , and ordinals satisfy trichotomy (Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals).
For a well-orderable , is the least ordinal equinumerous with , and equinumerous sets receive the same one (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used).
For finite there is exactly one with , written ; ; and when (The cardinality of a finite set, Finite, countably infinite, countable, uncountable).
For finite disjoint : is finite with (The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition, claim 1). For finite : is finite with (The product rule: , and , claim 1). For finite : the set of functions is finite with cardinality (The set of functions between finite sets is finite, with , Exponentiation of natural numbers, , and its agreement with the integer power in ).
is inductive, so it is closed under ; is injective and never ; and every nonzero natural number is a successor (The natural numbers (von Neumann), The von Neumann naturals form a Peano system, Every nonzero natural number is a successor).
, , (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations); a bijection witnesses and compositions of bijections are bijections (Equinumerous sets, and , Injection, surjection, bijection).
On the ordinal sum and product are the Peano ones (On the ordinal and are the Peano operations: is closed under ordinal , and exponentiation, and for naturals the ordinal and are the natural-number sum and product, claim (b)).
Proof
Let and suppose with ; then by [L2], so by [L1], giving , which [L4] forbids; so is a cardinal.
Suppose with ; then and , which [L1] forbids; so is a cardinal, and claim (a) holds.
Let be an infinite cardinal, so ; then , and if for an ordinal then is impossible, since by [L8] would give against [L4], so by [L4]; the map sending to , each to , and each with to itself is then a bijection , its three pieces having the pairwise disjoint images , and by [L8]; so with , contradicting that is a cardinal, and is therefore a limit ordinal, which is claim (b).
For the sets and are finite and disjoint with and by [L6], so [L7] gives that , and are all finite, with finite cardinalities , and respectively.
Claim (c): let be finite and in the sense of [L6], so and is well-orderable; if with then by [L2] and by [L9], so by [L1], contradicting [L4]; hence is the least ordinal equinumerous with and equals the cardinal of [L5].
Claim (d): each of , and is finite by step 1.4, hence well-orderable, so its cardinal cardinality is defined in ZF and equals its finite cardinality by step 2.1; reading this through [L9] gives , and (cardinal) (Exponentiation of natural numbers, , and its agreement with the integer power in ), and [L10] identifies the first two with the ordinal sum and product.
Claims (a), (b), (c) and (d) all hold, in ZF.
Remarks
Why this theorem is not optional. Two published items already write : The cardinality of a finite set, where the value is a natural number and the definition applies to finite sets only, and Cardinal (initial ordinal) and cardinality, where the value is an initial ordinal. On a finite set both apply. Without claim (c) the same symbol would carry two meanings and every finite computation on this page would be ambiguous; with it there is one meaning, and a natural number may be read as a cardinal without comment.
The same holds for on , twice over. Claim (d) closes the second half of a dictionary whose first half is On the ordinal and are the Peano operations: is closed under ordinal , and exponentiation, and for naturals the ordinal and are the natural-number sum and product: the Peano sum, the ordinal sum and the cardinal sum of two natural numbers are one natural number. The three operations diverge immediately above , and that divergence is the reason Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations writes and rather than and .
What claim (b) is for. It is used wherever an argument needs to take suprema below an infinite cardinal, or to know that stays below when . The proof is the shift bijection that Cardinal (initial ordinal) and cardinality already describes for , carried out at an arbitrary infinite cardinal: prepending or removing one point does not change the size of an infinite well-ordered set, so a successor ordinal above is never an initial ordinal.
Depends on
Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations
A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used
The cardinality of a finite set
The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition
The product rule: , and
The set of functions between finite sets is finite, with
Exponentiation of natural numbers, , and its agreement with the integer power in
The pigeonhole principle on
Cardinal (initial ordinal) and cardinality
is the least limit ordinal
On the ordinal and are the Peano operations: is closed under ordinal , and exponentiation, and for naturals the ordinal and are the natural-number sum and product
Finite, countably infinite, countable, uncountable
The natural numbers (von Neumann)
On the order is membership:
Every nonzero natural number is a successor
The von Neumann naturals form a Peano system
Basic closure properties of ordinals
Trichotomy and well-ordering of the ordinals
Successor and limit ordinals
Ordinal (von Neumann)
Equinumerous sets, and
Injection, surjection, bijection