Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > neiuni | GIF version |
Description: The union of the neighborhoods of a set equals the topology's underlying set. (Contributed by FL, 18-Sep-2007.) (Revised by Mario Carneiro, 9-Apr-2015.) |
Ref | Expression |
---|---|
tpnei.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
neiuni | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑋 = ∪ ((nei‘𝐽)‘𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tpnei.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
2 | 1 | tpnei 12332 | . . . 4 ⊢ (𝐽 ∈ Top → (𝑆 ⊆ 𝑋 ↔ 𝑋 ∈ ((nei‘𝐽)‘𝑆))) |
3 | 2 | biimpa 294 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑋 ∈ ((nei‘𝐽)‘𝑆)) |
4 | elssuni 3764 | . . 3 ⊢ (𝑋 ∈ ((nei‘𝐽)‘𝑆) → 𝑋 ⊆ ∪ ((nei‘𝐽)‘𝑆)) | |
5 | 3, 4 | syl 14 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑋 ⊆ ∪ ((nei‘𝐽)‘𝑆)) |
6 | 1 | neii1 12319 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑥 ⊆ 𝑋) |
7 | 6 | ex 114 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥 ⊆ 𝑋)) |
8 | 7 | adantr 274 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥 ⊆ 𝑋)) |
9 | 8 | ralrimiv 2504 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ∀𝑥 ∈ ((nei‘𝐽)‘𝑆)𝑥 ⊆ 𝑋) |
10 | unissb 3766 | . . 3 ⊢ (∪ ((nei‘𝐽)‘𝑆) ⊆ 𝑋 ↔ ∀𝑥 ∈ ((nei‘𝐽)‘𝑆)𝑥 ⊆ 𝑋) | |
11 | 9, 10 | sylibr 133 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ∪ ((nei‘𝐽)‘𝑆) ⊆ 𝑋) |
12 | 5, 11 | eqssd 3114 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑋 = ∪ ((nei‘𝐽)‘𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 ∀wral 2416 ⊆ wss 3071 ∪ cuni 3736 ‘cfv 5123 Topctop 12167 neicnei 12310 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-top 12168 df-nei 12311 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |