| 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 5105 | . . . . . 6 ⊢ (𝑏 = 𝑦 → ((abs‘(𝐹‘𝑗)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑗)) ≤ 𝑦)) | |
| 6 | 5 | imbi2d 342 | . . . . 5 ⊢ (𝑏 = 𝑦 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 7 | 6 | ralbidv 3186 | . . . 4 ⊢ (𝑏 = 𝑦 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 8 | breq1 5104 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗)) | |
| 9 | 8 | imbi1d 343 | . . . . . 6 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 10 | 9 | ralbidv 3186 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 11 | nfv 1935 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) | |
| 12 | nfv 1935 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑥 | |
| 13 | nfcv 2925 | . . . . . . . . . 10 ⊢ Ⅎ𝑗abs | |
| 14 | limsupref.j | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝐹 | |
| 15 | nfcv 2925 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝑥 | |
| 16 | 14, 15 | nffv 6877 | . . . . . . . . . 10 ⊢ Ⅎ𝑗(𝐹‘𝑥) |
| 17 | 13, 16 | nffv 6877 | . . . . . . . . 9 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) |
| 18 | nfcv 2925 | . . . . . . . . 9 ⊢ Ⅎ𝑗 ≤ | |
| 19 | nfcv 2925 | . . . . . . . . 9 ⊢ Ⅎ𝑗𝑦 | |
| 20 | 17, 18, 19 | nfbr 5148 | . . . . . . . 8 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) ≤ 𝑦 |
| 21 | 12, 20 | nfim 1917 | . . . . . . 7 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦) |
| 22 | breq2 5105 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑥)) | |
| 23 | 2fveq3 6872 | . . . . . . . . 9 ⊢ (𝑗 = 𝑥 → (abs‘(𝐹‘𝑗)) = (abs‘(𝐹‘𝑥))) | |
| 24 | 23 | breq1d 5111 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → ((abs‘(𝐹‘𝑗)) ≤ 𝑦 ↔ (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 25 | 22, 24 | imbi12d 346 | . . . . . . 7 ⊢ (𝑗 = 𝑥 → ((𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 26 | 11, 21, 25 | cbvralw 3305 | . . . . . 6 ⊢ (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 28 | 10, 27 | bitrd 281 | . . . 4 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 29 | 7, 28 | cbvrex2vw 3246 | . . 3 ⊢ (∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 30 | 4, 29 | sylib 220 | . 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 31 | 1, 2, 3, 30 | limsupre 46206 | 1 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 = wceq 1561 ∈ wcel 2143 Ⅎwnfc 2910 ∀wral 3077 ∃wrex 3087 ⊆ wss 3905 class class class wbr 5101 ⟶wf 6517 ‘cfv 6521 supcsup 9384 ℝcr 11083 +∞cpnf 11224 ℝ*cxr 11226 < clt 11227 ≤ cle 11228 abscabs 15271 lim supclsp 15507 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 ax-pre-sup 11162 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9386 df-inf 9387 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-div 11856 df-nn 12221 df-2 12290 df-3 12291 df-n0 12492 df-z 12579 df-uz 12850 df-rp 13004 df-ico 13365 df-seq 14025 df-exp 14085 df-cj 15136 df-re 15137 df-im 15138 df-sqrt 15272 df-abs 15273 df-limsup 15508 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |