Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > liminflelimsup | Structured version Visualization version GIF version |
Description: The superior limit is greater than or equal to the inferior limit. The second hypothesis is needed (see liminflelimsupcex 43726 for a counterexample). The inequality can be strict, see liminfltlimsupex 43710. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
liminflelimsup.1 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
liminflelimsup.2 | ⊢ (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅) |
Ref | Expression |
---|---|
liminflelimsup | ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | liminflelimsup.1 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
2 | liminflelimsup.2 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅) | |
3 | oveq1 7353 | . . . . . 6 ⊢ (𝑘 = 𝑖 → (𝑘[,)+∞) = (𝑖[,)+∞)) | |
4 | 3 | rexeqdv 3312 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑗 ∈ (𝑖[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅)) |
5 | oveq1 7353 | . . . . . . . . . 10 ⊢ (𝑗 = 𝑙 → (𝑗[,)+∞) = (𝑙[,)+∞)) | |
6 | 5 | imaeq2d 6006 | . . . . . . . . 9 ⊢ (𝑗 = 𝑙 → (𝐹 “ (𝑗[,)+∞)) = (𝐹 “ (𝑙[,)+∞))) |
7 | 6 | ineq1d 4166 | . . . . . . . 8 ⊢ (𝑗 = 𝑙 → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*)) |
8 | 7 | neeq1d 3001 | . . . . . . 7 ⊢ (𝑗 = 𝑙 → (((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅)) |
9 | 8 | cbvrexvw 3224 | . . . . . 6 ⊢ (∃𝑗 ∈ (𝑖[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅) |
10 | 9 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ (𝑖[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅)) |
11 | 4, 10 | bitrd 279 | . . . 4 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅)) |
12 | 11 | cbvralvw 3223 | . . 3 ⊢ (∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∀𝑖 ∈ ℝ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅) |
13 | 2, 12 | sylib 217 | . 2 ⊢ (𝜑 → ∀𝑖 ∈ ℝ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅) |
14 | 1, 13 | liminflelimsuplem 43704 | 1 ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 ∩ cin 3904 ∅c0 4277 class class class wbr 5100 “ cima 5630 ‘cfv 6488 (class class class)co 7346 ℝcr 10980 +∞cpnf 11116 ℝ*cxr 11118 ≤ cle 11120 [,)cico 13191 lim supclsp 15283 lim infclsi 43680 |
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 2708 ax-sep 5251 ax-nul 5258 ax-pow 5315 ax-pr 5379 ax-un 7659 ax-cnex 11037 ax-resscn 11038 ax-1cn 11039 ax-icn 11040 ax-addcl 11041 ax-addrcl 11042 ax-mulcl 11043 ax-mulrcl 11044 ax-mulcom 11045 ax-addass 11046 ax-mulass 11047 ax-distr 11048 ax-i2m1 11049 ax-1ne0 11050 ax-1rid 11051 ax-rnegex 11052 ax-rrecex 11053 ax-cnre 11054 ax-pre-lttri 11055 ax-pre-lttrn 11056 ax-pre-ltadd 11057 ax-pre-mulgt0 11058 ax-pre-sup 11059 |
This theorem depends on definitions: df-bi 206 df-an 398 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 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3735 df-csb 3851 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4278 df-if 4482 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4861 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5184 df-id 5525 df-po 5539 df-so 5540 df-xp 5633 df-rel 5634 df-cnv 5635 df-co 5636 df-dm 5637 df-rn 5638 df-res 5639 df-ima 5640 df-iota 6440 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7302 df-ov 7349 df-oprab 7350 df-mpo 7351 df-1st 7908 df-2nd 7909 df-er 8578 df-en 8814 df-dom 8815 df-sdom 8816 df-sup 9308 df-inf 9309 df-pnf 11121 df-mnf 11122 df-xr 11123 df-ltxr 11124 df-le 11125 df-sub 11317 df-neg 11318 df-ico 13195 df-limsup 15284 df-liminf 43681 |
This theorem is referenced by: liminfgelimsup 43711 liminflelimsupuz 43714 |
Copyright terms: Public domain | W3C validator |