Metamath Proof Explorer


Theorem limsuppnflem

Description: If the restriction of a function to every upper interval is unbounded above, its limsup is +oo . (Contributed by Glauco Siliprandi, 23-Oct-2021)

Ref Expression
Hypotheses limsuppnflem.j ⊢ Ⅎ _ j F
limsuppnflem.a ⊢ φ → A ⊆ ℝ
limsuppnflem.f ⊢ φ → F : A ⟶ ℝ *
Assertion limsuppnflem ⊢ φ → lim sup ⁡ F = +∞ ↔ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j

Proof

Step Hyp Ref Expression
1 limsuppnflem.j ⊢ Ⅎ _ j F
2 limsuppnflem.a ⊢ φ → A ⊆ ℝ
3 limsuppnflem.f ⊢ φ → F : A ⟶ ℝ *
4 id ⊢ φ → φ
5 imnan ⊢ k ≤ j → ¬ x ≤ F ⁡ j ↔ ¬ k ≤ j ∧ x ≤ F ⁡ j
6 5 ralbii ⊢ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j ↔ ∀ j ∈ A ¬ k ≤ j ∧ x ≤ F ⁡ j
7 ralnex ⊢ ∀ j ∈ A ¬ k ≤ j ∧ x ≤ F ⁡ j ↔ ¬ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
8 6 7 bitri ⊢ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j ↔ ¬ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
9 8 rexbii ⊢ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j ↔ ∃ k ∈ ℝ ¬ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
10 rexnal ⊢ ∃ k ∈ ℝ ¬ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j ↔ ¬ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
11 9 10 bitri ⊢ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j ↔ ¬ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
12 11 rexbii ⊢ ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j ↔ ∃ x ∈ ℝ ¬ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
13 rexnal ⊢ ∃ x ∈ ℝ ¬ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j ↔ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
14 12 13 bitri ⊢ ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j ↔ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
15 14 biimpri ⊢ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j
16 simp1 ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → ¬ x ≤ F ⁡ j ∧ k ≤ j → φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A
17 id ⊢ k ≤ j → ¬ x ≤ F ⁡ j → k ≤ j → ¬ x ≤ F ⁡ j
18 17 imp ⊢ k ≤ j → ¬ x ≤ F ⁡ j ∧ k ≤ j → ¬ x ≤ F ⁡ j
19 18 3adant1 ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → ¬ x ≤ F ⁡ j ∧ k ≤ j → ¬ x ≤ F ⁡ j
20 3 ffvelcdmda ⊢ φ ∧ j ∈ A → F ⁡ j ∈ ℝ *
21 20 ad4ant14 ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A → F ⁡ j ∈ ℝ *
22 21 adantr ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → F ⁡ j ∈ ℝ *
23 simpllr ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A → x ∈ ℝ
24 rexr ⊢ x ∈ ℝ → x ∈ ℝ *
25 23 24 syl ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A → x ∈ ℝ *
26 25 adantr ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → x ∈ ℝ *
27 simpr ⊢ φ ∧ x ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → ¬ x ≤ F ⁡ j
28 20 ad4ant13 ⊢ φ ∧ x ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → F ⁡ j ∈ ℝ *
29 24 ad3antlr ⊢ φ ∧ x ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → x ∈ ℝ *
30 28 29 xrltnled ⊢ φ ∧ x ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → F ⁡ j < x ↔ ¬ x ≤ F ⁡ j
31 27 30 mpbird ⊢ φ ∧ x ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → F ⁡ j < x
32 31 adantllr ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → F ⁡ j < x
33 22 26 32 xrltled ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ ¬ x ≤ F ⁡ j → F ⁡ j ≤ x
34 16 19 33 syl2anc ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → ¬ x ≤ F ⁡ j ∧ k ≤ j → F ⁡ j ≤ x
35 34 3exp ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ j ∈ A → k ≤ j → ¬ x ≤ F ⁡ j → k ≤ j → F ⁡ j ≤ x
36 35 ralimdva ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ → ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j → ∀ j ∈ A k ≤ j → F ⁡ j ≤ x
37 36 reximdva ⊢ φ ∧ x ∈ ℝ → ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j → ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x
38 37 reximdva ⊢ φ → ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j → ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x
39 38 imp ⊢ φ ∧ ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → ¬ x ≤ F ⁡ j → ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x
40 4 15 39 syl2an ⊢ φ ∧ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x
41 reex ⊢ ℝ ∈ V
42 41 a1i ⊢ φ → ℝ ∈ V
43 42 2 ssexd ⊢ φ → A ∈ V
44 3 43 fexd ⊢ φ → F ∈ V
45 44 limsupcld ⊢ φ → lim sup ⁡ F ∈ ℝ *
46 45 ad2antrr ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → lim sup ⁡ F ∈ ℝ *
47 24 ad2antlr ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → x ∈ ℝ *
48 pnfxr ⊢ +∞ ∈ ℝ *
49 48 a1i ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → +∞ ∈ ℝ *
50 2 ad2antrr ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → A ⊆ ℝ
51 3 ad2antrr ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → F : A ⟶ ℝ *
52 simpr ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x
53 1 50 51 47 52 limsupbnd1f ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → lim sup ⁡ F ≤ x
54 ltpnf ⊢ x ∈ ℝ → x < +∞
55 54 ad2antlr ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → x < +∞
56 46 47 49 53 55 xrlelttrd ⊢ φ ∧ x ∈ ℝ ∧ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → lim sup ⁡ F < +∞
57 56 rexlimdva2 ⊢ φ → ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → lim sup ⁡ F < +∞
58 57 imp ⊢ φ ∧ ∃ x ∈ ℝ ∃ k ∈ ℝ ∀ j ∈ A k ≤ j → F ⁡ j ≤ x → lim sup ⁡ F < +∞
59 40 58 syldan ⊢ φ ∧ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → lim sup ⁡ F < +∞
60 59 adantlr ⊢ φ ∧ lim sup ⁡ F = +∞ ∧ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → lim sup ⁡ F < +∞
61 id ⊢ lim sup ⁡ F = +∞ → lim sup ⁡ F = +∞
62 48 a1i ⊢ lim sup ⁡ F = +∞ → +∞ ∈ ℝ *
63 61 62 eqeltrd ⊢ lim sup ⁡ F = +∞ → lim sup ⁡ F ∈ ℝ *
64 63 61 xreqnltd ⊢ lim sup ⁡ F = +∞ → ¬ lim sup ⁡ F < +∞
65 64 adantl ⊢ φ ∧ lim sup ⁡ F = +∞ → ¬ lim sup ⁡ F < +∞
66 65 adantr ⊢ φ ∧ lim sup ⁡ F = +∞ ∧ ¬ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → ¬ lim sup ⁡ F < +∞
67 60 66 condan ⊢ φ ∧ lim sup ⁡ F = +∞ → ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
68 67 ex ⊢ φ → lim sup ⁡ F = +∞ → ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
69 2 adantr ⊢ φ ∧ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → A ⊆ ℝ
70 3 adantr ⊢ φ ∧ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → F : A ⟶ ℝ *
71 simpr ⊢ φ ∧ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
72 1 69 70 71 limsuppnfd ⊢ φ ∧ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → lim sup ⁡ F = +∞
73 72 ex ⊢ φ → ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j → lim sup ⁡ F = +∞
74 68 73 impbid ⊢ φ → lim sup ⁡ F = +∞ ↔ ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j