![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsup0 | Structured version Visualization version GIF version |
Description: The superior limit of the empty set. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsup0 | ⊢ (lim sup‘∅) = -∞ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ex 5264 | . . 3 ⊢ ∅ ∈ V | |
2 | eqid 2736 | . . . 4 ⊢ (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
3 | 2 | limsupval 15356 | . . 3 ⊢ (∅ ∈ V → (lim sup‘∅) = inf(ran (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
4 | 1, 3 | ax-mp 5 | . 2 ⊢ (lim sup‘∅) = inf(ran (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) |
5 | 0ima 6030 | . . . . . . . . . 10 ⊢ (∅ “ (𝑥[,)+∞)) = ∅ | |
6 | 5 | ineq1i 4168 | . . . . . . . . 9 ⊢ ((∅ “ (𝑥[,)+∞)) ∩ ℝ*) = (∅ ∩ ℝ*) |
7 | 0in 4353 | . . . . . . . . 9 ⊢ (∅ ∩ ℝ*) = ∅ | |
8 | 6, 7 | eqtri 2764 | . . . . . . . 8 ⊢ ((∅ “ (𝑥[,)+∞)) ∩ ℝ*) = ∅ |
9 | 8 | supeq1i 9383 | . . . . . . 7 ⊢ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(∅, ℝ*, < ) |
10 | xrsup0 13242 | . . . . . . 7 ⊢ sup(∅, ℝ*, < ) = -∞ | |
11 | 9, 10 | eqtri 2764 | . . . . . 6 ⊢ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < ) = -∞ |
12 | 11 | mpteq2i 5210 | . . . . 5 ⊢ (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑥 ∈ ℝ ↦ -∞) |
13 | ren0 43627 | . . . . . 6 ⊢ ℝ ≠ ∅ | |
14 | 13 | a1i 11 | . . . . 5 ⊢ (⊤ → ℝ ≠ ∅) |
15 | 12, 14 | rnmptc 7156 | . . . 4 ⊢ (⊤ → ran (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )) = {-∞}) |
16 | 15 | mptru 1548 | . . 3 ⊢ ran (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )) = {-∞} |
17 | 16 | infeq1i 9414 | . 2 ⊢ inf(ran (𝑥 ∈ ℝ ↦ sup(((∅ “ (𝑥[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) = inf({-∞}, ℝ*, < ) |
18 | xrltso 13060 | . . 3 ⊢ < Or ℝ* | |
19 | mnfxr 11212 | . . 3 ⊢ -∞ ∈ ℝ* | |
20 | infsn 9441 | . . 3 ⊢ (( < Or ℝ* ∧ -∞ ∈ ℝ*) → inf({-∞}, ℝ*, < ) = -∞) | |
21 | 18, 19, 20 | mp2an 690 | . 2 ⊢ inf({-∞}, ℝ*, < ) = -∞ |
22 | 4, 17, 21 | 3eqtri 2768 | 1 ⊢ (lim sup‘∅) = -∞ |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ⊤wtru 1542 ∈ wcel 2106 ≠ wne 2943 Vcvv 3445 ∩ cin 3909 ∅c0 4282 {csn 4586 ↦ cmpt 5188 Or wor 5544 ran crn 5634 “ cima 5636 ‘cfv 6496 (class class class)co 7357 supcsup 9376 infcinf 9377 ℝcr 11050 +∞cpnf 11186 -∞cmnf 11187 ℝ*cxr 11188 < clt 11189 [,)cico 13266 lim supclsp 15352 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-po 5545 df-so 5546 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9378 df-inf 9379 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-limsup 15353 |
This theorem is referenced by: climlimsupcex 44000 liminf0 44024 liminflelimsupcex 44028 |
Copyright terms: Public domain | W3C validator |