![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsup10ex | Structured version Visualization version GIF version |
Description: The superior limit of a function that alternates between two values. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
limsup10ex.1 | ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) |
Ref | Expression |
---|---|
limsup10ex | ⊢ (lim sup‘𝐹) = 1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1800 | . . . 4 ⊢ Ⅎ𝑘⊤ | |
2 | nnex 12269 | . . . . 5 ⊢ ℕ ∈ V | |
3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
4 | limsup10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
5 | 0xr 11305 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
7 | 1xr 11317 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
9 | 6, 8 | ifcld 4576 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
10 | 4, 9 | fmpti 7131 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
12 | eqid 2734 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
13 | 1, 3, 11, 12 | limsupval3 45647 | . . 3 ⊢ (⊤ → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
14 | 13 | mptru 1543 | . 2 ⊢ (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
15 | id 22 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
16 | 4, 15 | limsup10exlem 45727 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
17 | 16 | supeq1d 9483 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = sup({0, 1}, ℝ*, < )) |
18 | xrltso 13179 | . . . . . . . . 9 ⊢ < Or ℝ* | |
19 | suppr 9508 | . . . . . . . . 9 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ* ∧ 1 ∈ ℝ*) → sup({0, 1}, ℝ*, < ) = if(1 < 0, 0, 1)) | |
20 | 18, 5, 7, 19 | mp3an 1460 | . . . . . . . 8 ⊢ sup({0, 1}, ℝ*, < ) = if(1 < 0, 0, 1) |
21 | 0le1 11783 | . . . . . . . . . 10 ⊢ 0 ≤ 1 | |
22 | 0re 11260 | . . . . . . . . . . 11 ⊢ 0 ∈ ℝ | |
23 | 1re 11258 | . . . . . . . . . . 11 ⊢ 1 ∈ ℝ | |
24 | 22, 23 | lenlti 11378 | . . . . . . . . . 10 ⊢ (0 ≤ 1 ↔ ¬ 1 < 0) |
25 | 21, 24 | mpbi 230 | . . . . . . . . 9 ⊢ ¬ 1 < 0 |
26 | 25 | iffalsei 4540 | . . . . . . . 8 ⊢ if(1 < 0, 0, 1) = 1 |
27 | 20, 26 | eqtri 2762 | . . . . . . 7 ⊢ sup({0, 1}, ℝ*, < ) = 1 |
28 | 17, 27 | eqtrdi 2790 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 1) |
29 | 28 | mpteq2ia 5250 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 1) |
30 | 29 | rneqi 5950 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 1) |
31 | eqid 2734 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 1) = (𝑘 ∈ ℝ ↦ 1) | |
32 | ren0 45351 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
33 | 32 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
34 | 31, 33 | rnmptc 7226 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 1) = {1}) |
35 | 34 | mptru 1543 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 1) = {1} |
36 | 30, 35 | eqtri 2762 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {1} |
37 | 36 | infeq1i 9515 | . 2 ⊢ inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = inf({1}, ℝ*, < ) |
38 | infsn 9542 | . . 3 ⊢ (( < Or ℝ* ∧ 1 ∈ ℝ*) → inf({1}, ℝ*, < ) = 1) | |
39 | 18, 7, 38 | mp2an 692 | . 2 ⊢ inf({1}, ℝ*, < ) = 1 |
40 | 14, 37, 39 | 3eqtri 2766 | 1 ⊢ (lim sup‘𝐹) = 1 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1536 ⊤wtru 1537 ∈ wcel 2105 ≠ wne 2937 Vcvv 3477 ∅c0 4338 ifcif 4530 {csn 4630 {cpr 4632 class class class wbr 5147 ↦ cmpt 5230 Or wor 5595 ran crn 5689 “ cima 5691 ⟶wf 6558 ‘cfv 6562 (class class class)co 7430 supcsup 9477 infcinf 9478 ℝcr 11151 0cc0 11152 1c1 11153 +∞cpnf 11289 ℝ*cxr 11291 < clt 11292 ≤ cle 11293 ℕcn 12263 2c2 12318 [,)cico 13385 lim supclsp 15502 ∥ cdvds 16286 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 ax-pre-sup 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-sup 9479 df-inf 9480 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-div 11918 df-nn 12264 df-2 12326 df-n0 12524 df-z 12611 df-uz 12876 df-rp 13032 df-ico 13389 df-fl 13828 df-ceil 13829 df-limsup 15503 df-dvds 16287 |
This theorem is referenced by: liminfltlimsupex 45736 |
Copyright terms: Public domain | W3C validator |