Theorem 2ndctop 23390

Description: A second-countable topology is a topology. (Contributed by Jeff Hankins, 17-Jan-2010.) (Revised by Mario Carneiro, 21-Mar-2015.)

Assertion

Ref	Expression
2ndctop	⊢ (𝐽 ∈ 2ndω → 𝐽 ∈ Top)

Proof of Theorem 2ndctop

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		is2ndc 23389	. 2 ⊢ (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))
2		simprr 772	. . . 4 ⊢ ((𝑥 ∈ TopBases ∧ (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)) → (topGen‘𝑥) = 𝐽)
3		tgcl 22912	. . . . 5 ⊢ (𝑥 ∈ TopBases → (topGen‘𝑥) ∈ Top)
4	3	adantr 480	. . . 4 ⊢ ((𝑥 ∈ TopBases ∧ (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)) → (topGen‘𝑥) ∈ Top)
5	2, 4	eqeltrrd 2836	. . 3 ⊢ ((𝑥 ∈ TopBases ∧ (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)) → 𝐽 ∈ Top)
6	5	rexlimiva 3134	. 2 ⊢ (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ Top)
7	1, 6	sylbi 217	1 ⊢ (𝐽 ∈ 2ndω → 𝐽 ∈ Top)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3061   class class class wbr 5124  ‘cfv 6536  ωcom 7866   ≼ cdom 8962  topGenctg 17456  Topctop 22836  TopBasesctb 22888  2^ndωc2ndc 23381

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6538  df-fv 6544  df-topgen 17462  df-top 22837  df-bases 22889  df-2ndc 23383

This theorem is referenced by:  2ndc1stc  23394  2ndcctbss  23398