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

Theorem limsupval 15420
Description: The superior limit of an infinite sequence 𝐹 of extended real numbers, which is the infimum of the set of suprema of all upper infinite subsequences of 𝐹. Definition 12-4.1 of [Gleason] p. 175. (Contributed by NM, 26-Oct-2005.) (Revised by AV, 12-Sep-2014.)
Hypothesis
Ref Expression
limsupval.1 𝐺 = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
Assertion
Ref Expression
limsupval (𝐹𝑉 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
Distinct variable group:   𝑘,𝐹
Allowed substitution hints:   𝐺(𝑘)   𝑉(𝑘)

Proof of Theorem limsupval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elex 3492 . 2 (𝐹𝑉𝐹 ∈ V)
2 imaeq1 6054 . . . . . . . . 9 (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞)))
32ineq1d 4211 . . . . . . . 8 (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*))
43supeq1d 9443 . . . . . . 7 (𝑥 = 𝐹 → sup(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
54mpteq2dv 5250 . . . . . 6 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ sup(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
6 limsupval.1 . . . . . 6 𝐺 = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
75, 6eqtr4di 2790 . . . . 5 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ sup(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺)
87rneqd 5937 . . . 4 (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ sup(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺)
98infeq1d 9474 . . 3 (𝑥 = 𝐹 → inf(ran (𝑘 ∈ ℝ ↦ sup(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = inf(ran 𝐺, ℝ*, < ))
10 df-limsup 15417 . . 3 lim sup = (𝑥 ∈ V ↦ inf(ran (𝑘 ∈ ℝ ↦ sup(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))
11 xrltso 13122 . . . 4 < Or ℝ*
1211infex 9490 . . 3 inf(ran 𝐺, ℝ*, < ) ∈ V
139, 10, 12fvmpt 6998 . 2 (𝐹 ∈ V → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
141, 13syl 17 1 (𝐹𝑉 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2106  Vcvv 3474  cin 3947  cmpt 5231  ran crn 5677  cima 5679  cfv 6543  (class class class)co 7411  supcsup 9437  infcinf 9438  cr 11111  +∞cpnf 11247  *cxr 11249   < clt 11250  [,)cico 13328  lim supclsp 15416
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727  ax-cnex 11168  ax-resscn 11169  ax-pre-lttri 11186  ax-pre-lttrn 11187
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-po 5588  df-so 5589  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-sup 9439  df-inf 9440  df-pnf 11252  df-mnf 11253  df-xr 11254  df-ltxr 11255  df-limsup 15417
This theorem is referenced by:  limsuple  15424  limsupval2  15426  limsupval3  44487  limsup0  44489  limsupresre  44491  limsuplesup  44494  limsuppnfdlem  44496  limsupres  44500  limsupvald  44550  limsupresxr  44561  liminfvalxr  44578
  Copyright terms: Public domain W3C validator