Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  liminfval5 Structured version   Visualization version   GIF version

Theorem liminfval5 40741
Description: The inferior limit of an infinite sequence 𝐹 of extended real numbers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
Hypotheses
Ref Expression
limsupval5.1 𝑘𝜑
limsupval5.2 (𝜑𝐴𝑉)
limsupval5.3 (𝜑𝐹:𝐴⟶ℝ*)
limsupval5.4 𝐺 = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ))
Assertion
Ref Expression
liminfval5 (𝜑 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < ))
Distinct variable group:   𝑘,𝐹
Allowed substitution hints:   𝜑(𝑘)   𝐴(𝑘)   𝐺(𝑘)   𝑉(𝑘)

Proof of Theorem liminfval5
StepHypRef Expression
1 limsupval5.3 . . . 4 (𝜑𝐹:𝐴⟶ℝ*)
2 limsupval5.2 . . . 4 (𝜑𝐴𝑉)
31, 2fexd 40054 . . 3 (𝜑𝐹 ∈ V)
4 eqid 2799 . . . 4 (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
54liminfval 40735 . . 3 (𝐹 ∈ V → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))
63, 5syl 17 . 2 (𝜑 → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))
7 limsupval5.4 . . . . . 6 𝐺 = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ))
87a1i 11 . . . . 5 (𝜑𝐺 = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )))
9 limsupval5.1 . . . . . 6 𝑘𝜑
101fimassd 40180 . . . . . . . . . 10 (𝜑 → (𝐹 “ (𝑘[,)+∞)) ⊆ ℝ*)
11 df-ss 3783 . . . . . . . . . 10 ((𝐹 “ (𝑘[,)+∞)) ⊆ ℝ* ↔ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) = (𝐹 “ (𝑘[,)+∞)))
1210, 11sylib 210 . . . . . . . . 9 (𝜑 → ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) = (𝐹 “ (𝑘[,)+∞)))
1312eqcomd 2805 . . . . . . . 8 (𝜑 → (𝐹 “ (𝑘[,)+∞)) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*))
1413adantr 473 . . . . . . 7 ((𝜑𝑘 ∈ ℝ) → (𝐹 “ (𝑘[,)+∞)) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*))
1514infeq1d 8625 . . . . . 6 ((𝜑𝑘 ∈ ℝ) → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
169, 15mpteq2da 4936 . . . . 5 (𝜑 → (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
178, 16eqtr2d 2834 . . . 4 (𝜑 → (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺)
1817rneqd 5556 . . 3 (𝜑 → ran (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺)
1918supeq1d 8594 . 2 (𝜑 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < ))
206, 19eqtrd 2833 1 (𝜑 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 385   = wceq 1653  wnf 1879  wcel 2157  Vcvv 3385  cin 3768  wss 3769  cmpt 4922  ran crn 5313  cima 5315  wf 6097  cfv 6101  (class class class)co 6878  supcsup 8588  infcinf 8589  cr 10223  +∞cpnf 10360  *cxr 10362   < clt 10363  [,)cico 12426  lim infclsi 40727
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-rep 4964  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5097  ax-un 7183  ax-cnex 10280  ax-resscn 10281  ax-pre-lttri 10298  ax-pre-lttrn 10299
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ne 2972  df-nel 3075  df-ral 3094  df-rex 3095  df-reu 3096  df-rmo 3097  df-rab 3098  df-v 3387  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-pw 4351  df-sn 4369  df-pr 4371  df-op 4375  df-uni 4629  df-iun 4712  df-br 4844  df-opab 4906  df-mpt 4923  df-id 5220  df-po 5233  df-so 5234  df-xp 5318  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-rn 5323  df-res 5324  df-ima 5325  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-f1 6106  df-fo 6107  df-f1o 6108  df-fv 6109  df-er 7982  df-en 8196  df-dom 8197  df-sdom 8198  df-sup 8590  df-inf 8591  df-pnf 10365  df-mnf 10366  df-xr 10367  df-ltxr 10368  df-liminf 40728
This theorem is referenced by:  liminf10ex  40750
  Copyright terms: Public domain W3C validator