| 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 1811 | . . . 4 ⊢ Ⅎ𝑘⊤ | |
| 2 | nnex 12171 | . . . . 5 ⊢ ℕ ∈ V | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
| 4 | liminf10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
| 5 | 0xr 11183 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
| 7 | 1xr 11195 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
| 9 | 6, 8 | ifcld 4501 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
| 10 | 4, 9 | fmpti 7053 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
| 12 | eqid 2739 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
| 13 | 1, 3, 11, 12 | liminfval5 46208 | . . 3 ⊢ (⊤ → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
| 14 | 13 | mptru 1554 | . 2 ⊢ (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
| 15 | id 22 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
| 16 | 4, 15 | limsup10exlem 46215 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
| 17 | 16 | infeq1d 9381 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = inf({0, 1}, ℝ*, < )) |
| 18 | xrltso 13083 | . . . . . . . . 9 ⊢ < Or ℝ* | |
| 19 | infpr 9408 | . . . . . . . . 9 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ* ∧ 1 ∈ ℝ*) → inf({0, 1}, ℝ*, < ) = if(0 < 1, 0, 1)) | |
| 20 | 18, 5, 7, 19 | mp3an 1469 | . . . . . . . 8 ⊢ inf({0, 1}, ℝ*, < ) = if(0 < 1, 0, 1) |
| 21 | 0lt1 11663 | . . . . . . . . 9 ⊢ 0 < 1 | |
| 22 | 21 | iftruei 4461 | . . . . . . . 8 ⊢ if(0 < 1, 0, 1) = 0 |
| 23 | 20, 22 | eqtri 2762 | . . . . . . 7 ⊢ inf({0, 1}, ℝ*, < ) = 0 |
| 24 | 17, 23 | eqtrdi 2790 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 0) |
| 25 | 24 | mpteq2ia 5167 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 0) |
| 26 | 25 | rneqi 5879 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 0) |
| 27 | eqid 2739 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 0) = (𝑘 ∈ ℝ ↦ 0) | |
| 28 | ren0 45845 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
| 29 | 28 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
| 30 | 27, 29 | rnmptc 7151 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 0) = {0}) |
| 31 | 30 | mptru 1554 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 0) = {0} |
| 32 | 26, 31 | eqtri 2762 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {0} |
| 33 | 32 | supeq1i 9350 | . 2 ⊢ sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = sup({0}, ℝ*, < ) |
| 34 | supsn 9376 | . . 3 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ*) → sup({0}, ℝ*, < ) = 0) | |
| 35 | 18, 5, 34 | mp2an 698 | . 2 ⊢ sup({0}, ℝ*, < ) = 0 |
| 36 | 14, 33, 35 | 3eqtri 2766 | 1 ⊢ (lim inf‘𝐹) = 0 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ⊤wtru 1548 ∈ wcel 2119 ≠ wne 2934 Vcvv 3431 ∅c0 4261 ifcif 4454 {csn 4555 {cpr 4557 class class class wbr 5072 ↦ cmpt 5153 Or wor 5525 ran crn 5619 “ cima 5621 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 supcsup 9343 infcinf 9344 ℝcr 11028 0cc0 11029 1c1 11030 +∞cpnf 11167 ℝ*cxr 11169 < clt 11170 ℕcn 12165 2c2 12227 [,)cico 13291 ∥ cdvds 16212 lim infclsi 46194 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-ico 13295 df-fl 13742 df-ceil 13743 df-dvds 16213 df-liminf 46195 |
| This theorem is referenced by: liminfltlimsupex 46224 |
| Copyright terms: Public domain | W3C validator |