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.
The exact G101 milestone is fully proved, including the stronger checked bound k≤2·BitLen(b), a real beta-coded execution, and its actual terminal gcd. The independent T13 determinant/rank/integer-span substrate is now closed in the separate Alpha-v27 integer-linear-algebra branch. Full T13 proof · Alpha v27
Exact theorem in conservative defined notation
∀ b. ∀ l. BitLen(b,l) → ∃ x. PowTwo(l,x) ∧ Lt(b,x)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 28 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 (1)
01Fix variables and assumptionsL1–3
02Separate the logical casesL4–5
03Use earlier factsL6–6
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L6
specialize binary_power_two_exists l
04Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases binary_power_two_exists
05Construct an explicit witnessL8–8
Supply the displayed value, then prove that it has the required property.
- L8
exists x
06Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
split
07Use earlier factsL10–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
08Separate the logical casesL17–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases hlength_right - L18
cases hlength_right_witness - L19
cases hlength_right_witness_witness - L20
cases hlength_right_witness_witness_witness - L21
cases hlength_right_witness_witness_witness_right - L22
cases hlength_right_witness_witness_witness_right_right - L23
cases hlength_right_witness_witness_witness_right_right_right - L24
cases hlength_right_witness_witness_witness_right_right_right_right
09Construct an explicit witnessL25–25
Supply the displayed value, then prove that it has the required property.
- L25
exists x2
10Separate the logical casesL26–26
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L26
split
Original defined command ledger · 28 lines
- 0001
intro b - 0002
intro l - 0003
intro hlength - 0004
cases hlength - 0005
cases hlength_left - 0006
specialize binary_power_two_exists l - 0007
cases binary_power_two_exists - 0008
exists x - 0009
split - 0010
exact binary_power_two_exists_witness - 0011
specialize euclidean_log_zero_below_power l - 0012
specialize euclidean_log_zero_below_power x - 0013
specialize euclidean_log_zero_below_power b - 0014
apply euclidean_log_zero_below_power - 0015
exact binary_power_two_exists_witness - 0016
exact hlength_left_left - 0017
cases hlength_right - 0018
cases hlength_right_witness - 0019
cases hlength_right_witness_witness - 0020
cases hlength_right_witness_witness_witness - 0021
cases hlength_right_witness_witness_witness_right - 0022
cases hlength_right_witness_witness_witness_right_right - 0023
cases hlength_right_witness_witness_witness_right_right_right - 0024
cases hlength_right_witness_witness_witness_right_right_right_right - 0025
exists x2 - 0026
split - 0027
exact hlength_right_witness_witness_witness_right_right_right_left - 0028
exact hlength_right_witness_witness_witness_right_right_right_right_right