Theorems · Theorem · number theory
Nat.frequently_mod_eq
∀ {d n : ℕ}, d < n → ∃ᶠ (m : ℕ) in Filter.atTop, m % n = d- Defined in
- Mathlib.Order.Filter.AtTopBot.ModEq
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Filter.atTopstatement and proof · cited by 2,405
- Filter.Frequentlystatement and proof · cited by 414
- LT.lt.ne_botproof · cited by 26
- Nat.frequently_modEqproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Nat.frequently_oddproof · cited by 1
- Nat.frequently_evenproof · cited by 0