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 25386

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 25385	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐹 lim_ℂ 𝐵) ↔ (𝑥 ∈ ℂ ∧ ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))))
6	4	cnfldtop 24291	. . . . . . . . . 10 ⊢ 𝐾 ∈ Top
7	2	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ⊆ ℂ)
8	7	ssdifssd 4141	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ℂ)
9	4	cnfldtopon 24290	. . . . . . . . . . . 12 ⊢ 𝐾 ∈ (TopOn‘ℂ)
10	9	toponunii 22409	. . . . . . . . . . 11 ⊢ ℂ = ∪ 𝐾
11	10	clscld 22542	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Top ∧ (𝐴 ∖ {𝐵}) ⊆ ℂ) → ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾))
12	6, 8, 11	sylancr 587	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾))
13	10	cldopn 22526	. . . . . . . . 9 ⊢ (((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾) → (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾)
14	12, 13	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾)
15		limcnlp.n	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝐵 ∈ ((limPt‘𝐾)‘𝐴))
16	10	islp 22635	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ⊆ ℂ) → (𝐵 ∈ ((limPt‘𝐾)‘𝐴) ↔ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
17	6, 2, 16	sylancr 587	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∈ ((limPt‘𝐾)‘𝐴) ↔ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
18	15, 17	mtbid 323	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
19	3, 18	eldifd 3958	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
20	19	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
21		difin2 4290	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ {𝐵}) ⊆ ℂ → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
22	8, 21	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
23	10	sscls 22551	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Top ∧ (𝐴 ∖ {𝐵}) ⊆ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
24	6, 8, 23	sylancr 587	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
25		ssdif0 4362	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ↔ ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ∅)
26	24, 25	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ∅)
27	22, 26	eqtr3d 2774	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})) = ∅)
28	27	imaeq2d 6057	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) = (𝐹 “ ∅))
29		ima0 6073	. . . . . . . . . 10 ⊢ (𝐹 “ ∅) = ∅
30	28, 29	eqtrdi 2788	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) = ∅)
31		0ss 4395	. . . . . . . . 9 ⊢ ∅ ⊆ 𝑢
32	30, 31	eqsstrdi 4035	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)
33		eleq2 2822	. . . . . . . . . 10 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝐵 ∈ 𝑣 ↔ 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))))
34		ineq1 4204	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝑣 ∩ (𝐴 ∖ {𝐵})) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
35	34	imaeq2d 6057	. . . . . . . . . . 11 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) = (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))))
36	35	sseq1d 4012	. . . . . . . . . 10 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → ((𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢 ↔ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
37	33, 36	anbi12d 631	. . . . . . . . 9 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → ((𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢) ↔ (𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∧ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
38	37	rspcev 3612	. . . . . . . 8 ⊢ (((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾 ∧ (𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∧ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
39	14, 20, 32, 38	syl12anc 835	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
40	39	a1d 25	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
41	40	ralrimivw 3150	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
42	41	ex 413	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℂ → ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))))
43	42	pm4.71d 562	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℂ ↔ (𝑥 ∈ ℂ ∧ ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))))
44	5, 43	bitr4d 281	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐹 lim_ℂ 𝐵) ↔ 𝑥 ∈ ℂ))
45	44	eqrdv 2730	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) = ℂ)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ∖ cdif 3944 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 {csn 4627 “ cima 5678 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ℂcc 11104 TopOpenctopn 17363 ℂ_fldccnfld 20936 Topctop 22386 Clsdccld 22511 clsccl 22513 limPtclp 22629 lim_ℂ climc 25370

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fi 9402 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-q 12929 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-fz 13481 df-seq 13963 df-exp 14024 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-struct 17076 df-slot 17111 df-ndx 17123 df-base 17141 df-plusg 17206 df-mulr 17207 df-starv 17208 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-rest 17364 df-topn 17365 df-topgen 17385 df-psmet 20928 df-xmet 20929 df-met 20930 df-bl 20931 df-mopn 20932 df-cnfld 20937 df-top 22387 df-topon 22404 df-topsp 22426 df-bases 22440 df-cld 22514 df-cls 22516 df-lp 22631 df-cnp 22723 df-xms 23817 df-ms 23818 df-limc 25374

This theorem is referenced by: (None)

W3C validator