Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Length is representation length, not polynomial degree. Leading zeros and the empty zero polynomial are allowed; the canonical argument guard x<p also applies to the empty case. Evaluation is defined by actual field-operation steps, not an assumed residue invariant. Polynomial division, gcd, irreducibles and general prime-power extension fields remain open; this does not close G091.
Exact theorem in conservative defined notation
∀ p. ∀ b. ∀ c. ∀ t. ∀ l. ∀ r. ∀ s. Prime(p) → FpHorner(p,b,c,t,l,r) → FpHorner(p,b,c,t,l,s) → r = s
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
02Establish hnL11–16
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta horner eval exists.
- L11
have hn : ∃ n. Horner(b,c,t,l,n)Definitions: Horner(b,c,t,l,n)Original native command in the exact edition - L12
specialize beta_horner_eval_exists (b) - L13
specialize beta_horner_eval_exists (c) - L14
specialize beta_horner_eval_exists (t) - L15
specialize beta_horner_eval_exists (l) - L16
apply beta_horner_eval_exists
03Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases hn
04Use earlier factsL18–27
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
specialize binary_canonical_residue_functional (p) - L19
specialize binary_canonical_residue_functional (x) - L20
specialize binary_canonical_residue_functional (r) - L21
specialize binary_canonical_residue_functional (s) - L22
apply binary_canonical_residue_functional - L23
specialize prime_field_polynomial_horner_residue (p) - L24
specialize prime_field_polynomial_horner_residue (b) - L25
specialize prime_field_polynomial_horner_residue (c) - L26
specialize prime_field_polynomial_horner_residue (t) - L27
specialize prime_field_polynomial_horner_residue (l)
05Use earlier factsL28–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L28
specialize prime_field_polynomial_horner_residue (x) - L29
specialize prime_field_polynomial_horner_residue (r) - L30
apply prime_field_polynomial_horner_residue - L31
exact hp - L32
exact hn_witness - L33
exact hr - L34
specialize prime_field_polynomial_horner_residue (p) - L35
specialize prime_field_polynomial_horner_residue (b) - L36
specialize prime_field_polynomial_horner_residue (c) - L37
specialize prime_field_polynomial_horner_residue (t)
06Use earlier factsL38–44
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 44 lines
- 0001
intro p - 0002
intro b - 0003
intro c - 0004
intro t - 0005
intro l - 0006
intro r - 0007
intro s - 0008
intro hp - 0009
intro hr - 0010
intro hs - 0011
have hn : ∃ n. Horner(b,c,t,l,n) - 0012
specialize beta_horner_eval_exists (b) - 0013
specialize beta_horner_eval_exists (c) - 0014
specialize beta_horner_eval_exists (t) - 0015
specialize beta_horner_eval_exists (l) - 0016
apply beta_horner_eval_exists - 0017
cases hn - 0018
specialize binary_canonical_residue_functional (p) - 0019
specialize binary_canonical_residue_functional (x) - 0020
specialize binary_canonical_residue_functional (r) - 0021
specialize binary_canonical_residue_functional (s) - 0022
apply binary_canonical_residue_functional - 0023
specialize prime_field_polynomial_horner_residue (p) - 0024
specialize prime_field_polynomial_horner_residue (b) - 0025
specialize prime_field_polynomial_horner_residue (c) - 0026
specialize prime_field_polynomial_horner_residue (t) - 0027
specialize prime_field_polynomial_horner_residue (l) - 0028
specialize prime_field_polynomial_horner_residue (x) - 0029
specialize prime_field_polynomial_horner_residue (r) - 0030
apply prime_field_polynomial_horner_residue - 0031
exact hp - 0032
exact hn_witness - 0033
exact hr - 0034
specialize prime_field_polynomial_horner_residue (p) - 0035
specialize prime_field_polynomial_horner_residue (b) - 0036
specialize prime_field_polynomial_horner_residue (c) - 0037
specialize prime_field_polynomial_horner_residue (t) - 0038
specialize prime_field_polynomial_horner_residue (l) - 0039
specialize prime_field_polynomial_horner_residue (x) - 0040
specialize prime_field_polynomial_horner_residue (s) - 0041
apply prime_field_polynomial_horner_residue - 0042
exact hp - 0043
exact hn_witness - 0044
exact hs