2ndcsep - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 2ndcsep		Structured version Visualization version GIF version

Theorem 2ndcsep 21671

Description: A second-countable topology is separable, which is to say it contains a countable dense subset. (Contributed by Mario Carneiro, 13-Apr-2015.)

**Hypothesis**
Ref	Expression
2ndcsep.1	⊢ 𝑋 = ∪ 𝐽

**Assertion**
Ref	Expression
2ndcsep	⊢ (𝐽 ∈ 2^nd𝜔 → ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))

Distinct variable groups: 𝑥,𝐽 𝑥,𝑋

Proof of Theorem 2ndcsep Dummy variables 𝑓 𝑏 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		is2ndc 21658	. 2 ⊢ (𝐽 ∈ 2^nd𝜔 ↔ ∃𝑏 ∈ TopBases (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝐽))
2		vex 3401	. . . . . . . . 9 ⊢ 𝑏 ∈ V
3		difss 3960	. . . . . . . . 9 ⊢ (𝑏 ∖ {∅}) ⊆ 𝑏
4		ssdomg 8287	. . . . . . . . 9 ⊢ (𝑏 ∈ V → ((𝑏 ∖ {∅}) ⊆ 𝑏 → (𝑏 ∖ {∅}) ≼ 𝑏))
5	2, 3, 4	mp2 9	. . . . . . . 8 ⊢ (𝑏 ∖ {∅}) ≼ 𝑏
6		simpr 479	. . . . . . . 8 ⊢ ((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) → 𝑏 ≼ ω)
7		domtr 8294	. . . . . . . 8 ⊢ (((𝑏 ∖ {∅}) ≼ 𝑏 ∧ 𝑏 ≼ ω) → (𝑏 ∖ {∅}) ≼ ω)
8	5, 6, 7	sylancr 581	. . . . . . 7 ⊢ ((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) → (𝑏 ∖ {∅}) ≼ ω)
9		eldifsn 4550	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝑏 ∖ {∅}) ↔ (𝑦 ∈ 𝑏 ∧ 𝑦 ≠ ∅))
10		n0 4159	. . . . . . . . . 10 ⊢ (𝑦 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝑦)
11		elunii 4676	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑏) → 𝑧 ∈ ∪ 𝑏)
12		simpl 476	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑏) → 𝑧 ∈ 𝑦)
13	11, 12	jca 507	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑏) → (𝑧 ∈ ∪ 𝑏 ∧ 𝑧 ∈ 𝑦))
14	13	expcom 404	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑏 → (𝑧 ∈ 𝑦 → (𝑧 ∈ ∪ 𝑏 ∧ 𝑧 ∈ 𝑦)))
15	14	eximdv 1960	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑏 → (∃𝑧 𝑧 ∈ 𝑦 → ∃𝑧(𝑧 ∈ ∪ 𝑏 ∧ 𝑧 ∈ 𝑦)))
16	15	imp 397	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ 𝑏 ∧ ∃𝑧 𝑧 ∈ 𝑦) → ∃𝑧(𝑧 ∈ ∪ 𝑏 ∧ 𝑧 ∈ 𝑦))
17		df-rex 3096	. . . . . . . . . . 11 ⊢ (∃𝑧 ∈ ∪ 𝑏𝑧 ∈ 𝑦 ↔ ∃𝑧(𝑧 ∈ ∪ 𝑏 ∧ 𝑧 ∈ 𝑦))
18	16, 17	sylibr 226	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝑏 ∧ ∃𝑧 𝑧 ∈ 𝑦) → ∃𝑧 ∈ ∪ 𝑏𝑧 ∈ 𝑦)
19	10, 18	sylan2b 587	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑏 ∧ 𝑦 ≠ ∅) → ∃𝑧 ∈ ∪ 𝑏𝑧 ∈ 𝑦)
20	9, 19	sylbi 209	. . . . . . . 8 ⊢ (𝑦 ∈ (𝑏 ∖ {∅}) → ∃𝑧 ∈ ∪ 𝑏𝑧 ∈ 𝑦)
21	20	rgen 3104	. . . . . . 7 ⊢ ∀𝑦 ∈ (𝑏 ∖ {∅})∃𝑧 ∈ ∪ 𝑏𝑧 ∈ 𝑦
22		vuniex 7231	. . . . . . . 8 ⊢ ∪ 𝑏 ∈ V
23		eleq1 2847	. . . . . . . 8 ⊢ (𝑧 = (𝑓‘𝑦) → (𝑧 ∈ 𝑦 ↔ (𝑓‘𝑦) ∈ 𝑦))
24	22, 23	axcc4dom 9598	. . . . . . 7 ⊢ (((𝑏 ∖ {∅}) ≼ ω ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})∃𝑧 ∈ ∪ 𝑏𝑧 ∈ 𝑦) → ∃𝑓(𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦))
25	8, 21, 24	sylancl 580	. . . . . 6 ⊢ ((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) → ∃𝑓(𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦))
26		frn 6297	. . . . . . . . 9 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → ran 𝑓 ⊆ ∪ 𝑏)
27	26	ad2antrl 718	. . . . . . . 8 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ran 𝑓 ⊆ ∪ 𝑏)
28		vex 3401	. . . . . . . . . 10 ⊢ 𝑓 ∈ V
29	28	rnex 7379	. . . . . . . . 9 ⊢ ran 𝑓 ∈ V
30	29	elpw 4385	. . . . . . . 8 ⊢ (ran 𝑓 ∈ 𝒫 ∪ 𝑏 ↔ ran 𝑓 ⊆ ∪ 𝑏)
31	27, 30	sylibr 226	. . . . . . 7 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ran 𝑓 ∈ 𝒫 ∪ 𝑏)
32		omelon 8840	. . . . . . . . . . 11 ⊢ ω ∈ On
33	6	adantr 474	. . . . . . . . . . 11 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → 𝑏 ≼ ω)
34		ondomen 9193	. . . . . . . . . . 11 ⊢ ((ω ∈ On ∧ 𝑏 ≼ ω) → 𝑏 ∈ dom card)
35	32, 33, 34	sylancr 581	. . . . . . . . . 10 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → 𝑏 ∈ dom card)
36		ssnum 9195	. . . . . . . . . 10 ⊢ ((𝑏 ∈ dom card ∧ (𝑏 ∖ {∅}) ⊆ 𝑏) → (𝑏 ∖ {∅}) ∈ dom card)
37	35, 3, 36	sylancl 580	. . . . . . . . 9 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → (𝑏 ∖ {∅}) ∈ dom card)
38		ffn 6291	. . . . . . . . . . 11 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → 𝑓 Fn (𝑏 ∖ {∅}))
39	38	ad2antrl 718	. . . . . . . . . 10 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → 𝑓 Fn (𝑏 ∖ {∅}))
40		dffn4 6372	. . . . . . . . . 10 ⊢ (𝑓 Fn (𝑏 ∖ {∅}) ↔ 𝑓:(𝑏 ∖ {∅})–onto→ran 𝑓)
41	39, 40	sylib 210	. . . . . . . . 9 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → 𝑓:(𝑏 ∖ {∅})–onto→ran 𝑓)
42		fodomnum 9213	. . . . . . . . 9 ⊢ ((𝑏 ∖ {∅}) ∈ dom card → (𝑓:(𝑏 ∖ {∅})–onto→ran 𝑓 → ran 𝑓 ≼ (𝑏 ∖ {∅})))
43	37, 41, 42	sylc 65	. . . . . . . 8 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ran 𝑓 ≼ (𝑏 ∖ {∅}))
44	8	adantr 474	. . . . . . . 8 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → (𝑏 ∖ {∅}) ≼ ω)
45		domtr 8294	. . . . . . . 8 ⊢ ((ran 𝑓 ≼ (𝑏 ∖ {∅}) ∧ (𝑏 ∖ {∅}) ≼ ω) → ran 𝑓 ≼ ω)
46	43, 44, 45	syl2anc 579	. . . . . . 7 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ran 𝑓 ≼ ω)
47		tgcl 21181	. . . . . . . . . 10 ⊢ (𝑏 ∈ TopBases → (topGen‘𝑏) ∈ Top)
48	47	ad2antrr 716	. . . . . . . . 9 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → (topGen‘𝑏) ∈ Top)
49		unitg 21179	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ V → ∪ (topGen‘𝑏) = ∪ 𝑏)
50	2, 49	ax-mp 5	. . . . . . . . . . 11 ⊢ ∪ (topGen‘𝑏) = ∪ 𝑏
51	50	eqcomi 2787	. . . . . . . . . 10 ⊢ ∪ 𝑏 = ∪ (topGen‘𝑏)
52	51	clsss3 21271	. . . . . . . . 9 ⊢ (((topGen‘𝑏) ∈ Top ∧ ran 𝑓 ⊆ ∪ 𝑏) → ((cls‘(topGen‘𝑏))‘ran 𝑓) ⊆ ∪ 𝑏)
53	48, 27, 52	syl2anc 579	. . . . . . . 8 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ((cls‘(topGen‘𝑏))‘ran 𝑓) ⊆ ∪ 𝑏)
54		ne0i 4149	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝑦 → 𝑦 ≠ ∅)
55	54	anim2i 610	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ 𝑏 ∧ 𝑥 ∈ 𝑦) → (𝑦 ∈ 𝑏 ∧ 𝑦 ≠ ∅))
56	55, 9	sylibr 226	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝑏 ∧ 𝑥 ∈ 𝑦) → 𝑦 ∈ (𝑏 ∖ {∅}))
57		fnfvelrn 6620	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓 Fn (𝑏 ∖ {∅}) ∧ 𝑦 ∈ (𝑏 ∖ {∅})) → (𝑓‘𝑦) ∈ ran 𝑓)
58	38, 57	sylan 575	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ 𝑦 ∈ (𝑏 ∖ {∅})) → (𝑓‘𝑦) ∈ ran 𝑓)
59		inelcm 4257	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑓‘𝑦) ∈ 𝑦 ∧ (𝑓‘𝑦) ∈ ran 𝑓) → (𝑦 ∩ ran 𝑓) ≠ ∅)
60	59	expcom 404	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓‘𝑦) ∈ ran 𝑓 → ((𝑓‘𝑦) ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅))
61	58, 60	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ 𝑦 ∈ (𝑏 ∖ {∅})) → ((𝑓‘𝑦) ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅))
62	61	ex 403	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → (𝑦 ∈ (𝑏 ∖ {∅}) → ((𝑓‘𝑦) ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅)))
63	62	a2d 29	. . . . . . . . . . . . . 14 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → ((𝑦 ∈ (𝑏 ∖ {∅}) → (𝑓‘𝑦) ∈ 𝑦) → (𝑦 ∈ (𝑏 ∖ {∅}) → (𝑦 ∩ ran 𝑓) ≠ ∅)))
64	56, 63	syl7 74	. . . . . . . . . . . . 13 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → ((𝑦 ∈ (𝑏 ∖ {∅}) → (𝑓‘𝑦) ∈ 𝑦) → ((𝑦 ∈ 𝑏 ∧ 𝑥 ∈ 𝑦) → (𝑦 ∩ ran 𝑓) ≠ ∅)))
65	64	exp4a 424	. . . . . . . . . . . 12 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → ((𝑦 ∈ (𝑏 ∖ {∅}) → (𝑓‘𝑦) ∈ 𝑦) → (𝑦 ∈ 𝑏 → (𝑥 ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅))))
66	65	ralimdv2 3143	. . . . . . . . . . 11 ⊢ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 → (∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦 → ∀𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅)))
67	66	imp 397	. . . . . . . . . 10 ⊢ ((𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦) → ∀𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅))
68	67	ad2antlr 717	. . . . . . . . 9 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → ∀𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅))
69		eqidd 2779	. . . . . . . . . 10 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → (topGen‘𝑏) = (topGen‘𝑏))
70	51	a1i 11	. . . . . . . . . 10 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → ∪ 𝑏 = ∪ (topGen‘𝑏))
71		simplll 765	. . . . . . . . . 10 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → 𝑏 ∈ TopBases)
72	27	adantr 474	. . . . . . . . . 10 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → ran 𝑓 ⊆ ∪ 𝑏)
73		simpr 479	. . . . . . . . . 10 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → 𝑥 ∈ ∪ 𝑏)
74	69, 70, 71, 72, 73	elcls3 21295	. . . . . . . . 9 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → (𝑥 ∈ ((cls‘(topGen‘𝑏))‘ran 𝑓) ↔ ∀𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 → (𝑦 ∩ ran 𝑓) ≠ ∅)))
75	68, 74	mpbird 249	. . . . . . . 8 ⊢ ((((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) ∧ 𝑥 ∈ ∪ 𝑏) → 𝑥 ∈ ((cls‘(topGen‘𝑏))‘ran 𝑓))
76	53, 75	eqelssd 3841	. . . . . . 7 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ((cls‘(topGen‘𝑏))‘ran 𝑓) = ∪ 𝑏)
77		breq1 4889	. . . . . . . . 9 ⊢ (𝑥 = ran 𝑓 → (𝑥 ≼ ω ↔ ran 𝑓 ≼ ω))
78		fveqeq2 6455	. . . . . . . . 9 ⊢ (𝑥 = ran 𝑓 → (((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏 ↔ ((cls‘(topGen‘𝑏))‘ran 𝑓) = ∪ 𝑏))
79	77, 78	anbi12d 624	. . . . . . . 8 ⊢ (𝑥 = ran 𝑓 → ((𝑥 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏) ↔ (ran 𝑓 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘ran 𝑓) = ∪ 𝑏)))
80	79	rspcev 3511	. . . . . . 7 ⊢ ((ran 𝑓 ∈ 𝒫 ∪ 𝑏 ∧ (ran 𝑓 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘ran 𝑓) = ∪ 𝑏)) → ∃𝑥 ∈ 𝒫 ∪ 𝑏(𝑥 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏))
81	31, 46, 76, 80	syl12anc 827	. . . . . 6 ⊢ (((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) ∧ (𝑓:(𝑏 ∖ {∅})⟶∪ 𝑏 ∧ ∀𝑦 ∈ (𝑏 ∖ {∅})(𝑓‘𝑦) ∈ 𝑦)) → ∃𝑥 ∈ 𝒫 ∪ 𝑏(𝑥 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏))
82	25, 81	exlimddv 1978	. . . . 5 ⊢ ((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) → ∃𝑥 ∈ 𝒫 ∪ 𝑏(𝑥 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏))
83		unieq 4679	. . . . . . . 8 ⊢ ((topGen‘𝑏) = 𝐽 → ∪ (topGen‘𝑏) = ∪ 𝐽)
84		2ndcsep.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
85	83, 51, 84	3eqtr4g 2839	. . . . . . 7 ⊢ ((topGen‘𝑏) = 𝐽 → ∪ 𝑏 = 𝑋)
86	85	pweqd 4384	. . . . . 6 ⊢ ((topGen‘𝑏) = 𝐽 → 𝒫 ∪ 𝑏 = 𝒫 𝑋)
87		fveq2 6446	. . . . . . . . 9 ⊢ ((topGen‘𝑏) = 𝐽 → (cls‘(topGen‘𝑏)) = (cls‘𝐽))
88	87	fveq1d 6448	. . . . . . . 8 ⊢ ((topGen‘𝑏) = 𝐽 → ((cls‘(topGen‘𝑏))‘𝑥) = ((cls‘𝐽)‘𝑥))
89	88, 85	eqeq12d 2793	. . . . . . 7 ⊢ ((topGen‘𝑏) = 𝐽 → (((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏 ↔ ((cls‘𝐽)‘𝑥) = 𝑋))
90	89	anbi2d 622	. . . . . 6 ⊢ ((topGen‘𝑏) = 𝐽 → ((𝑥 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏) ↔ (𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋)))
91	86, 90	rexeqbidv 3327	. . . . 5 ⊢ ((topGen‘𝑏) = 𝐽 → (∃𝑥 ∈ 𝒫 ∪ 𝑏(𝑥 ≼ ω ∧ ((cls‘(topGen‘𝑏))‘𝑥) = ∪ 𝑏) ↔ ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋)))
92	82, 91	syl5ibcom 237	. . . 4 ⊢ ((𝑏 ∈ TopBases ∧ 𝑏 ≼ ω) → ((topGen‘𝑏) = 𝐽 → ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋)))
93	92	impr 448	. . 3 ⊢ ((𝑏 ∈ TopBases ∧ (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝐽)) → ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))
94	93	rexlimiva 3210	. 2 ⊢ (∃𝑏 ∈ TopBases (𝑏 ≼ ω ∧ (topGen‘𝑏) = 𝐽) → ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))
95	1, 94	sylbi 209	1 ⊢ (𝐽 ∈ 2^nd𝜔 → ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 386 = wceq 1601 ∃wex 1823 ∈ wcel 2107 ≠ wne 2969 ∀wral 3090 ∃wrex 3091 Vcvv 3398 ∖ cdif 3789 ∩ cin 3791 ⊆ wss 3792 ∅c0 4141 𝒫 cpw 4379 {csn 4398 ∪ cuni 4671 class class class wbr 4886 dom cdm 5355 ran crn 5356 Oncon0 5976 Fn wfn 6130 ⟶wf 6131 –onto→wfo 6133 ‘cfv 6135 ωcom 7343 ≼ cdom 8239 cardccrd 9094 topGenctg 16484 Topctop 21105 TopBasesctb 21157 clsccl 21230 2^nd𝜔c2ndc 21650

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5006 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 ax-inf2 8835 ax-cc 9592

This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4672 df-int 4711 df-iun 4755 df-iin 4756 df-br 4887 df-opab 4949 df-mpt 4966 df-tr 4988 df-id 5261 df-eprel 5266 df-po 5274 df-so 5275 df-fr 5314 df-se 5315 df-we 5316 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-pred 5933 df-ord 5979 df-on 5980 df-lim 5981 df-suc 5982 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-isom 6144 df-riota 6883 df-ov 6925 df-oprab 6926 df-mpt2 6927 df-om 7344 df-1st 7445 df-2nd 7446 df-wrecs 7689 df-recs 7751 df-rdg 7789 df-1o 7843 df-er 8026 df-map 8142 df-en 8242 df-dom 8243 df-sdom 8244 df-fin 8245 df-card 9098 df-acn 9101 df-topgen 16490 df-top 21106 df-bases 21158 df-cld 21231 df-ntr 21232 df-cls 21233 df-2ndc 21652

This theorem is referenced by: met2ndc 22736

W3C validator