| 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 4230 | . . . . . . 7 ⊢ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) | |
| 2 | 1 | unieqi 4884 | . . . . . 6 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) |
| 3 | unidif0 5328 | . . . . . 6 ⊢ ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) = ∪ (𝐵 ∩ 𝒫 𝑥) | |
| 4 | 2, 3 | eqtri 2786 | . . . . 5 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑥) |
| 5 | 4 | sseq2i 3942 | . . . 4 ⊢ (𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) ↔ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)) |
| 6 | 5 | abbii 2830 | . . 3 ⊢ {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)} = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)} |
| 7 | difexg 5298 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V) | |
| 8 | tgval 23328 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) |
| 10 | tgval 23328 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘𝐵) = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)}) | |
| 11 | 6, 9, 10 | 3eqtr4a 2824 | . 2 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)) |
| 12 | difsnexi 7807 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → 𝐵 ∈ V) | |
| 13 | fvprc 6908 | . . . 4 ⊢ (¬ (𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) | |
| 14 | 12, 13 | nsyl5 160 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) |
| 15 | fvprc 6908 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘𝐵) = ∅) | |
| 16 | 14, 15 | eqtr4d 2801 | . 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 1570 ∈ wcel 2147 {cab 2741 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∅c0 4281 𝒫 cpw 4560 {csn 4588 ∪ cuni 4872 ‘cfv 6566 topGenctg 17658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-topgen 17664 |
| This theorem is used by: prdsxmslem2 24903 |
| Copyright terms: Public domain | W3C validator |