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
∀ a. ∀ b. ∀ c. ∀ d. ∀ N. GaussianSignedNorm(a,b,c,d,N) → ¬(a = b ∧ c = d) → ¬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 43 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–8
02Separate the logical casesL9–12
03Establish hsumzeroL13–17
04Establish hrealzeroL18–23
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian signed square zero iff.
05Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
cases hrealzero
06Establish himagzeroL25–30
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian signed square zero iff.
07Separate the logical casesL31–31
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L31
cases himagzero
08Use earlier factsL32–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
apply hnonzero
09Separate the logical casesL33–33
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L33
split
10Use earlier factsL34–43
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 43 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro d - 0005
intro N - 0006
intro hnorm - 0007
intro hnonzero - 0008
intro hzero - 0009
cases hnorm - 0010
cases hnorm_witness - 0011
cases hnorm_witness_witness - 0012
cases hnorm_witness_witness_right - 0013
have hsumzero : x + x1 = 0 - 0014
trans N - 0015
symm - 0016
exact hnorm_witness_witness_right_right - 0017
exact hzero - 0018
have hrealzero : (x = 0 -> a = b) /\ (a = b -> x = 0) - 0019
specialize gaussian_signed_square_zero_iff a - 0020
specialize gaussian_signed_square_zero_iff b - 0021
specialize gaussian_signed_square_zero_iff x - 0022
apply gaussian_signed_square_zero_iff - 0023
exact hnorm_witness_witness_left - 0024
cases hrealzero - 0025
have himagzero : (x1 = 0 -> c = d) /\ (c = d -> x1 = 0) - 0026
specialize gaussian_signed_square_zero_iff c - 0027
specialize gaussian_signed_square_zero_iff d - 0028
specialize gaussian_signed_square_zero_iff x1 - 0029
apply gaussian_signed_square_zero_iff - 0030
exact hnorm_witness_witness_right_left - 0031
cases himagzero - 0032
apply hnonzero - 0033
split - 0034
apply hrealzero_left - 0035
specialize add_eq_zero_left x - 0036
specialize add_eq_zero_left x1 - 0037
apply add_eq_zero_left - 0038
exact hsumzero - 0039
apply himagzero_left - 0040
specialize add_eq_zero_right x - 0041
specialize add_eq_zero_right x1 - 0042
apply add_eq_zero_right - 0043
exact hsumzero