| 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 5117 | . 2 ⊢ (𝐹𝑅𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) |
| 3 | climreeq.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | climreeq.4 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ) | |
| 5 | ax-resscn 11174 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
| 6 | 5 | a1i 11 | . . . . 5 ⊢ (𝜑 → ℝ ⊆ ℂ) |
| 7 | 4, 6 | fssd 6727 | . . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ) |
| 8 | eqid 2765 | . . . . 5 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 9 | climreeq.2 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 10 | 8, 9 | lmclimf 25516 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶ℂ) → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 11 | 3, 7, 10 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 12 | tgioo4 25015 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 13 | reex 11208 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → ℝ ∈ V) |
| 15 | 8 | cnfldtop 24993 | . . . . . . 7 ⊢ (TopOpen‘ℂfld) ∈ Top |
| 16 | 15 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → (TopOpen‘ℂfld) ∈ Top) |
| 17 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 18 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝑀 ∈ ℤ) |
| 19 | 4 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝐹:𝑍⟶ℝ) |
| 20 | 12, 9, 14, 16, 17, 18, 19 | lmss 23507 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 21 | 20 | pm5.32da 590 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ↔ (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴))) |
| 22 | simpr 490 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) | |
| 23 | 3 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝑀 ∈ ℤ) |
| 24 | 11 | biimpa 482 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐹 ⇝ 𝐴) |
| 25 | 4 | ffvelcdmda 7083 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ) |
| 26 | 25 | adantlr 728 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ) |
| 27 | 9, 23, 24, 26 | climrecl 15660 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐴 ∈ ℝ) |
| 28 | 27 | ex 418 | . . . . . 6 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 → 𝐴 ∈ ℝ)) |
| 29 | 28 | ancrd 561 | . . . . 5 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 → (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴))) |
| 30 | 22, 29 | impbid2 229 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ↔ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴)) |
| 31 | simpr 490 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) | |
| 32 | retopon 24973 | . . . . . . . . 9 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ) | |
| 33 | 32 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → (topGen‘ran (,)) ∈ (TopOn‘ℝ)) |
| 34 | simpr 490 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) | |
| 35 | lmcl 23506 | . . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐴 ∈ ℝ) | |
| 36 | 33, 34, 35 | syl2anc 596 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐴 ∈ ℝ) |
| 37 | 36 | ex 418 | . . . . . 6 ⊢ (𝜑 → (𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴 → 𝐴 ∈ ℝ)) |
| 38 | 37 | ancrd 561 | . . . . 5 ⊢ (𝜑 → (𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴 → (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴))) |
| 39 | 31, 38 | impbid2 229 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 40 | 21, 30, 39 | 3bitr3d 312 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 41 | 11, 40 | bitr3d 284 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 42 | 2, 41 | bitr4id 293 | 1 ⊢ (𝜑 → (𝐹𝑅𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ⊆ wss 3906 class class class wbr 5111 ran crn 5664 ⟶wf 6536 ‘cfv 6540 ℂcc 11115 ℝcr 11116 ℤcz 12608 ℤ≥cuz 12880 (,)cioo 13390 ⇝ cli 15561 TopOpenctopn 17498 topGenctg 17514 ℂfldccnfld 21574 Topctop 23102 TopOnctopon 23119 ⇝𝑡clm 23435 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 ax-pre-sup 11195 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-pm 8833 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fi 9378 df-sup 9409 df-inf 9410 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-div 11889 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-z 12609 df-dec 12730 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ioo 13394 df-fz 13554 df-fl 13845 df-seq 14058 df-exp 14118 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-rlim 15566 df-struct 17231 df-slot 17266 df-ndx 17278 df-base 17294 df-plusg 17347 df-mulr 17348 df-starv 17349 df-tset 17353 df-ple 17354 df-ds 17356 df-unif 17357 df-rest 17499 df-topn 17500 df-topgen 17520 df-psmet 21566 df-xmet 21567 df-met 21568 df-bl 21569 df-mopn 21570 df-cnfld 21575 df-top 23103 df-topon 23120 df-topsp 23142 df-bases 23155 df-lm 23438 df-xms 24530 df-ms 24531 |
| This theorem is used by: xlimclim 46598 stirlingr 46864 |
| Copyright terms: Public domain | W3C validator |