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
∀ r. ∀ s. ∀ b. ∀ c. ∀ l. CRTMergeCompatiblePrefix(r,s,b,c,S l) → CRTMergeCompatiblePrefix(r,s,b,c,l)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 34 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
02Fix variables and assumptionsL11–18
03Use earlier factsL19–28
Original defined command ledger · 34 lines
- 0001
intro r - 0002
intro s - 0003
intro b - 0004
intro c - 0005
intro l - 0006
intro hmerge - 0007
intro i - 0008
intro x - 0009
intro M - 0010
intro a - 0011
intro n - 0012
intro g - 0013
intro hi - 0014
intro hlcm - 0015
intro hx - 0016
intro ha - 0017
intro hn - 0018
intro hg - 0019
specialize hmerge i - 0020
specialize hmerge x - 0021
specialize hmerge M - 0022
specialize hmerge a - 0023
specialize hmerge n - 0024
specialize hmerge g - 0025
apply hmerge - 0026
specialize le_succ (S i) - 0027
specialize le_succ l - 0028
apply le_succ - 0029
exact hi - 0030
exact hlcm - 0031
exact hx - 0032
exact ha - 0033
exact hn - 0034
exact hg