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.
All finite lists are included, even the empty list and zero moduli. A positive LCM gives x<M; at zero LCM congruence is exact equality and normalization deliberately does not require the impossible x<0.
Exact theorem in conservative defined notation
∀ a. ∀ b. ∀ g. ¬g = 0 → IsGCD(g,a,b) → ∃ x. ∃ y. a = g · x ∧ (b = g · y ∧ (∀ z. Dvd(z,x) → Dvd(z,y) → z = 1))
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 35 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
02Establish hleftL6–11
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply is gcd dvd left.
03Separate the logical casesL12–12
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L12
cases hleft
04Establish hrightL13–18
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply is gcd dvd right.
05Separate the logical casesL19–19
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
cases hright
06Construct an explicit witnessL20–21
07Separate the logical casesL22–22
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L22
split
08Use earlier factsL23–23
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L23
exact hleft_witness
09Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
split
10Use earlier factsL25–34
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L25
exact hright_witness - L26
specialize is_gcd_quotients_coprime_nonzero g - L27
specialize is_gcd_quotients_coprime_nonzero a - L28
specialize is_gcd_quotients_coprime_nonzero b - L29
specialize is_gcd_quotients_coprime_nonzero x - L30
specialize is_gcd_quotients_coprime_nonzero x1 - L31
apply is_gcd_quotients_coprime_nonzero - L32
exact hg - L33
exact hn - L34
exact hleft_witness
11Use earlier factsL35–35
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L35
exact hright_witness
Original defined command ledger · 35 lines
- 0001
intro a - 0002
intro b - 0003
intro g - 0004
intro hn - 0005
intro hg - 0006
have hleft : Dvd(g,a) - 0007
specialize is_gcd_dvd_left g - 0008
specialize is_gcd_dvd_left a - 0009
specialize is_gcd_dvd_left b - 0010
apply is_gcd_dvd_left - 0011
exact hg - 0012
cases hleft - 0013
have hright : Dvd(g,b) - 0014
specialize is_gcd_dvd_right g - 0015
specialize is_gcd_dvd_right a - 0016
specialize is_gcd_dvd_right b - 0017
apply is_gcd_dvd_right - 0018
exact hg - 0019
cases hright - 0020
exists x - 0021
exists x1 - 0022
split - 0023
exact hleft_witness - 0024
split - 0025
exact hright_witness - 0026
specialize is_gcd_quotients_coprime_nonzero g - 0027
specialize is_gcd_quotients_coprime_nonzero a - 0028
specialize is_gcd_quotients_coprime_nonzero b - 0029
specialize is_gcd_quotients_coprime_nonzero x - 0030
specialize is_gcd_quotients_coprime_nonzero x1 - 0031
apply is_gcd_quotients_coprime_nonzero - 0032
exact hg - 0033
exact hn - 0034
exact hleft_witness - 0035
exact hright_witness