![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupref | Structured version Visualization version GIF version |
Description: If a sequence is bounded, then the limsup is real. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsupref.j | ⊢ Ⅎ𝑗𝐹 |
limsupref.a | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
limsupref.s | ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) |
limsupref.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) |
limsupref.b | ⊢ (𝜑 → ∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) |
Ref | Expression |
---|---|
limsupref | ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | limsupref.a | . 2 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
2 | limsupref.s | . 2 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) | |
3 | limsupref.f | . 2 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) | |
4 | limsupref.b | . . 3 ⊢ (𝜑 → ∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) | |
5 | breq2 5155 | . . . . . 6 ⊢ (𝑏 = 𝑦 → ((abs‘(𝐹‘𝑗)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑗)) ≤ 𝑦)) | |
6 | 5 | imbi2d 340 | . . . . 5 ⊢ (𝑏 = 𝑦 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
7 | 6 | ralbidv 3178 | . . . 4 ⊢ (𝑏 = 𝑦 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
8 | breq1 5154 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗)) | |
9 | 8 | imbi1d 341 | . . . . . 6 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
10 | 9 | ralbidv 3178 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
11 | nfv 1914 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) | |
12 | nfv 1914 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑥 | |
13 | nfcv 2905 | . . . . . . . . . 10 ⊢ Ⅎ𝑗abs | |
14 | limsupref.j | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝐹 | |
15 | nfcv 2905 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝑥 | |
16 | 14, 15 | nffv 6924 | . . . . . . . . . 10 ⊢ Ⅎ𝑗(𝐹‘𝑥) |
17 | 13, 16 | nffv 6924 | . . . . . . . . 9 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) |
18 | nfcv 2905 | . . . . . . . . 9 ⊢ Ⅎ𝑗 ≤ | |
19 | nfcv 2905 | . . . . . . . . 9 ⊢ Ⅎ𝑗𝑦 | |
20 | 17, 18, 19 | nfbr 5198 | . . . . . . . 8 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) ≤ 𝑦 |
21 | 12, 20 | nfim 1896 | . . . . . . 7 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦) |
22 | breq2 5155 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑥)) | |
23 | 2fveq3 6919 | . . . . . . . . 9 ⊢ (𝑗 = 𝑥 → (abs‘(𝐹‘𝑗)) = (abs‘(𝐹‘𝑥))) | |
24 | 23 | breq1d 5161 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → ((abs‘(𝐹‘𝑗)) ≤ 𝑦 ↔ (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
25 | 22, 24 | imbi12d 344 | . . . . . . 7 ⊢ (𝑗 = 𝑥 → ((𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
26 | 11, 21, 25 | cbvralw 3306 | . . . . . 6 ⊢ (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
27 | 26 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
28 | 10, 27 | bitrd 279 | . . . 4 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
29 | 7, 28 | cbvrex2vw 3242 | . . 3 ⊢ (∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
30 | 4, 29 | sylib 218 | . 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
31 | 1, 2, 3, 30 | limsupre 45625 | 1 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1539 ∈ wcel 2108 Ⅎwnfc 2890 ∀wral 3061 ∃wrex 3070 ⊆ wss 3966 class class class wbr 5151 ⟶wf 6565 ‘cfv 6569 supcsup 9487 ℝcr 11161 +∞cpnf 11299 ℝ*cxr 11301 < clt 11302 ≤ cle 11303 abscabs 15279 lim supclsp 15512 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5288 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 ax-cnex 11218 ax-resscn 11219 ax-1cn 11220 ax-icn 11221 ax-addcl 11222 ax-addrcl 11223 ax-mulcl 11224 ax-mulrcl 11225 ax-mulcom 11226 ax-addass 11227 ax-mulass 11228 ax-distr 11229 ax-i2m1 11230 ax-1ne0 11231 ax-1rid 11232 ax-rnegex 11233 ax-rrecex 11234 ax-cnre 11235 ax-pre-lttri 11236 ax-pre-lttrn 11237 ax-pre-ltadd 11238 ax-pre-mulgt0 11239 ax-pre-sup 11240 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-csb 3912 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-pss 3986 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-iun 5001 df-br 5152 df-opab 5214 df-mpt 5235 df-tr 5269 df-id 5587 df-eprel 5593 df-po 5601 df-so 5602 df-fr 5645 df-we 5647 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-pred 6329 df-ord 6395 df-on 6396 df-lim 6397 df-suc 6398 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-riota 7395 df-ov 7441 df-oprab 7442 df-mpo 7443 df-om 7895 df-2nd 8023 df-frecs 8314 df-wrecs 8345 df-recs 8419 df-rdg 8458 df-er 8753 df-en 8994 df-dom 8995 df-sdom 8996 df-sup 9489 df-inf 9490 df-pnf 11304 df-mnf 11305 df-xr 11306 df-ltxr 11307 df-le 11308 df-sub 11501 df-neg 11502 df-div 11928 df-nn 12274 df-2 12336 df-3 12337 df-n0 12534 df-z 12621 df-uz 12886 df-rp 13042 df-ico 13399 df-seq 14049 df-exp 14109 df-cj 15144 df-re 15145 df-im 15146 df-sqrt 15280 df-abs 15281 df-limsup 15513 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |