| 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 46588 | . 2 ⊢ lim inf = (𝑥 ∈ V ↦ sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) | |
| 2 | imaeq1 6055 | . . . . . . . 8 ⊢ (𝑥 = 𝐹 → (𝑥 “ (𝑘[,)+∞)) = (𝐹 “ (𝑘[,)+∞))) | |
| 3 | 2 | ineq1d 4168 | . . . . . . 7 ⊢ (𝑥 = 𝐹 → ((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*)) |
| 4 | 3 | infeq1d 9452 | . . . . . 6 ⊢ (𝑥 = 𝐹 → inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 5 | 4 | mpteq2dv 5203 | . . . . 5 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))) |
| 6 | liminfval.1 | . . . . . 6 ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (𝑥 = 𝐹 → 𝐺 = (𝑘 ∈ ℝ ↦ inf(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ))) |
| 8 | 5, 7 | eqtr4d 2800 | . . . 4 ⊢ (𝑥 = 𝐹 → (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = 𝐺) |
| 9 | 8 | rneqd 5926 | . . 3 ⊢ (𝑥 = 𝐹 → ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = ran 𝐺) |
| 10 | 9 | supeq1d 9420 | . 2 ⊢ (𝑥 = 𝐹 → sup(ran (𝑘 ∈ ℝ ↦ inf(((𝑥 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = sup(ran 𝐺, ℝ*, < )) |
| 11 | elex 3474 | . 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V) | |
| 12 | xrltso 13196 | . . . 4 ⊢ < Or ℝ* | |
| 13 | 12 | supex 9438 | . . 3 ⊢ sup(ran 𝐺, ℝ*, < ) ∈ V |
| 14 | 13 | a1i 11 | . 2 ⊢ (𝐹 ∈ 𝑉 → sup(ran 𝐺, ℝ*, < ) ∈ V) |
| 15 | 1, 10, 11, 14 | fvmptd3 7014 | 1 ⊢ (𝐹 ∈ 𝑉 → (lim inf‘𝐹) = sup(ran 𝐺, ℝ*, < )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∩ cin 3901 ↦ cmpt 5190 ran crn 5660 “ cima 5662 ‘cfv 6537 (class class class)co 7417 supcsup 9414 infcinf 9415 ℝcr 11127 +∞cpnf 11268 ℝ*cxr 11270 < clt 11271 [,)cico 13404 lim infclsi 46587 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-pre-lttri 11202 ax-pre-lttrn 11203 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-sup 9416 df-inf 9417 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-liminf 46588 |
| This theorem is used by: liminfcl 46599 liminfvald 46600 liminfval5 46601 liminfresxr 46603 liminfval2 46604 liminfvalxr 46619 |
| Copyright terms: Public domain | W3C validator |