Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > liminfgelimsup | Structured version Visualization version GIF version |
Description: The inferior limit is greater than or equal to the superior limit if and only if they are equal. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
liminfgelimsup.1 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
liminfgelimsup.2 | ⊢ (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅) |
Ref | Expression |
---|---|
liminfgelimsup | ⊢ (𝜑 → ((lim sup‘𝐹) ≤ (lim inf‘𝐹) ↔ (lim inf‘𝐹) = (lim sup‘𝐹))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | liminfgelimsup.1 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
2 | 1 | liminfcld 41927 | . . . 4 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℝ*) |
3 | 2 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹)) → (lim inf‘𝐹) ∈ ℝ*) |
4 | 1 | limsupcld 41847 | . . . 4 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ*) |
5 | 4 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹)) → (lim sup‘𝐹) ∈ ℝ*) |
6 | liminfgelimsup.2 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅) | |
7 | 1, 6 | liminflelimsup 41933 | . . . 4 ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹)) |
8 | 7 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹)) → (lim inf‘𝐹) ≤ (lim sup‘𝐹)) |
9 | simpr 485 | . . 3 ⊢ ((𝜑 ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹)) → (lim sup‘𝐹) ≤ (lim inf‘𝐹)) | |
10 | 3, 5, 8, 9 | xrletrid 12536 | . 2 ⊢ ((𝜑 ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹)) → (lim inf‘𝐹) = (lim sup‘𝐹)) |
11 | 4 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ (lim inf‘𝐹) = (lim sup‘𝐹)) → (lim sup‘𝐹) ∈ ℝ*) |
12 | id 22 | . . . . 5 ⊢ ((lim inf‘𝐹) = (lim sup‘𝐹) → (lim inf‘𝐹) = (lim sup‘𝐹)) | |
13 | 12 | eqcomd 2824 | . . . 4 ⊢ ((lim inf‘𝐹) = (lim sup‘𝐹) → (lim sup‘𝐹) = (lim inf‘𝐹)) |
14 | 13 | adantl 482 | . . 3 ⊢ ((𝜑 ∧ (lim inf‘𝐹) = (lim sup‘𝐹)) → (lim sup‘𝐹) = (lim inf‘𝐹)) |
15 | 11, 14 | xreqled 41474 | . 2 ⊢ ((𝜑 ∧ (lim inf‘𝐹) = (lim sup‘𝐹)) → (lim sup‘𝐹) ≤ (lim inf‘𝐹)) |
16 | 10, 15 | impbida 797 | 1 ⊢ (𝜑 → ((lim sup‘𝐹) ≤ (lim inf‘𝐹) ↔ (lim inf‘𝐹) = (lim sup‘𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∀wral 3135 ∃wrex 3136 ∩ cin 3932 ∅c0 4288 class class class wbr 5057 “ cima 5551 ‘cfv 6348 (class class class)co 7145 ℝcr 10524 +∞cpnf 10660 ℝ*cxr 10662 ≤ cle 10664 [,)cico 12728 lim supclsp 14815 lim infclsi 41908 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-1st 7678 df-2nd 7679 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-sup 8894 df-inf 8895 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-ico 12732 df-limsup 14816 df-liminf 41909 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |