Theorem indiscld 23056

Description: The closed sets of an indiscrete topology. (Contributed by FL, 5-Jan-2009.) (Revised by Mario Carneiro, 14-Aug-2015.)

Assertion

Ref	Expression
indiscld	⊢ (Clsd‘{∅, 𝐴}) = {∅, 𝐴}

Proof of Theorem indiscld

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		indistop 22967	. . . . 5 ⊢ {∅, 𝐴} ∈ Top
2		indisuni 22968	. . . . . 6 ⊢ ( I ‘𝐴) = ∪ {∅, 𝐴}
3	2	iscld 22992	. . . . 5 ⊢ ({∅, 𝐴} ∈ Top → (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})))
4	1, 3	ax-mp 5	. . . 4 ⊢ (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}))
5		simpl 482	. . . . . 6 ⊢ ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ⊆ ( I ‘𝐴))
6		dfss4 4209	. . . . . 6 ⊢ (𝑥 ⊆ ( I ‘𝐴) ↔ (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
7	5, 6	sylib 218	. . . . 5 ⊢ ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
8		simpr 484	. . . . . . 7 ⊢ ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})
9		indislem 22965	. . . . . . 7 ⊢ {∅, ( I ‘𝐴)} = {∅, 𝐴}
10	8, 9	eleqtrrdi 2847	. . . . . 6 ⊢ ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)})
11		elpri 4591	. . . . . 6 ⊢ ((( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)} → ((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)))
12		difeq2 4060	. . . . . . . . 9 ⊢ ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ∅))
13		dif0 4318	. . . . . . . . 9 ⊢ (( I ‘𝐴) ∖ ∅) = ( I ‘𝐴)
14	12, 13	eqtrdi 2787	. . . . . . . 8 ⊢ ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ( I ‘𝐴))
15		fvex 6853	. . . . . . . . . 10 ⊢ ( I ‘𝐴) ∈ V
16	15	prid2 4707	. . . . . . . . 9 ⊢ ( I ‘𝐴) ∈ {∅, ( I ‘𝐴)}
17	16, 9	eleqtri 2834	. . . . . . . 8 ⊢ ( I ‘𝐴) ∈ {∅, 𝐴}
18	14, 17	eqeltrdi 2844	. . . . . . 7 ⊢ ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
19		difeq2 4060	. . . . . . . . 9 ⊢ ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ( I ‘𝐴)))
20		difid 4316	. . . . . . . . 9 ⊢ (( I ‘𝐴) ∖ ( I ‘𝐴)) = ∅
21	19, 20	eqtrdi 2787	. . . . . . . 8 ⊢ ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ∅)
22		0ex 5242	. . . . . . . . 9 ⊢ ∅ ∈ V
23	22	prid1 4706	. . . . . . . 8 ⊢ ∅ ∈ {∅, 𝐴}
24	21, 23	eqeltrdi 2844	. . . . . . 7 ⊢ ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
25	18, 24	jaoi 858	. . . . . 6 ⊢ (((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
26	10, 11, 25	3syl 18	. . . . 5 ⊢ ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
27	7, 26	eqeltrrd 2837	. . . 4 ⊢ ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
28	4, 27	sylbi 217	. . 3 ⊢ (𝑥 ∈ (Clsd‘{∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
29	28	ssriv 3925	. 2 ⊢ (Clsd‘{∅, 𝐴}) ⊆ {∅, 𝐴}
30		0cld 23003	. . . . 5 ⊢ ({∅, 𝐴} ∈ Top → ∅ ∈ (Clsd‘{∅, 𝐴}))
31	1, 30	ax-mp 5	. . . 4 ⊢ ∅ ∈ (Clsd‘{∅, 𝐴})
32	2	topcld 23000	. . . . 5 ⊢ ({∅, 𝐴} ∈ Top → ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴}))
33	1, 32	ax-mp 5	. . . 4 ⊢ ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})
34		prssi 4764	. . . 4 ⊢ ((∅ ∈ (Clsd‘{∅, 𝐴}) ∧ ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})) → {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴}))
35	31, 33, 34	mp2an 693	. . 3 ⊢ {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴})
36	9, 35	eqsstrri 3969	. 2 ⊢ {∅, 𝐴} ⊆ (Clsd‘{∅, 𝐴})
37	29, 36	eqssi 3938	1 ⊢ (Clsd‘{∅, 𝐴}) = {∅, 𝐴}

Syntax hints:   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ∖ cdif 3886   ⊆ wss 3889  ∅c0 4273  {cpr 4569   I cid 5525  ‘cfv 6498  Topctop 22858  Clsdccld 22981

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-top 22859  df-topon 22876  df-cld 22984

This theorem is referenced by: (None)