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.
The von Neumann naturals form a Peano system
Statement
The triple satisfies the three Peano axioms (Peano system): (P1) for all ; (P2) is injective; (P3) induction. Hence a Peano system exists.
Facts & Assumptions
Given: , , (The natural numbers (von Neumann)).
Induction principle (The principle of mathematical induction).
Every natural number is transitive and satisfies (Every natural number is a transitive set and is not a member of itself).
Proof
(P3) The induction axiom holds: it is exactly the induction principle.
(P1) For every , contains , so is nonempty and .
(P2) Suppose , i.e. ; then so or , and symmetrically or ; if then and , whence by transitivity [L2] gives , and gives , contradicting [L2]; therefore and is injective.
P1, P2, P3 all hold, so is a Peano system; in particular a Peano system exists.
Depends on
Used by
- Addition is a well-defined total operation Corollary
- Multiplication is a well-defined total operation Corollary
- The map n ↦ (n,0) from ℤ to ℤ × ℤ preserves addition and multiplication and does not preserve 1, so the clause f(1) = 1 is not redundant Counterexample
- The factorial n! and the falling factorial n^underlinek, defined by recursion in ℕ Definition
- The forward shift on F^ℕ is injective but not surjective Example
- FALSE: every injection of a set into itself is a bijection False statement
- FALSE: for all sets A and B with B having at least two elements, A × B is strictly larger than A False statement
- FALSE: successor-closure alone forces a set to be all of ℕ False statement
- A finite sum is unchanged by a permutation of its index range: ∑_k<n a_π(k) = ∑_k<n aₖ for every bijection π : n → n Lemma
- Addition is cancellative Lemma
- Discreteness: σ(n) is the immediate successor Lemma
- Laws of finite sums and products in ℕ, and ι(∑_k<n aₖ) = ∑_k<n ι(aₖ) Lemma
- No natural number equals its own successor Lemma
- The natural numbers have no zero divisors Lemma
- Trichotomy of the order on ℕ Lemma
- ≤ is a linear order on ℕ Theorem
- 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 | A | in the finite sense equal to | A | in the cardinal sense Theorem
- ℕ × ℕ ≈ ℕ Theorem
- On ω the ordinal + and · are the Peano operations: ω is closed under ordinal +, · and exponentiation, and for naturals m, n the ordinal m + n and m · n are the natural-number sum and product Theorem
- ℚ is countably infinite Theorem
- The well-ordering principle Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 19 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Peano axioms (Wikipedia) (standard reference, not scraped)
- Set-theoretic definition of natural numbers (Wikipedia) (standard reference, not scraped)
- Mathematics 144: Set Theory (UC Riverside lecture notes) (standard reference, not scraped)