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

Theorem limsupval2 14832
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 14826 . . 3 (𝐹𝑉 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
41, 3syl 17 . 2 (𝜑 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
5 imassrn 5939 . . . . 5 (𝐺𝐴) ⊆ ran 𝐺
62limsupgf 14827 . . . . . . 7 𝐺:ℝ⟶ℝ*
7 frn 6519 . . . . . . 7 (𝐺:ℝ⟶ℝ* → ran 𝐺 ⊆ ℝ*)
86, 7ax-mp 5 . . . . . 6 ran 𝐺 ⊆ ℝ*
9 infxrlb 12722 . . . . . . 7 ((ran 𝐺 ⊆ ℝ*𝑥 ∈ ran 𝐺) → inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
109ralrimiva 3187 . . . . . 6 (ran 𝐺 ⊆ ℝ* → ∀𝑥 ∈ ran 𝐺inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
118, 10mp1i 13 . . . . 5 (𝜑 → ∀𝑥 ∈ ran 𝐺inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
12 ssralv 4037 . . . . 5 ((𝐺𝐴) ⊆ ran 𝐺 → (∀𝑥 ∈ ran 𝐺inf(ran 𝐺, ℝ*, < ) ≤ 𝑥 → ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥))
135, 11, 12mpsyl 68 . . . 4 (𝜑 → ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
145, 8sstri 3980 . . . . 5 (𝐺𝐴) ⊆ ℝ*
15 infxrcl 12721 . . . . . 6 (ran 𝐺 ⊆ ℝ* → inf(ran 𝐺, ℝ*, < ) ∈ ℝ*)
168, 15ax-mp 5 . . . . 5 inf(ran 𝐺, ℝ*, < ) ∈ ℝ*
17 infxrgelb 12723 . . . . 5 (((𝐺𝐴) ⊆ ℝ* ∧ inf(ran 𝐺, ℝ*, < ) ∈ ℝ*) → (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ↔ ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥))
1814, 16, 17mp2an 688 . . . 4 (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ↔ ∀𝑥 ∈ (𝐺𝐴)inf(ran 𝐺, ℝ*, < ) ≤ 𝑥)
1913, 18sylibr 235 . . 3 (𝜑 → inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ))
20 limsupval2.3 . . . . . . 7 (𝜑 → sup(𝐴, ℝ*, < ) = +∞)
21 limsupval2.2 . . . . . . . . 9 (𝜑𝐴 ⊆ ℝ)
22 ressxr 10679 . . . . . . . . 9 ℝ ⊆ ℝ*
2321, 22sstrdi 3983 . . . . . . . 8 (𝜑𝐴 ⊆ ℝ*)
24 supxrunb1 12707 . . . . . . . 8 (𝐴 ⊆ ℝ* → (∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥 ↔ sup(𝐴, ℝ*, < ) = +∞))
2523, 24syl 17 . . . . . . 7 (𝜑 → (∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥 ↔ sup(𝐴, ℝ*, < ) = +∞))
2620, 25mpbird 258 . . . . . 6 (𝜑 → ∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥)
27 infxrcl 12721 . . . . . . . . . 10 ((𝐺𝐴) ⊆ ℝ* → inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*)
2814, 27mp1i 13 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*)
2921sselda 3971 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → 𝑥 ∈ ℝ)
3029ad2ant2r 743 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑥 ∈ ℝ)
316ffvelrni 6848 . . . . . . . . . 10 (𝑥 ∈ ℝ → (𝐺𝑥) ∈ ℝ*)
3230, 31syl 17 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) ∈ ℝ*)
336ffvelrni 6848 . . . . . . . . . 10 (𝑛 ∈ ℝ → (𝐺𝑛) ∈ ℝ*)
3433ad2antlr 723 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑛) ∈ ℝ*)
35 ffn 6513 . . . . . . . . . . . 12 (𝐺:ℝ⟶ℝ*𝐺 Fn ℝ)
366, 35mp1i 13 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝐺 Fn ℝ)
3721ad2antrr 722 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝐴 ⊆ ℝ)
38 simprl 767 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑥𝐴)
39 fnfvima 6991 . . . . . . . . . . 11 ((𝐺 Fn ℝ ∧ 𝐴 ⊆ ℝ ∧ 𝑥𝐴) → (𝐺𝑥) ∈ (𝐺𝐴))
4036, 37, 38, 39syl3anc 1365 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) ∈ (𝐺𝐴))
41 infxrlb 12722 . . . . . . . . . 10 (((𝐺𝐴) ⊆ ℝ* ∧ (𝐺𝑥) ∈ (𝐺𝐴)) → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑥))
4214, 40, 41sylancr 587 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑥))
43 simplr 765 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑛 ∈ ℝ)
44 simprr 769 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → 𝑛𝑥)
45 limsupgord 14824 . . . . . . . . . . 11 ((𝑛 ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ 𝑛𝑥) → sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ) ≤ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
4643, 30, 44, 45syl3anc 1365 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ) ≤ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
472limsupgval 14828 . . . . . . . . . . 11 (𝑥 ∈ ℝ → (𝐺𝑥) = sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ))
4830, 47syl 17 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) = sup(((𝐹 “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ))
492limsupgval 14828 . . . . . . . . . . 11 (𝑛 ∈ ℝ → (𝐺𝑛) = sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
5049ad2antlr 723 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑛) = sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ*), ℝ*, < ))
5146, 48, 503brtr4d 5095 . . . . . . . . 9 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → (𝐺𝑥) ≤ (𝐺𝑛))
5228, 32, 34, 42, 51xrletrd 12550 . . . . . . . 8 (((𝜑𝑛 ∈ ℝ) ∧ (𝑥𝐴𝑛𝑥)) → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛))
5352rexlimdvaa 3290 . . . . . . 7 ((𝜑𝑛 ∈ ℝ) → (∃𝑥𝐴 𝑛𝑥 → inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5453ralimdva 3182 . . . . . 6 (𝜑 → (∀𝑛 ∈ ℝ ∃𝑥𝐴 𝑛𝑥 → ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5526, 54mpd 15 . . . . 5 (𝜑 → ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛))
566, 35ax-mp 5 . . . . . 6 𝐺 Fn ℝ
57 breq2 5067 . . . . . . 7 (𝑥 = (𝐺𝑛) → (inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥 ↔ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5857ralrn 6852 . . . . . 6 (𝐺 Fn ℝ → (∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛)))
5956, 58ax-mp 5 . . . . 5 (∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ℝ inf((𝐺𝐴), ℝ*, < ) ≤ (𝐺𝑛))
6055, 59sylibr 235 . . . 4 (𝜑 → ∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥)
6114, 27ax-mp 5 . . . . 5 inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*
62 infxrgelb 12723 . . . . 5 ((ran 𝐺 ⊆ ℝ* ∧ inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*) → (inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ) ↔ ∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥))
638, 61, 62mp2an 688 . . . 4 (inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ) ↔ ∀𝑥 ∈ ran 𝐺inf((𝐺𝐴), ℝ*, < ) ≤ 𝑥)
6460, 63sylibr 235 . . 3 (𝜑 → inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ))
65 xrletri3 12542 . . . 4 ((inf(ran 𝐺, ℝ*, < ) ∈ ℝ* ∧ inf((𝐺𝐴), ℝ*, < ) ∈ ℝ*) → (inf(ran 𝐺, ℝ*, < ) = inf((𝐺𝐴), ℝ*, < ) ↔ (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ∧ inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < ))))
6616, 61, 65mp2an 688 . . 3 (inf(ran 𝐺, ℝ*, < ) = inf((𝐺𝐴), ℝ*, < ) ↔ (inf(ran 𝐺, ℝ*, < ) ≤ inf((𝐺𝐴), ℝ*, < ) ∧ inf((𝐺𝐴), ℝ*, < ) ≤ inf(ran 𝐺, ℝ*, < )))
6719, 64, 66sylanbrc 583 . 2 (𝜑 → inf(ran 𝐺, ℝ*, < ) = inf((𝐺𝐴), ℝ*, < ))
684, 67eqtrd 2861 1 (𝜑 → (lim sup‘𝐹) = inf((𝐺𝐴), ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1530  wcel 2107  wral 3143  wrex 3144  cin 3939  wss 3940   class class class wbr 5063  cmpt 5143  ran crn 5555  cima 5557   Fn wfn 6349  wf 6350  cfv 6354  (class class class)co 7150  supcsup 8898  infcinf 8899  cr 10530  +∞cpnf 10666  *cxr 10668   < clt 10669  cle 10670  [,)cico 12735  lim supclsp 14822
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608  ax-pre-sup 10609
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-nel 3129  df-ral 3148  df-rex 3149  df-reu 3150  df-rmo 3151  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-iun 4919  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5459  df-po 5473  df-so 5474  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7685  df-2nd 7686  df-er 8284  df-en 8504  df-dom 8505  df-sdom 8506  df-sup 8900  df-inf 8901  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-ico 12739  df-limsup 14823
This theorem is referenced by:  mbflimsup  24201  limsupresico  41865  limsupvaluz  41873
  Copyright terms: Public domain W3C validator