Theorem: Filter.BigO_zero_atTop_of_support_in_Icc (PrimeNumberTheoremAnd/MellinCalculus.lean)

State before:
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
⊢ f =O[atTop] fun x => 0
Tactic:
refine Eventually.isBigO ?_
State after:
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
⊢ ∀ᶠ (x : ℝ) in atTop, ‖f x‖ ≤ 0

State before:
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
⊢ ∀ᶠ (x : ℝ) in atTop, ‖f x‖ ≤ 0
Tactic:
filter_upwards [Ioi_mem_atTop b] with c hc
State after:
case h
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : c ∈ Ioi b
⊢ ‖f c‖ ≤ 0

State before:
case h
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : c ∈ Ioi b
⊢ ‖f c‖ ≤ 0
Tactic:
replace hc := mem_Ioi.mp hc
State after:
case h
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : b < c
⊢ ‖f c‖ ≤ 0

State before:
case h
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : b < c
⊢ ‖f c‖ ≤ 0
Tactic:
refine norm_le_zero_iff.mpr <| Function.support_subset_iff'.mp fSupp c ?_
State after:
case h
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : b < c
⊢ c ∉ Icc a b

State before:
case h
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : b < c
⊢ c ∉ Icc a b
Tactic:
exact fun h ↦ by linarith [mem_Icc.mp h]
State after:
no goals

State before:
𝕂 : Type u_1
inst✝ : _root_.RCLike 𝕂
a b : ℝ
f : ℝ → 𝕂
fSupp : Function.support f ⊆ Icc a b
c : ℝ
hc : b < c
h : c ∈ Icc a b
⊢ False
Tactic:
linarith [mem_Icc.mp h]
State after:
no goals