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. ∀ db. ∀ dc. ∀ D. ∀ d. ∀ ab. ∀ ac. ∀ L. ∀ a. Prime(p) → FpRepresentedDegree(p,db,dc,D,d) → FpRepresentedDegree(p,ab,ac,L,a) → FpPolynomialRightDivides(p,db,dc,D,ab,ac,L) → Le(d,a)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 38 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–13
03Establish hfL14–23
Establish this local claim before using it. It is not an additional assumption.
- L14
have hf : ∃ pfgu_qb_bound_factor. ∃ pfgu_qc_bound_factor. ∃ pfgu_e_bound_factor. ∃ pfgu_pb_bound_factor. ∃ pfgu_pc_bound_factor. FpRepresentedDegree(p,pfgu_qb_bound_factor,pfgu_qc_bound_factor,S pfgu_e_bound_factor,pfgu_e_bound_factor) ∧ (FpPolyProduct(p,pfgu_qb_bound_factor,pfgu_qc_bound_factor,S pfgu_e_bound_factor,db,dc,D,pfgu_pb_bound_factor,pfgu_pc_bound_factor,S a) ∧ (PolynomialEquivalent(pfgu_pb_bound_factor,pfgu_pc_bound_factor,S a,ab,ac,L) ∧ pfgu_e_bound_factor + d = a))Definitions: FpRepresentedDegree(p,pfgu_qb_bound_factor,pfgu_qc_bound_factor,S pfgu_e_bound_factor,pfgu_e_bound_factor)FpPolyProduct(p,pfgu_qb_bound_factor,pfgu_qc_bound_factor,S pfgu_e_bound_factor,db,dc,D,pfgu_pb_bound_factor,pfgu_pc_bound_factor,S a)PolynomialEquivalent(pfgu_pb_bound_factor,pfgu_pc_bound_factor,S a,ab,ac,L)Original native command in the exact edition - L15
specialize prime_field_polynomial_right_divides_represented_factorization (p) - L16
specialize prime_field_polynomial_right_divides_represented_factorization (db) - L17
specialize prime_field_polynomial_right_divides_represented_factorization (dc) - L18
specialize prime_field_polynomial_right_divides_represented_factorization (D) - L19
specialize prime_field_polynomial_right_divides_represented_factorization (d) - L20
specialize prime_field_polynomial_right_divides_represented_factorization (ab) - L21
specialize prime_field_polynomial_right_divides_represented_factorization (ac) - L22
specialize prime_field_polynomial_right_divides_represented_factorization (L) - L23
specialize prime_field_polynomial_right_divides_represented_factorization (a)
04Use earlier factsL24–28
05Separate the logical casesL29–36
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L29
cases hf - L30
cases hf_witness - L31
cases hf_witness_witness - L32
cases hf_witness_witness_witness - L33
cases hf_witness_witness_witness_witness - L34
cases hf_witness_witness_witness_witness_witness - L35
cases hf_witness_witness_witness_witness_witness_right - L36
cases hf_witness_witness_witness_witness_witness_right_right
06Construct an explicit witnessL37–37
Supply the displayed value, then prove that it has the required property.
- L37
exists x2
07Use earlier factsL38–38
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
exact hf_witness_witness_witness_witness_witness_right_right_right
Original defined command ledger · 38 lines
- 0001
intro p - 0002
intro db - 0003
intro dc - 0004
intro D - 0005
intro d - 0006
intro ab - 0007
intro ac - 0008
intro L - 0009
intro a - 0010
intro hp - 0011
intro hd - 0012
intro ha - 0013
intro hrd - 0014
have hf : ∃ pfgu_qb_bound_factor. ∃ pfgu_qc_bound_factor. ∃ pfgu_e_bound_factor. ∃ pfgu_pb_bound_factor. ∃ pfgu_pc_bound_factor. FpRepresentedDegree(p,pfgu_qb_bound_factor,pfgu_qc_bound_factor,S pfgu_e_bound_factor,pfgu_e_bound_factor) ∧ (FpPolyProduct(p,pfgu_qb_bound_factor,pfgu_qc_bound_factor,S pfgu_e_bound_factor,db,dc,D,pfgu_pb_bound_factor,pfgu_pc_bound_factor,S a) ∧ (PolynomialEquivalent(pfgu_pb_bound_factor,pfgu_pc_bound_factor,S a,ab,ac,L) ∧ pfgu_e_bound_factor + d = a)) - 0015
specialize prime_field_polynomial_right_divides_represented_factorization (p) - 0016
specialize prime_field_polynomial_right_divides_represented_factorization (db) - 0017
specialize prime_field_polynomial_right_divides_represented_factorization (dc) - 0018
specialize prime_field_polynomial_right_divides_represented_factorization (D) - 0019
specialize prime_field_polynomial_right_divides_represented_factorization (d) - 0020
specialize prime_field_polynomial_right_divides_represented_factorization (ab) - 0021
specialize prime_field_polynomial_right_divides_represented_factorization (ac) - 0022
specialize prime_field_polynomial_right_divides_represented_factorization (L) - 0023
specialize prime_field_polynomial_right_divides_represented_factorization (a) - 0024
apply prime_field_polynomial_right_divides_represented_factorization - 0025
exact hp - 0026
exact hd - 0027
exact ha - 0028
exact hrd - 0029
cases hf - 0030
cases hf_witness - 0031
cases hf_witness_witness - 0032
cases hf_witness_witness_witness - 0033
cases hf_witness_witness_witness_witness - 0034
cases hf_witness_witness_witness_witness_witness - 0035
cases hf_witness_witness_witness_witness_witness_right - 0036
cases hf_witness_witness_witness_witness_witness_right_right - 0037
exists x2 - 0038
exact hf_witness_witness_witness_witness_witness_right_right_right