| 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 2730 | . . . 4 ⊢ (𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
| 5 | 4 | limsuplt 15452 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ* ∧ 𝐴 ∈ ℝ*) → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑖 ∈ ℝ ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴)) |
| 6 | 1, 2, 3, 5 | syl3anc 1373 | . 2 ⊢ (𝜑 → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑖 ∈ ℝ ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴)) |
| 7 | oveq1 7397 | . . . . . . . 8 ⊢ (𝑗 = 𝑖 → (𝑗[,)+∞) = (𝑖[,)+∞)) | |
| 8 | 7 | imaeq2d 6034 | . . . . . . 7 ⊢ (𝑗 = 𝑖 → (𝐹 “ (𝑗[,)+∞)) = (𝐹 “ (𝑖[,)+∞))) |
| 9 | 8 | ineq1d 4185 | . . . . . 6 ⊢ (𝑗 = 𝑖 → ((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*)) |
| 10 | 9 | supeq1d 9404 | . . . . 5 ⊢ (𝑗 = 𝑖 → sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 11 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → 𝑖 ∈ ℝ) | |
| 12 | xrltso 13108 | . . . . . . 7 ⊢ < Or ℝ* | |
| 13 | 12 | supex 9422 | . . . . . 6 ⊢ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ V |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ V) |
| 15 | 4, 10, 11, 14 | fvmptd3 6994 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) = sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 16 | 15 | breq1d 5120 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ ℝ) → (((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴 ↔ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 17 | 16 | rexbidva 3156 | . 2 ⊢ (𝜑 → (∃𝑖 ∈ ℝ ((𝑗 ∈ ℝ ↦ sup(((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*), ℝ*, < ))‘𝑖) < 𝐴 ↔ ∃𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 18 | oveq1 7397 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (𝑖[,)+∞) = (𝑘[,)+∞)) | |
| 19 | 18 | imaeq2d 6034 | . . . . . . 7 ⊢ (𝑖 = 𝑘 → (𝐹 “ (𝑖[,)+∞)) = (𝐹 “ (𝑘[,)+∞))) |
| 20 | 19 | ineq1d 4185 | . . . . . 6 ⊢ (𝑖 = 𝑘 → ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*)) |
| 21 | 20 | supeq1d 9404 | . . . . 5 ⊢ (𝑖 = 𝑘 → sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) |
| 22 | 21 | breq1d 5120 | . . . 4 ⊢ (𝑖 = 𝑘 → (sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴 ↔ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 23 | 22 | cbvrexvw 3217 | . . 3 ⊢ (∃𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴) |
| 24 | 23 | a1i 11 | . 2 ⊢ (𝜑 → (∃𝑖 ∈ ℝ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| 25 | 6, 17, 24 | 3bitrd 305 | 1 ⊢ (𝜑 → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑘 ∈ ℝ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) < 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃wrex 3054 Vcvv 3450 ∩ cin 3916 ⊆ wss 3917 class class class wbr 5110 ↦ cmpt 5191 “ cima 5644 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 supcsup 9398 ℝcr 11074 +∞cpnf 11212 ℝ*cxr 11214 < clt 11215 [,)cico 13315 lim supclsp 15443 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9400 df-inf 9401 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-limsup 15444 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |