Metamath Proof Explorer


Theorem limsupval

Description: The superior limit of an infinite sequence F of extended real numbers, which is the infimum of the set of suprema of all upper infinite subsequences of F . Definition 12-4.1 of Gleason p. 175. (Contributed by NM, 26-Oct-2005) (Revised by AV, 12-Sep-2014)

Ref Expression
Hypothesis limsupval.1 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
Assertion limsupval ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ G ℝ * <

Proof

Step Hyp Ref Expression
1 limsupval.1 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
2 elex ⊢ F ∈ V → F ∈ V
3 imaeq1 ⊢ x = F → x k +∞ = F k +∞
4 3 ineq1d ⊢ x = F → x k +∞ ∩ ℝ * = F k +∞ ∩ ℝ *
5 4 supeq1d ⊢ x = F → sup x k +∞ ∩ ℝ * ℝ * < = sup F k +∞ ∩ ℝ * ℝ * <
6 5 mpteq2dv ⊢ x = F → k ∈ ℝ ⟼ sup x k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
7 6 1 eqtr4di ⊢ x = F → k ∈ ℝ ⟼ sup x k +∞ ∩ ℝ * ℝ * < = G
8 7 rneqd ⊢ x = F → ran ⁡ k ∈ ℝ ⟼ sup x k +∞ ∩ ℝ * ℝ * < = ran ⁡ G
9 8 infeq1d ⊢ x = F → inf ran ⁡ k ∈ ℝ ⟼ sup x k +∞ ∩ ℝ * ℝ * < ℝ * < = inf ran ⁡ G ℝ * <
10 df-limsup ⊢ lim sup = x ∈ V ⟼ inf ran ⁡ k ∈ ℝ ⟼ sup x k +∞ ∩ ℝ * ℝ * < ℝ * <
11 xrltso ⊢ < Or ℝ *
12 11 infex ⊢ inf ran ⁡ G ℝ * < ∈ V
13 9 10 12 fvmpt ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ G ℝ * <
14 2 13 syl ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ G ℝ * <