| 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 1805 | . . . 4 ⊢ Ⅎ𝑘⊤ | |
| 2 | nnex 12151 | . . . . 5 ⊢ ℕ ∈ V | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → ℕ ∈ V) |
| 4 | limsup10ex.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1)) | |
| 5 | 0xr 11179 | . . . . . . . 8 ⊢ 0 ∈ ℝ* | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 0 ∈ ℝ*) |
| 7 | 1xr 11191 | . . . . . . . 8 ⊢ 1 ∈ ℝ* | |
| 8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ*) |
| 9 | 6, 8 | ifcld 4526 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → if(2 ∥ 𝑛, 0, 1) ∈ ℝ*) |
| 10 | 4, 9 | fmpti 7057 | . . . . 5 ⊢ 𝐹:ℕ⟶ℝ* |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐹:ℕ⟶ℝ*) |
| 12 | eqid 2736 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) | |
| 13 | 1, 3, 11, 12 | limsupval3 45936 | . . 3 ⊢ (⊤ → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )) |
| 14 | 13 | mptru 1548 | . 2 ⊢ (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) |
| 15 | id 22 | . . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ) | |
| 16 | 4, 15 | limsup10exlem 46016 | . . . . . . . 8 ⊢ (𝑘 ∈ ℝ → (𝐹 “ (𝑘[,)+∞)) = {0, 1}) |
| 17 | 16 | supeq1d 9349 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = sup({0, 1}, ℝ*, < )) |
| 18 | xrltso 13055 | . . . . . . . . 9 ⊢ < Or ℝ* | |
| 19 | suppr 9375 | . . . . . . . . 9 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ* ∧ 1 ∈ ℝ*) → sup({0, 1}, ℝ*, < ) = if(1 < 0, 0, 1)) | |
| 20 | 18, 5, 7, 19 | mp3an 1463 | . . . . . . . 8 ⊢ sup({0, 1}, ℝ*, < ) = if(1 < 0, 0, 1) |
| 21 | 0le1 11660 | . . . . . . . . . 10 ⊢ 0 ≤ 1 | |
| 22 | 0re 11134 | . . . . . . . . . . 11 ⊢ 0 ∈ ℝ | |
| 23 | 1re 11132 | . . . . . . . . . . 11 ⊢ 1 ∈ ℝ | |
| 24 | 22, 23 | lenlti 11253 | . . . . . . . . . 10 ⊢ (0 ≤ 1 ↔ ¬ 1 < 0) |
| 25 | 21, 24 | mpbi 230 | . . . . . . . . 9 ⊢ ¬ 1 < 0 |
| 26 | 25 | iffalsei 4489 | . . . . . . . 8 ⊢ if(1 < 0, 0, 1) = 1 |
| 27 | 20, 26 | eqtri 2759 | . . . . . . 7 ⊢ sup({0, 1}, ℝ*, < ) = 1 |
| 28 | 17, 27 | eqtrdi 2787 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) = 1) |
| 29 | 28 | mpteq2ia 5193 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = (𝑘 ∈ ℝ ↦ 1) |
| 30 | 29 | rneqi 5886 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = ran (𝑘 ∈ ℝ ↦ 1) |
| 31 | eqid 2736 | . . . . . 6 ⊢ (𝑘 ∈ ℝ ↦ 1) = (𝑘 ∈ ℝ ↦ 1) | |
| 32 | ren0 45646 | . . . . . . 7 ⊢ ℝ ≠ ∅ | |
| 33 | 32 | a1i 11 | . . . . . 6 ⊢ (⊤ → ℝ ≠ ∅) |
| 34 | 31, 33 | rnmptc 7153 | . . . . 5 ⊢ (⊤ → ran (𝑘 ∈ ℝ ↦ 1) = {1}) |
| 35 | 34 | mptru 1548 | . . . 4 ⊢ ran (𝑘 ∈ ℝ ↦ 1) = {1} |
| 36 | 30, 35 | eqtri 2759 | . . 3 ⊢ ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )) = {1} |
| 37 | 36 | infeq1i 9382 | . 2 ⊢ inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = inf({1}, ℝ*, < ) |
| 38 | infsn 9410 | . . 3 ⊢ (( < Or ℝ* ∧ 1 ∈ ℝ*) → inf({1}, ℝ*, < ) = 1) | |
| 39 | 18, 7, 38 | mp2an 692 | . 2 ⊢ inf({1}, ℝ*, < ) = 1 |
| 40 | 14, 37, 39 | 3eqtri 2763 | 1 ⊢ (lim sup‘𝐹) = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1541 ⊤wtru 1542 ∈ wcel 2113 ≠ wne 2932 Vcvv 3440 ∅c0 4285 ifcif 4479 {csn 4580 {cpr 4582 class class class wbr 5098 ↦ cmpt 5179 Or wor 5531 ran crn 5625 “ cima 5627 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 supcsup 9343 infcinf 9344 ℝcr 11025 0cc0 11026 1c1 11027 +∞cpnf 11163 ℝ*cxr 11165 < clt 11166 ≤ cle 11167 ℕcn 12145 2c2 12200 [,)cico 13263 lim supclsp 15393 ∥ cdvds 16179 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-ico 13267 df-fl 13712 df-ceil 13713 df-limsup 15394 df-dvds 16180 |
| This theorem is referenced by: liminfltlimsupex 46025 |
| Copyright terms: Public domain | W3C validator |