| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > climreeq | Structured version Visualization version GIF version | ||
| Description: If 𝐹 is a real function, then 𝐹 converges to 𝐴 with respect to the standard topology on the reals if and only if it converges to 𝐴 with respect to the standard topology on complex numbers. In the theorem, 𝑅 is defined to be convergence w.r.t. the standard topology on the reals and then 𝐹𝑅𝐴 represents the statement "𝐹 converges to 𝐴, with respect to the standard topology on the reals". Notice that there is no need for the hypothesis that 𝐴 is a real number. (Contributed by Glauco Siliprandi, 2-Jul-2017.) |
| Ref | Expression |
|---|---|
| climreeq.1 | ⊢ 𝑅 = (⇝𝑡‘(topGen‘ran (,))) |
| climreeq.2 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| climreeq.3 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| climreeq.4 | ⊢ (𝜑 → 𝐹:𝑍⟶ℝ) |
| Ref | Expression |
|---|---|
| climreeq | ⊢ (𝜑 → (𝐹𝑅𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | climreeq.1 | . . 3 ⊢ 𝑅 = (⇝𝑡‘(topGen‘ran (,))) | |
| 2 | 1 | breqi 5092 | . 2 ⊢ (𝐹𝑅𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) |
| 3 | climreeq.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | climreeq.4 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ) | |
| 5 | ax-resscn 11089 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
| 6 | 5 | a1i 11 | . . . . 5 ⊢ (𝜑 → ℝ ⊆ ℂ) |
| 7 | 4, 6 | fssd 6680 | . . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ) |
| 8 | eqid 2737 | . . . . 5 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 9 | climreeq.2 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 10 | 8, 9 | lmclimf 25284 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶ℂ) → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 11 | 3, 7, 10 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 12 | tgioo4 24783 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 13 | reex 11123 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → ℝ ∈ V) |
| 15 | 8 | cnfldtop 24761 | . . . . . . 7 ⊢ (TopOpen‘ℂfld) ∈ Top |
| 16 | 15 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → (TopOpen‘ℂfld) ∈ Top) |
| 17 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 18 | 3 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝑀 ∈ ℤ) |
| 19 | 4 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝐹:𝑍⟶ℝ) |
| 20 | 12, 9, 14, 16, 17, 18, 19 | lmss 23276 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 21 | 20 | pm5.32da 579 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ↔ (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴))) |
| 22 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) | |
| 23 | 3 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝑀 ∈ ℤ) |
| 24 | 11 | biimpa 476 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐹 ⇝ 𝐴) |
| 25 | 4 | ffvelcdmda 7031 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ) |
| 26 | 25 | adantlr 716 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ) |
| 27 | 9, 23, 24, 26 | climrecl 15539 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐴 ∈ ℝ) |
| 28 | 27 | ex 412 | . . . . . 6 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 → 𝐴 ∈ ℝ)) |
| 29 | 28 | ancrd 551 | . . . . 5 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 → (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴))) |
| 30 | 22, 29 | impbid2 226 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ↔ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴)) |
| 31 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) | |
| 32 | retopon 24741 | . . . . . . . . 9 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ) | |
| 33 | 32 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → (topGen‘ran (,)) ∈ (TopOn‘ℝ)) |
| 34 | simpr 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) | |
| 35 | lmcl 23275 | . . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐴 ∈ ℝ) | |
| 36 | 33, 34, 35 | syl2anc 585 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐴 ∈ ℝ) |
| 37 | 36 | ex 412 | . . . . . 6 ⊢ (𝜑 → (𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴 → 𝐴 ∈ ℝ)) |
| 38 | 37 | ancrd 551 | . . . . 5 ⊢ (𝜑 → (𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴 → (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴))) |
| 39 | 31, 38 | impbid2 226 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 40 | 21, 30, 39 | 3bitr3d 309 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 41 | 11, 40 | bitr3d 281 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 42 | 2, 41 | bitr4id 290 | 1 ⊢ (𝜑 → (𝐹𝑅𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ⊆ wss 3890 class class class wbr 5086 ran crn 5626 ⟶wf 6489 ‘cfv 6493 ℂcc 11030 ℝcr 11031 ℤcz 12518 ℤ≥cuz 12782 (,)cioo 13292 ⇝ cli 15440 TopOpenctopn 17378 topGenctg 17394 ℂfldccnfld 21347 Topctop 22871 TopOnctopon 22888 ⇝𝑡clm 23204 |
| 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 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 ax-pre-sup 11110 |
| 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-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fi 9318 df-sup 9349 df-inf 9350 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-uz 12783 df-q 12893 df-rp 12937 df-xneg 13057 df-xadd 13058 df-xmul 13059 df-ioo 13296 df-fz 13456 df-fl 13745 df-seq 13958 df-exp 14018 df-cj 15055 df-re 15056 df-im 15057 df-sqrt 15191 df-abs 15192 df-clim 15444 df-rlim 15445 df-struct 17111 df-slot 17146 df-ndx 17158 df-base 17174 df-plusg 17227 df-mulr 17228 df-starv 17229 df-tset 17233 df-ple 17234 df-ds 17236 df-unif 17237 df-rest 17379 df-topn 17380 df-topgen 17400 df-psmet 21339 df-xmet 21340 df-met 21341 df-bl 21342 df-mopn 21343 df-cnfld 21348 df-top 22872 df-topon 22889 df-topsp 22911 df-bases 22924 df-lm 23207 df-xms 24298 df-ms 24299 |
| This theorem is referenced by: xlimclim 46273 stirlingr 46539 |
| Copyright terms: Public domain | W3C validator |