Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupres | Structured version Visualization version GIF version |
Description: The superior limit of a restriction is less than or equal to the original superior limit. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsupres.1 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
Ref | Expression |
---|---|
limsupres | ⊢ (𝜑 → (lim sup‘(𝐹 ↾ 𝐶)) ≤ (lim sup‘𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1911 | . . 3 ⊢ Ⅎ𝑘𝜑 | |
2 | resimass 41503 | . . . . . . . 8 ⊢ ((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ⊆ (𝐹 “ (𝑘[,)+∞)) | |
3 | 2 | a1i 11 | . . . . . . 7 ⊢ (𝑘 ∈ ℝ → ((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ⊆ (𝐹 “ (𝑘[,)+∞))) |
4 | 3 | ssrind 4211 | . . . . . 6 ⊢ (𝑘 ∈ ℝ → (((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*)) |
5 | 4 | adantl 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → (((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*)) |
6 | inss2 4205 | . . . . . 6 ⊢ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ℝ* | |
7 | 6 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ℝ*) |
8 | 5, 7 | sstrd 3976 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → (((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ℝ*) |
9 | 8 | supxrcld 41366 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ ℝ*) |
10 | 7 | supxrcld 41366 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) ∈ ℝ*) |
11 | supxrss 12719 | . . . 4 ⊢ (((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) ∧ ((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*) ⊆ ℝ*) → sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) ≤ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
12 | 5, 7, 11 | syl2anc 586 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < ) ≤ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) |
13 | 1, 9, 10, 12 | infrnmptle 41690 | . 2 ⊢ (𝜑 → inf(ran (𝑘 ∈ ℝ ↦ sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) ≤ inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
14 | limsupres.1 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
15 | 14 | resexd 41396 | . . . 4 ⊢ (𝜑 → (𝐹 ↾ 𝐶) ∈ V) |
16 | eqid 2821 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
17 | 16 | limsupval 14825 | . . . 4 ⊢ ((𝐹 ↾ 𝐶) ∈ V → (lim sup‘(𝐹 ↾ 𝐶)) = inf(ran (𝑘 ∈ ℝ ↦ sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
18 | 15, 17 | syl 17 | . . 3 ⊢ (𝜑 → (lim sup‘(𝐹 ↾ 𝐶)) = inf(ran (𝑘 ∈ ℝ ↦ sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
19 | eqid 2821 | . . . . 5 ⊢ (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
20 | 19 | limsupval 14825 | . . . 4 ⊢ (𝐹 ∈ 𝑉 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
21 | 14, 20 | syl 17 | . . 3 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < )) |
22 | 18, 21 | breq12d 5071 | . 2 ⊢ (𝜑 → ((lim sup‘(𝐹 ↾ 𝐶)) ≤ (lim sup‘𝐹) ↔ inf(ran (𝑘 ∈ ℝ ↦ sup((((𝐹 ↾ 𝐶) “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ) ≤ inf(ran (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ*), ℝ*, < )), ℝ*, < ))) |
23 | 13, 22 | mpbird 259 | 1 ⊢ (𝜑 → (lim sup‘(𝐹 ↾ 𝐶)) ≤ (lim sup‘𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ∩ cin 3934 ⊆ wss 3935 class class class wbr 5058 ↦ cmpt 5138 ran crn 5550 ↾ cres 5551 “ cima 5552 ‘cfv 6349 (class class class)co 7150 supcsup 8898 infcinf 8899 ℝcr 10530 +∞cpnf 10666 ℝ*cxr 10668 < clt 10669 ≤ cle 10670 [,)cico 12734 lim supclsp 14821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-po 5468 df-so 5469 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-sup 8900 df-inf 8901 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-limsup 14822 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |