| 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 5090 | . . . . . 6 ⊢ (𝑏 = 𝑦 → ((abs‘(𝐹‘𝑗)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑗)) ≤ 𝑦)) | |
| 6 | 5 | imbi2d 340 | . . . . 5 ⊢ (𝑏 = 𝑦 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 7 | 6 | ralbidv 3161 | . . . 4 ⊢ (𝑏 = 𝑦 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 8 | breq1 5089 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗)) | |
| 9 | 8 | imbi1d 341 | . . . . . 6 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 10 | 9 | ralbidv 3161 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦))) |
| 11 | nfv 1916 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) | |
| 12 | nfv 1916 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑥 | |
| 13 | nfcv 2899 | . . . . . . . . . 10 ⊢ Ⅎ𝑗abs | |
| 14 | limsupref.j | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝐹 | |
| 15 | nfcv 2899 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝑥 | |
| 16 | 14, 15 | nffv 6851 | . . . . . . . . . 10 ⊢ Ⅎ𝑗(𝐹‘𝑥) |
| 17 | 13, 16 | nffv 6851 | . . . . . . . . 9 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) |
| 18 | nfcv 2899 | . . . . . . . . 9 ⊢ Ⅎ𝑗 ≤ | |
| 19 | nfcv 2899 | . . . . . . . . 9 ⊢ Ⅎ𝑗𝑦 | |
| 20 | 17, 18, 19 | nfbr 5133 | . . . . . . . 8 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) ≤ 𝑦 |
| 21 | 12, 20 | nfim 1898 | . . . . . . 7 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦) |
| 22 | breq2 5090 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑥)) | |
| 23 | 2fveq3 6846 | . . . . . . . . 9 ⊢ (𝑗 = 𝑥 → (abs‘(𝐹‘𝑗)) = (abs‘(𝐹‘𝑥))) | |
| 24 | 23 | breq1d 5096 | . . . . . . . 8 ⊢ (𝑗 = 𝑥 → ((abs‘(𝐹‘𝑗)) ≤ 𝑦 ↔ (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 25 | 22, 24 | imbi12d 344 | . . . . . . 7 ⊢ (𝑗 = 𝑥 → ((𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 26 | 11, 21, 25 | cbvralw 3280 | . . . . . 6 ⊢ (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 28 | 10, 27 | bitrd 279 | . . . 4 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))) |
| 29 | 7, 28 | cbvrex2vw 3221 | . . 3 ⊢ (∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 30 | 4, 29 | sylib 218 | . 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)) |
| 31 | 1, 2, 3, 30 | limsupre 46069 | 1 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 Ⅎwnfc 2884 ∀wral 3052 ∃wrex 3062 ⊆ wss 3890 class class class wbr 5086 ⟶wf 6495 ‘cfv 6499 supcsup 9353 ℝcr 11037 +∞cpnf 11176 ℝ*cxr 11178 < clt 11179 ≤ cle 11180 abscabs 15196 lim supclsp 15432 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-ico 13304 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-limsup 15433 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |