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.
Inputs are genuine canonical signed-pair codes, not arbitrary naturals. Products start at the actual Gaussian identity, whose code is six. The factor list uses the proved prime-divisor property; irreducibility alone is not silently renamed primality. Uniqueness supplies equal lengths, a bounded bijection, and an actual unit at each match, including repeated factors. Units have empty factorizations and zero is excluded. Sorted primary representatives, Gaussian prime classification, and Eisenstein factorization are separate targets.
Exact theorem in conservative defined notation
∀ ap. ∀ an. ∀ bp. ∀ bn. ∀ cp. ∀ cn. ∀ dp. ∀ dn. ∀ ep. ∀ en. ∀ fp. ∀ fn. ap + cp + (an + en) = ap + ep + (an + cn) ∧ bp + dp + (bn + fn) = bp + fp + (bn + dn) → cp + en = ep + cn ∧ dp + fn = fp + dn
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 31 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
03Separate the logical casesL14–15
04Use earlier factsL16–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
specialize gaussian_ring_pair_sum_cancel (ap) - L17
specialize gaussian_ring_pair_sum_cancel (an) - L18
specialize gaussian_ring_pair_sum_cancel (cp) - L19
specialize gaussian_ring_pair_sum_cancel (cn) - L20
specialize gaussian_ring_pair_sum_cancel (ep) - L21
specialize gaussian_ring_pair_sum_cancel (en) - L22
apply gaussian_ring_pair_sum_cancel - L23
exact h_left - L24
specialize gaussian_ring_pair_sum_cancel (bp) - L25
specialize gaussian_ring_pair_sum_cancel (bn)
05Use earlier factsL26–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 31 lines
- 0001
intro ap - 0002
intro an - 0003
intro bp - 0004
intro bn - 0005
intro cp - 0006
intro cn - 0007
intro dp - 0008
intro dn - 0009
intro ep - 0010
intro en - 0011
intro fp - 0012
intro fn - 0013
intro h - 0014
cases h - 0015
split - 0016
specialize gaussian_ring_pair_sum_cancel (ap) - 0017
specialize gaussian_ring_pair_sum_cancel (an) - 0018
specialize gaussian_ring_pair_sum_cancel (cp) - 0019
specialize gaussian_ring_pair_sum_cancel (cn) - 0020
specialize gaussian_ring_pair_sum_cancel (ep) - 0021
specialize gaussian_ring_pair_sum_cancel (en) - 0022
apply gaussian_ring_pair_sum_cancel - 0023
exact h_left - 0024
specialize gaussian_ring_pair_sum_cancel (bp) - 0025
specialize gaussian_ring_pair_sum_cancel (bn) - 0026
specialize gaussian_ring_pair_sum_cancel (dp) - 0027
specialize gaussian_ring_pair_sum_cancel (dn) - 0028
specialize gaussian_ring_pair_sum_cancel (fp) - 0029
specialize gaussian_ring_pair_sum_cancel (fn) - 0030
apply gaussian_ring_pair_sum_cancel - 0031
exact h_right