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. ∀ e. ∀ f. ∀ g. ∀ h. ∀ i. ∀ j. ∀ k. ∀ l. ∀ o. ∀ p. ∀ q. ∀ r. a + j = i + b ∧ c + l = k + d → e + p = o + f ∧ g + r = q + h → a + e + (j + p) = i + o + (b + f) ∧ c + g + (l + r) = k + q + (d + h)
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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–18
03Separate the logical casesL19–21
04Use earlier factsL22–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
specialize integer_span_pair_add_congruence a - L23
specialize integer_span_pair_add_congruence b - L24
specialize integer_span_pair_add_congruence e - L25
specialize integer_span_pair_add_congruence f - L26
specialize integer_span_pair_add_congruence i - L27
specialize integer_span_pair_add_congruence j - L28
specialize integer_span_pair_add_congruence o - L29
specialize integer_span_pair_add_congruence p - L30
apply integer_span_pair_add_congruence - L31
exact hfirst_left
05Use earlier factsL32–41
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
exact hsecond_left - L33
specialize integer_span_pair_add_congruence c - L34
specialize integer_span_pair_add_congruence d - L35
specialize integer_span_pair_add_congruence g - L36
specialize integer_span_pair_add_congruence h - L37
specialize integer_span_pair_add_congruence k - L38
specialize integer_span_pair_add_congruence l - L39
specialize integer_span_pair_add_congruence q - L40
specialize integer_span_pair_add_congruence r - L41
apply integer_span_pair_add_congruence
Original defined command ledger · 43 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro d - 0005
intro e - 0006
intro f - 0007
intro g - 0008
intro h - 0009
intro i - 0010
intro j - 0011
intro k - 0012
intro l - 0013
intro o - 0014
intro p - 0015
intro q - 0016
intro r - 0017
intro hfirst - 0018
intro hsecond - 0019
cases hfirst - 0020
cases hsecond - 0021
split - 0022
specialize integer_span_pair_add_congruence a - 0023
specialize integer_span_pair_add_congruence b - 0024
specialize integer_span_pair_add_congruence e - 0025
specialize integer_span_pair_add_congruence f - 0026
specialize integer_span_pair_add_congruence i - 0027
specialize integer_span_pair_add_congruence j - 0028
specialize integer_span_pair_add_congruence o - 0029
specialize integer_span_pair_add_congruence p - 0030
apply integer_span_pair_add_congruence - 0031
exact hfirst_left - 0032
exact hsecond_left - 0033
specialize integer_span_pair_add_congruence c - 0034
specialize integer_span_pair_add_congruence d - 0035
specialize integer_span_pair_add_congruence g - 0036
specialize integer_span_pair_add_congruence h - 0037
specialize integer_span_pair_add_congruence k - 0038
specialize integer_span_pair_add_congruence l - 0039
specialize integer_span_pair_add_congruence q - 0040
specialize integer_span_pair_add_congruence r - 0041
apply integer_span_pair_add_congruence - 0042
exact hfirst_right - 0043
exact hsecond_right