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 25827

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 25826	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐹 lim_ℂ 𝐵) ↔ (𝑥 ∈ ℂ ∧ ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))))
6	4	cnfldtop 24720	. . . . . . . . . 10 ⊢ 𝐾 ∈ Top
7	2	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ⊆ ℂ)
8	7	ssdifssd 4143	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ℂ)
9	4	cnfldtopon 24719	. . . . . . . . . . . 12 ⊢ 𝐾 ∈ (TopOn‘ℂ)
10	9	toponunii 22838	. . . . . . . . . . 11 ⊢ ℂ = ∪ 𝐾
11	10	clscld 22971	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Top ∧ (𝐴 ∖ {𝐵}) ⊆ ℂ) → ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾))
12	6, 8, 11	sylancr 585	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾))
13	10	cldopn 22955	. . . . . . . . 9 ⊢ (((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ∈ (Clsd‘𝐾) → (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾)
14	12, 13	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾)
15		limcnlp.n	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝐵 ∈ ((limPt‘𝐾)‘𝐴))
16	10	islp 23064	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ⊆ ℂ) → (𝐵 ∈ ((limPt‘𝐾)‘𝐴) ↔ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
17	6, 2, 16	sylancr 585	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∈ ((limPt‘𝐾)‘𝐴) ↔ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
18	15, 17	mtbid 323	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝐵 ∈ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
19	3, 18	eldifd 3960	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
20	19	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))))
21		difin2 4294	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ {𝐵}) ⊆ ℂ → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
22	8, 21	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
23	10	sscls 22980	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Top ∧ (𝐴 ∖ {𝐵}) ⊆ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
24	6, 8, 23	sylancr 585	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))
25		ssdif0 4367	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ {𝐵}) ⊆ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})) ↔ ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ∅)
26	24, 25	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝐴 ∖ {𝐵}) ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) = ∅)
27	22, 26	eqtr3d 2770	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})) = ∅)
28	27	imaeq2d 6068	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) = (𝐹 “ ∅))
29		ima0 6085	. . . . . . . . . 10 ⊢ (𝐹 “ ∅) = ∅
30	28, 29	eqtrdi 2784	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) = ∅)
31		0ss 4400	. . . . . . . . 9 ⊢ ∅ ⊆ 𝑢
32	30, 31	eqsstrdi 4036	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)
33		eleq2 2818	. . . . . . . . . 10 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝐵 ∈ 𝑣 ↔ 𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵})))))
34		ineq1 4207	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝑣 ∩ (𝐴 ∖ {𝐵})) = ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵})))
35	34	imaeq2d 6068	. . . . . . . . . . 11 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) = (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))))
36	35	sseq1d 4013	. . . . . . . . . 10 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → ((𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢 ↔ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
37	33, 36	anbi12d 630	. . . . . . . . 9 ⊢ (𝑣 = (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) → ((𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢) ↔ (𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∧ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
38	37	rspcev 3611	. . . . . . . 8 ⊢ (((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∈ 𝐾 ∧ (𝐵 ∈ (ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∧ (𝐹 “ ((ℂ ∖ ((cls‘𝐾)‘(𝐴 ∖ {𝐵}))) ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
39	14, 20, 32, 38	syl12anc 835	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))
40	39	a1d 25	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
41	40	ralrimivw 3147	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))
42	41	ex 411	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℂ → ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢))))
43	42	pm4.71d 560	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℂ ↔ (𝑥 ∈ ℂ ∧ ∀𝑢 ∈ 𝐾 (𝑥 ∈ 𝑢 → ∃𝑣 ∈ 𝐾 (𝐵 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (𝐴 ∖ {𝐵}))) ⊆ 𝑢)))))
44	5, 43	bitr4d 281	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐹 lim_ℂ 𝐵) ↔ 𝑥 ∈ ℂ))
45	44	eqrdv 2726	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) = ℂ)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∀wral 3058 ∃wrex 3067 ∖ cdif 3946 ∩ cin 3948 ⊆ wss 3949 ∅c0 4326 {csn 4632 “ cima 5685 ⟶wf 6549 ‘cfv 6553 (class class class)co 7426 ℂcc 11144 TopOpenctopn 17410 ℂ_fldccnfld 21286 Topctop 22815 Clsdccld 22940 clsccl 22942 limPtclp 23058 lim_ℂ climc 25811

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-pre-sup 11224

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-tp 4637 df-op 4639 df-uni 4913 df-int 4954 df-iun 5002 df-iin 5003 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-1o 8493 df-er 8731 df-map 8853 df-pm 8854 df-en 8971 df-dom 8972 df-sdom 8973 df-fin 8974 df-fi 9442 df-sup 9473 df-inf 9474 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-2 12313 df-3 12314 df-4 12315 df-5 12316 df-6 12317 df-7 12318 df-8 12319 df-9 12320 df-n0 12511 df-z 12597 df-dec 12716 df-uz 12861 df-q 12971 df-rp 13015 df-xneg 13132 df-xadd 13133 df-xmul 13134 df-fz 13525 df-seq 14007 df-exp 14067 df-cj 15086 df-re 15087 df-im 15088 df-sqrt 15222 df-abs 15223 df-struct 17123 df-slot 17158 df-ndx 17170 df-base 17188 df-plusg 17253 df-mulr 17254 df-starv 17255 df-tset 17259 df-ple 17260 df-ds 17262 df-unif 17263 df-rest 17411 df-topn 17412 df-topgen 17432 df-psmet 21278 df-xmet 21279 df-met 21280 df-bl 21281 df-mopn 21282 df-cnfld 21287 df-top 22816 df-topon 22833 df-topsp 22855 df-bases 22869 df-cld 22943 df-cls 22945 df-lp 23060 df-cnp 23152 df-xms 24246 df-ms 24247 df-limc 25815

This theorem is referenced by: (None)

W3C validator