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.
G101 and G102 were OPEN when these BitLen foundations were first admitted in Alpha v22. Both are now CLOSED in Alpha v23: complete canonical exponent digits and both exact logarithmic execution bounds are proved.
Exact theorem in conservative defined notation
∀ n. ∃ l. BitLen(n,l) ∧ (∀ x. BitLen(n,x) → l = x)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 14 lines are the exact independently kernel-checked original 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.
Named ingredients (2)
01Fix variables and assumptionsL1–1
Work with arbitrary variables or the premises of the current implication.
- L1
intro n
02Use earlier factsL2–2
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L2
specialize binary_length_exists n
03Separate the logical casesL3–3
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L3
cases binary_length_exists
04Construct an explicit witnessL4–4
Supply the displayed value, then prove that it has the required property.
- L4
exists x
05Separate the logical casesL5–5
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L5
split
06Use earlier factsL6–6
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L6
exact binary_length_exists_witness
07Fix variables and assumptionsL7–8
08Use earlier factsL9–14
Original defined command ledger · 14 lines
- 0001
intro n - 0002
specialize binary_length_exists n - 0003
cases binary_length_exists - 0004
exists x - 0005
split - 0006
exact binary_length_exists_witness - 0007
intro L - 0008
intro hother - 0009
specialize binary_length_functional n - 0010
specialize binary_length_functional x - 0011
specialize binary_length_functional L - 0012
apply binary_length_functional - 0013
exact binary_length_exists_witness - 0014
exact hother