Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Coefficients are highest-degree-first. The divisor has a nonzero decoded head; primality supplies its actual inverse. Empty quotients and remainders are included. Functionality compares the constructed execution lengths and decoded coefficients, never arbitrary beta codes. Formal polynomial equivalence compares every coefficient, not evaluations on a finite field. The formal identity and remainder-degree bound are proved separately, not assumed by the execution graph. Arbitrary quotient/remainder-pair uniqueness from a formal identity, multiplication associativity, gcd/Bezout, irreducible-polynomial existence, and the full G091 prime-power-field goal remain open. The seven displayed new names are conservative first-order notation, not new kernel primitives.
Exact theorem in conservative defined notation
∀ p. ∀ ub. ∀ uc. ∀ L. ∀ t. ∀ rb. ∀ rc. ∀ R. ∀ d. FpPolynomialTrim(p,ub,uc,L,t,rb,rc,R) → Le(R,d) → R = 0 ∨ (∃ x. FpRepresentedDegree(p,rb,rc,R,x) ∧ Lt(x,d))
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 35 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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hbound
03Establish hRL12–14
04Separate the logical casesL15–16
05Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
exact hR_left
06Separate the logical casesL18–19
07Construct an explicit witnessL20–20
Supply the displayed value, then prove that it has the required property.
- L20
exists x
08Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
split
09Use earlier factsL22–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
specialize prime_field_polynomial_trim_represented_degree (p) - L23
specialize prime_field_polynomial_trim_represented_degree (ub) - L24
specialize prime_field_polynomial_trim_represented_degree (uc) - L25
specialize prime_field_polynomial_trim_represented_degree (L) - L26
specialize prime_field_polynomial_trim_represented_degree (t) - L27
specialize prime_field_polynomial_trim_represented_degree (rb) - L28
specialize prime_field_polynomial_trim_represented_degree (rc) - L29
specialize prime_field_polynomial_trim_represented_degree (R) - L30
specialize prime_field_polynomial_trim_represented_degree (x) - L31
apply prime_field_polynomial_trim_represented_degree
10Use earlier factsL32–33
11Calculate and transport equalitiesL34–34
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L34
rewrite hR_right_witness at hbound
12Use earlier factsL35–35
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L35
exact hbound
Original defined command ledger · 35 lines
- 0001
intro p - 0002
intro ub - 0003
intro uc - 0004
intro L - 0005
intro t - 0006
intro rb - 0007
intro rc - 0008
intro R - 0009
intro d - 0010
intro ht - 0011
intro hbound - 0012
have hR : R=0 \/ exists e. R=S e - 0013
specialize zero_or_succ (R) - 0014
apply zero_or_succ - 0015
cases hR - 0016
left - 0017
exact hR_left - 0018
cases hR_right - 0019
right - 0020
exists x - 0021
split - 0022
specialize prime_field_polynomial_trim_represented_degree (p) - 0023
specialize prime_field_polynomial_trim_represented_degree (ub) - 0024
specialize prime_field_polynomial_trim_represented_degree (uc) - 0025
specialize prime_field_polynomial_trim_represented_degree (L) - 0026
specialize prime_field_polynomial_trim_represented_degree (t) - 0027
specialize prime_field_polynomial_trim_represented_degree (rb) - 0028
specialize prime_field_polynomial_trim_represented_degree (rc) - 0029
specialize prime_field_polynomial_trim_represented_degree (R) - 0030
specialize prime_field_polynomial_trim_represented_degree (x) - 0031
apply prime_field_polynomial_trim_represented_degree - 0032
exact ht - 0033
exact hR_right_witness - 0034
rewrite hR_right_witness at hbound - 0035
exact hbound