Theorem is1stc 23814

Description: The predicate "is a first-countable topology." This can be described as "every point has a countable local basis" - that is, every point has a countable collection of open sets containing it such that every open set containing the point has an open set from this collection as a subset. (Contributed by Jeff Hankins, 22-Aug-2009.)

Hypothesis

Ref	Expression
is1stc.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
is1stc	⊢ (𝐽 ∈ 1stω ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐽   𝑥,𝑋

Allowed substitution hints:   𝑋(𝑦, 𝑧)

Proof of Theorem is1stc

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unieq 4883	. . . 4 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
2		is1stc.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
3	1, 2	eqtr4di 2816	. . 3 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
4		pweq 4574	. . . 4 ⊢ (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝐽)
5		raleq 3320	. . . . 5 ⊢ (𝑗 = 𝐽 → (∀𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)) ↔ ∀𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧))))
6	5	anbi2d 642	. . . 4 ⊢ (𝑗 = 𝐽 → ((𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧))) ↔ (𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)))))
7	4, 6	rexeqbidv 3339	. . 3 ⊢ (𝑗 = 𝐽 → (∃𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧))) ↔ ∃𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)))))
8	3, 7	raleqbidv 3338	. 2 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ ∪ 𝑗∃𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧))) ↔ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)))))
9		df-1stc 23812	. 2 ⊢ 1stω = {𝑗 ∈ Top ∣ ∀𝑥 ∈ ∪ 𝑗∃𝑦 ∈ 𝒫 𝑗(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)))}
10	8, 9	elrab2 3652	1 ⊢ (𝐽 ∈ 1stω ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝒫 𝐽(𝑦 ≼ ω ∧ ∀𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 → 𝑥 ∈ ∪ (𝑦 ∩ 𝒫 𝑧)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4872   class class class wbr 5108  ωcom 7911   ≼ cdom 9009  Topctop 23266  1^stωc1stc 23810

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pw 4562  df-uni 4873  df-1stc 23812

This theorem is used by:  is1stc2  23815  1stctop  23816