Theorem conncompcld 23344

Description: The connected component containing 𝐴 is a closed set. (Contributed by Mario Carneiro, 19-Mar-2015.)

Hypothesis

Ref	Expression
conncomp.2	⊢ 𝑆 = ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}

Assertion

Ref	Expression
conncompcld	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ∈ (Clsd‘𝐽))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐽   𝑥,𝑋

Allowed substitution hint:   𝑆(𝑥)

Proof of Theorem conncompcld

Step	Hyp	Ref	Expression
1		topontop 22823	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2		conncomp.2	. . . . . . 7 ⊢ 𝑆 = ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}
3		ssrab2 4025	. . . . . . . 8 ⊢ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋
4		sspwuni 5043	. . . . . . . 8 ⊢ ({𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋 ↔ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝑋)
5	3, 4	mpbi 230	. . . . . . 7 ⊢ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝑋
6	2, 5	eqsstri 3976	. . . . . 6 ⊢ 𝑆 ⊆ 𝑋
7		toponuni 22824	. . . . . . 7 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
8	7	adantr 480	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑋 = ∪ 𝐽)
9	6, 8	sseqtrid 3972	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ ∪ 𝐽)
10		eqid 2731	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
11	10	clsss3 22969	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((cls‘𝐽)‘𝑆) ⊆ ∪ 𝐽)
12	1, 9, 11	syl2an2r 685	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ∪ 𝐽)
13	12, 8	sseqtrrd 3967	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
14	10	sscls 22966	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
15	1, 9, 14	syl2an2r 685	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
16	2	conncompid 23341	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑆)
17	15, 16	sseldd 3930	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
18		simpl 482	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
19	6	a1i 11	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
20	2	conncompconn 23342	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t 𝑆) ∈ Conn)
21		clsconn 23340	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ (𝐽 ↾t 𝑆) ∈ Conn) → (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn)
22	18, 19, 20, 21	syl3anc 1373	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn)
23	2	conncompss 23343	. . 3 ⊢ ((((cls‘𝐽)‘𝑆) ⊆ 𝑋 ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆) ∧ (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
24	13, 17, 22, 23	syl3anc 1373	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
25	10	iscld4 22975	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
26	1, 9, 25	syl2an2r 685	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
27	24, 26	mpbird 257	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ∈ (Clsd‘𝐽))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  {crab 3395   ⊆ wss 3897  𝒫 cpw 4545  ∪ cuni 4854  ‘cfv 6476  (class class class)co 7341   ↾_t crest 17319  Topctop 22803  TopOnctopon 22820  Clsdccld 22926  clsccl 22928  Conncconn 23321

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 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5212  ax-sep 5229  ax-nul 5239  ax-pow 5298  ax-pr 5365  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-int 4893  df-iun 4938  df-iin 4939  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5506  df-eprel 5511  df-po 5519  df-so 5520  df-fr 5564  df-we 5566  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-ord 6304  df-on 6305  df-lim 6306  df-suc 6307  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-ov 7344  df-oprab 7345  df-mpo 7346  df-om 7792  df-1st 7916  df-2nd 7917  df-en 8865  df-fin 8868  df-fi 9290  df-rest 17321  df-topgen 17342  df-top 22804  df-topon 22821  df-bases 22856  df-cld 22929  df-ntr 22930  df-cls 22931  df-conn 23322

This theorem is referenced by:  conncompclo  23345