Metamath Proof Explorer


Theorem limsupval2

Description: The superior limit, relativized to an unbounded set. (Contributed by Mario Carneiro, 7-Sep-2014) (Revised by AV, 12-Sep-2020)

Ref Expression
Hypotheses limsupval.1 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
limsupval2.1 ⊢ φ → F ∈ V
limsupval2.2 ⊢ φ → A ⊆ ℝ
limsupval2.3 ⊢ φ → sup A ℝ * < = +∞
Assertion limsupval2 ⊢ φ → lim sup ⁡ F = inf G A ℝ * <

Proof

Step Hyp Ref Expression
1 limsupval.1 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
2 limsupval2.1 ⊢ φ → F ∈ V
3 limsupval2.2 ⊢ φ → A ⊆ ℝ
4 limsupval2.3 ⊢ φ → sup A ℝ * < = +∞
5 1 limsupval ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ G ℝ * <
6 2 5 syl ⊢ φ → lim sup ⁡ F = inf ran ⁡ G ℝ * <
7 imassrn ⊢ G A ⊆ ran ⁡ G
8 1 limsupgf ⊢ G : ℝ ⟶ ℝ *
9 frn ⊢ G : ℝ ⟶ ℝ * → ran ⁡ G ⊆ ℝ *
10 8 9 ax-mp ⊢ ran ⁡ G ⊆ ℝ *
11 infxrlb ⊢ ran ⁡ G ⊆ ℝ * ∧ x ∈ ran ⁡ G → inf ran ⁡ G ℝ * < ≤ x
12 11 ralrimiva ⊢ ran ⁡ G ⊆ ℝ * → ∀ x ∈ ran ⁡ G inf ran ⁡ G ℝ * < ≤ x
13 10 12 mp1i ⊢ φ → ∀ x ∈ ran ⁡ G inf ran ⁡ G ℝ * < ≤ x
14 ssralv ⊢ G A ⊆ ran ⁡ G → ∀ x ∈ ran ⁡ G inf ran ⁡ G ℝ * < ≤ x → ∀ x ∈ G A inf ran ⁡ G ℝ * < ≤ x
15 7 13 14 mpsyl ⊢ φ → ∀ x ∈ G A inf ran ⁡ G ℝ * < ≤ x
16 7 10 sstri ⊢ G A ⊆ ℝ *
17 infxrcl ⊢ ran ⁡ G ⊆ ℝ * → inf ran ⁡ G ℝ * < ∈ ℝ *
18 10 17 ax-mp ⊢ inf ran ⁡ G ℝ * < ∈ ℝ *
19 infxrgelb ⊢ G A ⊆ ℝ * ∧ inf ran ⁡ G ℝ * < ∈ ℝ * → inf ran ⁡ G ℝ * < ≤ inf G A ℝ * < ↔ ∀ x ∈ G A inf ran ⁡ G ℝ * < ≤ x
20 16 18 19 mp2an ⊢ inf ran ⁡ G ℝ * < ≤ inf G A ℝ * < ↔ ∀ x ∈ G A inf ran ⁡ G ℝ * < ≤ x
21 15 20 sylibr ⊢ φ → inf ran ⁡ G ℝ * < ≤ inf G A ℝ * <
22 ressxr ⊢ ℝ ⊆ ℝ *
23 3 22 sstrdi ⊢ φ → A ⊆ ℝ *
24 supxrunb1 ⊢ A ⊆ ℝ * → ∀ n ∈ ℝ ∃ x ∈ A n ≤ x ↔ sup A ℝ * < = +∞
25 23 24 syl ⊢ φ → ∀ n ∈ ℝ ∃ x ∈ A n ≤ x ↔ sup A ℝ * < = +∞
26 4 25 mpbird ⊢ φ → ∀ n ∈ ℝ ∃ x ∈ A n ≤ x
27 infxrcl ⊢ G A ⊆ ℝ * → inf G A ℝ * < ∈ ℝ *
28 16 27 mp1i ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → inf G A ℝ * < ∈ ℝ *
29 3 sselda ⊢ φ ∧ x ∈ A → x ∈ ℝ
30 29 ad2ant2r ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → x ∈ ℝ
31 8 ffvelcdmi ⊢ x ∈ ℝ → G ⁡ x ∈ ℝ *
32 30 31 syl ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G ⁡ x ∈ ℝ *
33 8 ffvelcdmi ⊢ n ∈ ℝ → G ⁡ n ∈ ℝ *
34 33 ad2antlr ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G ⁡ n ∈ ℝ *
35 ffn ⊢ G : ℝ ⟶ ℝ * → G Fn ℝ
36 8 35 mp1i ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G Fn ℝ
37 3 ad2antrr ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → A ⊆ ℝ
38 simprl ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → x ∈ A
39 fnfvima ⊢ G Fn ℝ ∧ A ⊆ ℝ ∧ x ∈ A → G ⁡ x ∈ G A
40 36 37 38 39 syl3anc ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G ⁡ x ∈ G A
41 infxrlb ⊢ G A ⊆ ℝ * ∧ G ⁡ x ∈ G A → inf G A ℝ * < ≤ G ⁡ x
42 16 40 41 sylancr ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → inf G A ℝ * < ≤ G ⁡ x
43 simplr ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → n ∈ ℝ
44 simprr ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → n ≤ x
45 limsupgord ⊢ n ∈ ℝ ∧ x ∈ ℝ ∧ n ≤ x → sup F x +∞ ∩ ℝ * ℝ * < ≤ sup F n +∞ ∩ ℝ * ℝ * <
46 43 30 44 45 syl3anc ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → sup F x +∞ ∩ ℝ * ℝ * < ≤ sup F n +∞ ∩ ℝ * ℝ * <
47 1 limsupgval ⊢ x ∈ ℝ → G ⁡ x = sup F x +∞ ∩ ℝ * ℝ * <
48 30 47 syl ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G ⁡ x = sup F x +∞ ∩ ℝ * ℝ * <
49 1 limsupgval ⊢ n ∈ ℝ → G ⁡ n = sup F n +∞ ∩ ℝ * ℝ * <
50 49 ad2antlr ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G ⁡ n = sup F n +∞ ∩ ℝ * ℝ * <
51 46 48 50 3brtr4d ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → G ⁡ x ≤ G ⁡ n
52 28 32 34 42 51 xrletrd ⊢ φ ∧ n ∈ ℝ ∧ x ∈ A ∧ n ≤ x → inf G A ℝ * < ≤ G ⁡ n
53 52 rexlimdvaa ⊢ φ ∧ n ∈ ℝ → ∃ x ∈ A n ≤ x → inf G A ℝ * < ≤ G ⁡ n
54 53 ralimdva ⊢ φ → ∀ n ∈ ℝ ∃ x ∈ A n ≤ x → ∀ n ∈ ℝ inf G A ℝ * < ≤ G ⁡ n
55 26 54 mpd ⊢ φ → ∀ n ∈ ℝ inf G A ℝ * < ≤ G ⁡ n
56 8 35 ax-mp ⊢ G Fn ℝ
57 breq2 ⊢ x = G ⁡ n → inf G A ℝ * < ≤ x ↔ inf G A ℝ * < ≤ G ⁡ n
58 57 ralrn ⊢ G Fn ℝ → ∀ x ∈ ran ⁡ G inf G A ℝ * < ≤ x ↔ ∀ n ∈ ℝ inf G A ℝ * < ≤ G ⁡ n
59 56 58 ax-mp ⊢ ∀ x ∈ ran ⁡ G inf G A ℝ * < ≤ x ↔ ∀ n ∈ ℝ inf G A ℝ * < ≤ G ⁡ n
60 55 59 sylibr ⊢ φ → ∀ x ∈ ran ⁡ G inf G A ℝ * < ≤ x
61 16 27 ax-mp ⊢ inf G A ℝ * < ∈ ℝ *
62 infxrgelb ⊢ ran ⁡ G ⊆ ℝ * ∧ inf G A ℝ * < ∈ ℝ * → inf G A ℝ * < ≤ inf ran ⁡ G ℝ * < ↔ ∀ x ∈ ran ⁡ G inf G A ℝ * < ≤ x
63 10 61 62 mp2an ⊢ inf G A ℝ * < ≤ inf ran ⁡ G ℝ * < ↔ ∀ x ∈ ran ⁡ G inf G A ℝ * < ≤ x
64 60 63 sylibr ⊢ φ → inf G A ℝ * < ≤ inf ran ⁡ G ℝ * <
65 xrletri3 ⊢ inf ran ⁡ G ℝ * < ∈ ℝ * ∧ inf G A ℝ * < ∈ ℝ * → inf ran ⁡ G ℝ * < = inf G A ℝ * < ↔ inf ran ⁡ G ℝ * < ≤ inf G A ℝ * < ∧ inf G A ℝ * < ≤ inf ran ⁡ G ℝ * <
66 18 61 65 mp2an ⊢ inf ran ⁡ G ℝ * < = inf G A ℝ * < ↔ inf ran ⁡ G ℝ * < ≤ inf G A ℝ * < ∧ inf G A ℝ * < ≤ inf ran ⁡ G ℝ * <
67 21 64 66 sylanbrc ⊢ φ → inf ran ⁡ G ℝ * < = inf G A ℝ * <
68 6 67 eqtrd ⊢ φ → lim sup ⁡ F = inf G A ℝ * <