MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  conncompcld Structured version   Visualization version   GIF version

Theorem conncompcld 22585
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
StepHypRef Expression
1 topontop 22062 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2 conncomp.2 . . . . . . 7 𝑆 = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)}
3 ssrab2 4013 . . . . . . . 8 {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋
4 sspwuni 5029 . . . . . . . 8 ({𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋 {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝑋)
53, 4mpbi 229 . . . . . . 7 {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝑋
62, 5eqsstri 3955 . . . . . 6 𝑆𝑋
7 toponuni 22063 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
87adantr 481 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑋 = 𝐽)
96, 8sseqtrid 3973 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆 𝐽)
10 eqid 2738 . . . . . 6 𝐽 = 𝐽
1110clsss3 22210 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → ((cls‘𝐽)‘𝑆) ⊆ 𝐽)
121, 9, 11syl2an2r 682 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝐽)
1312, 8sseqtrrd 3962 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
1410sscls 22207 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
151, 9, 14syl2an2r 682 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
162conncompid 22582 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐴𝑆)
1715, 16sseldd 3922 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
18 simpl 483 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
196a1i 11 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆𝑋)
202conncompconn 22583 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t 𝑆) ∈ Conn)
21 clsconn 22581 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑆𝑋 ∧ (𝐽t 𝑆) ∈ Conn) → (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Conn)
2218, 19, 20, 21syl3anc 1370 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Conn)
232conncompss 22584 . . 3 ((((cls‘𝐽)‘𝑆) ⊆ 𝑋𝐴 ∈ ((cls‘𝐽)‘𝑆) ∧ (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Conn) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
2413, 17, 22, 23syl3anc 1370 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
2510iscld4 22216 . . 3 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
261, 9, 25syl2an2r 682 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
2724, 26mpbird 256 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆 ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  {crab 3068  wss 3887  𝒫 cpw 4533   cuni 4839  cfv 6433  (class class class)co 7275  t crest 17131  Topctop 22042  TopOnctopon 22059  Clsdccld 22167  clsccl 22169  Conncconn 22562
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-en 8734  df-fin 8737  df-fi 9170  df-rest 17133  df-topgen 17154  df-top 22043  df-topon 22060  df-bases 22096  df-cld 22170  df-ntr 22171  df-cls 22172  df-conn 22563
This theorem is referenced by:  conncompclo  22586
  Copyright terms: Public domain W3C validator