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
∀ z. ∀ N. GNorm(z,N) → ¬z = 0 → ¬N = 0
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.
01Fix variables and assumptionsL1–5
02Separate the logical casesL6–10
03Establish hzeroL11–18
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian representation zero iff.
- L11
have hzero : (z=0 -> (x=x1 /\ x2=x3)) /\ ((x=x1 /\ x2=x3) -> z=0) - L12
specialize gaussian_representation_zero_iff (z) - L13
specialize gaussian_representation_zero_iff (x) - L14
specialize gaussian_representation_zero_iff (x1) - L15
specialize gaussian_representation_zero_iff (x2) - L16
specialize gaussian_representation_zero_iff (x3) - L17
apply gaussian_representation_zero_iff - L18
exact hnorm_witness_witness_witness_witness_left
04Separate the logical casesL19–19
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
cases hzero
05Use earlier factsL20–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L20
specialize gaussian_signed_norm_nonzero (x) - L21
specialize gaussian_signed_norm_nonzero (x1) - L22
specialize gaussian_signed_norm_nonzero (x2) - L23
specialize gaussian_signed_norm_nonzero (x3) - L24
specialize gaussian_signed_norm_nonzero (N) - L25
apply gaussian_signed_norm_nonzero - L26
exact hnorm_witness_witness_witness_witness_right
06Fix variables and assumptionsL27–27
Work with arbitrary variables or the premises of the current implication.
- L27
intro hvanish
Original defined command ledger · 31 lines
- 0001
intro z - 0002
intro N - 0003
intro hnorm - 0004
intro hz - 0005
intro hN - 0006
cases hnorm - 0007
cases hnorm_witness - 0008
cases hnorm_witness_witness - 0009
cases hnorm_witness_witness_witness - 0010
cases hnorm_witness_witness_witness_witness - 0011
have hzero : (z=0 -> (x=x1 /\ x2=x3)) /\ ((x=x1 /\ x2=x3) -> z=0) - 0012
specialize gaussian_representation_zero_iff (z) - 0013
specialize gaussian_representation_zero_iff (x) - 0014
specialize gaussian_representation_zero_iff (x1) - 0015
specialize gaussian_representation_zero_iff (x2) - 0016
specialize gaussian_representation_zero_iff (x3) - 0017
apply gaussian_representation_zero_iff - 0018
exact hnorm_witness_witness_witness_witness_left - 0019
cases hzero - 0020
specialize gaussian_signed_norm_nonzero (x) - 0021
specialize gaussian_signed_norm_nonzero (x1) - 0022
specialize gaussian_signed_norm_nonzero (x2) - 0023
specialize gaussian_signed_norm_nonzero (x3) - 0024
specialize gaussian_signed_norm_nonzero (N) - 0025
apply gaussian_signed_norm_nonzero - 0026
exact hnorm_witness_witness_witness_witness_right - 0027
intro hvanish - 0028
apply hz - 0029
apply hzero_right - 0030
exact hvanish - 0031
exact hN