Theorem indiscld 18822

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 ` { (/) , A } ) = { (/) , A }

Proof of Theorem indiscld

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		indistop 18733	. . . . 5 |- { (/) , A } e. Top
2		indisuni 18734	. . . . . 6 |- ( _I ` A ) = U. { (/) , A }
3	2	iscld 18758	. . . . 5 |- ( { (/) , A } e. Top -> ( x e. ( Clsd ` { (/) , A } ) <-> ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) ) )
4	1, 3	ax-mp 5	. . . 4 |- ( x e. ( Clsd ` { (/) , A } ) <-> ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) )
5		simpl 457	. . . . . 6 |- ( ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) -> x C_ ( _I ` A ) )
6		dfss4 3687	. . . . . 6 |- ( x C_ ( _I ` A ) <-> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) = x )
7	5, 6	sylib 196	. . . . 5 |- ( ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) = x )
8		simpr 461	. . . . . . 7 |- ( ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) -> ( ( _I ` A ) \ x ) e. { (/) , A } )
9		indislem 18731	. . . . . . 7 |- { (/) , ( _I ` A ) } = { (/) , A }
10	8, 9	syl6eleqr 2551	. . . . . 6 |- ( ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) -> ( ( _I ` A ) \ x ) e. { (/) , ( _I ` A ) } )
11		elpri 4000	. . . . . 6 |- ( ( ( _I ` A ) \ x ) e. { (/) , ( _I ` A ) } -> ( ( ( _I ` A ) \ x ) = (/) \/ ( ( _I ` A ) \ x ) = ( _I ` A ) ) )
12		difeq2 3571	. . . . . . . . 9 |- ( ( ( _I ` A ) \ x ) = (/) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) = ( ( _I ` A ) \ (/) ) )
13		dif0 3852	. . . . . . . . 9 |- ( ( _I ` A ) \ (/) ) = ( _I ` A )
14	12, 13	syl6eq 2509	. . . . . . . 8 |- ( ( ( _I ` A ) \ x ) = (/) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) = ( _I ` A ) )
15		fvex 5804	. . . . . . . . . 10 |- ( _I ` A ) e. _V
16	15	prid2 4087	. . . . . . . . 9 |- ( _I ` A ) e. { (/) , ( _I ` A ) }
17	16, 9	eleqtri 2538	. . . . . . . 8 |- ( _I ` A ) e. { (/) , A }
18	14, 17	syl6eqel 2548	. . . . . . 7 |- ( ( ( _I ` A ) \ x ) = (/) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) e. { (/) , A } )
19		difeq2 3571	. . . . . . . . 9 |- ( ( ( _I ` A ) \ x ) = ( _I ` A ) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) = ( ( _I ` A ) \ ( _I ` A ) ) )
20		difid 3850	. . . . . . . . 9 |- ( ( _I ` A ) \ ( _I ` A ) ) = (/)
21	19, 20	syl6eq 2509	. . . . . . . 8 |- ( ( ( _I ` A ) \ x ) = ( _I ` A ) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) = (/) )
22		0ex 4525	. . . . . . . . 9 |- (/) e. _V
23	22	prid1 4086	. . . . . . . 8 |- (/) e. { (/) , A }
24	21, 23	syl6eqel 2548	. . . . . . 7 |- ( ( ( _I ` A ) \ x ) = ( _I ` A ) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) e. { (/) , A } )
25	18, 24	jaoi 379	. . . . . 6 |- ( ( ( ( _I ` A ) \ x ) = (/) \/ ( ( _I ` A ) \ x ) = ( _I ` A ) ) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) e. { (/) , A } )
26	10, 11, 25	3syl 20	. . . . 5 |- ( ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) -> ( ( _I ` A ) \ ( ( _I ` A ) \ x ) ) e. { (/) , A } )
27	7, 26	eqeltrrd 2541	. . . 4 |- ( ( x C_ ( _I ` A ) /\ ( ( _I ` A ) \ x ) e. { (/) , A } ) -> x e. { (/) , A } )
28	4, 27	sylbi 195	. . 3 |- ( x e. ( Clsd ` { (/) , A } ) -> x e. { (/) , A } )
29	28	ssriv 3463	. 2 |- ( Clsd ` { (/) , A } ) C_ { (/) , A }
30		0cld 18769	. . . . 5 |- ( { (/) , A } e. Top -> (/) e. ( Clsd ` { (/) , A } ) )
31	1, 30	ax-mp 5	. . . 4 |- (/) e. ( Clsd ` { (/) , A } )
32	2	topcld 18766	. . . . 5 |- ( { (/) , A } e. Top -> ( _I ` A ) e. ( Clsd ` { (/) , A } ) )
33	1, 32	ax-mp 5	. . . 4 |- ( _I ` A ) e. ( Clsd ` { (/) , A } )
34		prssi 4132	. . . 4 |- ( ( (/) e. ( Clsd ` { (/) , A } ) /\ ( _I ` A ) e. ( Clsd ` { (/) , A } ) ) -> { (/) , ( _I ` A ) } C_ ( Clsd ` { (/) , A } ) )
35	31, 33, 34	mp2an 672	. . 3 |- { (/) , ( _I ` A ) } C_ ( Clsd ` { (/) , A } )
36	9, 35	eqsstr3i 3490	. 2 |- { (/) , A } C_ ( Clsd ` { (/) , A } )
37	29, 36	eqssi 3475	1 |- ( Clsd ` { (/) , A } ) = { (/) , A }

Syntax hints:   <-> wb 184   \/ wo 368   /\ wa 369   = wceq 1370   e. wcel 1758   \ cdif 3428   C_ wss 3431   (/)c0 3740   {cpr 3982   _I cid 4734   ` cfv 5521   Topctop 18625   Clsdccld 18747

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1954  ax-ext 2431  ax-sep 4516  ax-nul 4524  ax-pow 4573  ax-pr 4634  ax-un 6477

This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2265  df-mo 2266  df-clab 2438  df-cleq 2444  df-clel 2447  df-nfc 2602  df-ne 2647  df-ral 2801  df-rex 2802  df-rab 2805  df-v 3074  df-sbc 3289  df-dif 3434  df-un 3436  df-in 3438  df-ss 3445  df-nul 3741  df-if 3895  df-pw 3965  df-sn 3981  df-pr 3983  df-op 3987  df-uni 4195  df-br 4396  df-opab 4454  df-mpt 4455  df-id 4739  df-xp 4949  df-rel 4950  df-cnv 4951  df-co 4952  df-dm 4953  df-iota 5484  df-fun 5523  df-fv 5529  df-top 18630  df-topon 18633  df-cld 18750

This theorem is referenced by: (None)