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
∀ p. ∀ a. ∀ b. ¬p = 0 → GMul(a,b,p) → GDvd(p,a) → GUnit(b)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 60 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 (7)
01Fix variables and assumptionsL1–6
02Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases hdiv
03Establish hqL8–17
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian multiply exists.
- L8
- L9
specialize gaussian_multiply_exists (x) - L10
specialize gaussian_multiply_exists (b) - L11
apply gaussian_multiply_exists - L12
specialize gaussian_multiply_input_right_valid (p) - L13
specialize gaussian_multiply_input_right_valid (x) - L14
specialize gaussian_multiply_input_right_valid (a) - L15
apply gaussian_multiply_input_right_valid - L16
exact hdiv_witness - L17
specialize gaussian_multiply_input_right_valid (a)
04Use earlier factsL18–21
05Separate the logical casesL22–22
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L22
cases hq
06Establish hselfL23–32
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian multiply associative.
- L23
- L24
specialize gaussian_multiply_associative (p) - L25
specialize gaussian_multiply_associative (x) - L26
specialize gaussian_multiply_associative (b) - L27
specialize gaussian_multiply_associative (a) - L28
specialize gaussian_multiply_associative (x1) - L29
specialize gaussian_multiply_associative (p) - L30
apply gaussian_multiply_associative - L31
exact hdiv_witness - L32
exact hprod
07Use earlier factsL33–33
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L33
exact hq_witness
08Establish heqL34–43
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian multiply cancel left.
- L34
have heq : x1=6 - L35
specialize gaussian_multiply_cancel_left (p) - L36
specialize gaussian_multiply_cancel_left (x1) - L37
specialize gaussian_multiply_cancel_left (6) - L38
specialize gaussian_multiply_cancel_left (p) - L39
apply gaussian_multiply_cancel_left - L40
exact hn - L41
exact hself - L42
specialize gaussian_multiply_one_right (p) - L43
apply gaussian_multiply_one_right
09Use earlier factsL44–48
Instantiate or apply named facts and discharge the corresponding proof obligations.
10Construct an explicit witnessL49–49
Supply the displayed value, then prove that it has the required property.
- L49
exists (x)
11Use earlier factsL50–59
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L50
specialize gaussian_multiply_commutative (x) - L51
specialize gaussian_multiply_commutative (b) - L52
specialize gaussian_multiply_commutative (6) - L53
apply gaussian_multiply_commutative - L54
specialize gaussian_multiply_output_transport (x) - L55
specialize gaussian_multiply_output_transport (b) - L56
specialize gaussian_multiply_output_transport (x1) - L57
specialize gaussian_multiply_output_transport (6) - L58
apply gaussian_multiply_output_transport - L59
exact heq
12Use earlier factsL60–60
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L60
exact hq_witness
Original defined command ledger · 60 lines
- 0001
intro p - 0002
intro a - 0003
intro b - 0004
intro hn - 0005
intro hprod - 0006
intro hdiv - 0007
cases hdiv - 0008
have hq : ∃ q. GMul(x,b,q) - 0009
specialize gaussian_multiply_exists (x) - 0010
specialize gaussian_multiply_exists (b) - 0011
apply gaussian_multiply_exists - 0012
specialize gaussian_multiply_input_right_valid (p) - 0013
specialize gaussian_multiply_input_right_valid (x) - 0014
specialize gaussian_multiply_input_right_valid (a) - 0015
apply gaussian_multiply_input_right_valid - 0016
exact hdiv_witness - 0017
specialize gaussian_multiply_input_right_valid (a) - 0018
specialize gaussian_multiply_input_right_valid (b) - 0019
specialize gaussian_multiply_input_right_valid (p) - 0020
apply gaussian_multiply_input_right_valid - 0021
exact hprod - 0022
cases hq - 0023
have hself : GMul(p,x1,p) - 0024
specialize gaussian_multiply_associative (p) - 0025
specialize gaussian_multiply_associative (x) - 0026
specialize gaussian_multiply_associative (b) - 0027
specialize gaussian_multiply_associative (a) - 0028
specialize gaussian_multiply_associative (x1) - 0029
specialize gaussian_multiply_associative (p) - 0030
apply gaussian_multiply_associative - 0031
exact hdiv_witness - 0032
exact hprod - 0033
exact hq_witness - 0034
have heq : x1=6 - 0035
specialize gaussian_multiply_cancel_left (p) - 0036
specialize gaussian_multiply_cancel_left (x1) - 0037
specialize gaussian_multiply_cancel_left (6) - 0038
specialize gaussian_multiply_cancel_left (p) - 0039
apply gaussian_multiply_cancel_left - 0040
exact hn - 0041
exact hself - 0042
specialize gaussian_multiply_one_right (p) - 0043
apply gaussian_multiply_one_right - 0044
specialize gaussian_multiply_input_left_valid (p) - 0045
specialize gaussian_multiply_input_left_valid (x) - 0046
specialize gaussian_multiply_input_left_valid (a) - 0047
apply gaussian_multiply_input_left_valid - 0048
exact hdiv_witness - 0049
exists (x) - 0050
specialize gaussian_multiply_commutative (x) - 0051
specialize gaussian_multiply_commutative (b) - 0052
specialize gaussian_multiply_commutative (6) - 0053
apply gaussian_multiply_commutative - 0054
specialize gaussian_multiply_output_transport (x) - 0055
specialize gaussian_multiply_output_transport (b) - 0056
specialize gaussian_multiply_output_transport (x1) - 0057
specialize gaussian_multiply_output_transport (6) - 0058
apply gaussian_multiply_output_transport - 0059
exact heq - 0060
exact hq_witness