| 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 1824 | . . . 4 ⊢ Ⅎ𝑘⊤ | |
| 2 | nnex 12216 | . . . . 5 ⊢ ℕ ∈ V | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
| 4 | liminf10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
| 5 | 0xr 11229 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
| 7 | 1xr 11241 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
| 9 | 6, 8 | ifcld 4527 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
| 10 | 4, 9 | fmpti 7093 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
| 12 | eqid 2762 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
| 13 | 1, 3, 11, 12 | liminfval5 46336 | . . 3 ⊢ (⊤ → (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
| 14 | 13 | mptru 1567 | . 2 ⊢ (lim inf‘𝐹) = sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
| 15 | id 22 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
| 16 | 4, 15 | limsup10exlem 46343 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
| 17 | 16 | infeq1d 9424 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = inf({0, 1}, ℝ*, < )) |
| 18 | xrltso 13143 | . . . . . . . . 9 ⊢ < Or ℝ* | |
| 19 | infpr 9451 | . . . . . . . . 9 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ* ∧ 1 ∈ ℝ*) → inf({0, 1}, ℝ*, < ) = if(0 < 1, 0, 1)) | |
| 20 | 18, 5, 7, 19 | mp3an 1482 | . . . . . . . 8 ⊢ inf({0, 1}, ℝ*, < ) = if(0 < 1, 0, 1) |
| 21 | 0lt1 11709 | . . . . . . . . 9 ⊢ 0 < 1 | |
| 22 | 21 | iftruei 4487 | . . . . . . . 8 ⊢ if(0 < 1, 0, 1) = 0 |
| 23 | 20, 22 | eqtri 2785 | . . . . . . 7 ⊢ inf({0, 1}, ℝ*, < ) = 0 |
| 24 | 17, 23 | eqtrdi 2813 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 0) |
| 25 | 24 | mpteq2ia 5195 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 0) |
| 26 | 25 | rneqi 5913 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 0) |
| 27 | eqid 2762 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 0) = (𝑘 ∈ ℝ ↦ 0) | |
| 28 | ren0 45973 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
| 29 | 28 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
| 30 | 27, 29 | rnmptc 7191 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 0) = {0}) |
| 31 | 30 | mptru 1567 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 0) = {0} |
| 32 | 26, 31 | eqtri 2785 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {0} |
| 33 | 32 | supeq1i 9393 | . 2 ⊢ sup(ran (𝑘 ∈ ℝ ↦ inf((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = sup({0}, ℝ*, < ) |
| 34 | supsn 9419 | . . 3 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ*) → sup({0}, ℝ*, < ) = 0) | |
| 35 | 18, 5, 34 | mp2an 702 | . 2 ⊢ sup({0}, ℝ*, < ) = 0 |
| 36 | 14, 33, 35 | 3eqtri 2789 | 1 ⊢ (lim inf‘𝐹) = 0 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1560 ⊤wtru 1561 ∈ wcel 2142 ≠ wne 2957 Vcvv 3454 ∅c0 4285 ifcif 4480 {csn 4582 {cpr 4584 class class class wbr 5100 ↦ cmpt 5181 Or wor 5554 ran crn 5648 “ cima 5650 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 supcsup 9386 infcinf 9387 ℝcr 11072 0cc0 11073 1c1 11074 +∞cpnf 11213 ℝ*cxr 11215 < clt 11216 ℕcn 12210 2c2 12272 [,)cico 13351 ∥ cdvds 16286 lim infclsi 46322 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 ax-pre-sup 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9388 df-inf 9389 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-n0 12482 df-z 12569 df-uz 12840 df-rp 12994 df-ico 13355 df-fl 13802 df-ceil 13803 df-dvds 16287 df-liminf 46323 |
| This theorem is referenced by: liminfltlimsupex 46352 |
| Copyright terms: Public domain | W3C validator |