ZMod.prodEquivPi

{ι : Type u_3} →
  [inst : Fintype ι] →
    (a : ι → ℕ) → Pairwise (Function.onFun Nat.Coprime a) → ZMod (∏ i, a i) ≃+* ((i : ι) → ZMod (a i))

The Chinese remainder theorem, elementary version for ZMod. See also Mathlib/Data/ZMod/Basic.lean for versions involving only two numbers.

Defined in: Mathlib.Data.ZMod.QuotientRing
Cited by: 1 results in Mathlib
Foundations: Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Fintype

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.