Metamath Proof Explorer


Theorem limsupval3

Description: The superior limit of an infinite sequence F of extended real numbers. (Contributed by Glauco Siliprandi, 23-Oct-2021)

Ref Expression
Hypotheses limsupval3.1 ⊢ Ⅎ k φ
limsupval3.2 ⊢ φ → A ∈ V
limsupval3.3 ⊢ φ → F : A ⟶ ℝ *
limsupval3.4 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ℝ * <
Assertion limsupval3 ⊢ φ → lim sup ⁡ F = inf ran ⁡ G ℝ * <

Proof

Step Hyp Ref Expression
1 limsupval3.1 ⊢ Ⅎ k φ
2 limsupval3.2 ⊢ φ → A ∈ V
3 limsupval3.3 ⊢ φ → F : A ⟶ ℝ *
4 limsupval3.4 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ℝ * <
5 3 2 fexd ⊢ φ → F ∈ V
6 eqid ⊢ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
7 6 limsupval ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
8 5 7 syl ⊢ φ → lim sup ⁡ F = inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
9 4 a1i ⊢ φ → G = k ∈ ℝ ⟼ sup F k +∞ ℝ * <
10 3 fimassd ⊢ φ → F k +∞ ⊆ ℝ *
11 dfss2 ⊢ F k +∞ ⊆ ℝ * ↔ F k +∞ ∩ ℝ * = F k +∞
12 10 11 sylib ⊢ φ → F k +∞ ∩ ℝ * = F k +∞
13 12 eqcomd ⊢ φ → F k +∞ = F k +∞ ∩ ℝ *
14 13 supeq1d ⊢ φ → sup F k +∞ ℝ * < = sup F k +∞ ∩ ℝ * ℝ * <
15 14 adantr ⊢ φ ∧ k ∈ ℝ → sup F k +∞ ℝ * < = sup F k +∞ ∩ ℝ * ℝ * <
16 1 15 mpteq2da ⊢ φ → k ∈ ℝ ⟼ sup F k +∞ ℝ * < = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
17 9 16 eqtr2d ⊢ φ → k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < = G
18 17 rneqd ⊢ φ → ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < = ran ⁡ G
19 18 infeq1d ⊢ φ → inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * < = inf ran ⁡ G ℝ * <
20 8 19 eqtrd ⊢ φ → lim sup ⁡ F = inf ran ⁡ G ℝ * <