![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > liminfval | Structured version Visualization version GIF version |
Description: The inferior limit of a set 𝐹. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
liminfval.1 | ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) |
Ref | Expression |
---|---|
liminfval | ⊢ (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-liminf 40499 | . 2 ⊢ lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) | |
2 | imaeq1 5601 | . . . . . . . . 9 ⊢ (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞))) | |
3 | 2 | ineq1d 3964 | . . . . . . . 8 ⊢ (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*)) |
4 | 3 | infeq1d 8543 | . . . . . . 7 ⊢ (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) |
5 | 4 | mpteq2dv 4880 | . . . . . 6 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))) |
6 | liminfval.1 | . . . . . . 7 ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
7 | 6 | a1i 11 | . . . . . 6 ⊢ (𝑥 = 𝐹 → 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))) |
8 | 5, 7 | eqtr4d 2808 | . . . . 5 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺) |
9 | 8 | rneqd 5490 | . . . 4 ⊢ (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺) |
10 | 9 | supeq1d 8512 | . . 3 ⊢ (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < )) |
11 | 10 | adantl 467 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑥 = 𝐹) → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < )) |
12 | elex 3364 | . 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V) | |
13 | xrltso 12179 | . . . 4 ⊢ < Or ℝ* | |
14 | 13 | supex 8529 | . . 3 ⊢ sup(ran 𝐺, ℝ*, < ) ∈ V |
15 | 14 | a1i 11 | . 2 ⊢ (𝐹 ∈ 𝑉 → sup(ran 𝐺, ℝ*, < ) ∈ V) |
16 | 1, 11, 12, 15 | fvmptd2 39960 | 1 ⊢ (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1631 ∈ wcel 2145 Vcvv 3351 ∩ cin 3722 ↦ cmpt 4864 ran crn 5251 “ cima 5253 ‘cfv 6030 (class class class)co 6796 supcsup 8506 infcinf 8507 ℝcr 10141 +∞cpnf 10277 ℝ*cxr 10279 < clt 10280 [,)cico 12382 lim infclsi 40498 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-cnex 10198 ax-resscn 10199 ax-pre-lttri 10216 ax-pre-lttrn 10217 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-op 4324 df-uni 4576 df-br 4788 df-opab 4848 df-mpt 4865 df-id 5158 df-po 5171 df-so 5172 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-er 7900 df-en 8114 df-dom 8115 df-sdom 8116 df-sup 8508 df-inf 8509 df-pnf 10282 df-mnf 10283 df-xr 10284 df-ltxr 10285 df-liminf 40499 |
This theorem is referenced by: liminfcl 40510 liminfvald 40511 liminfval5 40512 liminfresxr 40514 liminfval2 40515 liminfvalxr 40530 |
Copyright terms: Public domain | W3C validator |