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
∀ a. ∀ b. ∀ c. ∀ ab. ∀ ac. ∀ t. GMul(a,b,ab) → GMul(ab,c,t) → GMul(a,c,ac) → GMul(ac,b,t)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 49 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 (4)
01Fix variables and assumptionsL1–9
02Establish hBCL10–19
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian multiply exists.
- L10
- L11
specialize gaussian_multiply_exists (b) - L12
specialize gaussian_multiply_exists (c) - L13
apply gaussian_multiply_exists - L14
specialize gaussian_multiply_input_right_valid (a) - L15
specialize gaussian_multiply_input_right_valid (b) - L16
specialize gaussian_multiply_input_right_valid (ab) - L17
apply gaussian_multiply_input_right_valid - L18
exact hAB - L19
specialize gaussian_multiply_input_right_valid (ab)
03Use earlier factsL20–23
04Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
cases hBC
05Establish hTL25–34
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian multiply associative.
- L25
- L26
specialize gaussian_multiply_associative (a) - L27
specialize gaussian_multiply_associative (b) - L28
specialize gaussian_multiply_associative (c) - L29
specialize gaussian_multiply_associative (ab) - L30
specialize gaussian_multiply_associative (x) - L31
specialize gaussian_multiply_associative (t) - L32
apply gaussian_multiply_associative - L33
exact hAB - L34
exact hABC
06Use earlier factsL35–44
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L35
exact hBC_witness - L36
specialize gaussian_multiply_associative_reverse (a) - L37
specialize gaussian_multiply_associative_reverse (c) - L38
specialize gaussian_multiply_associative_reverse (b) - L39
specialize gaussian_multiply_associative_reverse (ac) - L40
specialize gaussian_multiply_associative_reverse (x) - L41
specialize gaussian_multiply_associative_reverse (t) - L42
apply gaussian_multiply_associative_reverse - L43
exact hAC - L44
specialize gaussian_multiply_commutative (b)
Original defined command ledger · 49 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro ab - 0005
intro ac - 0006
intro t - 0007
intro hAB - 0008
intro hABC - 0009
intro hAC - 0010
have hBC : ∃ u. GMul(b,c,u) - 0011
specialize gaussian_multiply_exists (b) - 0012
specialize gaussian_multiply_exists (c) - 0013
apply gaussian_multiply_exists - 0014
specialize gaussian_multiply_input_right_valid (a) - 0015
specialize gaussian_multiply_input_right_valid (b) - 0016
specialize gaussian_multiply_input_right_valid (ab) - 0017
apply gaussian_multiply_input_right_valid - 0018
exact hAB - 0019
specialize gaussian_multiply_input_right_valid (ab) - 0020
specialize gaussian_multiply_input_right_valid (c) - 0021
specialize gaussian_multiply_input_right_valid (t) - 0022
apply gaussian_multiply_input_right_valid - 0023
exact hABC - 0024
cases hBC - 0025
have hT : GMul(a,x,t) - 0026
specialize gaussian_multiply_associative (a) - 0027
specialize gaussian_multiply_associative (b) - 0028
specialize gaussian_multiply_associative (c) - 0029
specialize gaussian_multiply_associative (ab) - 0030
specialize gaussian_multiply_associative (x) - 0031
specialize gaussian_multiply_associative (t) - 0032
apply gaussian_multiply_associative - 0033
exact hAB - 0034
exact hABC - 0035
exact hBC_witness - 0036
specialize gaussian_multiply_associative_reverse (a) - 0037
specialize gaussian_multiply_associative_reverse (c) - 0038
specialize gaussian_multiply_associative_reverse (b) - 0039
specialize gaussian_multiply_associative_reverse (ac) - 0040
specialize gaussian_multiply_associative_reverse (x) - 0041
specialize gaussian_multiply_associative_reverse (t) - 0042
apply gaussian_multiply_associative_reverse - 0043
exact hAC - 0044
specialize gaussian_multiply_commutative (b) - 0045
specialize gaussian_multiply_commutative (c) - 0046
specialize gaussian_multiply_commutative (x) - 0047
apply gaussian_multiply_commutative - 0048
exact hBC_witness - 0049
exact hT