Theorem sn0top 7597

Description: The singleton of the empty set is a topology. (Contributed by Stefan Allan, 3-Mar-2006.)

Assertion

Ref	Expression
sn0top	|- {(/)} e. Top

Proof of Theorem sn0top

Step	Hyp	Ref	Expression
1		p0ex 2765	. . 3 |- {(/)} e. V
2		istopg 7546	. . 3 |- ({(/)} e. V -> ({(/)} e. Top <-> (A.x(x (_ {(/)} -> U.x e. {(/)}) /\ A.x e. {(/)}A.y e. {(/)} (x i^i y) e. {(/)})))
3	1, 2	ax-mp 7	. 2 |- ({(/)} e. Top <-> (A.x(x (_ {(/)} -> U.x e. {(/)}) /\ A.x e. {(/)}A.y e. {(/)} (x i^i y) e. {(/)}))
4		sssn 2469	. . . 4 |- (x (_ {(/)} <-> (x = (/) \/ x = {(/)}))
5		unieq 2505	. . . . . 6 |- (x = (/) -> U.x = U.(/))
6		uni0 2520	. . . . . . 7 |- U.(/) = (/)
7		0ex 2706	. . . . . . . 8 |- (/) e. V
8	7	elsnc2 2433	. . . . . . 7 |- (U.(/) e. {(/)} <-> U.(/) = (/))
9	6, 8	mpbir 190	. . . . . 6 |- U.(/) e. {(/)}
10	5, 9	syl6eqel 1553	. . . . 5 |- (x = (/) -> U.x e. {(/)})
11		unieq 2505	. . . . . 6 |- (x = {(/)} -> U.x = U.{(/)})
12	7	unisn 2512	. . . . . . . 8 |- U.{(/)} = (/)
13		eqtrt 1489	. . . . . . . 8 |- ((U.x = U.{(/)} /\ U.{(/)} = (/)) -> U.x = (/))
14	12, 13	mpan2 695	. . . . . . 7 |- (U.x = U.{(/)} -> U.x = (/))
15		visset 1809	. . . . . . . . 9 |- x e. V
16	15	uniex 2865	. . . . . . . 8 |- U.x e. V
17	16	elsnc 2427	. . . . . . 7 |- (U.x e. {(/)} <-> U.x = (/))
18	14, 17	sylibr 200	. . . . . 6 |- (U.x = U.{(/)} -> U.x e. {(/)})
19	11, 18	syl 10	. . . . 5 |- (x = {(/)} -> U.x e. {(/)})
20	10, 19	jaoi 341	. . . 4 |- ((x = (/) \/ x = {(/)}) -> U.x e. {(/)})
21	4, 20	sylbi 199	. . 3 |- (x (_ {(/)} -> U.x e. {(/)})
22	21	ax-gen 961	. 2 |- A.x(x (_ {(/)} -> U.x e. {(/)})
23		elsn 2417	. . . . 5 |- (y e. {(/)} <-> y = (/))
24		ineq2 2207	. . . . . . 7 |- (y = (/) -> (x i^i y) = (x i^i (/)))
25		in0 2294	. . . . . . . . 9 |- (x i^i (/)) = (/)
26	25	eqeq2i 1482	. . . . . . . 8 |- ((x i^i y) = (x i^i (/)) <-> (x i^i y) = (/))
27	26	biimp 151	. . . . . . 7 |- ((x i^i y) = (x i^i (/)) -> (x i^i y) = (/))
28	24, 27	syl 10	. . . . . 6 |- (y = (/) -> (x i^i y) = (/))
29	15	inex1 2711	. . . . . . . 8 |- (x i^i y) e. V
30	29	elsnc 2427	. . . . . . 7 |- ((x i^i y) e. {(/)} <-> (x i^i y) = (/))
31	30	biimpr 152	. . . . . 6 |- ((x i^i y) = (/) -> (x i^i y) e. {(/)})
32	28, 31	syl 10	. . . . 5 |- (y = (/) -> (x i^i y) e. {(/)})
33	23, 32	sylbi 199	. . . 4 |- (y e. {(/)} -> (x i^i y) e. {(/)})
34	33	adantl 388	. . 3 |- ((x e. {(/)} /\ y e. {(/)}) -> (x i^i y) e. {(/)})
35	34	rgen2a 1696	. 2 |- A.x e. {(/)}A.y e. {(/)} (x i^i y) e. {(/)}
36	3, 22, 35	mpbir2an 729	1 |- {(/)} e. Top

Syntax hints:   -> wi 3   <-> wb 146   \/ wo 222   /\ wa 223  A.wal 952   = wceq 954   e. wcel 956  A.wral 1642  Vcvv 1807   i^i cin 2042   (_ wss 2043  (/)c0 2276  {csn 2405  U.cuni 2498  Topctop 7538

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-nul 2705  ax-pow 2737  ax-un 2861

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-uni 2499  df-top 7542

Copyright terms: Public domain