| 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 1837 | . . . 4 ⊢ Ⅎ𝑘⊤ | |
| 2 | nnex 12341 | . . . . 5 ⊢ ℕ ∈ V | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
| 4 | liminf10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
| 5 | 0xr 11356 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
| 7 | 1xr 11368 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
| 9 | 6, 8 | ifcld 4529 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
| 10 | 4, 9 | fmpti 7112 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
| 12 | eqid 2761 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
| 13 | 1, 3, 11, 12 | liminfval5 46774 | . . 3 ⊢ (⊤ → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
| 14 | 13 | mptru 1577 | . 2 ⊢ (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
| 15 | id 23 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
| 16 | 4, 15 | limsup10exlem 46781 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
| 17 | 16 | infeq1d 9470 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = inf({0, 1}, ℝ*, < )) |
| 18 | xrltso 13270 | . . . . . . . . 9 ⊢ < Or ℝ* | |
| 19 | infpr 9497 | . . . . . . . . 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 11838 | . . . . . . . . 9 ⊢ 0 < 1 | |
| 22 | 21 | iftruei 4489 | . . . . . . . 8 ⊢ if(0 < 1, 0, 1) = 0 |
| 23 | 20, 22 | eqtri 2784 | . . . . . . 7 ⊢ inf({0, 1}, ℝ*, < ) = 0 |
| 24 | 17, 23 | eqtrdi 2812 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 0) |
| 25 | 24 | mpteq2ia 5200 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 0) |
| 26 | 25 | rneqi 5919 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 0) |
| 27 | eqid 2761 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 0) = (𝑘 ∈ ℝ ↦ 0) | |
| 28 | ren0 46411 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
| 29 | 28 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
| 30 | 27, 29 | rnmptc 7213 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 0) = {0}) |
| 31 | 30 | mptru 1577 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 0) = {0} |
| 32 | 26, 31 | eqtri 2784 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {0} |
| 33 | 32 | supeq1i 9439 | . 2 ⊢ sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = sup({0}, ℝ*, < ) |
| 34 | supsn 9465 | . . 3 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ*) → sup({0}, ℝ*, < ) = 0) | |
| 35 | 18, 5, 34 | mp2an 705 | . 2 ⊢ sup({0}, ℝ*, < ) = 0 |
| 36 | 14, 33, 35 | 3eqtri 2788 | 1 ⊢ (lim inf‘𝐹) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ⊤wtru 1571 ∈ wcel 2145 ≠ wne 2956 Vcvv 3451 ∅c0 4279 ifcif 4482 {csn 4584 {cpr 4586 class class class wbr 5103 ↦ cmpt 5186 Or wor 5558 ran crn 5652 “ cima 5654 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 supcsup 9432 infcinf 9433 ℝcr 11199 0cc0 11200 1c1 11201 +∞cpnf 11340 ℝ*cxr 11342 < clt 11343 ℕcn 12335 2c2 12397 [,)cico 13478 ∥ cdvds 16422 lim infclsi 46760 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-ico 13482 df-fl 13932 df-ceil 13933 df-dvds 16423 df-liminf 46761 |
| This theorem is used by: liminfltlimsupex 46790 |
| Copyright terms: Public domain | W3C validator |