| 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 47080 for a counterexample). The inequality can be strict, see liminfltlimsupex 47064. (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 7458 | . . . . . 6 ⊢ (𝑘 = 𝑖 → (𝑘[,)+∞) = (𝑖[,)+∞)) | |
| 4 | 3 | rexeqdv 3324 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑗 ∈ (𝑖[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅)) |
| 5 | oveq1 7458 | . . . . . . . . . 10 ⊢ (𝑗 = 𝑙 → (𝑗[,)+∞) = (𝑙[,)+∞)) | |
| 6 | 5 | imaeq2d 6070 | . . . . . . . . 9 ⊢ (𝑗 = 𝑙 → (𝐹 “ (𝑗[,)+∞)) = (𝐹 “ (𝑙[,)+∞))) |
| 7 | 6 | ineq1d 4119 | . . . . . . . 8 ⊢ (𝑗 = 𝑙 → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*)) |
| 8 | 7 | neeq1d 3018 | . . . . . . 7 ⊢ (𝑗 = 𝑙 → (((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅)) |
| 9 | 8 | cbvrexvw 3245 | . . . . . 6 ⊢ (∃𝑗 ∈ (𝑖[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅) |
| 10 | 9 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ (𝑖[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅)) |
| 11 | 4, 10 | bitrd 282 | . . . 4 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅)) |
| 12 | 11 | cbvralvw 3244 | . . 3 ⊢ (∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅ ↔ ∀𝑖 ∈ ℝ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅) |
| 13 | 2, 12 | sylib 221 | . 2 ⊢ (𝜑 → ∀𝑖 ∈ ℝ ∃𝑙 ∈ (𝑖[,)+∞)((𝐹 “ (𝑙[,)+∞)) ∩ ℝ*) ≠ ∅) |
| 14 | 1, 13 | liminflelimsuplem 47058 | 1 ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 ∩ cin 4092 ∅c0 4281 class class class wbr 5108 “ cima 5661 ‘cfv 6566 (class class class)co 7451 ℝcr 11238 +∞cpnf 11379 ℝ*cxr 11381 ≤ cle 11383 [,)cico 13518 lim supclsp 15681 lim infclsi 47034 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-ico 13522 df-limsup 15682 df-liminf 47035 |
| This theorem is used by: liminfgelimsup 47065 liminflelimsupuz 47068 |
| Copyright terms: Public domain | W3C validator |