Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
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 (N,0,σ)=(ω,,+)(\mathbb{N}, 0, \sigma) = (\omega, \varnothing, {\cdot}^{+}) satisfies the three Peano axioms (Peano system): (P1) σ(n)0\sigma(n) \neq 0 for all nn; (P2) σ\sigma is injective; (P3) induction. Hence a Peano system exists.

Facts & Assumptions

Given: N=ω\mathbb{N} = \omega, 0=0 = \varnothing, σ(n)=n{n}\sigma(n) = n \cup \{n\} (The natural numbers N\mathbb{N} (von Neumann)).

[L1]
[L2]

Every natural number is transitive and satisfies nnn \notin n (Every natural number is a transitive set and is not a member of itself).

Proof

technique · direct
1.1

(P3) The induction axiom holds: it is exactly the induction principle.

L1
1.2

(P1) For every nn, σ(n)=n{n}\sigma(n) = n \cup \{n\} contains nn, so σ(n)\sigma(n) is nonempty and σ(n)=0\sigma(n) \neq \varnothing = 0.

given
1.3

(P2) Suppose σ(m)=σ(n)\sigma(m) = \sigma(n), i.e. m{m}=n{n}m \cup \{m\} = n \cup \{n\}; then mn{n}m \in n \cup \{n\} so mnm \in n or m=nm = n, and symmetrically nmn \in m or n=mn = m; if mnm \neq n then mnm \in n and nmn \in m, whence by transitivity [L2] mnm \in n gives mnm \subseteq n, and nmnn \in m \subseteq n gives nnn \in n, contradicting nnn \notin n [L2]; therefore m=nm = n and σ\sigma is injective.

L2given
2.1

P1, P2, P3 all hold, so (N,0,σ)(\mathbb{N}, 0, \sigma) is a Peano system; in particular a Peano system exists.

step 1.1step 1.2step 1.3

Depends on

Used by

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