![]() |
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 3871 | . . . . . . 7 ⊢ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) | |
2 | 1 | unieqi 4445 | . . . . . 6 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) |
3 | unidif0 4838 | . . . . . 6 ⊢ ∪ ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) = ∪ (𝐵 ∩ 𝒫 𝑥) | |
4 | 2, 3 | eqtri 2644 | . . . . 5 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑥) |
5 | 4 | sseq2i 3630 | . . . 4 ⊢ (𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) ↔ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)) |
6 | 5 | abbii 2739 | . . 3 ⊢ {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)} = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)} |
7 | difexg 4808 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V) | |
8 | tgval 20759 | . . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥 ∣ 𝑥 ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)}) |
10 | tgval 20759 | . . 3 ⊢ (𝐵 ∈ V → (topGen‘𝐵) = {𝑥 ∣ 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 𝑥)}) | |
11 | 6, 9, 10 | 3eqtr4a 2682 | . 2 ⊢ (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)) |
12 | difsnexi 6970 | . . . . 5 ⊢ ((𝐵 ∖ {∅}) ∈ V → 𝐵 ∈ V) | |
13 | 12 | con3i 150 | . . . 4 ⊢ (¬ 𝐵 ∈ V → ¬ (𝐵 ∖ {∅}) ∈ V) |
14 | fvprc 6185 | . . . 4 ⊢ (¬ (𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) | |
15 | 13, 14 | syl 17 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅) |
16 | fvprc 6185 | . . 3 ⊢ (¬ 𝐵 ∈ V → (topGen‘𝐵) = ∅) | |
17 | 15, 16 | eqtr4d 2659 | . 2 ⊢ (¬ 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)) |
18 | 11, 17 | pm2.61i 176 | 1 ⊢ (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1483 ∈ wcel 1990 {cab 2608 Vcvv 3200 ∖ cdif 3571 ∩ cin 3573 ⊆ wss 3574 ∅c0 3915 𝒫 cpw 4158 {csn 4177 ∪ cuni 4436 ‘cfv 5888 topGenctg 16098 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fv 5896 df-topgen 16104 |
This theorem is referenced by: prdsxmslem2 22334 |
Copyright terms: Public domain | W3C validator |