Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > caurcvg | Structured version Visualization version GIF version |
Description: A Cauchy sequence of real numbers converges to its limit supremum. The fourth hypothesis specifies that 𝐹 is a Cauchy sequence. (Contributed by NM, 4-Apr-2005.) (Revised by AV, 12-Sep-2020.) |
Ref | Expression |
---|---|
caurcvg.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
caurcvg.3 | ⊢ (𝜑 → 𝐹:𝑍⟶ℝ) |
caurcvg.4 | ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) |
Ref | Expression |
---|---|
caurcvg | ⊢ (𝜑 → 𝐹 ⇝ (lim sup‘𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caurcvg.1 | . . . . . 6 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
2 | uzssz 12603 | . . . . . 6 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
3 | 1, 2 | eqsstri 3955 | . . . . 5 ⊢ 𝑍 ⊆ ℤ |
4 | zssre 12326 | . . . . 5 ⊢ ℤ ⊆ ℝ | |
5 | 3, 4 | sstri 3930 | . . . 4 ⊢ 𝑍 ⊆ ℝ |
6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 𝑍 ⊆ ℝ) |
7 | caurcvg.3 | . . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ) | |
8 | 1rp 12734 | . . . . . 6 ⊢ 1 ∈ ℝ+ | |
9 | 8 | ne0ii 4271 | . . . . 5 ⊢ ℝ+ ≠ ∅ |
10 | caurcvg.4 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) | |
11 | r19.2z 4425 | . . . . 5 ⊢ ((ℝ+ ≠ ∅ ∧ ∀𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) → ∃𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) | |
12 | 9, 10, 11 | sylancr 587 | . . . 4 ⊢ (𝜑 → ∃𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) |
13 | eluzel2 12587 | . . . . . . . . 9 ⊢ (𝑚 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
14 | 13, 1 | eleq2s 2857 | . . . . . . . 8 ⊢ (𝑚 ∈ 𝑍 → 𝑀 ∈ ℤ) |
15 | 1 | uzsup 13583 | . . . . . . . 8 ⊢ (𝑀 ∈ ℤ → sup(𝑍, ℝ*, < ) = +∞) |
16 | 14, 15 | syl 17 | . . . . . . 7 ⊢ (𝑚 ∈ 𝑍 → sup(𝑍, ℝ*, < ) = +∞) |
17 | 16 | a1d 25 | . . . . . 6 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → sup(𝑍, ℝ*, < ) = +∞)) |
18 | 17 | rexlimiv 3209 | . . . . 5 ⊢ (∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → sup(𝑍, ℝ*, < ) = +∞) |
19 | 18 | rexlimivw 3211 | . . . 4 ⊢ (∃𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → sup(𝑍, ℝ*, < ) = +∞) |
20 | 12, 19 | syl 17 | . . 3 ⊢ (𝜑 → sup(𝑍, ℝ*, < ) = +∞) |
21 | 3 | sseli 3917 | . . . . . . . . . . . 12 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ ℤ) |
22 | 3 | sseli 3917 | . . . . . . . . . . . 12 ⊢ (𝑘 ∈ 𝑍 → 𝑘 ∈ ℤ) |
23 | eluz 12596 | . . . . . . . . . . . 12 ⊢ ((𝑚 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑘 ∈ (ℤ≥‘𝑚) ↔ 𝑚 ≤ 𝑘)) | |
24 | 21, 22, 23 | syl2an 596 | . . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑘 ∈ (ℤ≥‘𝑚) ↔ 𝑚 ≤ 𝑘)) |
25 | 24 | biimprd 247 | . . . . . . . . . 10 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑚 ≤ 𝑘 → 𝑘 ∈ (ℤ≥‘𝑚))) |
26 | 25 | expimpd 454 | . . . . . . . . 9 ⊢ (𝑚 ∈ 𝑍 → ((𝑘 ∈ 𝑍 ∧ 𝑚 ≤ 𝑘) → 𝑘 ∈ (ℤ≥‘𝑚))) |
27 | 26 | imim1d 82 | . . . . . . . 8 ⊢ (𝑚 ∈ 𝑍 → ((𝑘 ∈ (ℤ≥‘𝑚) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) → ((𝑘 ∈ 𝑍 ∧ 𝑚 ≤ 𝑘) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥))) |
28 | 27 | exp4a 432 | . . . . . . 7 ⊢ (𝑚 ∈ 𝑍 → ((𝑘 ∈ (ℤ≥‘𝑚) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥) → (𝑘 ∈ 𝑍 → (𝑚 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)))) |
29 | 28 | ralimdv2 3107 | . . . . . 6 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → ∀𝑘 ∈ 𝑍 (𝑚 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥))) |
30 | 29 | reximia 3176 | . . . . 5 ⊢ (∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ 𝑍 (𝑚 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
31 | 30 | ralimi 3087 | . . . 4 ⊢ (∀𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → ∀𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ 𝑍 (𝑚 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
32 | 10, 31 | syl 17 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ 𝑍 (𝑚 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
33 | 6, 7, 20, 32 | caurcvgr 15385 | . 2 ⊢ (𝜑 → 𝐹 ⇝𝑟 (lim sup‘𝐹)) |
34 | 14 | a1d 25 | . . . . . 6 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → 𝑀 ∈ ℤ)) |
35 | 34 | rexlimiv 3209 | . . . . 5 ⊢ (∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → 𝑀 ∈ ℤ) |
36 | 35 | rexlimivw 3211 | . . . 4 ⊢ (∃𝑥 ∈ ℝ+ ∃𝑚 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑚)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥 → 𝑀 ∈ ℤ) |
37 | 12, 36 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
38 | ax-resscn 10928 | . . . 4 ⊢ ℝ ⊆ ℂ | |
39 | fss 6617 | . . . 4 ⊢ ((𝐹:𝑍⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:𝑍⟶ℂ) | |
40 | 7, 38, 39 | sylancl 586 | . . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ) |
41 | 1, 37, 40 | rlimclim 15255 | . 2 ⊢ (𝜑 → (𝐹 ⇝𝑟 (lim sup‘𝐹) ↔ 𝐹 ⇝ (lim sup‘𝐹))) |
42 | 33, 41 | mpbid 231 | 1 ⊢ (𝜑 → 𝐹 ⇝ (lim sup‘𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 ⊆ wss 3887 ∅c0 4256 class class class wbr 5074 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 supcsup 9199 ℂcc 10869 ℝcr 10870 1c1 10872 +∞cpnf 11006 ℝ*cxr 11008 < clt 11009 ≤ cle 11010 − cmin 11205 ℤcz 12319 ℤ≥cuz 12582 ℝ+crp 12730 abscabs 14945 lim supclsp 15179 ⇝ cli 15193 ⇝𝑟 crli 15194 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-pm 8618 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-inf 9202 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-ico 13085 df-fl 13512 df-seq 13722 df-exp 13783 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-limsup 15180 df-clim 15197 df-rlim 15198 |
This theorem is referenced by: caurcvg2 15389 mbflimlem 24831 climlimsup 43301 ioodvbdlimc1lem1 43472 |
Copyright terms: Public domain | W3C validator |