Metamath Proof Explorer


Theorem limsupbnd1

Description: If a sequence is eventually at most A , then the limsup is also at most A . (The converse is only true if the less or equal is replaced by strictly less than; consider the sequence 1 / n which is never less or equal to zero even though the limsup is.) (Contributed by Mario Carneiro, 7-Sep-2014) (Revised by AV, 12-Sep-2020)

Ref Expression
Hypotheses limsupbnd.1 ⊢ φ → B ⊆ ℝ
limsupbnd.2 ⊢ φ → F : B ⟶ ℝ *
limsupbnd.3 ⊢ φ → A ∈ ℝ *
limsupbnd1.4 ⊢ φ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → F ⁡ j ≤ A
Assertion limsupbnd1 ⊢ φ → lim sup ⁡ F ≤ A

Proof

Step Hyp Ref Expression
1 limsupbnd.1 ⊢ φ → B ⊆ ℝ
2 limsupbnd.2 ⊢ φ → F : B ⟶ ℝ *
3 limsupbnd.3 ⊢ φ → A ∈ ℝ *
4 limsupbnd1.4 ⊢ φ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → F ⁡ j ≤ A
5 1 adantr ⊢ φ ∧ k ∈ ℝ → B ⊆ ℝ
6 2 adantr ⊢ φ ∧ k ∈ ℝ → F : B ⟶ ℝ *
7 simpr ⊢ φ ∧ k ∈ ℝ → k ∈ ℝ
8 3 adantr ⊢ φ ∧ k ∈ ℝ → A ∈ ℝ *
9 eqid ⊢ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < = n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * <
10 9 limsupgle ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ k ∈ ℝ ∧ A ∈ ℝ * → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ≤ A ↔ ∀ j ∈ B k ≤ j → F ⁡ j ≤ A
11 5 6 7 8 10 syl211anc ⊢ φ ∧ k ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ≤ A ↔ ∀ j ∈ B k ≤ j → F ⁡ j ≤ A
12 reex ⊢ ℝ ∈ V
13 12 ssex ⊢ B ⊆ ℝ → B ∈ V
14 1 13 syl ⊢ φ → B ∈ V
15 xrex ⊢ ℝ * ∈ V
16 15 a1i ⊢ φ → ℝ * ∈ V
17 fex2 ⊢ F : B ⟶ ℝ * ∧ B ∈ V ∧ ℝ * ∈ V → F ∈ V
18 2 14 16 17 syl3anc ⊢ φ → F ∈ V
19 limsupcl ⊢ F ∈ V → lim sup ⁡ F ∈ ℝ *
20 18 19 syl ⊢ φ → lim sup ⁡ F ∈ ℝ *
21 20 xrleidd ⊢ φ → lim sup ⁡ F ≤ lim sup ⁡ F
22 9 limsuple ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ lim sup ⁡ F ∈ ℝ * → lim sup ⁡ F ≤ lim sup ⁡ F ↔ ∀ k ∈ ℝ lim sup ⁡ F ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k
23 1 2 20 22 syl3anc ⊢ φ → lim sup ⁡ F ≤ lim sup ⁡ F ↔ ∀ k ∈ ℝ lim sup ⁡ F ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k
24 21 23 mpbid ⊢ φ → ∀ k ∈ ℝ lim sup ⁡ F ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k
25 24 r19.21bi ⊢ φ ∧ k ∈ ℝ → lim sup ⁡ F ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k
26 20 adantr ⊢ φ ∧ k ∈ ℝ → lim sup ⁡ F ∈ ℝ *
27 9 limsupgf ⊢ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < : ℝ ⟶ ℝ *
28 27 a1i ⊢ φ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < : ℝ ⟶ ℝ *
29 28 ffvelcdmda ⊢ φ ∧ k ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ∈ ℝ *
30 xrletr ⊢ lim sup ⁡ F ∈ ℝ * ∧ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ∈ ℝ * ∧ A ∈ ℝ * → lim sup ⁡ F ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ∧ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ≤ A → lim sup ⁡ F ≤ A
31 26 29 8 30 syl3anc ⊢ φ ∧ k ∈ ℝ → lim sup ⁡ F ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ∧ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ≤ A → lim sup ⁡ F ≤ A
32 25 31 mpand ⊢ φ ∧ k ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ k ≤ A → lim sup ⁡ F ≤ A
33 11 32 sylbird ⊢ φ ∧ k ∈ ℝ → ∀ j ∈ B k ≤ j → F ⁡ j ≤ A → lim sup ⁡ F ≤ A
34 33 rexlimdva ⊢ φ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → F ⁡ j ≤ A → lim sup ⁡ F ≤ A
35 4 34 mpd ⊢ φ → lim sup ⁡ F ≤ A