Theorem: F_neg (PrimeNumberTheoremAnd/Fourier.lean)

State before:
f : ℝ → ℂ
u : ℝ
⊢ 𝓕 (fun x => -f x) u = -𝓕 f u
Tactic:
simp [fourierIntegral_eq, integral_neg]
State after:
no goals