Metamath Proof Explorer


Theorem limsupbnd2

Description: If a sequence is eventually greater than A , then the limsup is also greater than A . (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 ∈ ℝ *
limsupbnd2.4 ⊢ φ → sup B ℝ * < = +∞
limsupbnd2.5 ⊢ φ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → A ≤ F ⁡ j
Assertion limsupbnd2 ⊢ φ → A ≤ lim sup ⁡ F

Proof

Step Hyp Ref Expression
1 limsupbnd.1 ⊢ φ → B ⊆ ℝ
2 limsupbnd.2 ⊢ φ → F : B ⟶ ℝ *
3 limsupbnd.3 ⊢ φ → A ∈ ℝ *
4 limsupbnd2.4 ⊢ φ → sup B ℝ * < = +∞
5 limsupbnd2.5 ⊢ φ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → A ≤ F ⁡ j
6 ressxr ⊢ ℝ ⊆ ℝ *
7 1 6 sstrdi ⊢ φ → B ⊆ ℝ *
8 supxrunb1 ⊢ B ⊆ ℝ * → ∀ n ∈ ℝ ∃ j ∈ B n ≤ j ↔ sup B ℝ * < = +∞
9 7 8 syl ⊢ φ → ∀ n ∈ ℝ ∃ j ∈ B n ≤ j ↔ sup B ℝ * < = +∞
10 4 9 mpbird ⊢ φ → ∀ n ∈ ℝ ∃ j ∈ B n ≤ j
11 ifcl ⊢ m ∈ ℝ ∧ k ∈ ℝ → if k ≤ m m k ∈ ℝ
12 breq1 ⊢ n = if k ≤ m m k → n ≤ j ↔ if k ≤ m m k ≤ j
13 12 rexbidv ⊢ n = if k ≤ m m k → ∃ j ∈ B n ≤ j ↔ ∃ j ∈ B if k ≤ m m k ≤ j
14 13 rspccva ⊢ ∀ n ∈ ℝ ∃ j ∈ B n ≤ j ∧ if k ≤ m m k ∈ ℝ → ∃ j ∈ B if k ≤ m m k ≤ j
15 10 11 14 syl2an ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → ∃ j ∈ B if k ≤ m m k ≤ j
16 r19.29 ⊢ ∀ j ∈ B k ≤ j → A ≤ F ⁡ j ∧ ∃ j ∈ B if k ≤ m m k ≤ j → ∃ j ∈ B k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j
17 simplrr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ∈ ℝ
18 simprl ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → m ∈ ℝ
19 18 adantr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → m ∈ ℝ
20 max1 ⊢ k ∈ ℝ ∧ m ∈ ℝ → k ≤ if k ≤ m m k
21 17 19 20 syl2anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ if k ≤ m m k
22 19 17 11 syl2anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → if k ≤ m m k ∈ ℝ
23 1 adantr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → B ⊆ ℝ
24 23 sselda ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → j ∈ ℝ
25 letr ⊢ k ∈ ℝ ∧ if k ≤ m m k ∈ ℝ ∧ j ∈ ℝ → k ≤ if k ≤ m m k ∧ if k ≤ m m k ≤ j → k ≤ j
26 17 22 24 25 syl3anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ if k ≤ m m k ∧ if k ≤ m m k ≤ j → k ≤ j
27 21 26 mpand ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → if k ≤ m m k ≤ j → k ≤ j
28 27 imim1d ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ j → A ≤ F ⁡ j → if k ≤ m m k ≤ j → A ≤ F ⁡ j
29 28 impd ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j → A ≤ F ⁡ j
30 max2 ⊢ k ∈ ℝ ∧ m ∈ ℝ → m ≤ if k ≤ m m k
31 17 19 30 syl2anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → m ≤ if k ≤ m m k
32 letr ⊢ m ∈ ℝ ∧ if k ≤ m m k ∈ ℝ ∧ j ∈ ℝ → m ≤ if k ≤ m m k ∧ if k ≤ m m k ≤ j → m ≤ j
33 19 22 24 32 syl3anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → m ≤ if k ≤ m m k ∧ if k ≤ m m k ≤ j → m ≤ j
34 31 33 mpand ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → if k ≤ m m k ≤ j → m ≤ j
35 34 adantld ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j → m ≤ j
36 eqid ⊢ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < = n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * <
37 36 limsupgf ⊢ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < : ℝ ⟶ ℝ *
38 37 ffvelcdmi ⊢ m ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ∈ ℝ *
39 38 adantl ⊢ φ ∧ m ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ∈ ℝ *
40 39 xrleidd ⊢ φ ∧ m ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
41 40 adantrr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
42 2 adantr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → F : B ⟶ ℝ *
43 18 38 syl ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ∈ ℝ *
44 36 limsupgle ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ m ∈ ℝ ∧ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ∈ ℝ * → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ↔ ∀ j ∈ B m ≤ j → F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
45 23 42 18 43 44 syl211anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ↔ ∀ j ∈ B m ≤ j → F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
46 41 45 mpbid ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → ∀ j ∈ B m ≤ j → F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
47 46 r19.21bi ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → m ≤ j → F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
48 35 47 syld ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j → F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
49 29 48 jcad ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j → A ≤ F ⁡ j ∧ F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
50 3 ad2antrr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → A ∈ ℝ *
51 42 ffvelcdmda ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → F ⁡ j ∈ ℝ *
52 43 adantr ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ∈ ℝ *
53 xrletr ⊢ A ∈ ℝ * ∧ F ⁡ j ∈ ℝ * ∧ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m ∈ ℝ * → A ≤ F ⁡ j ∧ F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
54 50 51 52 53 syl3anc ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → A ≤ F ⁡ j ∧ F ⁡ j ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
55 49 54 syld ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ B → k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
56 55 rexlimdva ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → ∃ j ∈ B k ≤ j → A ≤ F ⁡ j ∧ if k ≤ m m k ≤ j → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
57 16 56 syl5 ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → ∀ j ∈ B k ≤ j → A ≤ F ⁡ j ∧ ∃ j ∈ B if k ≤ m m k ≤ j → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
58 15 57 mpan2d ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → ∀ j ∈ B k ≤ j → A ≤ F ⁡ j → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
59 58 anassrs ⊢ φ ∧ m ∈ ℝ ∧ k ∈ ℝ → ∀ j ∈ B k ≤ j → A ≤ F ⁡ j → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
60 59 rexlimdva ⊢ φ ∧ m ∈ ℝ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → A ≤ F ⁡ j → A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
61 60 ralrimdva ⊢ φ → ∃ k ∈ ℝ ∀ j ∈ B k ≤ j → A ≤ F ⁡ j → ∀ m ∈ ℝ A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
62 5 61 mpd ⊢ φ → ∀ m ∈ ℝ A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
63 36 limsuple ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ A ∈ ℝ * → A ≤ lim sup ⁡ F ↔ ∀ m ∈ ℝ A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
64 1 2 3 63 syl3anc ⊢ φ → A ≤ lim sup ⁡ F ↔ ∀ m ∈ ℝ A ≤ n ∈ ℝ ⟼ sup F n +∞ ∩ ℝ * ℝ * < ⁡ m
65 62 64 mpbird ⊢ φ → A ≤ lim sup ⁡ F