Metamath Proof Explorer


Theorem limsupgt

Description: Given a sequence of real numbers, there exists an upper part of the sequence that's appxoximated from below by the superior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022)

Ref Expression
Hypotheses limsupgt.k ⊢ Ⅎ _ k F
limsupgt.m ⊢ φ → M ∈ ℤ
limsupgt.z ⊢ Z = ℤ ≥ M
limsupgt.f ⊢ φ → F : Z ⟶ ℝ
limsupgt.r ⊢ φ → lim sup ⁡ F ∈ ℝ
limsupgt.x ⊢ φ → X ∈ ℝ +
Assertion limsupgt ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k − X < lim sup ⁡ F

Proof

Step Hyp Ref Expression
1 limsupgt.k ⊢ Ⅎ _ k F
2 limsupgt.m ⊢ φ → M ∈ ℤ
3 limsupgt.z ⊢ Z = ℤ ≥ M
4 limsupgt.f ⊢ φ → F : Z ⟶ ℝ
5 limsupgt.r ⊢ φ → lim sup ⁡ F ∈ ℝ
6 limsupgt.x ⊢ φ → X ∈ ℝ +
7 2 3 4 5 6 limsupgtlem ⊢ φ → ∃ i ∈ Z ∀ l ∈ ℤ ≥ i F ⁡ l − X < lim sup ⁡ F
8 nfcv ⊢ Ⅎ _ k l
9 1 8 nffv ⊢ Ⅎ _ k F ⁡ l
10 nfcv ⊢ Ⅎ _ k −
11 nfcv ⊢ Ⅎ _ k X
12 9 10 11 nfov ⊢ Ⅎ _ k F ⁡ l − X
13 nfcv ⊢ Ⅎ _ k <
14 nfcv ⊢ Ⅎ _ k lim sup
15 14 1 nffv ⊢ Ⅎ _ k lim sup ⁡ F
16 12 13 15 nfbr ⊢ Ⅎ k F ⁡ l − X < lim sup ⁡ F
17 nfv ⊢ Ⅎ l F ⁡ k − X < lim sup ⁡ F
18 fveq2 ⊢ l = k → F ⁡ l = F ⁡ k
19 18 oveq1d ⊢ l = k → F ⁡ l − X = F ⁡ k − X
20 19 breq1d ⊢ l = k → F ⁡ l − X < lim sup ⁡ F ↔ F ⁡ k − X < lim sup ⁡ F
21 16 17 20 cbvralw ⊢ ∀ l ∈ ℤ ≥ i F ⁡ l − X < lim sup ⁡ F ↔ ∀ k ∈ ℤ ≥ i F ⁡ k − X < lim sup ⁡ F
22 21 a1i ⊢ i = j → ∀ l ∈ ℤ ≥ i F ⁡ l − X < lim sup ⁡ F ↔ ∀ k ∈ ℤ ≥ i F ⁡ k − X < lim sup ⁡ F
23 fveq2 ⊢ i = j → ℤ ≥ i = ℤ ≥ j
24 23 raleqdv ⊢ i = j → ∀ k ∈ ℤ ≥ i F ⁡ k − X < lim sup ⁡ F ↔ ∀ k ∈ ℤ ≥ j F ⁡ k − X < lim sup ⁡ F
25 22 24 bitrd ⊢ i = j → ∀ l ∈ ℤ ≥ i F ⁡ l − X < lim sup ⁡ F ↔ ∀ k ∈ ℤ ≥ j F ⁡ k − X < lim sup ⁡ F
26 25 cbvrexvw ⊢ ∃ i ∈ Z ∀ l ∈ ℤ ≥ i F ⁡ l − X < lim sup ⁡ F ↔ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k − X < lim sup ⁡ F
27 7 26 sylib ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j F ⁡ k − X < lim sup ⁡ F