Metamath Proof Explorer


Theorem limsuppnfdlem

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 limsuppnfdlem.a ⊢ φ → A ⊆ ℝ
limsuppnfdlem.f ⊢ φ → F : A ⟶ ℝ *
limsuppnfdlem.u ⊢ φ → ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
limsuppnfdlem.g ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
Assertion limsuppnfdlem ⊢ φ → lim sup ⁡ F = +∞

Proof

Step Hyp Ref Expression
1 limsuppnfdlem.a ⊢ φ → A ⊆ ℝ
2 limsuppnfdlem.f ⊢ φ → F : A ⟶ ℝ *
3 limsuppnfdlem.u ⊢ φ → ∀ x ∈ ℝ ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
4 limsuppnfdlem.g ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
5 reex ⊢ ℝ ∈ V
6 5 a1i ⊢ φ → ℝ ∈ V
7 6 1 ssexd ⊢ φ → A ∈ V
8 2 7 fexd ⊢ φ → F ∈ V
9 4 limsupval ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ G ℝ * <
10 8 9 syl ⊢ φ → lim sup ⁡ F = inf ran ⁡ G ℝ * <
11 2 ffund ⊢ φ → Fun ⁡ F
12 11 adantr ⊢ φ ∧ j ∈ A → Fun ⁡ F
13 simpr ⊢ φ ∧ j ∈ A → j ∈ A
14 2 fdmd ⊢ φ → dom ⁡ F = A
15 14 adantr ⊢ φ ∧ j ∈ A → dom ⁡ F = A
16 13 15 eleqtrrd ⊢ φ ∧ j ∈ A → j ∈ dom ⁡ F
17 12 16 jca ⊢ φ ∧ j ∈ A → Fun ⁡ F ∧ j ∈ dom ⁡ F
18 17 ad4ant13 ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → Fun ⁡ F ∧ j ∈ dom ⁡ F
19 simpllr ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → k ∈ ℝ
20 19 rexrd ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → k ∈ ℝ *
21 pnfxr ⊢ +∞ ∈ ℝ *
22 21 a1i ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → +∞ ∈ ℝ *
23 1 ssrexr ⊢ φ → A ⊆ ℝ *
24 23 sselda ⊢ φ ∧ j ∈ A → j ∈ ℝ *
25 24 ad4ant13 ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → j ∈ ℝ *
26 simpr ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → k ≤ j
27 1 sselda ⊢ φ ∧ j ∈ A → j ∈ ℝ
28 27 ltpnfd ⊢ φ ∧ j ∈ A → j < +∞
29 28 ad4ant13 ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → j < +∞
30 20 22 25 26 29 elicod ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → j ∈ k +∞
31 funfvima ⊢ Fun ⁡ F ∧ j ∈ dom ⁡ F → j ∈ k +∞ → F ⁡ j ∈ F k +∞
32 18 30 31 sylc ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → F ⁡ j ∈ F k +∞
33 2 ffvelcdmda ⊢ φ ∧ j ∈ A → F ⁡ j ∈ ℝ *
34 33 ad4ant13 ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → F ⁡ j ∈ ℝ *
35 32 34 elind ⊢ φ ∧ k ∈ ℝ ∧ j ∈ A ∧ k ≤ j → F ⁡ j ∈ F k +∞ ∩ ℝ *
36 35 adantllr ⊢ φ ∧ k ∈ ℝ ∧ x ∈ ℝ ∧ j ∈ A ∧ k ≤ j → F ⁡ j ∈ F k +∞ ∩ ℝ *
37 36 adantrr ⊢ φ ∧ k ∈ ℝ ∧ x ∈ ℝ ∧ j ∈ A ∧ k ≤ j ∧ x ≤ F ⁡ j → F ⁡ j ∈ F k +∞ ∩ ℝ *
38 simprr ⊢ φ ∧ k ∈ ℝ ∧ x ∈ ℝ ∧ j ∈ A ∧ k ≤ j ∧ x ≤ F ⁡ j → x ≤ F ⁡ j
39 breq2 ⊢ y = F ⁡ j → x ≤ y ↔ x ≤ F ⁡ j
40 39 rspcev ⊢ F ⁡ j ∈ F k +∞ ∩ ℝ * ∧ x ≤ F ⁡ j → ∃ y ∈ F k +∞ ∩ ℝ * x ≤ y
41 37 38 40 syl2anc ⊢ φ ∧ k ∈ ℝ ∧ x ∈ ℝ ∧ j ∈ A ∧ k ≤ j ∧ x ≤ F ⁡ j → ∃ y ∈ F k +∞ ∩ ℝ * x ≤ y
42 3 r19.21bi ⊢ φ ∧ x ∈ ℝ → ∀ k ∈ ℝ ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
43 42 r19.21bi ⊢ φ ∧ x ∈ ℝ ∧ k ∈ ℝ → ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
44 43 an32s ⊢ φ ∧ k ∈ ℝ ∧ x ∈ ℝ → ∃ j ∈ A k ≤ j ∧ x ≤ F ⁡ j
45 41 44 r19.29a ⊢ φ ∧ k ∈ ℝ ∧ x ∈ ℝ → ∃ y ∈ F k +∞ ∩ ℝ * x ≤ y
46 45 ralrimiva ⊢ φ ∧ k ∈ ℝ → ∀ x ∈ ℝ ∃ y ∈ F k +∞ ∩ ℝ * x ≤ y
47 inss2 ⊢ F k +∞ ∩ ℝ * ⊆ ℝ *
48 supxrunb3 ⊢ F k +∞ ∩ ℝ * ⊆ ℝ * → ∀ x ∈ ℝ ∃ y ∈ F k +∞ ∩ ℝ * x ≤ y ↔ sup F k +∞ ∩ ℝ * ℝ * < = +∞
49 47 48 mp1i ⊢ φ ∧ k ∈ ℝ → ∀ x ∈ ℝ ∃ y ∈ F k +∞ ∩ ℝ * x ≤ y ↔ sup F k +∞ ∩ ℝ * ℝ * < = +∞
50 46 49 mpbid ⊢ φ ∧ k ∈ ℝ → sup F k +∞ ∩ ℝ * ℝ * < = +∞
51 50 mpteq2dva ⊢ φ → k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ +∞
52 4 51 eqtrid ⊢ φ → G = k ∈ ℝ ⟼ +∞
53 52 rneqd ⊢ φ → ran ⁡ G = ran ⁡ k ∈ ℝ ⟼ +∞
54 eqid ⊢ k ∈ ℝ ⟼ +∞ = k ∈ ℝ ⟼ +∞
55 ren0 ⊢ ℝ ≠ ∅
56 55 a1i ⊢ φ → ℝ ≠ ∅
57 54 56 rnmptc ⊢ φ → ran ⁡ k ∈ ℝ ⟼ +∞ = +∞
58 53 57 eqtrd ⊢ φ → ran ⁡ G = +∞
59 58 infeq1d ⊢ φ → inf ran ⁡ G ℝ * < = inf +∞ ℝ * <
60 xrltso ⊢ < Or ℝ *
61 infsn ⊢ < Or ℝ * ∧ +∞ ∈ ℝ * → inf +∞ ℝ * < = +∞
62 60 21 61 mp2an ⊢ inf +∞ ℝ * < = +∞
63 62 a1i ⊢ φ → inf +∞ ℝ * < = +∞
64 10 59 63 3eqtrd ⊢ φ → lim sup ⁡ F = +∞