| 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 5112 | . . . . . 6 ⊢ (𝑏 = 𝑦 → ((abs‘(𝐹‘𝑗)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑗)) ≤ 𝑦)) | |
| 6 | 5 | imbi2d 343 | . . . . 5 ⊢ (𝑏 = 𝑦 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 7 | 6 | ralbidv 3186 | . . . 4 ⊢ (𝑏 = 𝑦 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 8 | breq1 5111 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗)) | |
| 9 | 8 | imbi1d 344 | . . . . . 6 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 10 | 9 | ralbidv 3186 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 11 | nfv 1942 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) | |
| 12 | nfv 1942 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑥 | |
| 13 | nfcv 2923 | . . . . . . . . . 10 ⊢ Ⅎ𝑗abs | |
| 14 | limsupref.j | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝐹 | |
| 15 | nfcv 2923 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝑥 | |
| 16 | 14, 15 | nffv 6891 | . . . . . . . . . 10 ⊢ Ⅎ𝑗(𝐹‘𝑥) |
| 17 | 13, 16 | nffv 6891 | . . . . . . . . 9 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) |
| 18 | nfcv 2923 | . . . . . . . . 9 ⊢ Ⅎ𝑗 ≤ | |
| 19 | nfcv 2923 | . . . . . . . . 9 ⊢ Ⅎ𝑗𝑦 | |
| 20 | 17, 18, 19 | nfbr 5157 | . . . . . . . 8 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) ≤ 𝑦 |
| 21 | 12, 20 | nfim 1924 | . . . . . . 7 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦) |
| 22 | breq2 5112 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑥)) | |
| 23 | 2fveq3 6886 | . . . . . . . . 9 ⊢ (𝑗 = 𝑥 → (abs‘(𝐹‘𝑗)) = (abs‘(𝐹‘𝑥))) | |
| 24 | 23 | breq1d 5118 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → ((abs‘(𝐹‘𝑗)) ≤ 𝑦 ↔ (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 25 | 22, 24 | imbi12d 347 | . . . . . . 7 ⊢ (𝑗 = 𝑥 → ((𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 26 | 11, 21, 25 | cbvralw 3305 | . . . . . 6 ⊢ (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 28 | 10, 27 | bitrd 282 | . . . 4 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 29 | 7, 28 | cbvrex2vw 3246 | . . 3 ⊢ (∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 30 | 4, 29 | sylib 221 | . 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 31 | 1, 2, 3, 30 | limsupre 46325 | 1 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1568 ∈ wcel 2141 Ⅎwnfc 2908 ∀wral 3077 ∃wrex 3087 ⊆ wss 3904 class class class wbr 5108 ⟶wf 6532 ‘cfv 6536 supcsup 9399 ℝcr 11098 +∞cpnf 11239 ℝ*cxr 11241 < clt 11242 ≤ cle 11243 abscabs 15284 lim supclsp 15520 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-sup 9401 df-inf 9402 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-rp 13016 df-ico 13377 df-seq 14037 df-exp 14097 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-limsup 15521 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |