| 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 12266 | . . . . 5 ⊢ ℕ ∈ V | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
| 4 | liminf10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
| 5 | 0xr 11283 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
| 7 | 1xr 11295 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
| 9 | 6, 8 | ifcld 4529 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
| 10 | 4, 9 | fmpti 7106 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
| 12 | eqid 2760 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
| 13 | 1, 3, 11, 12 | liminfval5 46596 | . . 3 ⊢ (⊤ → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
| 14 | 13 | mptru 1577 | . 2 ⊢ (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
| 15 | id 23 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
| 16 | 4, 15 | limsup10exlem 46603 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
| 17 | 16 | infeq1d 9451 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = inf({0, 1}, ℝ*, < )) |
| 18 | xrltso 13195 | . . . . . . . . 9 ⊢ < Or ℝ* | |
| 19 | infpr 9478 | . . . . . . . . 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 11763 | . . . . . . . . 9 ⊢ 0 < 1 | |
| 22 | 21 | iftruei 4489 | . . . . . . . 8 ⊢ if(0 < 1, 0, 1) = 0 |
| 23 | 20, 22 | eqtri 2783 | . . . . . . 7 ⊢ inf({0, 1}, ℝ*, < ) = 0 |
| 24 | 17, 23 | eqtrdi 2811 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 0) |
| 25 | 24 | mpteq2ia 5200 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 0) |
| 26 | 25 | rneqi 5921 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 0) |
| 27 | eqid 2760 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 0) = (𝑘 ∈ ℝ ↦ 0) | |
| 28 | ren0 46233 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
| 29 | 28 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
| 30 | 27, 29 | rnmptc 7207 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 0) = {0}) |
| 31 | 30 | mptru 1577 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 0) = {0} |
| 32 | 26, 31 | eqtri 2783 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {0} |
| 33 | 32 | supeq1i 9420 | . 2 ⊢ sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = sup({0}, ℝ*, < ) |
| 34 | supsn 9446 | . . 3 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ*) → sup({0}, ℝ*, < ) = 0) | |
| 35 | 18, 5, 34 | mp2an 705 | . 2 ⊢ sup({0}, ℝ*, < ) = 0 |
| 36 | 14, 33, 35 | 3eqtri 2787 | 1 ⊢ (lim inf‘𝐹) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ⊤wtru 1571 ∈ wcel 2145 ≠ wne 2955 Vcvv 3450 ∅c0 4279 ifcif 4482 {csn 4584 {cpr 4586 class class class wbr 5103 ↦ cmpt 5186 Or wor 5562 ran crn 5656 “ cima 5658 ⟶wf 6529 ‘cfv 6533 (class class class)co 7414 supcsup 9413 infcinf 9414 ℝcr 11126 0cc0 11127 1c1 11128 +∞cpnf 11267 ℝ*cxr 11269 < clt 11270 ℕcn 12260 2c2 12322 [,)cico 13403 ∥ cdvds 16345 lim infclsi 46582 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-inf 9416 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13046 df-ico 13407 df-fl 13856 df-ceil 13857 df-dvds 16346 df-liminf 46583 |
| This theorem is used by: liminfltlimsupex 46612 |
| Copyright terms: Public domain | W3C validator |