Simultaneous congruences modulo distinct primes
Provedgpy_exists_modEq_prime_finsetnumber-theory
For any residue function a and any finset P of primes, there is a w with w congruent to a q modulo q for every q in P: the Chinese remainder theorem over a finset of primes. Formalization Note: the statement uses only Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_exists_modEq_prime_finset {P : Finset ℕ} (a : ℕ → ℕ)
(hP : ∀ q ∈ P, Nat.Prime q) :
∃ w, ∀ q ∈ P, w ≡ a q [MOD q] := by sorrySource
GPY good-count local evaluation, formalized from Mathlib (prime factorization of the good-pair condition)