Theorem of theorems
Theorem.Theorem of theorems.
Proof.the fixed point: the crack lattice derives from {2,3,5} (every multi-digit member a Babylonian regular), the registry is one runnable conjunction, the axiom ledger computes beneath it, and this theorem is a MEMBER of the registry it quantifies over — self-inclusion closes the tower; only the void {0,1}, measured inputs and the Gödel residue remain, each named.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/4/6/index.ts#theoremOfTheorems
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Theorem of theorems" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation theoremOfTheorems.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (theoremOfTheorems @ src/4/6) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes theoremOfTheorems (src/4/6/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.