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

Theorem isconn2 21439
 Description: The predicate 𝐽 is a connected topology . (Contributed by Mario Carneiro, 10-Mar-2015.)
Hypothesis
Ref Expression
isconn.1 𝑋 = 𝐽
Assertion
Ref Expression
isconn2 (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋}))

Proof of Theorem isconn2
StepHypRef Expression
1 isconn.1 . . 3 𝑋 = 𝐽
21isconn 21438 . 2 (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋}))
3 0opn 20931 . . . . . . 7 (𝐽 ∈ Top → ∅ ∈ 𝐽)
4 0cld 21064 . . . . . . 7 (𝐽 ∈ Top → ∅ ∈ (Clsd‘𝐽))
53, 4elind 3941 . . . . . 6 (𝐽 ∈ Top → ∅ ∈ (𝐽 ∩ (Clsd‘𝐽)))
61topopn 20933 . . . . . . 7 (𝐽 ∈ Top → 𝑋𝐽)
71topcld 21061 . . . . . . 7 (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽))
86, 7elind 3941 . . . . . 6 (𝐽 ∈ Top → 𝑋 ∈ (𝐽 ∩ (Clsd‘𝐽)))
9 prssi 4498 . . . . . 6 ((∅ ∈ (𝐽 ∩ (Clsd‘𝐽)) ∧ 𝑋 ∈ (𝐽 ∩ (Clsd‘𝐽))) → {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽)))
105, 8, 9syl2anc 696 . . . . 5 (𝐽 ∈ Top → {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽)))
1110biantrud 529 . . . 4 (𝐽 ∈ Top → ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ↔ ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ∧ {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽)))))
12 eqss 3759 . . . 4 ((𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋} ↔ ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ∧ {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽))))
1311, 12syl6rbbr 279 . . 3 (𝐽 ∈ Top → ((𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋} ↔ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋}))
1413pm5.32i 672 . 2 ((𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋}) ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋}))
152, 14bitri 264 1 (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋}))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   = wceq 1632   ∈ wcel 2139   ∩ cin 3714   ⊆ wss 3715  ∅c0 4058  {cpr 4323  ∪ cuni 4588  ‘cfv 6049  Topctop 20920  Clsdccld 21042  Conncconn 21436 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-iota 6012  df-fun 6051  df-fv 6057  df-top 20921  df-cld 21045  df-conn 21437 This theorem is referenced by:  indisconn  21443  dfconn2  21444  cnconn  21447  txconn  21714  filconn  21908  onsucconni  32763
 Copyright terms: Public domain W3C validator