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 derivative-nonzero criterion supplies no inverse or power witness: both are constructed. Roots may be arbitrary natural representatives of signed integer polynomials. Singular-root classification and p-adic completion are separate milestones.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ a. ∀ l. ∀ n. ∀ d. ∀ m. ∀ p. ∀ s. ∀ M. ∀ r. ¬p = 0 → HornerDerivative(b,c,a,l,n,d) → Coprime(d,p) → m = p · s → CanonicalHornerLift(b,c,l,m,a,M,r) → SimpleHornerRoot(b,c,r,l,M,p)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 44 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay 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–10
02Fix variables and assumptionsL11–16
03Separate the logical casesL17–18
04Use earlier factsL19–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
specialize beta_horner_simple_root_at_congruent_point b - L20
specialize beta_horner_simple_root_at_congruent_point c - L21
specialize beta_horner_simple_root_at_congruent_point a - L22
specialize beta_horner_simple_root_at_congruent_point r - L23
specialize beta_horner_simple_root_at_congruent_point l - L24
specialize beta_horner_simple_root_at_congruent_point n - L25
specialize beta_horner_simple_root_at_congruent_point d - L26
specialize beta_horner_simple_root_at_congruent_point p - L27
specialize beta_horner_simple_root_at_congruent_point M - L28
apply beta_horner_simple_root_at_congruent_point
05Use earlier factsL29–36
Instantiate or apply named facts and discharge the corresponding proof obligations.
06Construct an explicit witnessL37–37
Supply the displayed value, then prove that it has the required property.
- L37
exists s
Original defined command ledger · 44 lines
- 0001
intro b - 0002
intro c - 0003
intro a - 0004
intro l - 0005
intro n - 0006
intro d - 0007
intro m - 0008
intro p - 0009
intro s - 0010
intro M - 0011
intro r - 0012
intro hp - 0013
intro hpair - 0014
intro hcop - 0015
intro hfactor - 0016
intro hlift - 0017
cases hlift - 0018
cases hlift_right - 0019
specialize beta_horner_simple_root_at_congruent_point b - 0020
specialize beta_horner_simple_root_at_congruent_point c - 0021
specialize beta_horner_simple_root_at_congruent_point a - 0022
specialize beta_horner_simple_root_at_congruent_point r - 0023
specialize beta_horner_simple_root_at_congruent_point l - 0024
specialize beta_horner_simple_root_at_congruent_point n - 0025
specialize beta_horner_simple_root_at_congruent_point d - 0026
specialize beta_horner_simple_root_at_congruent_point p - 0027
specialize beta_horner_simple_root_at_congruent_point M - 0028
apply beta_horner_simple_root_at_congruent_point - 0029
exact hp - 0030
exact hpair - 0031
exact hcop - 0032
specialize mod_eq_of_mod_eq_multiple p - 0033
specialize mod_eq_of_mod_eq_multiple m - 0034
specialize mod_eq_of_mod_eq_multiple a - 0035
specialize mod_eq_of_mod_eq_multiple r - 0036
apply mod_eq_of_mod_eq_multiple - 0037
exists s - 0038
exact hfactor - 0039
specialize mod_eq_symm m - 0040
specialize mod_eq_symm r - 0041
specialize mod_eq_symm a - 0042
apply mod_eq_symm - 0043
exact hlift_right_left - 0044
exact hlift_right_right