| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > liminf10ex | Structured version Visualization version GIF version | ||
| Description: The inferior limit of a function that alternates between two values. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
| Ref | Expression |
|---|---|
| liminf10ex.1 | ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) |
| Ref | Expression |
|---|---|
| liminf10ex | ⊢ (lim inf‘𝐹) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nftru 1836 | . . . 4 ⊢ Ⅎ𝑘⊤ | |
| 2 | nnex 12351 | . . . . 5 ⊢ ℕ ∈ V | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
| 4 | liminf10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
| 5 | 0xr 11366 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
| 7 | 1xr 11378 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
| 9 | 6, 8 | ifcld 4531 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
| 10 | 4, 9 | fmpti 7120 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
| 12 | eqid 2763 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
| 13 | 1, 3, 11, 12 | liminfval5 46914 | . . 3 ⊢ (⊤ → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
| 14 | 13 | mptru 1576 | . 2 ⊢ (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
| 15 | id 23 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
| 16 | 4, 15 | limsup10exlem 46921 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
| 17 | 16 | infeq1d 9480 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = inf({0, 1}, ℝ*, < )) |
| 18 | xrltso 13280 | . . . . . . . . 9 ⊢ < Or ℝ* | |
| 19 | infpr 9507 | . . . . . . . . 9 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ* ∧ 1 ∈ ℝ*) → inf({0, 1}, ℝ*, < ) = if(0 < 1, 0, 1)) | |
| 20 | 18, 5, 7, 19 | mp3an 1490 | . . . . . . . 8 ⊢ inf({0, 1}, ℝ*, < ) = if(0 < 1, 0, 1) |
| 21 | 0lt1 11848 | . . . . . . . . 9 ⊢ 0 < 1 | |
| 22 | 21 | iftruei 4491 | . . . . . . . 8 ⊢ if(0 < 1, 0, 1) = 0 |
| 23 | 20, 22 | eqtri 2786 | . . . . . . 7 ⊢ inf({0, 1}, ℝ*, < ) = 0 |
| 24 | 17, 23 | eqtrdi 2814 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 0) |
| 25 | 24 | mpteq2ia 5202 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 0) |
| 26 | 25 | rneqi 5923 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 0) |
| 27 | eqid 2763 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 0) = (𝑘 ∈ ℝ ↦ 0) | |
| 28 | ren0 46551 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
| 29 | 28 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
| 30 | 27, 29 | rnmptc 7220 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 0) = {0}) |
| 31 | 30 | mptru 1576 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 0) = {0} |
| 32 | 26, 31 | eqtri 2786 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {0} |
| 33 | 32 | supeq1i 9449 | . 2 ⊢ sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = sup({0}, ℝ*, < ) |
| 34 | supsn 9475 | . . 3 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ*) → sup({0}, ℝ*, < ) = 0) | |
| 35 | 18, 5, 34 | mp2an 705 | . 2 ⊢ sup({0}, ℝ*, < ) = 0 |
| 36 | 14, 33, 35 | 3eqtri 2790 | 1 ⊢ (lim inf‘𝐹) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ⊤wtru 1570 ∈ wcel 2146 ≠ wne 2958 Vcvv 3453 ∅c0 4280 ifcif 4484 {csn 4587 {cpr 4589 class class class wbr 5105 ↦ cmpt 5188 Or wor 5561 ran crn 5655 “ cima 5657 ⟶wf 6542 ‘cfv 6546 (class class class)co 7427 supcsup 9442 infcinf 9443 ℝcr 11209 0cc0 11210 1c1 11211 +∞cpnf 11350 ℝ*cxr 11352 < clt 11353 ℕcn 12345 2c2 12407 [,)cico 13488 ∥ cdvds 16434 lim infclsi 46900 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 ax-pre-sup 11288 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9444 df-inf 9445 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-2 12415 df-n0 12617 df-z 12704 df-uz 12976 df-rp 13131 df-ico 13492 df-fl 13942 df-ceil 13943 df-dvds 16435 df-liminf 46901 |
| This theorem is used by: liminfltlimsupex 46930 |
| Copyright terms: Public domain | W3C validator |