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.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ t. ∀ n. Horner(b,c,t,0,n) → n = 0
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 17 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–5
02Separate the logical casesL6–9
03Use earlier factsL10–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 17 lines
- 0001
intro b - 0002
intro c - 0003
intro t - 0004
intro n - 0005
intro hsum - 0006
cases hsum - 0007
cases hsum_witness - 0008
cases hsum_witness_witness - 0009
cases hsum_witness_witness_right - 0010
specialize beta_at_unique x - 0011
specialize beta_at_unique x1 - 0012
specialize beta_at_unique 0 - 0013
specialize beta_at_unique n - 0014
specialize beta_at_unique 0 - 0015
apply beta_at_unique - 0016
exact hsum_witness_witness_right_left - 0017
exact hsum_witness_witness_left