Theorem: MellinInversion_aux1 (PrimeNumberTheoremAnd/MellinCalculus.lean)

State before:
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
f : ℝ → ℂ
s : ℂ
s_ne_zero : s ≠ 0
fDiff : DifferentiableOn ℝ f (Ioi 0)
hfs : Tendsto (fun x => f x * ↑x ^ s) (𝓝[>] 0) (𝓝 0)
hfinf : Tendsto (fun x => f x * ↑x ^ s) atTop (𝓝 0)
⊢ ∫ (x : ℝ) in Ioi 0, f x * ↑x ^ s / ↑x = -∫ (x : ℝ) in Ioi 0, deriv f x * ↑x ^ s / s
Tactic:
sorry
State after:
no goals