| 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 5078 | . 2 ⊢ (𝐹𝑅𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) |
| 3 | climreeq.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | climreeq.4 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ) | |
| 5 | ax-resscn 11086 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
| 6 | 5 | a1i 11 | . . . . 5 ⊢ (𝜑 → ℝ ⊆ ℂ) |
| 7 | 4, 6 | fssd 6672 | . . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ) |
| 8 | eqid 2739 | . . . . 5 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 9 | climreeq.2 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 10 | 8, 9 | lmclimf 25289 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶ℂ) → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 11 | 3, 7, 10 | syl2anc 590 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 12 | tgioo4 24788 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 13 | reex 11120 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → ℝ ∈ V) |
| 15 | 8 | cnfldtop 24766 | . . . . . . 7 ⊢ (TopOpen‘ℂfld) ∈ Top |
| 16 | 15 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → (TopOpen‘ℂfld) ∈ Top) |
| 17 | simpr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 18 | 3 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝑀 ∈ ℤ) |
| 19 | 4 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → 𝐹:𝑍⟶ℝ) |
| 20 | 12, 9, 14, 16, 17, 18, 19 | lmss 23281 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ) → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 21 | 20 | pm5.32da 584 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ↔ (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴))) |
| 22 | simpr 485 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) | |
| 23 | 3 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝑀 ∈ ℤ) |
| 24 | 11 | biimpa 477 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐹 ⇝ 𝐴) |
| 25 | 4 | ffvelcdmda 7025 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ) |
| 26 | 25 | adantlr 721 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ ℝ) |
| 27 | 9, 23, 24, 26 | climrecl 15536 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) → 𝐴 ∈ ℝ) |
| 28 | 27 | ex 413 | . . . . . 6 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 → 𝐴 ∈ ℝ)) |
| 29 | 28 | ancrd 556 | . . . . 5 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 → (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴))) |
| 30 | 22, 29 | impbid2 227 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴) ↔ 𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴)) |
| 31 | simpr 485 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) | |
| 32 | retopon 24746 | . . . . . . . . 9 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ) | |
| 33 | 32 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → (topGen‘ran (,)) ∈ (TopOn‘ℝ)) |
| 34 | simpr 485 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) | |
| 35 | lmcl 23280 | . . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐴 ∈ ℝ) | |
| 36 | 33, 34, 35 | syl2anc 590 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) → 𝐴 ∈ ℝ) |
| 37 | 36 | ex 413 | . . . . . 6 ⊢ (𝜑 → (𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴 → 𝐴 ∈ ℝ)) |
| 38 | 37 | ancrd 556 | . . . . 5 ⊢ (𝜑 → (𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴 → (𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴))) |
| 39 | 31, 38 | impbid2 227 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴) ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 40 | 21, 30, 39 | 3bitr3d 310 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑡‘(TopOpen‘ℂfld))𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 41 | 11, 40 | bitr3d 282 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ 𝐹(⇝𝑡‘(topGen‘ran (,)))𝐴)) |
| 42 | 2, 41 | bitr4id 291 | 1 ⊢ (𝜑 → (𝐹𝑅𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3431 ⊆ wss 3883 class class class wbr 5072 ran crn 5619 ⟶wf 6481 ‘cfv 6485 ℂcc 11027 ℝcr 11028 ℤcz 12515 ℤ≥cuz 12779 (,)cioo 13289 ⇝ cli 15437 TopOpenctopn 17375 topGenctg 17391 ℂfldccnfld 21347 Topctop 22876 TopOnctopon 22893 ⇝𝑡clm 23209 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8765 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fi 9314 df-sup 9345 df-inf 9346 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-q 12890 df-rp 12934 df-xneg 13054 df-xadd 13055 df-xmul 13056 df-ioo 13293 df-fz 13453 df-fl 13742 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-clim 15441 df-rlim 15442 df-struct 17108 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-mulr 17225 df-starv 17226 df-tset 17230 df-ple 17231 df-ds 17233 df-unif 17234 df-rest 17376 df-topn 17377 df-topgen 17397 df-psmet 21339 df-xmet 21340 df-met 21341 df-bl 21342 df-mopn 21343 df-cnfld 21348 df-top 22877 df-topon 22894 df-topsp 22916 df-bases 22929 df-lm 23212 df-xms 24303 df-ms 24304 |
| This theorem is referenced by: xlimclim 46267 stirlingr 46533 |
| Copyright terms: Public domain | W3C validator |