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

Theorem liminfval 46111
Description: The inferior limit of a set 𝐹. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
Hypothesis
Ref Expression
liminfval.1 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
Assertion
Ref Expression
liminfval (𝐹𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < ))
Distinct variable group:   𝑘,𝐹
Allowed substitution hints:   𝐺(𝑘)   𝑉(𝑘)

Proof of Theorem liminfval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 df-liminf 46104 . 2 lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))
2 imaeq1 6022 . . . . . . . 8 (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞)))
32ineq1d 4173 . . . . . . 7 (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*))
43infeq1d 9393 . . . . . 6 (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
54mpteq2dv 5194 . . . . 5 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
6 liminfval.1 . . . . . 6 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
76a1i 11 . . . . 5 (𝑥 = 𝐹𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
85, 7eqtr4d 2775 . . . 4 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺)
98rneqd 5895 . . 3 (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺)
109supeq1d 9361 . 2 (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < ))
11 elex 3463 . 2 (𝐹𝑉𝐹 ∈ V)
12 xrltso 13067 . . . 4 < Or ℝ*
1312supex 9379 . . 3 sup(ran 𝐺, ℝ*, < ) ∈ V
1413a1i 11 . 2 (𝐹𝑉 → sup(ran 𝐺, ℝ*, < ) ∈ V)
151, 10, 11, 14fvmptd3 6973 1 (𝐹𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  cin 3902  cmpt 5181  ran crn 5633  cima 5635  cfv 6500  (class class class)co 7368  supcsup 9355  infcinf 9356  cr 11037  +∞cpnf 11175  *cxr 11177   < clt 11178  [,)cico 13275  lim infclsi 46103
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-pre-lttri 11112  ax-pre-lttrn 11113
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-po 5540  df-so 5541  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-sup 9357  df-inf 9358  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-liminf 46104
This theorem is referenced by:  liminfcl  46115  liminfvald  46116  liminfval5  46117  liminfresxr  46119  liminfval2  46120  liminfvalxr  46135
  Copyright terms: Public domain W3C validator