Metamath Proof Explorer


Theorem dis2ndc

Description: A discrete space is second-countable iff it is countable. (Contributed by Mario Carneiro, 13-Apr-2015)

Ref Expression
Assertion dis2ndc X ω 𝒫 X 2 nd 𝜔

Proof

Step Hyp Ref Expression
1 ctex X ω X V
2 pwexr 𝒫 X 2 nd 𝜔 X V
3 vsnex x V
4 3 2a1i X V x X x V
5 vex x V
6 5 sneqr x = y x = y
7 sneq x = y x = y
8 6 7 impbii x = y x = y
9 8 2a1i X V x X y X x = y x = y
10 4 9 dom2lem X V x X x : X 1-1 V
11 f1f1orn x X x : X 1-1 V x X x : X 1-1 onto ran x X x
12 10 11 syl X V x X x : X 1-1 onto ran x X x
13 f1oeng X V x X x : X 1-1 onto ran x X x X ran x X x
14 12 13 mpdan X V X ran x X x
15 domen1 X ran x X x X ω ran x X x ω
16 14 15 syl X V X ω ran x X x ω
17 distop X V 𝒫 X Top
18 5 snelpw x X x 𝒫 X
19 18 bilani X V x X x 𝒫 X
20 19 fmpttd X V x X x : X 𝒫 X
21 20 frnd X V ran x X x 𝒫 X
22 elpwi y 𝒫 X y X
23 22 ad2antrl X V y 𝒫 X z y y X
24 simprr X V y 𝒫 X z y z y
25 23 24 sseldd X V y 𝒫 X z y z X
26 eqidd X V y 𝒫 X z y z = z
27 sneq x = z x = z
28 27 rspceeqv z X z = z x X z = x
29 25 26 28 syl2anc X V y 𝒫 X z y x X z = x
30 vsnex z V
31 eqid x X x = x X x
32 31 elrnmpt z V z ran x X x x X z = x
33 30 32 ax-mp z ran x X x x X z = x
34 29 33 sylibr X V y 𝒫 X z y z ran x X x
35 vsnid z z
36 35 a1i X V y 𝒫 X z y z z
37 24 snssd X V y 𝒫 X z y z y
38 eleq2 w = z z w z z
39 sseq1 w = z w y z y
40 38 39 anbi12d w = z z w w y z z z y
41 40 rspcev z ran x X x z z z y w ran x X x z w w y
42 34 36 37 41 syl12anc X V y 𝒫 X z y w ran x X x z w w y
43 42 ralrimivva X V y 𝒫 X z y w ran x X x z w w y
44 basgen2 𝒫 X Top ran x X x 𝒫 X y 𝒫 X z y w ran x X x z w w y topGen ran x X x = 𝒫 X
45 17 21 43 44 syl3anc X V topGen ran x X x = 𝒫 X
46 45 adantr X V ran x X x ω topGen ran x X x = 𝒫 X
47 45 17 eqeltrd X V topGen ran x X x Top
48 tgclb ran x X x TopBases topGen ran x X x Top
49 47 48 sylibr X V ran x X x TopBases
50 2ndci ran x X x TopBases ran x X x ω topGen ran x X x 2 nd 𝜔
51 49 50 sylan X V ran x X x ω topGen ran x X x 2 nd 𝜔
52 46 51 eqeltrrd X V ran x X x ω 𝒫 X 2 nd 𝜔
53 is2ndc 𝒫 X 2 nd 𝜔 b TopBases b ω topGen b = 𝒫 X
54 vex b V
55 18 bilani X V b TopBases b ω topGen b = 𝒫 X x X x 𝒫 X
56 simplrr X V b TopBases b ω topGen b = 𝒫 X x X topGen b = 𝒫 X
57 55 56 eleqtrrd X V b TopBases b ω topGen b = 𝒫 X x X x topGen b
58 vsnid x x
59 tg2 x topGen b x x y b x y y x
60 57 58 59 sylancl X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x
61 simprrl X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x x y
62 61 snssd X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x x y
63 simprrr X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x y x
64 62 63 eqssd X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x x = y
65 simprl X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x y b
66 64 65 eqeltrd X V b TopBases b ω topGen b = 𝒫 X x X y b x y y x x b
67 60 66 rexlimddv X V b TopBases b ω topGen b = 𝒫 X x X x b
68 67 fmpttd X V b TopBases b ω topGen b = 𝒫 X x X x : X b
69 68 frnd X V b TopBases b ω topGen b = 𝒫 X ran x X x b
70 ssdomg b V ran x X x b ran x X x b
71 54 69 70 mpsyl X V b TopBases b ω topGen b = 𝒫 X ran x X x b
72 simprl X V b TopBases b ω topGen b = 𝒫 X b ω
73 domtr ran x X x b b ω ran x X x ω
74 71 72 73 syl2anc X V b TopBases b ω topGen b = 𝒫 X ran x X x ω
75 74 rexlimdva2 X V b TopBases b ω topGen b = 𝒫 X ran x X x ω
76 53 75 biimtrid X V 𝒫 X 2 nd 𝜔 ran x X x ω
77 76 imp X V 𝒫 X 2 nd 𝜔 ran x X x ω
78 52 77 impbida X V ran x X x ω 𝒫 X 2 nd 𝜔
79 16 78 bitrd X V X ω 𝒫 X 2 nd 𝜔
80 1 2 79 pm5.21nii X ω 𝒫 X 2 nd 𝜔