Theorem: MeasureTheory.tendsto_measure_Iic_atTop
File: Mathlib/MeasureTheory/Measure/MeasureSpace.lean

Proof steps:
state_before: α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
⊢ Tendsto (fun x => μ (Iic x)) atTop (𝓝 (μ univ))
state_after: case inl
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : IsEmpty α
⊢ Tendsto (fun x => μ (Iic x)) atTop (𝓝 (μ univ))

case inr
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
⊢ Tendsto (fun x => μ (Iic x)) atTop (𝓝 (μ univ))
tactic: cases isEmpty_or_nonempty α
state_before: case inr
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
⊢ Tendsto (fun x => μ (Iic x)) atTop (𝓝 (μ univ))
state_after: case inr
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
⊢ Tendsto (fun x => μ (Iic x)) atTop (𝓝 (μ univ))
tactic: have h_mono : Monotone fun x => μ (Iic x) := fun i j hij => by simp only; gcongr
state_before: case inr
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
⊢ Tendsto (fun x => μ (Iic x)) atTop (𝓝 (μ univ))
state_after: case h.e'_5.h.e'_3
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
⊢ μ univ = ⨆ i, μ (Iic i)
tactic: convert tendsto_atTop_iSup h_mono
state_before: case h.e'_5.h.e'_3
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
⊢ μ univ = ⨆ i, μ (Iic i)
state_after: case h.e'_5.h.e'_3.intro.intro
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
xs : ℕ → α
hxs_mono : Monotone xs
hxs_tendsto : Tendsto xs atTop atTop
⊢ μ univ = ⨆ i, μ (Iic i)
tactic: obtain ⟨xs, hxs_mono, hxs_tendsto⟩ := exists_seq_monotone_tendsto_atTop_atTop α
state_before: case h.e'_5.h.e'_3.intro.intro
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
xs : ℕ → α
hxs_mono : Monotone xs
hxs_tendsto : Tendsto xs atTop atTop
⊢ μ univ = ⨆ i, μ (Iic i)
state_after: case h.e'_5.h.e'_3.intro.intro
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
xs : ℕ → α
hxs_mono : Monotone xs
hxs_tendsto : Tendsto xs atTop atTop
h_univ : univ = ⋃ n, Iic (xs n)
⊢ μ univ = ⨆ i, μ (Iic i)
tactic: have h_univ : (univ : Set α) = ⋃ n, Iic (xs n) := by
    ext1 x
    simp only [mem_univ, mem_iUnion, mem_Iic, true_iff_iff]
    obtain ⟨n, hn⟩ := tendsto_atTop_atTop.mp hxs_tendsto x
    exact ⟨n, hn n le_rfl⟩
state_before: case h.e'_5.h.e'_3.intro.intro
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
xs : ℕ → α
hxs_mono : Monotone xs
hxs_tendsto : Tendsto xs atTop atTop
h_univ : univ = ⋃ n, Iic (xs n)
⊢ μ univ = ⨆ i, μ (Iic i)
state_after: case h.e'_5.h.e'_3.intro.intro
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
xs : ℕ → α
hxs_mono : Monotone xs
hxs_tendsto : Tendsto xs atTop atTop
h_univ : univ = ⋃ n, Iic (xs n)
⊢ Directed (fun x x_1 => x ⊆ x_1) fun n => Iic (xs n)
tactic: rw [h_univ, measure_iUnion_eq_iSup, iSup_eq_iSup_subseq_of_monotone h_mono hxs_tendsto]
state_before: case h.e'_5.h.e'_3.intro.intro
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝³ : MeasurableSpace β
inst✝² : MeasurableSpace γ
μ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s s' t : Set α
inst✝¹ : SemilatticeSup α
inst✝ : atTop.IsCountablyGenerated
μ : Measure α
h✝ : Nonempty α
h_mono : Monotone fun x => μ (Iic x)
xs : ℕ → α
hxs_mono : Monotone xs
hxs_tendsto : Tendsto xs atTop atTop
h_univ : univ = ⋃ n, Iic (xs n)
⊢ Directed (fun x x_1 => x ⊆ x_1) fun n => Iic (xs n)
state_after: no goals
tactic: exact Monotone.directed_le fun i j hij => Iic_subset_Iic.mpr (hxs_mono hij)