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 46984
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 46977 . 2 lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))
2 imaeq1 6060 . . . . . . . 8 (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞)))
32ineq1d 4119 . . . . . . 7 (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*))
43infeq1d 9500 . . . . . 6 (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
54mpteq2dv 5203 . . . . 5 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
6 liminfval.1 . . . . . 6 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))
76a1i 11 . . . . 5 (𝑥 = 𝐹 → 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )))
85, 7eqtr4d 2801 . . . 4 (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺)
98rneqd 5928 . . 3 (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺)
109supeq1d 9468 . 2 (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < ))
11 elex 3475 . 2 (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
12 xrltso 13300 . . . 4 < Or ℝ*
1312supex 9486 . . 3 sup(ran 𝐺, ℝ*, < ) ∈ V
1413a1i 11 . 2 (𝐹 ∈ 𝑉 → sup(ran 𝐺, ℝ*, < ) ∈ V)
151, 10, 11, 14fvmptd3 7043 1 (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   ↦ cmpt 5190  ran crn 5657   “ cima 5659  ‘cfv 6561  (class class class)co 7446  supcsup 9462  infcinf 9463  ℝcr 11229  +∞cpnf 11370  ℝ*cxr 11372   < clt 11373  [,)cico 13508  lim infclsi 46976
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-resscn 11287  ax-pre-lttri 11304  ax-pre-lttrn 11305
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-po 5564  df-so 5565  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-er 8748  df-en 9005  df-dom 9006  df-sdom 9007  df-sup 9464  df-inf 9465  df-pnf 11375  df-mnf 11376  df-xr 11377  df-ltxr 11378  df-liminf 46977
This theorem is used by:  liminfcl  46988  liminfvald  46989  liminfval5  46990  liminfresxr  46992  liminfval2  46993  liminfvalxr  47008
  Copyright terms: Public domain W3C validator