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 46297
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 46290 . 2 lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))
2 imaeq1 6041 . . . . . . . 8 (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞)))
32ineq1d 4171 . . . . . . 7 (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*))
43infeq1d 9421 . . . . . 6 (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
54mpteq2dv 5193 . . . . 5 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
6 liminfval.1 . . . . . 6 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
76a1i 11 . . . . 5 (𝑥 = 𝐹𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
85, 7eqtr4d 2799 . . . 4 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺)
98rneqd 5912 . . 3 (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺)
109supeq1d 9389 . 2 (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < ))
11 elex 3474 . 2 (𝐹𝑉𝐹 ∈ V)
12 xrltso 13140 . . . 4 < Or ℝ*
1312supex 9407 . . 3 sup(ran 𝐺, ℝ*, < ) ∈ V
1413a1i 11 . 2 (𝐹𝑉 → sup(ran 𝐺, ℝ*, < ) ∈ V)
151, 10, 11, 14fvmptd3 6995 1 (𝐹𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1559  wcel 2141  Vcvv 3453  cin 3903  cmpt 5180  ran crn 5646  cima 5648  cfv 6517  (class class class)co 7392  supcsup 9383  infcinf 9384  cr 11069  +∞cpnf 11210  *cxr 11212   < clt 11213  [,)cico 13348  lim infclsi 46289
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126  ax-resscn 11127  ax-pre-lttri 11144  ax-pre-lttrn 11145
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-po 5553  df-so 5554  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-er 8673  df-en 8924  df-dom 8925  df-sdom 8926  df-sup 9385  df-inf 9386  df-pnf 11215  df-mnf 11216  df-xr 11217  df-ltxr 11218  df-liminf 46290
This theorem is referenced by:  liminfcl  46301  liminfvald  46302  liminfval5  46303  liminfresxr  46305  liminfval2  46306  liminfvalxr  46321
  Copyright terms: Public domain W3C validator