Recommended
Defined mathematical notation
Browse 12 linked conservative definitions and 27 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Arbitrary finite pairwise-coprime lists · exact LCM · G011 partial · Constructive arithmetic
∀ finite coprime positive lists. ∃!x<lcm(mᵢ). ∀i. x≡aᵢ (mod mᵢ)
Twenty-seven independently checked constructive theorems compute the universal-property LCM of arbitrary finite modulus lists and prove existence and canonical uniqueness for every positive pairwise-coprime finite congruence system.
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.
Recommended
Browse 12 linked conservative definitions and 27 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 1106 native tactic lines and 83 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem CR001B and follow only the lemmas and conservative definitions supporting crt_pairwise_coprime_prefix_canonical_exists_unique.
CR0010 crt_prefix_lcm_exists_unique · CR0013 crt_pairwise_coprime_prefix_solution_exists · CR0018 crt_prefix_solution_class_iff_lcm · CR001B crt_pairwise_coprime_prefix_canonical_exists_unique.627e39ed29b10db48bf37d5bef8750d48009a7524c822a7c5e7c83e96a8e9cf9.Separate complete second-wave branches: Full G011 proof · Alpha v27.