CR0001 crt_positive_moduli_prefix_emptyAn empty decoded modulus prefix has no zero-valued member.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableArbitrary finite pairwise-coprime lists · exact LCM · G011 partial
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.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not Stable
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.
CR0001 crt_positive_moduli_prefix_emptyAn empty decoded modulus prefix has no zero-valued member.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0002 crt_positive_moduli_prefix_drop_lastPositivity of a successor-length modulus list restricts to its predecessor prefix.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0003 crt_positive_moduli_prefix_last_nonzeroThe final decoded modulus of a positive successor list is nonzero.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0004 crt_pairwise_coprime_prefix_drop_lastPairwise coprimality of decoded moduli restricts to every predecessor prefix.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0005 crt_prefix_solution_emptyEvery natural number solves the empty simultaneous-congruence system.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0006 crt_prefix_solution_drop_lastA solution of a successor list remains a solution of the predecessor prefix.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0007 crt_prefix_solution_lastThe last residue/modulus pair of a solved successor list satisfies its actual congruence.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0008 crt_prefix_solution_successor_introA solved predecessor prefix extends exactly when the actual last decoded congruence holds.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0009 crt_pairwise_coprime_prefix_lastThe last decoded modulus is coprime to every actual earlier modulus in a pairwise-coprime list.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR000A crt_positive_moduli_prefix_product_nonzeroA genuine beta-coded product of an arbitrary positive finite modulus list is nonzero.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR000B crt_prefix_product_common_multipleThe actual finite beta-product is a common multiple of every decoded modulus.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR000C crt_pairwise_coprime_prefix_product_is_lcmFor pairwise-coprime decoded moduli the actual finite product is exactly their universal-property lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR000D crt_prefix_lcm_uniqueThe universal-property lcm of any decoded finite modulus prefix is unique whenever it exists.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR000E crt_prefix_lcm_emptyThe universal-property lcm of the empty decoded modulus list is exactly one.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR000F crt_prefix_lcm_successor_introBinary relational lcm extends the exact universal-property lcm of any finite decoded modulus prefix.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0010 crt_prefix_lcm_exists_uniqueEvery arbitrary finite decoded modulus list, including noncoprime and zero entries, has a unique exact lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0011 crt_pairwise_coprime_prefix_lcm_exists_uniqueEvery arbitrary finite pairwise-coprime modulus list has a unique relational lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0012 crt_pairwise_coprime_prefix_product_coprime_lastThe actual predecessor product is coprime to the final modulus of any pairwise-coprime list.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0013 crt_pairwise_coprime_prefix_solution_existsEvery arbitrary finite beta-coded list of positive pairwise-coprime moduli has an actual simultaneous CRT solution.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0014 crt_prefix_solutions_pointwise_congruentTwo simultaneous solutions are congruent modulo every actually decoded list modulus.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0015 crt_prefix_solution_transport_common_multipleCongruence modulo any common multiple transports an actual simultaneous-list solution.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0016 crt_prefix_ordered_solutions_gap_multipleFor every finite list, the directed gap between two solutions is divisible by its universal-property lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0017 crt_prefix_solutions_congruent_lcmFor arbitrary decoded lists, every two simultaneous solutions are congruent modulo the exact list lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0018 crt_prefix_solution_class_iff_lcmThe complete solution class of any finite system is exactly one congruence class modulo its list lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR0019 crt_prefix_solution_canonical_remainderEvery existing finite-list solution has an actual canonical representative strictly below its nonzero list lcm.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR001A crt_canonical_prefix_solution_uniqueThe strictly bounded canonical representative of any finite decoded CRT system is unique.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableCR001B crt_pairwise_coprime_prefix_canonical_exists_uniqueEvery arbitrary finite list of positive pairwise-coprime moduli has its exact lcm and a unique actual bounded CRT solution.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not StableND0001 Beta(b,c,i,x)Exact hygienic Gödel-beta extraction; a signature-identical alias of checked BetaAt.
Conservative definition · notation layer 0PD0002 Lt(a,b)Witness-defined strict order on natural numbers.
Conservative definition · notation layer 0PD0003 Dvd(d,n)The natural number d divides n.
Conservative definition · notation layer 0ND0056 CRTPrefixLCM(b,c,l,M)The exact beta-prefix least common multiple, specified by divisibility and its universal leastness property.
Conservative definition · notation layer 1PD0008 ModEq(m,a,b)Balanced-natural congruence modulo m.
Conservative definition · notation layer 0ND0055 CRTPrefixSolution(r,s,b,c,l,x)One actual simultaneous solution to every beta-coded finite residue/modulus pair.
Conservative definition · notation layer 1ND0057 CRTCanonicalPrefixSolution(r,s,b,c,l,x,M)A genuine simultaneous finite CRT solution in the unique half-open range below its actual prefix LCM.
Conservative definition · notation layer 2PD0005 Coprime(a,b)Every common divisor of a and b is one.
Conservative definition · notation layer 1ND0054 CRTPairwiseCoprimePrefix(b,c,l)Exact pairwise coprimality of every pair of distinct positions in a beta-coded modulus prefix.
Conservative definition · notation layer 2ND0053 CRTPositiveModuliPrefix(b,c,l)A bounded beta-coded finite prefix consisting entirely of genuinely positive moduli.
Conservative definition · notation layer 1PD0006 IsGCD(g,a,b)g is a common divisor divisible by every common divisor.
Conservative definition · notation layer 1PD0001 Le(a,b)Witness-defined non-strict order on natural numbers.
Conservative definition · notation layer 0Only proof arrows are theorem dependencies. Definition arrows are hygienic abbreviations of exact first-order formulas and introduce no axiom or kernel symbol.
Separate complete second-wave branches: Full G011 proof · Alpha v27.