| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > limsuplt2 | Structured version Visualization version GIF version | ||
| Description: The defining property of the superior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
| Ref | Expression |
|---|---|
| limsuplt2.1 | ⊢ (𝜑 → 𝐵 ⊆ ℝ) |
| limsuplt2.2 | ⊢ (𝜑 → 𝐹:𝐵⟶ℝ*) |
| limsuplt2.3 | ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| Ref | Expression |
|---|---|
| limsuplt2 | ⊢ (𝜑 → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | limsuplt2.1 | . . 3 ⊢ (𝜑 → 𝐵 ⊆ ℝ) | |
| 2 | limsuplt2.2 | . . 3 ⊢ (𝜑 → 𝐹:𝐵⟶ℝ*) | |
| 3 | limsuplt2.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
| 4 | eqid 2760 | . . . 4 ⊢ (𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
| 5 | 4 | limsuplt 15652 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ* ∧ 𝐴 ∈ ℝ*) → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑖 ∈ ℝ ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴)) |
| 6 | 1, 2, 3, 5 | syl3anc 1398 | . 2 ⊢ (𝜑 → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑖 ∈ ℝ ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴)) |
| 7 | oveq1 7428 | . . . . . . . 8 ⊢ (𝑗 = 𝑖 → (𝑗[,)+∞) = (𝑖[,)+∞)) | |
| 8 | 7 | imaeq2d 6051 | . . . . . . 7 ⊢ (𝑗 = 𝑖 → (𝐹 “ (𝑗[,)+∞)) = (𝐹 “ (𝑖[,)+∞))) |
| 9 | 8 | ineq1d 4116 | . . . . . 6 ⊢ (𝑗 = 𝑖 → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*)) |
| 10 | 9 | supeq1d 9442 | . . . . 5 ⊢ (𝑗 = 𝑖 → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 11 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → 𝑖 ∈ ℝ) | |
| 12 | xrltso 13274 | . . . . . . 7 ⊢ < Or ℝ* | |
| 13 | 12 | supex 9460 | . . . . . 6 ⊢ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ V |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ V) |
| 15 | 4, 10, 11, 14 | fvmptd3 7018 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) = sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 16 | 15 | breq1d 5112 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → (((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴 ↔ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 17 | 16 | rexbidva 3184 | . 2 ⊢ (𝜑 → (∃𝑖 ∈ ℝ ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴 ↔ ∃𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 18 | oveq1 7428 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (𝑖[,)+∞) = (𝑘[,)+∞)) | |
| 19 | 18 | imaeq2d 6051 | . . . . . . 7 ⊢ (𝑖 = 𝑘 → (𝐹 “ (𝑖[,)+∞)) = (𝐹 “ (𝑘[,)+∞))) |
| 20 | 19 | ineq1d 4116 | . . . . . 6 ⊢ (𝑖 = 𝑘 → ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*)) |
| 21 | 20 | supeq1d 9442 | . . . . 5 ⊢ (𝑖 = 𝑘 → sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 22 | 21 | breq1d 5112 | . . . 4 ⊢ (𝑖 = 𝑘 → (sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴 ↔ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 23 | 22 | cbvrexvw 3241 | . . 3 ⊢ (∃𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴) |
| 24 | 23 | a1i 11 | . 2 ⊢ (𝜑 → (∃𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 25 | 6, 17, 24 | 3bitrd 308 | 1 ⊢ (𝜑 → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 Vcvv 3450 ⊆ wss 3895 ∩ cin 4089 class class class wbr 5102 ↦ cmpt 5185 “ cima 5653 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 supcsup 9436 ℝcr 11203 +∞cpnf 11344 ℝ*cxr 11346 < clt 11347 [,)cico 13482 lim supclsp 15643 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 ax-pre-sup 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-sup 9438 df-inf 9439 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-limsup 15644 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |