![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsuplesup | Structured version Visualization version GIF version |
Description: An upper bound for the superior limit. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsuplesup.1 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
limsuplesup.2 | ⊢ (𝜑 → 𝐾 ∈ ℝ) |
Ref | Expression |
---|---|
limsuplesup | ⊢ (𝜑 → (lim sup‘𝐹) ≤ sup(((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*), ℝ*, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | limsuplesup.1 | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
2 | eqid 2727 | . . . 4 ⊢ (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
3 | 2 | limsupval 15436 | . . 3 ⊢ (𝐹 ∈ 𝑉 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
4 | 1, 3 | syl 17 | . 2 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
5 | nfv 1910 | . . 3 ⊢ Ⅎ𝑘𝜑 | |
6 | inss2 4225 | . . . . 5 ⊢ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ℝ* | |
7 | 6 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ℝ*) |
8 | 7 | supxrcld 44386 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ ℝ*) |
9 | limsuplesup.2 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℝ) | |
10 | inss2 4225 | . . . . 5 ⊢ ((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*) ⊆ ℝ* | |
11 | 10 | a1i 11 | . . . 4 ⊢ (𝜑 → ((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*) ⊆ ℝ*) |
12 | 11 | supxrcld 44386 | . . 3 ⊢ (𝜑 → sup(((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ ℝ*) |
13 | oveq1 7421 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑘[,)+∞) = (𝐾[,)+∞)) | |
14 | 13 | imaeq2d 6057 | . . . . 5 ⊢ (𝑘 = 𝐾 → (𝐹 “ (𝑘[,)+∞)) = (𝐹 “ (𝐾[,)+∞))) |
15 | 14 | ineq1d 4207 | . . . 4 ⊢ (𝑘 = 𝐾 → ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) = ((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*)) |
16 | 15 | supeq1d 9455 | . . 3 ⊢ (𝑘 = 𝐾 → sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) = sup(((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*), ℝ*, < )) |
17 | 5, 8, 9, 12, 16 | infxrlbrnmpt2 44705 | . 2 ⊢ (𝜑 → inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) ≤ sup(((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*), ℝ*, < )) |
18 | 4, 17 | eqbrtrd 5164 | 1 ⊢ (𝜑 → (lim sup‘𝐹) ≤ sup(((𝐹 “ (𝐾[,)+∞)) ∩ ℝ*), ℝ*, < )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∩ cin 3943 ⊆ wss 3944 class class class wbr 5142 ↦ cmpt 5225 ran crn 5673 “ cima 5675 ‘cfv 6542 (class class class)co 7414 supcsup 9449 infcinf 9450 ℝcr 11123 +∞cpnf 11261 ℝ*cxr 11263 < clt 11264 ≤ cle 11265 [,)cico 13344 lim supclsp 15432 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-br 5143 df-opab 5205 df-mpt 5226 df-id 5570 df-po 5584 df-so 5585 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-er 8716 df-en 8954 df-dom 8955 df-sdom 8956 df-sup 9451 df-inf 9452 df-pnf 11266 df-mnf 11267 df-xr 11268 df-ltxr 11269 df-le 11270 df-sub 11462 df-neg 11463 df-limsup 15433 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |