Theorem: _private.Mathlib.MeasureTheory.Function.UnifTight.0.MeasureTheory.ae_tendsto_ae_congr
File: Mathlib/MeasureTheory/Function/UnifTight.lean

Proof steps:
state_before: α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f' n x) atTop (𝓝 (g' x))
state_after: α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
⊢ ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f' n x) atTop (𝓝 (g' x))
tactic: have hff'' := eventually_countable_forall.mpr hff'
state_before: α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
⊢ ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f' n x) atTop (𝓝 (g' x))
state_after: case h
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
x : α
hff'x : ∀ (i : ℕ), f i x = f' i x
hgg'x : g x = g' x
hfgx : Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ Tendsto (fun n => f' n x) atTop (𝓝 (g' x))
tactic: filter_upwards [hff'', hgg', hfg] with x hff'x hgg'x hfgx
state_before: case h
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
x : α
hff'x : ∀ (i : ℕ), f i x = f' i x
hgg'x : g x = g' x
hfgx : Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ Tendsto (fun n => f' n x) atTop (𝓝 (g' x))
state_after: case h
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
x : α
hff'x : ∀ (i : ℕ), f i x = f' i x
hgg'x : g x = g' x
hfgx : Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ Tendsto (fun x_1 => f x_1 x) atTop (𝓝 (g' x))
tactic: apply Tendsto.congr hff'x
state_before: case h
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
x : α
hff'x : ∀ (i : ℕ), f i x = f' i x
hgg'x : g x = g' x
hfgx : Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ Tendsto (fun x_1 => f x_1 x) atTop (𝓝 (g' x))
state_after: case h
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
x : α
hff'x : ∀ (i : ℕ), f i x = f' i x
hgg'x : g x = g' x
hfgx : Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ Tendsto (fun x_1 => f x_1 x) atTop (𝓝 (g x))
tactic: rw [← hgg'x]
state_before: case h
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ✝ : Measure α
inst✝ : NormedAddCommGroup β
μ : Measure α
p : ℝ≥0∞
f✝ : ℕ → α → β
g✝ : α → β
f f' : ℕ → α → β
g g' : α → β
hff' : ∀ (n : ℕ), f n =ᶠ[ae μ] f' n
hgg' : g =ᶠ[ae μ] g'
hfg : ∀ᵐ (x : α) ∂μ, Tendsto (fun n => f n x) atTop (𝓝 (g x))
hff'' : ∀ᵐ (x : α) ∂μ, ∀ (i : ℕ), f i x = f' i x
x : α
hff'x : ∀ (i : ℕ), f i x = f' i x
hgg'x : g x = g' x
hfgx : Tendsto (fun n => f n x) atTop (𝓝 (g x))
⊢ Tendsto (fun x_1 => f x_1 x) atTop (𝓝 (g x))
state_after: no goals
tactic: exact hfgx