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
∀ e. ∀ f. ∀ p. ∀ q. Le(e,f) → PowTwo(e,p) → PowTwo(f,q) → Le(p,q)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 18 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.
01Fix variables and assumptionsL1–7
02Use earlier factsL8–13
03Construct an explicit witnessL14–14
Supply the displayed value, then prove that it has the required property.
- L14
exists 1
04Calculate and transport equalitiesL15–15
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L15
simp
Original defined command ledger · 18 lines
- 0001
intro e - 0002
intro f - 0003
intro p - 0004
intro q - 0005
intro horder - 0006
intro hp - 0007
intro hq - 0008
specialize pow_exponent_monotone 2 - 0009
specialize pow_exponent_monotone e - 0010
specialize pow_exponent_monotone f - 0011
specialize pow_exponent_monotone p - 0012
specialize pow_exponent_monotone q - 0013
apply pow_exponent_monotone - 0014
exists 1 - 0015
simp - 0016
exact horder - 0017
exact hp - 0018
exact hq