Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-02 (claude-opus-5)
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 is a transitive set and is not a member of itself

Statement

For every n∈N: (a) n is transitive, i.e. x∈n⇒x⊆n; and (b) n∉n.

Facts & Assumptions

Given: N (The natural numbers N (von Neumann)) with 0=∅, σ(n)=n∪{n}; the induction principle (The principle of mathematical induction). Let P(n) be the conjunction "n is transitive and n∉n".

[L1]

Induction: if P(0) and P(n)⇒P(σ(n)), then P holds for all n (The principle of mathematical induction).

Proof

technique · induction
1.1

Base P(0): 0=∅ has no members, so it is vacuously transitive and ∅∉∅.

base
1.2

Inductive hypothesis: P(n) holds, i.e. n is transitive and n∉n.

ih
2.1

σ(n)=n∪{n} is transitive: take x∈σ(n); if x∈n then x⊆n⊆σ(n) by the inductive hypothesis transitivity; if x=n then x=n⊆σ(n) since n⊆n∪{n}; either way x⊆σ(n).

step 1.2
2.2

σ(n)∉σ(n): suppose σ(n)∈σ(n)=n∪{n}, so σ(n)∈n or σ(n)=n; if σ(n)=n then n∈n (as n∈{n}⊆σ(n)=n), contradicting the inductive hypothesis n∉n; if σ(n)∈n then σ(n)⊆n by transitivity of n, and since n∈n∪{n}=σ(n)⊆n we get n∈n, again contradicting n∉n; hence σ(n)∉σ(n).

step 1.2
3.1

Hence P(σ(n)) holds; by induction [L1], P(n) for all n∈N: every natural number is transitive and satisfies n∉n.

step 2.1step 2.2discharge-induction∎

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources