MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  limsupval2 Structured version   Visualization version   GIF version

Theorem limsupval2 14153
Description: The superior limit, relativized to an unbounded set. (Contributed by Mario Carneiro, 7-Sep-2014.) (Revised by AV, 12-Sep-2020.)
Hypotheses
Ref Expression
limsupval.1 𝐺 = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
limsupval2.1 (𝜑𝐹𝑉)
limsupval2.2 (𝜑𝐴 ⊆ ℝ)
limsupval2.3 (𝜑 → sup(𝐴, ℝ*, < ) = +∞)
Assertion
Ref Expression
limsupval2 (𝜑 → (lim sup‘𝐹) = inf((𝐺𝐴), ℝ*, < ))
Distinct variable groups:   𝑘,𝐹   𝐴,𝑘
Allowed substitution hints:   𝜑(𝑘)   𝐺(𝑘)   𝑉(𝑘)

Proof of Theorem limsupval2
Dummy variables 𝑥 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limsupval2.1 . . 3 (𝜑𝐹𝑉)
2 limsupval.1 . . . 4 𝐺 = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
32limsupval 14147 . . 3 (𝐹𝑉 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
41, 3syl 17 . 2 (𝜑 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
5 imassrn 5441 . . . . 5 (𝐺𝐴) ⊆ ran 𝐺
62limsupgf 14148 . . . . . . 7 𝐺:ℝ⟶ℝ*
7 frn 6015 . . . . . . 7 (𝐺:ℝ⟶ℝ* → ran 𝐺 ⊆ ℝ*)
86, 7ax-mp 5 . . . . . 6 ran 𝐺 ⊆ ℝ*
9 infxrlb 12115 . . . . . . 7 ((ran 𝐺 ⊆ ℝ*𝑥 ∈ ran 𝐺) → inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
109ralrimiva 2961 . . . . . 6 (ran 𝐺 ⊆ ℝ* → ∀𝑥 ∈ ran 𝐺inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
118, 10mp1i 13 . . . . 5 (𝜑 → ∀𝑥 ∈ ran 𝐺inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
12 ssralv 3650 . . . . 5 ((𝐺𝐴) ⊆ ran 𝐺 → (∀𝑥 ∈ ran 𝐺inf(ran 𝐺, ℝ*, < ) ≤ 𝑥 → ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥))
135, 11, 12mpsyl 68 . . . 4 (𝜑 → ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
145, 8sstri 3596 . . . . 5 (𝐺𝐴) ⊆ ℝ*
15 infxrcl 12114 . . . . . 6 (ran 𝐺 ⊆ ℝ* → inf(ran 𝐺, ℝ*, < ) ∈ ℝ*)
168, 15ax-mp 5 . . . . 5 inf(ran 𝐺, ℝ*, < ) ∈ ℝ*
17 infxrgelb 12116 . . . . 5 (((𝐺𝐴) ⊆ ℝ* ∧ inf(ran 𝐺, ℝ*, < ) ∈ ℝ*) → (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ↔ ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥))
1814, 16, 17mp2an 707 . . . 4 (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ↔ ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
1913, 18sylibr 224 . . 3 (𝜑 → inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ))
20 limsupval2.3 . . . . . . 7 (𝜑 → sup(𝐴, ℝ*, < ) = +∞)
21 limsupval2.2 . . . . . . . . 9 (𝜑𝐴 ⊆ ℝ)
22 ressxr 10035 . . . . . . . . 9 ℝ ⊆ ℝ*
2321, 22syl6ss 3599 . . . . . . . 8 (𝜑𝐴 ⊆ ℝ*)
24 supxrunb1 12100 . . . . . . . 8 (𝐴 ⊆ ℝ* → (∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥 ↔ sup(𝐴, ℝ*, < ) = +∞))
2523, 24syl 17 . . . . . . 7 (𝜑 → (∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥 ↔ sup(𝐴, ℝ*, < ) = +∞))
2620, 25mpbird 247 . . . . . 6 (𝜑 → ∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥)
27 infxrcl 12114 . . . . . . . . . 10 ((𝐺𝐴) ⊆ ℝ* → inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*)
2814, 27mp1i 13 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*)
2921sselda 3587 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → 𝑥 ∈ ℝ)
3029ad2ant2r 782 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑥 ∈ ℝ)
316ffvelrni 6319 . . . . . . . . . 10 (𝑥 ∈ ℝ → (𝐺𝑥) ∈ ℝ*)
3230, 31syl 17 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) ∈ ℝ*)
336ffvelrni 6319 . . . . . . . . . 10 (𝑛 ∈ ℝ → (𝐺𝑛) ∈ ℝ*)
3433ad2antlr 762 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑛) ∈ ℝ*)
35 ffn 6007 . . . . . . . . . . . 12 (𝐺:ℝ⟶ℝ*𝐺 Fn ℝ)
366, 35mp1i 13 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝐺 Fn ℝ)
3721ad2antrr 761 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝐴 ⊆ ℝ)
38 simprl 793 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑥𝐴)
39 fnfvima 6456 . . . . . . . . . . 11 ((𝐺 Fn ℝ ∧ 𝐴 ⊆ ℝ ∧ 𝑥𝐴) → (𝐺𝑥) ∈ (𝐺𝐴))
4036, 37, 38, 39syl3anc 1323 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) ∈ (𝐺𝐴))
41 infxrlb 12115 . . . . . . . . . 10 (((𝐺𝐴) ⊆ ℝ* ∧ (𝐺𝑥) ∈ (𝐺𝐴)) → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑥))
4214, 40, 41sylancr 694 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑥))
43 simplr 791 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑛 ∈ ℝ)
44 simprr 795 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑛𝑥)
45 limsupgord 14145 . . . . . . . . . . 11 ((𝑛 ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ 𝑛𝑥) → sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ) ≤ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
4643, 30, 44, 45syl3anc 1323 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ) ≤ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
472limsupgval 14149 . . . . . . . . . . 11 (𝑥 ∈ ℝ → (𝐺𝑥) = sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ))
4830, 47syl 17 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) = sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ))
492limsupgval 14149 . . . . . . . . . . 11 (𝑛 ∈ ℝ → (𝐺𝑛) = sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
5049ad2antlr 762 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑛) = sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
5146, 48, 503brtr4d 4650 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) ≤ (𝐺𝑛))
5228, 32, 34, 42, 51xrletrd 11945 . . . . . . . 8 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛))
5352rexlimdvaa 3026 . . . . . . 7 ((𝜑𝑛 ∈ ℝ) → (∃𝑥𝐴 𝑛𝑥 → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5453ralimdva 2957 . . . . . 6 (𝜑 → (∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥 → ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5526, 54mpd 15 . . . . 5 (𝜑 → ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛))
566, 35ax-mp 5 . . . . . 6 𝐺 Fn ℝ
57 breq2 4622 . . . . . . 7 (𝑥 = (𝐺𝑛) → (inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥 ↔ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5857ralrn 6323 . . . . . 6 (𝐺 Fn ℝ → (∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5956, 58ax-mp 5 . . . . 5 (∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛))
6055, 59sylibr 224 . . . 4 (𝜑 → ∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥)
6114, 27ax-mp 5 . . . . 5 inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*
62 infxrgelb 12116 . . . . 5 ((ran 𝐺 ⊆ ℝ* ∧ inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*) → (inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ) ↔ ∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥))
638, 61, 62mp2an 707 . . . 4 (inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ) ↔ ∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥)
6460, 63sylibr 224 . . 3 (𝜑 → inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ))
65 xrletri3 11937 . . . 4 ((inf(ran 𝐺, ℝ*, < ) ∈ ℝ* ∧ inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*) → (inf(ran 𝐺, ℝ*, < ) = inf((𝐺𝐴), ℝ*, < ) ↔ (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ∧ inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ))))
6616, 61, 65mp2an 707 . . 3 (inf(ran 𝐺, ℝ*, < ) = inf((𝐺𝐴), ℝ*, < ) ↔ (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ∧ inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < )))
6719, 64, 66sylanbrc 697 . 2 (𝜑 → inf(ran 𝐺, ℝ*, < ) = inf((𝐺𝐴), ℝ*, < ))
684, 67eqtrd 2655 1 (𝜑 → (lim sup‘𝐹) = inf((𝐺𝐴), ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  wral 2907  wrex 2908  cin 3558  wss 3559   class class class wbr 4618  cmpt 4678  ran crn 5080  cima 5082   Fn wfn 5847  wf 5848  cfv 5852  (class class class)co 6610  supcsup 8298  infcinf 8299  cr 9887  +∞cpnf 10023  *cxr 10025   < clt 10026  cle 10027  [,)cico 12127  lim supclsp 14143
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-cnex 9944  ax-resscn 9945  ax-1cn 9946  ax-icn 9947  ax-addcl 9948  ax-addrcl 9949  ax-mulcl 9950  ax-mulrcl 9951  ax-mulcom 9952  ax-addass 9953  ax-mulass 9954  ax-distr 9955  ax-i2m1 9956  ax-1ne0 9957  ax-1rid 9958  ax-rnegex 9959  ax-rrecex 9960  ax-cnre 9961  ax-pre-lttri 9962  ax-pre-lttrn 9963  ax-pre-ltadd 9964  ax-pre-mulgt0 9965  ax-pre-sup 9966
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-po 5000  df-so 5001  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-riota 6571  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-1st 7120  df-2nd 7121  df-er 7694  df-en 7908  df-dom 7909  df-sdom 7910  df-sup 8300  df-inf 8301  df-pnf 10028  df-mnf 10029  df-xr 10030  df-ltxr 10031  df-le 10032  df-sub 10220  df-neg 10221  df-ico 12131  df-limsup 14144
This theorem is referenced by:  mbflimsup  23356  limsupresico  39364  limsupvaluz  39372
  Copyright terms: Public domain W3C validator