Theorem: ceil_mul_le_iff (PrimeNumberTheoremAnd/Wiener.lean)

State before:
n : ℕ
A a b c d u x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
hx : 0 < x
⊢ ⌈a * x⌉₊ ≤ n ↔ a ≤ ↑n / x
Tactic:
rw [le_div_iff hx, Nat.ceil_le]
State after:
no goals