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
∀ a. ∀ b. ∀ B. EuclideanBoundedTrace(a,b,B) → EuclideanBoundedTrace(a,b,S B)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 19 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–4
02Separate the logical casesL5–9
03Construct an explicit witnessL10–13
04Separate the logical casesL14–14
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
split
Original defined command ledger · 19 lines
- 0001
intro a - 0002
intro b - 0003
intro B - 0004
intro htrace - 0005
cases htrace - 0006
cases htrace_witness - 0007
cases htrace_witness_witness - 0008
cases htrace_witness_witness_witness - 0009
cases htrace_witness_witness_witness_witness - 0010
exists x - 0011
exists x1 - 0012
exists x2 - 0013
exists x3 - 0014
split - 0015
exact htrace_witness_witness_witness_witness_left - 0016
specialize le_succ x3 - 0017
specialize le_succ B - 0018
apply le_succ - 0019
exact htrace_witness_witness_witness_witness_right