Theorem: lt_ceil_mul_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
⊢ n < ⌈b * x⌉₊ ↔ ↑n / x < b
Tactic:
rw [div_lt_iff hx, Nat.lt_ceil]
State after:
no goals