![]() |
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 23361 | . 2 ⊢ (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋})) |
3 | eqss 3992 | . . . 4 ⊢ ((𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋} ↔ ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ∧ {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽)))) | |
4 | 0opn 22850 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ∅ ∈ 𝐽) | |
5 | 0cld 22986 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ∅ ∈ (Clsd‘𝐽)) | |
6 | 4, 5 | elind 4192 | . . . . . 6 ⊢ (𝐽 ∈ Top → ∅ ∈ (𝐽 ∩ (Clsd‘𝐽))) |
7 | 1 | topopn 22852 | . . . . . . 7 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
8 | 1 | topcld 22983 | . . . . . . 7 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽)) |
9 | 7, 8 | elind 4192 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (𝐽 ∩ (Clsd‘𝐽))) |
10 | 6, 9 | prssd 4827 | . . . . 5 ⊢ (𝐽 ∈ Top → {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽))) |
11 | 10 | biantrud 530 | . . . 4 ⊢ (𝐽 ∈ Top → ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ↔ ((𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋} ∧ {∅, 𝑋} ⊆ (𝐽 ∩ (Clsd‘𝐽))))) |
12 | 3, 11 | bitr4id 289 | . . 3 ⊢ (𝐽 ∈ Top → ((𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋} ↔ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
13 | 12 | pm5.32i 573 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) = {∅, 𝑋}) ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
14 | 2, 13 | bitri 274 | 1 ⊢ (𝐽 ∈ Conn ↔ (𝐽 ∈ Top ∧ (𝐽 ∩ (Clsd‘𝐽)) ⊆ {∅, 𝑋})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∩ cin 3943 ⊆ wss 3944 ∅c0 4322 {cpr 4632 ∪ cuni 4909 ‘cfv 6549 Topctop 22839 Clsdccld 22964 Conncconn 23359 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-iota 6501 df-fun 6551 df-fv 6557 df-top 22840 df-cld 22967 df-conn 23360 |
This theorem is referenced by: indisconn 23366 dfconn2 23367 cnconn 23370 txconn 23637 filconn 23831 onsucconni 36049 |
Copyright terms: Public domain | W3C validator |