![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > isconn2 | Structured version Visualization version GIF version |
Description: The predicate 𝐽 is a connected topology . (Contributed by Mario Carneiro, 10-Mar-2015.) |
Ref | Expression |
---|---|
isconn.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
isconn2 | ⊢ (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isconn.1 | . . 3 ⊢ 𝑋 = ∪ 𝐽 | |
2 | 1 | isconn 22787 | . 2 ⊢ (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋})) |
3 | eqss 3963 | . . . 4 ⊢ ((𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋} ↔ ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ∧ {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽)))) | |
4 | 0opn 22276 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ∅ ∈ 𝐽) | |
5 | 0cld 22412 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ∅ ∈ (Clsd‘𝐽)) | |
6 | 4, 5 | elind 4158 | . . . . . 6 ⊢ (𝐽 ∈ Top → ∅ ∈ (𝐽 ∩ (Clsd‘𝐽))) |
7 | 1 | topopn 22278 | . . . . . . 7 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
8 | 1 | topcld 22409 | . . . . . . 7 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽)) |
9 | 7, 8 | elind 4158 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (𝐽 ∩ (Clsd‘𝐽))) |
10 | 6, 9 | prssd 4786 | . . . . 5 ⊢ (𝐽 ∈ Top → {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽))) |
11 | 10 | biantrud 533 | . . . 4 ⊢ (𝐽 ∈ Top → ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ↔ ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ∧ {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽))))) |
12 | 3, 11 | bitr4id 290 | . . 3 ⊢ (𝐽 ∈ Top → ((𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋} ↔ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
13 | 12 | pm5.32i 576 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋}) ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
14 | 2, 13 | bitri 275 | 1 ⊢ (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∩ cin 3913 ⊆ wss 3914 ∅c0 4286 {cpr 4592 ∪ cuni 4869 ‘cfv 6500 Topctop 22265 Clsdccld 22390 Conncconn 22785 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5260 ax-nul 5267 ax-pow 5324 ax-pr 5388 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ral 3062 df-rex 3071 df-rab 3407 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4287 df-if 4491 df-pw 4566 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-br 5110 df-opab 5172 df-mpt 5193 df-id 5535 df-xp 5643 df-rel 5644 df-cnv 5645 df-co 5646 df-dm 5647 df-iota 6452 df-fun 6502 df-fv 6508 df-top 22266 df-cld 22393 df-conn 22786 |
This theorem is referenced by: indisconn 22792 dfconn2 22793 cnconn 22796 txconn 23063 filconn 23257 onsucconni 34962 |
Copyright terms: Public domain | W3C validator |