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.
The natural-code carrier consists of genuine pairs of the existing signed integers; no new primitive arithmetic is trusted. The theorem constructs quotient, remainder, and actual norm witnesses. Gaussian gcd, unique factorization, and prime classification are separate targets.
Exact theorem in conservative defined notation
∀ z. ZPairValid(z) → ∃ x. GNorm(z,x) ∧ (∀ y. GNorm(z,y) → y = x)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 18 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 (2)
01Fix variables and assumptionsL1–2
02Establish hnormL3–6
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian norm exists.
03Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases hnorm
04Construct an explicit witnessL8–8
Supply the displayed value, then prove that it has the required property.
- L8
exists x
05Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
split
06Use earlier factsL10–10
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L10
exact hnorm_witness
07Fix variables and assumptionsL11–12
Original defined command ledger · 18 lines
- 0001
intro z - 0002
intro hvalid - 0003
have hnorm : ∃ N. GNorm(z,N) - 0004
specialize gaussian_norm_exists z - 0005
apply gaussian_norm_exists - 0006
exact hvalid - 0007
cases hnorm - 0008
exists x - 0009
split - 0010
exact hnorm_witness - 0011
intro M - 0012
intro hother - 0013
specialize gaussian_norm_functional z - 0014
specialize gaussian_norm_functional M - 0015
specialize gaussian_norm_functional x - 0016
apply gaussian_norm_functional - 0017
exact hother - 0018
exact hnorm_witness