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