Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 nNn \in \mathbb{N}: (a) nn is transitive, i.e. xnxnx \in n \Rightarrow x \subseteq n; and (b) nnn \notin n.

Facts & Assumptions

Given: N\mathbb{N} (The natural numbers N\mathbb{N} (von Neumann)) with 0=0 = \varnothing, σ(n)=n{n}\sigma(n) = n \cup \{n\}; the induction principle (The principle of mathematical induction). Let P(n)P(n) be the conjunction "nn is transitive and nnn \notin n".

[L1]

Induction: if P(0)P(0) and P(n)P(σ(n))P(n) \Rightarrow P(\sigma(n)), then PP holds for all nn (The principle of mathematical induction).

Proof

technique · induction
1.1

Base P(0)P(0): 0=0 = \varnothing has no members, so it is vacuously transitive and \varnothing \notin \varnothing.

base
1.2

Inductive hypothesis: P(n)P(n) holds, i.e. nn is transitive and nnn \notin n.

ih
2.1

σ(n)=n{n}\sigma(n) = n \cup \{n\} is transitive: take xσ(n)x \in \sigma(n); if xnx \in n then xnσ(n)x \subseteq n \subseteq \sigma(n) by the inductive hypothesis transitivity; if x=nx = n then x=nσ(n)x = n \subseteq \sigma(n) since nn{n}n \subseteq n \cup \{n\}; either way xσ(n)x \subseteq \sigma(n).

step 1.2
2.2

σ(n)σ(n)\sigma(n) \notin \sigma(n): suppose σ(n)σ(n)=n{n}\sigma(n) \in \sigma(n) = n \cup \{n\}, so σ(n)n\sigma(n) \in n or σ(n)=n\sigma(n) = n; if σ(n)=n\sigma(n) = n then nnn \in n (as n{n}σ(n)=nn \in \{n\} \subseteq \sigma(n) = n), contradicting the inductive hypothesis nnn \notin n; if σ(n)n\sigma(n) \in n then σ(n)n\sigma(n) \subseteq n by transitivity of nn, and since nn{n}=σ(n)nn \in n \cup \{n\} = \sigma(n) \subseteq n we get nnn \in n, again contradicting nnn \notin n; hence σ(n)σ(n)\sigma(n) \notin \sigma(n).

step 1.2
3.1

Hence P(σ(n))P(\sigma(n)) holds; by induction [L1], P(n)P(n) for all nNn \in \mathbb{N}: every natural number is transitive and satisfies nnn \notin n.

step 2.1step 2.2discharge-induction

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 14 results over 7 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