Theorem discld 15160

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 15109	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Top)
2		unipw 4352	. . . . . . 7 ⊢ ∪ 𝒫 𝐴 = 𝐴
3	2	eqcomi 2242	. . . . . 6 ⊢ 𝐴 = ∪ 𝒫 𝐴
4	3	iscld 15127	. . . . 5 ⊢ (𝒫 𝐴 ∈ Top → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)))
5	1, 4	syl 14	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)))
6		difss 3355	. . . . . 6 ⊢ (𝐴 ∖ 𝑥) ⊆ 𝐴
7		elpw2g 4287	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ 𝑥) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ 𝑥) ⊆ 𝐴))
8	6, 7	mpbiri 168	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)
9	8	biantrud 304	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ⊆ 𝐴 ↔ (𝑥 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝒫 𝐴)))
10	5, 9	bitr4d 191	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ 𝑥 ⊆ 𝐴))
11		velpw 3692	. . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
12	10, 11	bitr4di 198	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ (Clsd‘𝒫 𝐴) ↔ 𝑥 ∈ 𝒫 𝐴))
13	12	eqrdv 2236	1 ⊢ (𝐴 ∈ 𝑉 → (Clsd‘𝒫 𝐴) = 𝒫 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209   ∖ cdif 3217   ⊆ wss 3220  𝒫 cpw 3685  ∪ cuni 3930  ‘cfv 5372  Topctop 15021  Clsdccld 15116

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-top 15022  df-cld 15119

This theorem is referenced by:  sn0cld  15161