Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
These are the exact finite integer inequalities with constant 8, for every N≥2. The proof uses constructive binomial and primorial infrastructure; it does not assume logarithms, asymptotic estimates, the prime number theorem, or a factorization oracle.
Exact theorem in conservative defined notation
∀ n. ∀ ell. ¬n = 0 → BitLen(n,ell) → ∃ x. ∃ y. ∃ z. ell = S x ∧ (PowTwo(x,y) ∧ (PowTwo(ell,z) ∧ (Le(y,n) ∧ Lt(n,z))))
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 26 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
01Fix variables and assumptionsL1–4
02Separate the logical casesL5–7
03Use earlier factsL8–9
04Separate the logical casesL10–16
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
05Construct an explicit witnessL17–19
06Separate the logical casesL20–20
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L20
split
07Use earlier factsL21–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
exact h_right_witness_witness_witness_left
08Separate the logical casesL22–22
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L22
split
09Use earlier factsL23–23
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L23
exact h_right_witness_witness_witness_right_right_left
10Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
split
Original defined command ledger · 26 lines
- 0001
intro n - 0002
intro ell - 0003
intro hn - 0004
intro h - 0005
cases h - 0006
cases h_left - 0007
exfalso - 0008
apply hn - 0009
exact h_left_left - 0010
cases h_right - 0011
cases h_right_witness - 0012
cases h_right_witness_witness - 0013
cases h_right_witness_witness_witness - 0014
cases h_right_witness_witness_witness_right - 0015
cases h_right_witness_witness_witness_right_right - 0016
cases h_right_witness_witness_witness_right_right_right - 0017
exists x - 0018
exists x1 - 0019
exists x2 - 0020
split - 0021
exact h_right_witness_witness_witness_left - 0022
split - 0023
exact h_right_witness_witness_witness_right_right_left - 0024
split - 0025
exact h_right_witness_witness_witness_right_right_right_left - 0026
exact h_right_witness_witness_witness_right_right_right_right