2ndci - Metamath Proof Explorer

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

Theorem 2ndci 23472

Description: A countable basis generates a second-countable topology. (Contributed by Mario Carneiro, 21-Mar-2015.)

**Assertion**
Ref	Expression
2ndci	⊢ ((𝐵 ∈ TopBases ∧ 𝐵 ≼ ω) → (topGen‘𝐵) ∈ 2^ndω)

Proof of Theorem 2ndci Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 482	. . 3 ⊢ ((𝐵 ∈ TopBases ∧ 𝐵 ≼ ω) → 𝐵 ∈ TopBases)
2		simpr 484	. . 3 ⊢ ((𝐵 ∈ TopBases ∧ 𝐵 ≼ ω) → 𝐵 ≼ ω)
3		eqidd 2736	. . 3 ⊢ ((𝐵 ∈ TopBases ∧ 𝐵 ≼ ω) → (topGen‘𝐵) = (topGen‘𝐵))
4		breq1 5151	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 ≼ ω ↔ 𝐵 ≼ ω))
5		fveqeq2 6916	. . . . 5 ⊢ (𝑥 = 𝐵 → ((topGen‘𝑥) = (topGen‘𝐵) ↔ (topGen‘𝐵) = (topGen‘𝐵)))
6	4, 5	anbi12d 632	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝑥 ≼ ω ∧ (topGen‘𝑥) = (topGen‘𝐵)) ↔ (𝐵 ≼ ω ∧ (topGen‘𝐵) = (topGen‘𝐵))))
7	6	rspcev 3622	. . 3 ⊢ ((𝐵 ∈ TopBases ∧ (𝐵 ≼ ω ∧ (topGen‘𝐵) = (topGen‘𝐵))) → ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = (topGen‘𝐵)))
8	1, 2, 3, 7	syl12anc 837	. 2 ⊢ ((𝐵 ∈ TopBases ∧ 𝐵 ≼ ω) → ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = (topGen‘𝐵)))
9		is2ndc 23470	. 2 ⊢ ((topGen‘𝐵) ∈ 2^ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = (topGen‘𝐵)))
10	8, 9	sylibr 234	1 ⊢ ((𝐵 ∈ TopBases ∧ 𝐵 ≼ ω) → (topGen‘𝐵) ∈ 2^ndω)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 class class class wbr 5148 ‘cfv 6563 ωcom 7887 ≼ cdom 8982 topGenctg 17484 TopBasesctb 22968 2^ndωc2ndc 23462

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-nul 5312

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-iota 6516 df-fv 6571 df-2ndc 23464

This theorem is referenced by: 2ndcrest 23478 2ndcomap 23482 dis2ndc 23484 dis1stc 23523 tx2ndc 23675 met2ndci 24551 re2ndc 24837

W3C validator