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

Theorem conncompcld 23463
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 22940 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2 conncomp.2 . . . . . . 7 𝑆 = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)}
3 ssrab2 4103 . . . . . . . 8 {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋
4 sspwuni 5123 . . . . . . . 8 ({𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝒫 𝑋 {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝑋)
53, 4mpbi 230 . . . . . . 7 {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴𝑥 ∧ (𝐽t 𝑥) ∈ Conn)} ⊆ 𝑋
62, 5eqsstri 4043 . . . . . 6 𝑆𝑋
7 toponuni 22941 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
87adantr 480 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑋 = 𝐽)
96, 8sseqtrid 4061 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆 𝐽)
10 eqid 2740 . . . . . 6 𝐽 = 𝐽
1110clsss3 23088 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → ((cls‘𝐽)‘𝑆) ⊆ 𝐽)
121, 9, 11syl2an2r 684 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝐽)
1312, 8sseqtrrd 4050 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
1410sscls 23085 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
151, 9, 14syl2an2r 684 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
162conncompid 23460 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐴𝑆)
1715, 16sseldd 4009 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
18 simpl 482 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
196a1i 11 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆𝑋)
202conncompconn 23461 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t 𝑆) ∈ Conn)
21 clsconn 23459 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑆𝑋 ∧ (𝐽t 𝑆) ∈ Conn) → (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Conn)
2218, 19, 20, 21syl3anc 1371 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Conn)
232conncompss 23462 . . 3 ((((cls‘𝐽)‘𝑆) ⊆ 𝑋𝐴 ∈ ((cls‘𝐽)‘𝑆) ∧ (𝐽t ((cls‘𝐽)‘𝑆)) ∈ Conn) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
2413, 17, 22, 23syl3anc 1371 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑆)
2510iscld4 23094 . . 3 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
261, 9, 25syl2an2r 684 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝑆 ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘𝑆) ⊆ 𝑆))
2724, 26mpbird 257 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝑆 ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  {crab 3443  wss 3976  𝒫 cpw 4622   cuni 4931  cfv 6573  (class class class)co 7448  t crest 17480  Topctop 22920  TopOnctopon 22937  Clsdccld 23045  clsccl 23047  Conncconn 23440
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-iin 5018  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-en 9004  df-fin 9007  df-fi 9480  df-rest 17482  df-topgen 17503  df-top 22921  df-topon 22938  df-bases 22974  df-cld 23048  df-ntr 23049  df-cls 23050  df-conn 23441
This theorem is referenced by:  conncompclo  23464
  Copyright terms: Public domain W3C validator