| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgdif0 | Structured version Visualization version GIF version | ||
| Description: A generated topology is not affected by the addition or removal of the empty set from the base. (Contributed by Mario Carneiro, 28-Aug-2015.) |
| Ref | Expression |
|---|---|
| tgdif0 | ⊢ (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indif1 4226 | . . . . . . 7 ⊢ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) | |
| 2 | 1 | unieqi 4878 | . . . . . 6 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) |
| 3 | unidif0 5321 | . . . . . 6 ⊢ ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) = ∪ (𝐵 ∩ 𝒫 𝑥) | |
| 4 | 2, 3 | eqtri 2783 | . . . . 5 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑥) |
| 5 | 4 | sseq2i 3938 | . . . 4 ⊢ (𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) ↔ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)) |
| 6 | 5 | abbii 2827 | . . 3 ⊢ {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)} = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)} |
| 7 | difexg 5291 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V) | |
| 8 | tgval 23282 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) |
| 10 | tgval 23282 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘𝐵) = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)}) | |
| 11 | 6, 9, 10 | 3eqtr4a 2821 | . 2 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)) |
| 12 | difsnexi 7779 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → 𝐵 ∈ V) | |
| 13 | fvprc 6882 | . . . 4 ⊢ (¬ (𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) | |
| 14 | 12, 13 | nsyl5 160 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) |
| 15 | fvprc 6882 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘𝐵) = ∅) | |
| 16 | 14, 15 | eqtr4d 2798 | . 2 ⊢ (¬ 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)) |
| 17 | 11, 16 | pm2.61i 184 | 1 ⊢ (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ∈ wcel 2144 {cab 2738 Vcvv 3450 ⊆ wss 3896 ∖ cdif 4044 ∩ cin 4088 ∅c0 4277 𝒫 cpw 4556 {csn 4584 ∪ cuni 4866 ‘cfv 6543 topGenctg 17617 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6497 df-fun 6545 df-fv 6551 df-topgen 17623 |
| This theorem is used by: prdsxmslem2 24857 |
| Copyright terms: Public domain | W3C validator |