Theorem discld 14850

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.

Step	Hyp	Ref	Expression
1		distop 14799	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Top)
2		unipw 4307	. . . . . . 7 ⊢ ∪ 𝒫 𝐴 = 𝐴
3	2	eqcomi 2233	. . . . . 6 ⊢ 𝐴 = ∪ 𝒫 𝐴
4	3	iscld 14817	. . . . 5 ⊢ (𝒫 𝐴 ∈ Top → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)))
5	1, 4	syl 14	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)))
6		difss 3331	. . . . . 6 ⊢ (𝐴 ∖ 𝑥) ⊆ 𝐴
7		elpw2g 4244	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ 𝑥) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ 𝑥) ⊆ 𝐴))
8	6, 7	mpbiri 168	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)
9	8	biantrud 304	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ⊆ 𝐴 ↔ (𝑥 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)))
10	5, 9	bitr4d 191	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ 𝑥 ⊆ 𝐴))
11		velpw 3657	. . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
12	10, 11	bitr4di 198	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ 𝑥 ∈ 𝒫 𝐴))
13	12	eqrdv 2227	1 ⊢ (𝐴 ∈ 𝑉 → (Clsd‘𝒫 𝐴) = 𝒫 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1395   ∈ wcel 2200   ∖ cdif 3195   ⊆ wss 3198  𝒫 cpw 3650  ∪ cuni 3891  ‘cfv 5324  Topctop 14711  Clsdccld 14806

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-top 14712  df-cld 14809

This theorem is referenced by:  sn0cld  14851