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 ℝ * < ℝ * <