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

Theorem tgdif0 23217
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 4228 . . . . . . 7 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅})
21unieqi 4879 . . . . . 6 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = ((𝐵 ∩ 𝒫 𝑥) ∖ {∅})
3 unidif0 5324 . . . . . 6 ((𝐵 ∩ 𝒫 𝑥) ∖ {∅}) = (𝐵 ∩ 𝒫 𝑥)
42, 3eqtri 2783 . . . . 5 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑥)
54sseq2i 3960 . . . 4 (𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥) ↔ 𝑥 (𝐵 ∩ 𝒫 𝑥))
65abbii 2827 . . 3 {𝑥𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)} = {𝑥𝑥 (𝐵 ∩ 𝒫 𝑥)}
7 difexg 5294 . . . 4 (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V)
8 tgval 23180 . . . 4 ((𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)})
97, 8syl 18 . . 3 (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = {𝑥𝑥 ((𝐵 ∖ {∅}) ∩ 𝒫 𝑥)})
10 tgval 23180 . . 3 (𝐵 ∈ V → (topGen‘𝐵) = {𝑥𝑥 (𝐵 ∩ 𝒫 𝑥)})
116, 9, 103eqtr4a 2821 . 2 (𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵))
12 difsnexi 7760 . . . 4 ((𝐵 ∖ {∅}) ∈ V → 𝐵 ∈ V)
13 fvprc 6870 . . . 4 (¬ (𝐵 ∖ {∅}) ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅)
1412, 13nsyl5 160 . . 3 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = ∅)
15 fvprc 6870 . . 3 𝐵 ∈ V → (topGen‘𝐵) = ∅)
1614, 15eqtr4d 2798 . 2 𝐵 ∈ V → (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵))
1711, 16pm2.61i 184 1 (topGen‘(𝐵 ∖ {∅})) = (topGen‘𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570  wcel 2145  {cab 2738  Vcvv 3450  cdif 3896  cin 3898  wss 3899  c0 4279  𝒫 cpw 4557  {csn 4584   cuni 4867  cfv 6533  topGenctg 17522
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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 2100  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-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-topgen 17528
This theorem is used by:  prdsxmslem2  24755
  Copyright terms: Public domain W3C validator