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. ∀ A. ∀ B. ∀ N. GNorm(a,A) → GNorm(b,B) → N = A · B → ¬N = 0 → ¬GUnit(a) → ¬GUnit(b) → Lt(A,N) ∧ Lt(B,N)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 56 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–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hv
03Establish hAL12–20
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply factor nonzero left.
04Establish hBL21–29
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply factor nonzero right.
05Separate the logical casesL30–30
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L30
split
06Calculate and transport equalitiesL31–31
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L31
rewrite heq
07Use earlier factsL32–41
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
specialize succ_le_mul_of_two_le_right (A) - L33
specialize succ_le_mul_of_two_le_right (B) - L34
apply succ_le_mul_of_two_le_right - L35
exact hA - L36
specialize gaussian_search_nonunit_norm_two (b) - L37
specialize gaussian_search_nonunit_norm_two (B) - L38
apply gaussian_search_nonunit_norm_two - L39
exact hb - L40
exact hB - L41
exact hv
08Establish hreorderL42–51
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mul comm.
Original defined command ledger · 56 lines
- 0001
intro a - 0002
intro b - 0003
intro A - 0004
intro B - 0005
intro N - 0006
intro ha - 0007
intro hb - 0008
intro heq - 0009
intro hn - 0010
intro hu - 0011
intro hv - 0012
have hA : ~(A=0) - 0013
intro hz - 0014
specialize factor_nonzero_left (N) - 0015
specialize factor_nonzero_left (A) - 0016
specialize factor_nonzero_left (B) - 0017
apply factor_nonzero_left - 0018
exact hn - 0019
exact heq - 0020
exact hz - 0021
have hB : ~(B=0) - 0022
intro hz - 0023
specialize factor_nonzero_right (N) - 0024
specialize factor_nonzero_right (A) - 0025
specialize factor_nonzero_right (B) - 0026
apply factor_nonzero_right - 0027
exact hn - 0028
exact heq - 0029
exact hz - 0030
split - 0031
rewrite heq - 0032
specialize succ_le_mul_of_two_le_right (A) - 0033
specialize succ_le_mul_of_two_le_right (B) - 0034
apply succ_le_mul_of_two_le_right - 0035
exact hA - 0036
specialize gaussian_search_nonunit_norm_two (b) - 0037
specialize gaussian_search_nonunit_norm_two (B) - 0038
apply gaussian_search_nonunit_norm_two - 0039
exact hb - 0040
exact hB - 0041
exact hv - 0042
have hreorder : N=B*A - 0043
trans A*B - 0044
exact heq - 0045
apply mul_comm - 0046
rewrite hreorder - 0047
specialize succ_le_mul_of_two_le_right (B) - 0048
specialize succ_le_mul_of_two_le_right (A) - 0049
apply succ_le_mul_of_two_le_right - 0050
exact hB - 0051
specialize gaussian_search_nonunit_norm_two (a) - 0052
specialize gaussian_search_nonunit_norm_two (A) - 0053
apply gaussian_search_nonunit_norm_two - 0054
exact ha - 0055
exact hA - 0056
exact hu