limcnlp - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > limcnlp		Structured version Visualization version GIF version

Theorem limcnlp 25727

Description: If 𝐵 is not a limit point of the domain of the function 𝐹, then every point is a limit of 𝐹 at 𝐵. (Contributed by Mario Carneiro, 25-Dec-2016.)

**Hypotheses**
Ref	Expression
limccl.f	⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
limccl.a	⊢ (𝜑 → 𝐴 ⊆ ℂ)
limccl.b	⊢ (𝜑 → 𝐵 ∈ ℂ)
ellimc2.k	⊢ 𝐾 = (TopOpen‘ℂ_fld)
limcnlp.n	⊢ (𝜑 → ¬ 𝐵 ∈ ((limPt‘𝐾)‘𝐴))

**Assertion**
Ref	Expression
limcnlp	⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) = ℂ)

Proof of Theorem limcnlp Dummy variables 𝑥 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		limccl.f	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
2		limccl.a	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
3		limccl.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ)
4		ellimc2.k	. . . 4 ⊢ 𝐾 = (TopOpen‘ℂ_fld)
5	1, 2, 3, 4	ellimc2 25726	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐹 lim_ℂ 𝐵) ↔ (𝑥 ∈ ℂ ∧ ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))))
6	4	cnfldtop 24620	. . . . . . . . . 10 ⊢ 𝐾 ∈ Top
7	2	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ⊆ ℂ)
8	7	ssdifssd 4142	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ℂ)
9	4	cnfldtopon 24619	. . . . . . . . . . . 12 ⊢ 𝐾 ∈ (TopOn‘ℂ)
10	9	toponunii 22738	. . . . . . . . . . 11 ⊢ ℂ = ∪ 𝐾
11	10	clscld 22871	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Top ∧ (𝐴 ∖ {𝐵}) ⊆ ℂ) → ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾))
12	6, 8, 11	sylancr 586	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾))
13	10	cldopn 22855	. . . . . . . . 9 ⊢ (((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾) → (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾)
14	12, 13	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾)
15		limcnlp.n	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝐵 ∈ ((limPt‘𝐾)‘𝐴))
16	10	islp 22964	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ⊆ ℂ) → (𝐵 ∈ ((limPt‘𝐾)‘𝐴) ↔ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
17	6, 2, 16	sylancr 586	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∈ ((limPt‘𝐾)‘𝐴) ↔ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
18	15, 17	mtbid 324	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
19	3, 18	eldifd 3959	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
20	19	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
21		difin2 4291	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ {𝐵}) ⊆ ℂ → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
22	8, 21	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
23	10	sscls 22880	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Top ∧ (𝐴 ∖ {𝐵}) ⊆ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
24	6, 8, 23	sylancr 586	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
25		ssdif0 4363	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ↔ ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ∅)
26	24, 25	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ∅)
27	22, 26	eqtr3d 2773	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})) = ∅)
28	27	imaeq2d 6059	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) = (𝐹 “ ∅))
29		ima0 6076	. . . . . . . . . 10 ⊢ (𝐹 “ ∅) = ∅
30	28, 29	eqtrdi 2787	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) = ∅)
31		0ss 4396	. . . . . . . . 9 ⊢ ∅ ⊆ 𝑢
32	30, 31	eqsstrdi 4036	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)
33		eleq2 2821	. . . . . . . . . 10 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝐵 ∈ 𝑣 ↔ 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))))
34		ineq1 4205	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝑣 ∩ (𝐴 ∖ {𝐵})) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
35	34	imaeq2d 6059	. . . . . . . . . . 11 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) = (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))))
36	35	sseq1d 4013	. . . . . . . . . 10 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → ((𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢 ↔ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
37	33, 36	anbi12d 630	. . . . . . . . 9 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → ((𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢) ↔ (𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∧ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
38	37	rspcev 3612	. . . . . . . 8 ⊢ (((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾 ∧ (𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∧ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
39	14, 20, 32, 38	syl12anc 834	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
40	39	a1d 25	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
41	40	ralrimivw 3149	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
42	41	ex 412	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℂ → ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))))
43	42	pm4.71d 561	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℂ ↔ (𝑥 ∈ ℂ ∧ ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))))
44	5, 43	bitr4d 282	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐹 lim_ℂ 𝐵) ↔ 𝑥 ∈ ℂ))
45	44	eqrdv 2729	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) = ℂ)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ∀wral 3060 ∃wrex 3069 ∖ cdif 3945 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 {csn 4628 “ cima 5679 ⟶wf 6539 ‘cfv 6543 (class class class)co 7412 ℂcc 11114 TopOpenctopn 17374 ℂ_fldccnfld 21233 Topctop 22715 Clsdccld 22840 clsccl 22842 limPtclp 22958 lim_ℂ climc 25711

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193 ax-pre-sup 11194

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-er 8709 df-map 8828 df-pm 8829 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-fi 9412 df-sup 9443 df-inf 9444 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-div 11879 df-nn 12220 df-2 12282 df-3 12283 df-4 12284 df-5 12285 df-6 12286 df-7 12287 df-8 12288 df-9 12289 df-n0 12480 df-z 12566 df-dec 12685 df-uz 12830 df-q 12940 df-rp 12982 df-xneg 13099 df-xadd 13100 df-xmul 13101 df-fz 13492 df-seq 13974 df-exp 14035 df-cj 15053 df-re 15054 df-im 15055 df-sqrt 15189 df-abs 15190 df-struct 17087 df-slot 17122 df-ndx 17134 df-base 17152 df-plusg 17217 df-mulr 17218 df-starv 17219 df-tset 17223 df-ple 17224 df-ds 17226 df-unif 17227 df-rest 17375 df-topn 17376 df-topgen 17396 df-psmet 21225 df-xmet 21226 df-met 21227 df-bl 21228 df-mopn 21229 df-cnfld 21234 df-top 22716 df-topon 22733 df-topsp 22755 df-bases 22769 df-cld 22843 df-cls 22845 df-lp 22960 df-cnp 23052 df-xms 24146 df-ms 24147 df-limc 25715

This theorem is referenced by: (None)

W3C validator