Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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,σ)=(ω,∅,⋅+) satisfies the three Peano axioms (Peano system): (P1) σ(n)≠0 for all n; (P2) σ is injective; (P3) induction. Hence a Peano system exists.

Facts & Assumptions

Given: N=ω, 0=∅, σ(n)=n∪{n} (The natural numbers N (von Neumann)).

[L1]
[L2]

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

Proof

technique · direct
1.1L1

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

1.2given

(P1) For every n, σ(n)=n∪{n} contains n, so σ(n) is nonempty and σ(n)≠∅=0.

1.3L2given

(P2) Suppose σ(m)=σ(n), i.e. m∪{m}=n∪{n}; then m∈n∪{n} so m∈n or m=n, and symmetrically n∈m or n=m; if m≠n then m∈n and n∈m, whence by transitivity [L2] m∈n gives m⊆n, and n∈m⊆n gives n∈n, contradicting n∉n [L2]; therefore m=n and σ is injective.

2.1step 1.1step 1.2step 1.3∎

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

Depends on

Dependency tree · 2 levels

Sources