Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
All products and sums use actual beta-coded coefficients; equality is formal coefficient equivalence, not equality of evaluations or raw codes. The zero gcd is included. Uniqueness is up to formal equivalence, not unique Bézout coefficients. This proves the polynomial gcd component, not G091 irreducible-polynomial existence or arbitrary prime-power-field construction.
Exact theorem in conservative defined notation
∀ p. ∀ ab. ∀ ac. ∀ L. ∀ bb. ∀ bc. ∀ d. ∀ qb. ∀ qc. ∀ q. ∀ rb. ∀ rc. ∀ R. Prime(p) → FpPolynomialDivisionExecution(p,ab,ac,L,bb,bc,d,qb,qc,q,rb,rc,R) → Le(R,d) ∧ Lt(R,S d)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 48 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–15
03Establish hdegreeL16–25
Establish this local claim before using it. It is not an additional assumption.
- L16
have hdegree : R = 0 ∨ (∃ x. FpRepresentedDegree(p,rb,rc,R,x) ∧ Lt(x,d))Definitions: FpRepresentedDegree(p,rb,rc,R,x)Lt(x,d)Original native command in the exact edition - L17
specialize prime_field_polynomial_division_remainder_degree (p) - L18
specialize prime_field_polynomial_division_remainder_degree (ab) - L19
specialize prime_field_polynomial_division_remainder_degree (ac) - L20
specialize prime_field_polynomial_division_remainder_degree (L) - L21
specialize prime_field_polynomial_division_remainder_degree (bb) - L22
specialize prime_field_polynomial_division_remainder_degree (bc) - L23
specialize prime_field_polynomial_division_remainder_degree (d) - L24
specialize prime_field_polynomial_division_remainder_degree (qb) - L25
specialize prime_field_polynomial_division_remainder_degree (qc)
04Use earlier factsL26–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
specialize prime_field_polynomial_division_remainder_degree (q) - L27
specialize prime_field_polynomial_division_remainder_degree (rb) - L28
specialize prime_field_polynomial_division_remainder_degree (rc) - L29
specialize prime_field_polynomial_division_remainder_degree (R) - L30
apply prime_field_polynomial_division_remainder_degree - L31
exact hp - L32
exact hexecution
05Establish hboundL33–33
Establish this local claim before using it. It is not an additional assumption.
06Separate the logical casesL34–34
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L34
cases hdegree
07Calculate and transport equalitiesL35–35
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L35
rewrite hdegree_left
08Use earlier factsL36–37
09Separate the logical casesL38–40
10Calculate and transport equalitiesL41–41
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L41
rewrite hdegree_right_witness_left_left
11Use earlier factsL42–42
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L42
exact hdegree_right_witness_right
12Separate the logical casesL43–43
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L43
split
Original defined command ledger · 48 lines
- 0001
intro p - 0002
intro ab - 0003
intro ac - 0004
intro L - 0005
intro bb - 0006
intro bc - 0007
intro d - 0008
intro qb - 0009
intro qc - 0010
intro q - 0011
intro rb - 0012
intro rc - 0013
intro R - 0014
intro hp - 0015
intro hexecution - 0016
have hdegree : R = 0 ∨ (∃ x. FpRepresentedDegree(p,rb,rc,R,x) ∧ Lt(x,d)) - 0017
specialize prime_field_polynomial_division_remainder_degree (p) - 0018
specialize prime_field_polynomial_division_remainder_degree (ab) - 0019
specialize prime_field_polynomial_division_remainder_degree (ac) - 0020
specialize prime_field_polynomial_division_remainder_degree (L) - 0021
specialize prime_field_polynomial_division_remainder_degree (bb) - 0022
specialize prime_field_polynomial_division_remainder_degree (bc) - 0023
specialize prime_field_polynomial_division_remainder_degree (d) - 0024
specialize prime_field_polynomial_division_remainder_degree (qb) - 0025
specialize prime_field_polynomial_division_remainder_degree (qc) - 0026
specialize prime_field_polynomial_division_remainder_degree (q) - 0027
specialize prime_field_polynomial_division_remainder_degree (rb) - 0028
specialize prime_field_polynomial_division_remainder_degree (rc) - 0029
specialize prime_field_polynomial_division_remainder_degree (R) - 0030
apply prime_field_polynomial_division_remainder_degree - 0031
exact hp - 0032
exact hexecution - 0033
have hbound : Le(R,d) - 0034
cases hdegree - 0035
rewrite hdegree_left - 0036
specialize zero_le (d) - 0037
apply zero_le - 0038
cases hdegree_right - 0039
cases hdegree_right_witness - 0040
cases hdegree_right_witness_left - 0041
rewrite hdegree_right_witness_left_left - 0042
exact hdegree_right_witness_right - 0043
split - 0044
exact hbound - 0045
specialize succ_le_succ (R) - 0046
specialize succ_le_succ (d) - 0047
apply succ_le_succ - 0048
exact hbound