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 = sup 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 sup ran k sup x k +∞ * * < * < = sup ran G * <
10 df-limsup lim sup = x V sup ran k sup x k +∞ * * < * <
11 xrltso < Or *
12 11 infex sup ran G * < V
13 9 10 12 fvmpt F V lim sup F = sup ran G * <
14 2 13 syl F V lim sup F = sup ran G * <