Metamath Proof Explorer


Theorem limsupvaluz

Description: The superior limit, when the domain of the function is a set of upper integers (the first condition is needed, otherwise the l.h.s. would be -oo and the r.h.s. would be +oo ). (Contributed by Glauco Siliprandi, 23-Oct-2021)

Ref Expression
Hypotheses limsupvaluz.m φ M
limsupvaluz.z Z = M
limsupvaluz.f φ F : Z *
Assertion limsupvaluz φ lim sup F = inf ran k Z sup ran F k * < * <

Proof

Step Hyp Ref Expression
1 limsupvaluz.m φ M
2 limsupvaluz.z Z = M
3 limsupvaluz.f φ F : Z *
4 eqid i sup F i +∞ * * < = i sup F i +∞ * * <
5 2 fvexi Z V
6 5 a1i φ Z V
7 3 6 fexd φ F V
8 2 uzssre2 Z
9 8 a1i φ Z
10 2 uzsup M sup Z * < = +∞
11 1 10 syl φ sup Z * < = +∞
12 4 7 9 11 limsupval2 φ lim sup F = inf i sup F i +∞ * * < Z * <
13 9 mptimass φ i sup F i +∞ * * < Z = ran i Z sup F i +∞ * * <
14 oveq1 i = n i +∞ = n +∞
15 14 imaeq2d i = n F i +∞ = F n +∞
16 15 ineq1d i = n F i +∞ * = F n +∞ *
17 16 supeq1d i = n sup F i +∞ * * < = sup F n +∞ * * <
18 17 cbvmptv i Z sup F i +∞ * * < = n Z sup F n +∞ * * <
19 3 fimassd φ F n +∞ *
20 dfss2 F n +∞ * F n +∞ * = F n +∞
21 19 20 sylib φ F n +∞ * = F n +∞
22 21 adantr φ n Z F n +∞ * = F n +∞
23 df-ima F n +∞ = ran F n +∞
24 23 a1i φ n Z F n +∞ = ran F n +∞
25 resindm F n +∞ dom F = F n +∞
26 2 ineq1i Z n +∞ = M n +∞
27 26 ineqcomi n +∞ Z = M n +∞
28 3 fdmd φ dom F = Z
29 28 ineq2d φ n +∞ dom F = n +∞ Z
30 29 adantr φ n Z n +∞ dom F = n +∞ Z
31 2 eleq2i n Z n M
32 31 bilani φ n Z n M
33 32 uzinico2 φ n Z n = M n +∞
34 27 30 33 3eqtr4a φ n Z n +∞ dom F = n
35 34 reseq2d φ n Z F n +∞ dom F = F n
36 25 35 eqtr3id φ n Z F n +∞ = F n
37 36 rneqd φ n Z ran F n +∞ = ran F n
38 22 24 37 3eqtrd φ n Z F n +∞ * = ran F n
39 38 supeq1d φ n Z sup F n +∞ * * < = sup ran F n * <
40 39 mpteq2dva φ n Z sup F n +∞ * * < = n Z sup ran F n * <
41 18 40 eqtrid φ i Z sup F i +∞ * * < = n Z sup ran F n * <
42 41 rneqd φ ran i Z sup F i +∞ * * < = ran n Z sup ran F n * <
43 13 42 eqtrd φ i sup F i +∞ * * < Z = ran n Z sup ran F n * <
44 43 infeq1d φ inf i sup F i +∞ * * < Z * < = inf ran n Z sup ran F n * < * <
45 fveq2 n = k n = k
46 45 reseq2d n = k F n = F k
47 46 rneqd n = k ran F n = ran F k
48 47 supeq1d n = k sup ran F n * < = sup ran F k * <
49 48 cbvmptv n Z sup ran F n * < = k Z sup ran F k * <
50 49 rneqi ran n Z sup ran F n * < = ran k Z sup ran F k * <
51 50 infeq1i inf ran n Z sup ran F n * < * < = inf ran k Z sup ran F k * < * <
52 51 a1i φ inf ran n Z sup ran F n * < * < = inf ran k Z sup ran F k * < * <
53 12 44 52 3eqtrd φ lim sup F = inf ran k Z sup ran F k * < * <