MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tgdif0 Structured version   Visualization version   GIF version

Theorem tgdif0 22934
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.)
Assertion
Ref Expression
tgdif0 (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)

Proof of Theorem tgdif0
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 indif1 4232 . . . . . . 7 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅})
21unieqi 4873 . . . . . 6 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅})
3 unidif0 5303 . . . . . 6 ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) = (𝐵 ∩ 𝒫 𝑥)
42, 3eqtri 2757 . . . . 5 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑥)
54sseq2i 3961 . . . 4 (𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) ↔ 𝑥 (𝐵 ∩ 𝒫 𝑥))
65abbii 2801 . . 3 {𝑥𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)} = {𝑥𝑥 (𝐵 ∩ 𝒫 𝑥)}
7 difexg 5272 . . . 4 (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V)
8 tgval 22897 . . . 4 ((𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)})
97, 8syl 17 . . 3 (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)})
10 tgval 22897 . . 3 (𝐵 ∈ V → (topGen‘𝐵) = {𝑥𝑥 (𝐵 ∩ 𝒫 𝑥)})
116, 9, 103eqtr4a 2795 . 2 (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵))
12 difsnexi 7704 . . . 4 ((𝐵 ∖ {∅}) ∈ V → 𝐵 ∈ V)
13 fvprc 6824 . . . 4 (¬ (𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅)
1412, 13nsyl5 159 . . 3 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅)
15 fvprc 6824 . . 3 𝐵 ∈ V → (topGen‘𝐵) = ∅)
1614, 15eqtr4d 2772 . 2 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵))
1711, 16pm2.61i 182 1 (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1541  wcel 2113  {cab 2712  Vcvv 3438  cdif 3896  cin 3898  wss 3899  c0 4283  𝒫 cpw 4552  {csn 4578   cuni 4861  cfv 6490  topGenctg 17355
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-topgen 17361
This theorem is referenced by:  prdsxmslem2  24471
  Copyright terms: Public domain W3C validator