| 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 4234 | . . . . . . 7 ⊢ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) | |
| 2 | 1 | unieqi 4883 | . . . . . 6 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) |
| 3 | unidif0 5329 | . . . . . 6 ⊢ ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) = ∪ (𝐵 ∩ 𝒫 𝑥) | |
| 4 | 2, 3 | eqtri 2785 | . . . . 5 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑥) |
| 5 | 4 | sseq2i 3965 | . . . 4 ⊢ (𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) ↔ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)) |
| 6 | 5 | abbii 2829 | . . 3 ⊢ {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)} = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)} |
| 7 | difexg 5299 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V) | |
| 8 | tgval 23123 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) |
| 10 | tgval 23123 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘𝐵) = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)}) | |
| 11 | 6, 9, 10 | 3eqtr4a 2823 | . 2 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)) |
| 12 | difsnexi 7758 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → 𝐵 ∈ V) | |
| 13 | fvprc 6873 | . . . 4 ⊢ (¬ (𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) | |
| 14 | 12, 13 | nsyl5 160 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) |
| 15 | fvprc 6873 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘𝐵) = ∅) | |
| 16 | 14, 15 | eqtr4d 2800 | . 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 2142 {cab 2740 Vcvv 3454 ∖ cdif 3901 ∩ cin 3903 ⊆ wss 3904 ∅c0 4285 𝒫 cpw 4561 {csn 4588 ∪ cuni 4871 ‘cfv 6536 topGenctg 17496 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-iota 6492 df-fun 6538 df-fv 6544 df-topgen 17502 |
| This theorem is used by: prdsxmslem2 24697 |
| Copyright terms: Public domain | W3C validator |