Theorem conncompcld 23591

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 23070	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2		conncomp.2	. . . . . . 7 ⊢ 𝑆 = ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}
3		ssrab2 4034	. . . . . . . 8 ⊢ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋
4		sspwuni 5066	. . . . . . . 8 ⊢ ({𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋 ↔ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝑋)
5	3, 4	mpbi 233	. . . . . . 7 ⊢ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ⊆ 𝑋
6	2, 5	eqsstri 3983	. . . . . 6 ⊢ 𝑆 ⊆ 𝑋
7		toponuni 23071	. . . . . . 7 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
8	7	adantr 485	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑋 = ∪ 𝐽)
9	6, 8	sseqtrid 3979	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ ∪ 𝐽)
10		eqid 2763	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
11	10	clsss3 23216	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((cls‘𝐽)‘𝑆) ⊆ ∪ 𝐽)
12	1, 9, 11	syl2an2r 697	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ∪ 𝐽)
13	12, 8	sseqtrrd 3974	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
14	10	sscls 23213	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
15	1, 9, 14	syl2an2r 697	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
16	2	conncompid 23588	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑆)
17	15, 16	sseldd 3938	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
18		simpl 487	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
19	6	a1i 11	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
20	2	conncompconn 23589	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t 𝑆) ∈ Conn)
21		clsconn 23587	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ (𝐽 ↾t 𝑆) ∈ Conn) → (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn)
22	18, 19, 20, 21	syl3anc 1398	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn)
23	2	conncompss 23590	. . 3 ⊢ ((((cls‘𝐽)‘𝑆) ⊆ 𝑋 ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆) ∧ (𝐽 ↾t ((cls‘𝐽)‘𝑆)) ∈ Conn) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
24	13, 17, 22, 23	syl3anc 1398	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
25	10	iscld4 23222	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
26	1, 9, 25	syl2an2r 697	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
27	24, 26	mpbird 260	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝑆 ∈ (Clsd‘𝐽))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {crab 3416   ⊆ wss 3905  𝒫 cpw 4562  ∪ cuni 4872  ‘cfv 6536  (class class class)co 7410   ↾_t crest 17468  Topctop 23050  TopOnctopon 23067  Clsdccld 23173  clsccl 23175  Conncconn 23568

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-en 8940  df-fin 8943  df-fi 9367  df-rest 17470  df-topgen 17491  df-top 23051  df-topon 23068  df-bases 23103  df-cld 23176  df-ntr 23177  df-cls 23178  df-conn 23569

This theorem is referenced by:  conncompclo  23592