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

Theorem discld 20803
Description: The open sets of a discrete topology are closed and its closed sets are open. (Contributed by FL, 7-Jun-2007.) (Revised by Mario Carneiro, 7-Apr-2015.)
Assertion
Ref Expression
discld (𝐴𝑉 → (Clsd‘𝒫 𝐴) = 𝒫 𝐴)

Proof of Theorem discld
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 distop 20710 . . . . 5 (𝐴𝑉 → 𝒫 𝐴 ∈ Top)
2 unipw 4879 . . . . . . 7 𝒫 𝐴 = 𝐴
32eqcomi 2630 . . . . . 6 𝐴 = 𝒫 𝐴
43iscld 20741 . . . . 5 (𝒫 𝐴 ∈ Top → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ (𝑥𝐴 ∧ (𝐴𝑥) ∈ 𝒫 𝐴)))
51, 4syl 17 . . . 4 (𝐴𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ (𝑥𝐴 ∧ (𝐴𝑥) ∈ 𝒫 𝐴)))
6 difss 3715 . . . . . 6 (𝐴𝑥) ⊆ 𝐴
7 elpw2g 4787 . . . . . 6 (𝐴𝑉 → ((𝐴𝑥) ∈ 𝒫 𝐴 ↔ (𝐴𝑥) ⊆ 𝐴))
86, 7mpbiri 248 . . . . 5 (𝐴𝑉 → (𝐴𝑥) ∈ 𝒫 𝐴)
98biantrud 528 . . . 4 (𝐴𝑉 → (𝑥𝐴 ↔ (𝑥𝐴 ∧ (𝐴𝑥) ∈ 𝒫 𝐴)))
105, 9bitr4d 271 . . 3 (𝐴𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ 𝑥𝐴))
11 selpw 4137 . . 3 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
1210, 11syl6bbr 278 . 2 (𝐴𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ 𝑥 ∈ 𝒫 𝐴))
1312eqrdv 2619 1 (𝐴𝑉 → (Clsd‘𝒫 𝐴) = 𝒫 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  cdif 3552  wss 3555  𝒫 cpw 4130   cuni 4402  cfv 5847  Topctop 20617  Clsdccld 20730
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-iota 5810  df-fun 5849  df-fv 5855  df-top 20621  df-cld 20733
This theorem is referenced by:  sn0cld  20804
  Copyright terms: Public domain W3C validator