| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnplimc | Structured version Visualization version GIF version | ||
| Description: A function is continuous at 𝐵 iff its limit at 𝐵 equals the value of the function there. (Contributed by Mario Carneiro, 28-Dec-2016.) |
| Ref | Expression |
|---|---|
| cnplimc.k | ⊢ 𝐾 = (TopOpen‘ℂfld) |
| cnplimc.j | ⊢ 𝐽 = (𝐾 ↾t 𝐴) |
| Ref | Expression |
|---|---|
| cnplimc | ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) ↔ (𝐹:𝐴⟶ℂ ∧ (𝐹‘𝐵) ∈ (𝐹 limℂ 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnplimc.j | . . . . 5 ⊢ 𝐽 = (𝐾 ↾t 𝐴) | |
| 2 | cnplimc.k | . . . . . . 7 ⊢ 𝐾 = (TopOpen‘ℂfld) | |
| 3 | 2 | cnfldtopon 24820 | . . . . . 6 ⊢ 𝐾 ∈ (TopOn‘ℂ) |
| 4 | simpl 486 | . . . . . 6 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → 𝐴 ⊆ ℂ) | |
| 5 | resttopon 23199 | . . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ 𝐴 ⊆ ℂ) → (𝐾 ↾t 𝐴) ∈ (TopOn‘𝐴)) | |
| 6 | 3, 4, 5 | sylancr 596 | . . . . 5 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → (𝐾 ↾t 𝐴) ∈ (TopOn‘𝐴)) |
| 7 | 1, 6 | eqeltrid 2865 | . . . 4 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → 𝐽 ∈ (TopOn‘𝐴)) |
| 8 | cnpf2 23288 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐹:𝐴⟶ℂ) | |
| 9 | 8 | 3expia 1133 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘ℂ)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐹:𝐴⟶ℂ)) |
| 10 | 7, 3, 9 | sylancl 595 | . . 3 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐹:𝐴⟶ℂ)) |
| 11 | 10 | pm4.71rd 570 | . 2 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) ↔ (𝐹:𝐴⟶ℂ ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵)))) |
| 12 | simpr 488 | . . . . . . 7 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐹:𝐴⟶ℂ) | |
| 13 | simplr 778 | . . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐵 ∈ 𝐴) | |
| 14 | 13 | snssd 4744 | . . . . . . . . 9 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → {𝐵} ⊆ 𝐴) |
| 15 | ssequn2 4141 | . . . . . . . . 9 ⊢ ({𝐵} ⊆ 𝐴 ↔ (𝐴 ∪ {𝐵}) = 𝐴) | |
| 16 | 14, 15 | sylib 220 | . . . . . . . 8 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → (𝐴 ∪ {𝐵}) = 𝐴) |
| 17 | 16 | feq2d 6669 | . . . . . . 7 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → (𝐹:(𝐴 ∪ {𝐵})⟶ℂ ↔ 𝐹:𝐴⟶ℂ)) |
| 18 | 12, 17 | mpbird 259 | . . . . . 6 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐹:(𝐴 ∪ {𝐵})⟶ℂ) |
| 19 | 18 | feqmptd 6929 | . . . . 5 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐹 = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ (𝐹‘𝑥))) |
| 20 | 16 | oveq2d 7406 | . . . . . . . 8 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) = (𝐾 ↾t 𝐴)) |
| 21 | 1, 20 | eqtr4id 2815 | . . . . . . 7 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐽 = (𝐾 ↾t (𝐴 ∪ {𝐵}))) |
| 22 | 21 | oveq1d 7405 | . . . . . 6 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → (𝐽 CnP 𝐾) = ((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)) |
| 23 | 22 | fveq1d 6863 | . . . . 5 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → ((𝐽 CnP 𝐾)‘𝐵) = (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)) |
| 24 | 19, 23 | eleq12d 2855 | . . . 4 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ (𝐹‘𝑥)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))) |
| 25 | eqid 2761 | . . . . 5 ⊢ (𝐾 ↾t (𝐴 ∪ {𝐵})) = (𝐾 ↾t (𝐴 ∪ {𝐵})) | |
| 26 | ifid 4520 | . . . . . . 7 ⊢ if(𝑥 = 𝐵, (𝐹‘𝑥), (𝐹‘𝑥)) = (𝐹‘𝑥) | |
| 27 | fveq2 6861 | . . . . . . . . 9 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵)) | |
| 28 | 27 | adantl 485 | . . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴 ∪ {𝐵}) ∧ 𝑥 = 𝐵) → (𝐹‘𝑥) = (𝐹‘𝐵)) |
| 29 | 28 | ifeq1da 4511 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) → if(𝑥 = 𝐵, (𝐹‘𝑥), (𝐹‘𝑥)) = if(𝑥 = 𝐵, (𝐹‘𝐵), (𝐹‘𝑥))) |
| 30 | 26, 29 | eqtr3id 2810 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) → (𝐹‘𝑥) = if(𝑥 = 𝐵, (𝐹‘𝐵), (𝐹‘𝑥))) |
| 31 | 30 | mpteq2ia 5194 | . . . . 5 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ (𝐹‘𝑥)) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐹‘𝐵), (𝐹‘𝑥))) |
| 32 | simpll 776 | . . . . 5 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐴 ⊆ ℂ) | |
| 33 | 32, 13 | sseldd 3937 | . . . . 5 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → 𝐵 ∈ ℂ) |
| 34 | 25, 2, 31, 12, 32, 33 | ellimc 25913 | . . . 4 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → ((𝐹‘𝐵) ∈ (𝐹 limℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ (𝐹‘𝑥)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))) |
| 35 | 24, 34 | bitr4d 284 | . . 3 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) ∧ 𝐹:𝐴⟶ℂ) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) ↔ (𝐹‘𝐵) ∈ (𝐹 limℂ 𝐵))) |
| 36 | 35 | pm5.32da 587 | . 2 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → ((𝐹:𝐴⟶ℂ ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵)) ↔ (𝐹:𝐴⟶ℂ ∧ (𝐹‘𝐵) ∈ (𝐹 limℂ 𝐵)))) |
| 37 | 11, 36 | bitrd 281 | 1 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ 𝐴) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐵) ↔ (𝐹:𝐴⟶ℂ ∧ (𝐹‘𝐵) ∈ (𝐹 limℂ 𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∪ cun 3902 ⊆ wss 3904 ifcif 4479 {csn 4581 ↦ cmpt 5180 ⟶wf 6511 ‘cfv 6515 (class class class)co 7390 ℂcc 11066 ↾t crest 17430 TopOpenctopn 17431 ℂfldccnfld 21402 TopOnctopon 22948 CnP ccnp 23263 limℂ climc 25902 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-er 8671 df-map 8803 df-pm 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-fi 9352 df-sup 9383 df-inf 9384 df-pnf 11213 df-mnf 11214 df-xr 11215 df-ltxr 11216 df-le 11217 df-sub 11411 df-neg 11412 df-div 11840 df-nn 12206 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12477 df-z 12564 df-dec 12684 df-uz 12835 df-q 12945 df-rp 12989 df-xneg 13109 df-xadd 13110 df-xmul 13111 df-fz 13508 df-seq 14010 df-exp 14070 df-cj 15107 df-re 15108 df-im 15109 df-sqrt 15243 df-abs 15244 df-struct 17164 df-slot 17199 df-ndx 17211 df-base 17227 df-plusg 17280 df-mulr 17281 df-starv 17282 df-tset 17286 df-ple 17287 df-ds 17289 df-unif 17290 df-rest 17432 df-topn 17433 df-topgen 17453 df-psmet 21394 df-xmet 21395 df-met 21396 df-bl 21397 df-mopn 21398 df-cnfld 21403 df-top 22932 df-topon 22949 df-topsp 22971 df-bases 22984 df-cnp 23266 df-xms 24358 df-ms 24359 df-limc 25906 |
| This theorem is referenced by: cnlimc 25928 dvcnp2 25960 dvmulbr 25979 dvcobr 25986 cncfiooicclem1 46420 jumpncnp 46425 dirkercncf 46634 fourierdlem32 46666 fourierdlem33 46667 fourierdlem62 46695 fouriercnp 46753 |
| Copyright terms: Public domain | W3C validator |