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.
Historical partial components only: this chapter proves canonical solutions under successive-merge compatibility and in the pairwise-compatible dominating-last case. G011 is now closed in the separate Alpha-v27 generalized-crt branch for arbitrary pairwise-compatible finite lists, including noncoprime moduli. Full G011 proof · Alpha v27
Exact theorem in conservative defined notation
∀ a. ∀ b. ∀ d. ∀ e. Coprime(a,b) → Dvd(d,a) → Dvd(e,b) → Coprime(d,e)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 24 lines are the exact independently kernel-checked original 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
02Use earlier factsL11–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 24 lines
- 0001
intro a - 0002
intro b - 0003
intro d - 0004
intro e - 0005
intro hcoprime - 0006
intro hd - 0007
intro he - 0008
intro k - 0009
intro hkd - 0010
intro hke - 0011
specialize hcoprime k - 0012
apply hcoprime - 0013
specialize multiple_trans d - 0014
specialize multiple_trans k - 0015
specialize multiple_trans a - 0016
apply multiple_trans - 0017
exact hd - 0018
exact hkd - 0019
specialize multiple_trans e - 0020
specialize multiple_trans k - 0021
specialize multiple_trans b - 0022
apply multiple_trans - 0023
exact he - 0024
exact hke