Metamath Proof Explorer


Theorem gneispace0nelrn

Description: A generic neighborhood space has a nonempty set of neighborhoods for every point in its domain. (Contributed by RP, 15-Apr-2021)

Ref Expression
Hypothesis gneispace.a 𝐴 = { 𝑓 ∣ ( 𝑓 : dom 𝑓 ⟶ ( 𝒫 ( 𝒫 dom 𝑓 ∖ { ∅ } ) ∖ { ∅ } ) ∧ ∀ 𝑝 ∈ dom 𝑓𝑛 ∈ ( 𝑓𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝑓 ( 𝑛𝑠𝑠 ∈ ( 𝑓𝑝 ) ) ) ) }
Assertion gneispace0nelrn ( 𝐹𝐴 → ∀ 𝑝 ∈ dom 𝐹 ( 𝐹𝑝 ) ≠ ∅ )

Proof

Step Hyp Ref Expression
1 gneispace.a 𝐴 = { 𝑓 ∣ ( 𝑓 : dom 𝑓 ⟶ ( 𝒫 ( 𝒫 dom 𝑓 ∖ { ∅ } ) ∖ { ∅ } ) ∧ ∀ 𝑝 ∈ dom 𝑓𝑛 ∈ ( 𝑓𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝑓 ( 𝑛𝑠𝑠 ∈ ( 𝑓𝑝 ) ) ) ) }
2 elex ( 𝐹𝐴𝐹 ∈ V )
3 1 gneispace ( 𝐹 ∈ V → ( 𝐹𝐴 ↔ ( Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀ 𝑝 ∈ dom 𝐹 ( ( 𝐹𝑝 ) ≠ ∅ ∧ ∀ 𝑛 ∈ ( 𝐹𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝐹 ( 𝑛𝑠𝑠 ∈ ( 𝐹𝑝 ) ) ) ) ) ) )
4 2 3 syl ( 𝐹𝐴 → ( 𝐹𝐴 ↔ ( Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀ 𝑝 ∈ dom 𝐹 ( ( 𝐹𝑝 ) ≠ ∅ ∧ ∀ 𝑛 ∈ ( 𝐹𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝐹 ( 𝑛𝑠𝑠 ∈ ( 𝐹𝑝 ) ) ) ) ) ) )
5 4 ibi ( 𝐹𝐴 → ( Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀ 𝑝 ∈ dom 𝐹 ( ( 𝐹𝑝 ) ≠ ∅ ∧ ∀ 𝑛 ∈ ( 𝐹𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝐹 ( 𝑛𝑠𝑠 ∈ ( 𝐹𝑝 ) ) ) ) ) )
6 5 simp3d ( 𝐹𝐴 → ∀ 𝑝 ∈ dom 𝐹 ( ( 𝐹𝑝 ) ≠ ∅ ∧ ∀ 𝑛 ∈ ( 𝐹𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝐹 ( 𝑛𝑠𝑠 ∈ ( 𝐹𝑝 ) ) ) ) )
7 simpl ( ( ( 𝐹𝑝 ) ≠ ∅ ∧ ∀ 𝑛 ∈ ( 𝐹𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝐹 ( 𝑛𝑠𝑠 ∈ ( 𝐹𝑝 ) ) ) ) → ( 𝐹𝑝 ) ≠ ∅ )
8 7 ralimi ( ∀ 𝑝 ∈ dom 𝐹 ( ( 𝐹𝑝 ) ≠ ∅ ∧ ∀ 𝑛 ∈ ( 𝐹𝑝 ) ( 𝑝𝑛 ∧ ∀ 𝑠 ∈ 𝒫 dom 𝐹 ( 𝑛𝑠𝑠 ∈ ( 𝐹𝑝 ) ) ) ) → ∀ 𝑝 ∈ dom 𝐹 ( 𝐹𝑝 ) ≠ ∅ )
9 6 8 syl ( 𝐹𝐴 → ∀ 𝑝 ∈ dom 𝐹 ( 𝐹𝑝 ) ≠ ∅ )