Theorem conncompcld 23319

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 22798	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2		conncomp.2	. . . . . . 7 ⊢ 𝑆 = ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}
3		ssrab2 4031	. . . . . . . 8 ⊢ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋
4		sspwuni 5049	. . . . . . . 8 ⊢ ({𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋 ↔ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝑋)
5	3, 4	mpbi 230	. . . . . . 7 ⊢ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝑋
6	2, 5	eqsstri 3982	. . . . . 6 ⊢ 𝑆 ⊆ 𝑋
7		toponuni 22799	. . . . . . 7 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
8	7	adantr 480	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑋 = ∪ 𝐽)
9	6, 8	sseqtrid 3978	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ ∪ 𝐽)
10		eqid 2729	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
11	10	clsss3 22944	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((cls‘𝐽)‘𝑆) ⊆ ∪ 𝐽)
12	1, 9, 11	syl2an2r 685	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ∪ 𝐽)
13	12, 8	sseqtrrd 3973	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
14	10	sscls 22941	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
15	1, 9, 14	syl2an2r 685	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
16	2	conncompid 23316	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑆)
17	15, 16	sseldd 3936	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
18		simpl 482	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
19	6	a1i 11	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
20	2	conncompconn 23317	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t 𝑆) ∈ Conn)
21		clsconn 23315	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ (𝐽 ↾t 𝑆) ∈ Conn) → (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn)
22	18, 19, 20, 21	syl3anc 1373	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn)
23	2	conncompss 23318	. . 3 ⊢ ((((cls‘𝐽)‘𝑆) ⊆ 𝑋 ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆) ∧ (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
24	13, 17, 22, 23	syl3anc 1373	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
25	10	iscld4 22950	. . 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 1540   ∈ wcel 2109  {crab 3394   ⊆ wss 3903  𝒫 cpw 4551  ∪ cuni 4858  ‘cfv 6482  (class class class)co 7349   ↾_t crest 17324  Topctop 22778  TopOnctopon 22795  Clsdccld 22901  clsccl 22903  Conncconn 23296

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-iin 4944  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-en 8873  df-fin 8876  df-fi 9301  df-rest 17326  df-topgen 17347  df-top 22779  df-topon 22796  df-bases 22831  df-cld 22904  df-ntr 22905  df-cls 22906  df-conn 23297

This theorem is referenced by:  conncompclo  23320