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 : (a) is transitive, i.e. ; and (b) .
Facts & Assumptions
Given: (The natural numbers (von Neumann)) with , ; the induction principle (The principle of mathematical induction). Let be the conjunction " is transitive and ".
Induction: if and , then holds for all (The principle of mathematical induction).
Proof
Base : has no members, so it is vacuously transitive and .
Inductive hypothesis: holds, i.e. is transitive and .
is transitive: take ; if then by the inductive hypothesis transitivity; if then since ; either way .
: suppose , so or ; if then (as ), contradicting the inductive hypothesis ; if then by transitivity of , and since we get , again contradicting ; hence .
Hence holds; by induction [L1], for all : every natural number is transitive and satisfies .
Depends on
Used by
- Ordinal (von Neumann) Definition
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies Definition
- Sym({1,2,3}) has exactly six elements, is non-abelian, and its elements have orders 1, 2 and 3 Example
- The eight vertex permutations of a square form a non-abelian subgroup of Sym({1,2,3,4}) of order 8, generated by a 4-cycle and one diagonal swap Example
- The Klein four-group as the subgroup {id, (12)(34), (13)(24), (14)(23)} of Sym({1,2,3,4}): abelian of order 4, non-cyclic, every non-identity element of order 2 Example
- A family lies in a filter exactly when it has the finite intersection property Lemma
- Basic closure properties of ordinals Lemma
- Every subset of an at most countable set is at most countable Lemma
- On ℕ the order is membership: m < n ⟺ m ∈ n Lemma
- The nonempty finite subsets of ℝ are exactly the listable ones Lemma
- The pigeonhole principle on ℕ Lemma
- ω is the least limit ordinal Lemma
- The von Neumann naturals form a Peano system Theorem
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
- Set-theoretic definition of natural numbers (Wikipedia) (standard reference, not scraped)
- Mathematical induction (Wikipedia) (standard reference, not scraped)
- B. Kaya, MATH 320 Set Theory (METU lecture notes) (standard reference, not scraped)