Theorem dis2ndc 23517

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

Assertion

Ref	Expression
dis2ndc	⊢ (𝑋 ≼ ω ↔ 𝒫 𝑋 ∈ 2ndω)

Proof of Theorem dis2ndc

Dummy variables 𝑤 𝑏 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ctex 8944	. 2 ⊢ (𝑋 ≼ ω → 𝑋 ∈ V)
2		pwexr 7748	. 2 ⊢ (𝒫 𝑋 ∈ 2ndω → 𝑋 ∈ V)
3		vsnex 5392	. . . . . . . 8 ⊢ {𝑥} ∈ V
4	3	2a1i 12	. . . . . . 7 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 → {𝑥} ∈ V))
5		vex 3458	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
6	5	sneqr 4798	. . . . . . . . 9 ⊢ ({𝑥} = {𝑦} → 𝑥 = 𝑦)
7		sneq 4592	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
8	6, 7	impbii 211	. . . . . . . 8 ⊢ ({𝑥} = {𝑦} ↔ 𝑥 = 𝑦)
9	8	2a1i 12	. . . . . . 7 ⊢ (𝑋 ∈ V → ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ({𝑥} = {𝑦} ↔ 𝑥 = 𝑦)))
10	4, 9	dom2lem 8973	. . . . . 6 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋–1-1→V)
11		f1f1orn 6818	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋–1-1→V → (𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋–1-1-onto→ran (𝑥 ∈ 𝑋 ↦ {𝑥}))
12	10, 11	syl 17	. . . . 5 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋–1-1-onto→ran (𝑥 ∈ 𝑋 ↦ {𝑥}))
13		f1oeng 8951	. . . . 5 ⊢ ((𝑋 ∈ V ∧ (𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋–1-1-onto→ran (𝑥 ∈ 𝑋 ↦ {𝑥})) → 𝑋 ≈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}))
14	12, 13	mpdan 697	. . . 4 ⊢ (𝑋 ∈ V → 𝑋 ≈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}))
15		domen1 9091	. . . 4 ⊢ (𝑋 ≈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) → (𝑋 ≼ ω ↔ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω))
16	14, 15	syl 17	. . 3 ⊢ (𝑋 ∈ V → (𝑋 ≼ ω ↔ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω))
17		distop 23052	. . . . . . 7 ⊢ (𝑋 ∈ V → 𝒫 𝑋 ∈ Top)
18	5	snelpw 5412	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑋 ↔ {𝑥} ∈ 𝒫 𝑋)
19	18	bilani 508	. . . . . . . . 9 ⊢ ((𝑋 ∈ V ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ 𝒫 𝑋)
20	19	fmpttd 7096	. . . . . . . 8 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋⟶𝒫 𝑋)
21	20	frnd 6700	. . . . . . 7 ⊢ (𝑋 ∈ V → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ⊆ 𝒫 𝑋)
22		elpwi 4562	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝒫 𝑋 → 𝑦 ⊆ 𝑋)
23	22	ad2antrl 738	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → 𝑦 ⊆ 𝑋)
24		simprr 782	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → 𝑧 ∈ 𝑦)
25	23, 24	sseldd 3937	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → 𝑧 ∈ 𝑋)
26		eqidd 2763	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → {𝑧} = {𝑧})
27		sneq 4592	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
28	27	rspceeqv 3604	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑋 ∧ {𝑧} = {𝑧}) → ∃𝑥 ∈ 𝑋 {𝑧} = {𝑥})
29	25, 26, 28	syl2anc 593	. . . . . . . . . 10 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → ∃𝑥 ∈ 𝑋 {𝑧} = {𝑥})
30		vsnex 5392	. . . . . . . . . . 11 ⊢ {𝑧} ∈ V
31		eqid 2762	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑋 ↦ {𝑥}) = (𝑥 ∈ 𝑋 ↦ {𝑥})
32	31	elrnmpt 5934	. . . . . . . . . . 11 ⊢ ({𝑧} ∈ V → ({𝑧} ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ↔ ∃𝑥 ∈ 𝑋 {𝑧} = {𝑥}))
33	30, 32	ax-mp 5	. . . . . . . . . 10 ⊢ ({𝑧} ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ↔ ∃𝑥 ∈ 𝑋 {𝑧} = {𝑥})
34	29, 33	sylibr 236	. . . . . . . . 9 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → {𝑧} ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}))
35		vsnid 4622	. . . . . . . . . 10 ⊢ 𝑧 ∈ {𝑧}
36	35	a1i 11	. . . . . . . . 9 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → 𝑧 ∈ {𝑧})
37	24	snssd 4745	. . . . . . . . 9 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → {𝑧} ⊆ 𝑦)
38		eleq2 2851	. . . . . . . . . . 11 ⊢ (𝑤 = {𝑧} → (𝑧 ∈ 𝑤 ↔ 𝑧 ∈ {𝑧}))
39		sseq1 3961	. . . . . . . . . . 11 ⊢ (𝑤 = {𝑧} → (𝑤 ⊆ 𝑦 ↔ {𝑧} ⊆ 𝑦))
40	38, 39	anbi12d 641	. . . . . . . . . 10 ⊢ (𝑤 = {𝑧} → ((𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ 𝑦) ↔ (𝑧 ∈ {𝑧} ∧ {𝑧} ⊆ 𝑦)))
41	40	rspcev 3581	. . . . . . . . 9 ⊢ (({𝑧} ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ∧ (𝑧 ∈ {𝑧} ∧ {𝑧} ⊆ 𝑦)) → ∃𝑤 ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥})(𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ 𝑦))
42	34, 36, 37, 41	syl12anc 847	. . . . . . . 8 ⊢ ((𝑋 ∈ V ∧ (𝑦 ∈ 𝒫 𝑋 ∧ 𝑧 ∈ 𝑦)) → ∃𝑤 ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥})(𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ 𝑦))
43	42	ralrimivva 3205	. . . . . . 7 ⊢ (𝑋 ∈ V → ∀𝑦 ∈ 𝒫 𝑋∀𝑧 ∈ 𝑦 ∃𝑤 ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥})(𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ 𝑦))
44		basgen2 23046	. . . . . . 7 ⊢ ((𝒫 𝑋 ∈ Top ∧ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ⊆ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋∀𝑧 ∈ 𝑦 ∃𝑤 ∈ ran (𝑥 ∈ 𝑋 ↦ {𝑥})(𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ 𝑦)) → (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) = 𝒫 𝑋)
45	17, 21, 43, 44	syl3anc 1390	. . . . . 6 ⊢ (𝑋 ∈ V → (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) = 𝒫 𝑋)
46	45	adantr 484	. . . . 5 ⊢ ((𝑋 ∈ V ∧ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω) → (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) = 𝒫 𝑋)
47	45, 17	eqeltrd 2862	. . . . . . 7 ⊢ (𝑋 ∈ V → (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) ∈ Top)
48		tgclb 23027	. . . . . . 7 ⊢ (ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ∈ TopBases ↔ (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) ∈ Top)
49	47, 48	sylibr 236	. . . . . 6 ⊢ (𝑋 ∈ V → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ∈ TopBases)
50		2ndci 23505	. . . . . 6 ⊢ ((ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ∈ TopBases ∧ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω) → (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) ∈ 2ndω)
51	49, 50	sylan 589	. . . . 5 ⊢ ((𝑋 ∈ V ∧ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω) → (topGen‘ran (𝑥 ∈ 𝑋 ↦ {𝑥})) ∈ 2ndω)
52	46, 51	eqeltrrd 2863	. . . 4 ⊢ ((𝑋 ∈ V ∧ ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω) → 𝒫 𝑋 ∈ 2ndω)
53		is2ndc 23503	. . . . . 6 ⊢ (𝒫 𝑋 ∈ 2ndω ↔ ∃𝑏 ∈ TopBases (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋))
54		vex 3458	. . . . . . . . 9 ⊢ 𝑏 ∈ V
55	18	bilani 508	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ 𝒫 𝑋)
56		simplrr 787	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) → (topGen‘𝑏) = 𝒫 𝑋)
57	55, 56	eleqtrrd 2865	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ (topGen‘𝑏))
58		vsnid 4622	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ {𝑥}
59		tg2 23022	. . . . . . . . . . . . 13 ⊢ (({𝑥} ∈ (topGen‘𝑏) ∧ 𝑥 ∈ {𝑥}) → ∃𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))
60	57, 58, 59	sylancl 595	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))
61		simprrl 790	. . . . . . . . . . . . . . 15 ⊢ (((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝑏 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))) → 𝑥 ∈ 𝑦)
62	61	snssd 4745	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝑏 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))) → {𝑥} ⊆ 𝑦)
63		simprrr 791	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝑏 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))) → 𝑦 ⊆ {𝑥})
64	62, 63	eqssd 3953	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝑏 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))) → {𝑥} = 𝑦)
65		simprl 780	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝑏 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))) → 𝑦 ∈ 𝑏)
66	64, 65	eqeltrd 2862	. . . . . . . . . . . 12 ⊢ (((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝑏 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ⊆ {𝑥}))) → {𝑥} ∈ 𝑏)
67	60, 66	rexlimddv 3169	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ 𝑏)
68	67	fmpttd 7096	. . . . . . . . . 10 ⊢ (((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) → (𝑥 ∈ 𝑋 ↦ {𝑥}):𝑋⟶𝑏)
69	68	frnd 6700	. . . . . . . . 9 ⊢ (((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ⊆ 𝑏)
70		ssdomg 8981	. . . . . . . . 9 ⊢ (𝑏 ∈ V → (ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ⊆ 𝑏 → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ 𝑏))
71	54, 69, 70	mpsyl 68	. . . . . . . 8 ⊢ (((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ 𝑏)
72		simprl 780	. . . . . . . 8 ⊢ (((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) → 𝑏 ≼ ω)
73		domtr 8988	. . . . . . . 8 ⊢ ((ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ 𝑏 ∧ 𝑏 ≼ ω) → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω)
74	71, 72, 73	syl2anc 593	. . . . . . 7 ⊢ (((𝑋 ∈ V ∧ 𝑏 ∈ TopBases) ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋)) → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω)
75	74	rexlimdva2 3165	. . . . . 6 ⊢ (𝑋 ∈ V → (∃𝑏 ∈ TopBases (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝒫 𝑋) → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω))
76	53, 75	biimtrid 244	. . . . 5 ⊢ (𝑋 ∈ V → (𝒫 𝑋 ∈ 2ndω → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω))
77	76	imp 410	. . . 4 ⊢ ((𝑋 ∈ V ∧ 𝒫 𝑋 ∈ 2ndω) → ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω)
78	52, 77	impbida 810	. . 3 ⊢ (𝑋 ∈ V → (ran (𝑥 ∈ 𝑋 ↦ {𝑥}) ≼ ω ↔ 𝒫 𝑋 ∈ 2ndω))
79	16, 78	bitrd 281	. 2 ⊢ (𝑋 ∈ V → (𝑋 ≼ ω ↔ 𝒫 𝑋 ∈ 2ndω))
80	1, 2, 79	pm5.21nii 380	1 ⊢ (𝑋 ≼ ω ↔ 𝒫 𝑋 ∈ 2ndω)

Syntax hints:   ↔ wb 208   ∧ wa 399   = wceq 1560   ∈ wcel 2142  ∀wral 3076  ∃wrex 3086  Vcvv 3454   ⊆ wss 3904  𝒫 cpw 4555  {csn 4582   class class class wbr 5100   ↦ cmpt 5181  ran crn 5648  –1-1→wf1 6518  –1-1-onto→wf1o 6520  ‘cfv 6521  ωcom 7846   ≈ cen 8924   ≼ cdom 8925  topGenctg 17466  Topctop 22950  TopBasesctb 23002  2^ndωc2ndc 23495

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-er 8678  df-en 8928  df-dom 8929  df-topgen 17472  df-top 22951  df-bases 23003  df-2ndc 23497

This theorem is referenced by: (None)