Theorem gneispace0nelrn3 37460

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

Hypothesis

Ref	Expression
gneispace.a	⊢ 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}

Assertion

Ref	Expression
gneispace0nelrn3	⊢ (𝐹 ∈ 𝐴 → ¬ ∅ ∈ ran 𝐹)

Distinct variable groups:   𝑛,𝐹,𝑝,𝑓   𝐹,𝑠,𝑓   𝑓,𝑛,𝑝

Allowed substitution hints:   𝐴(𝑓,𝑛,𝑠,𝑝)

Proof of Theorem gneispace0nelrn3

Step	Hyp	Ref	Expression
1		gneispace.a	. . 3 ⊢ 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}
2	1	gneispacern 37456	. 2 ⊢ (𝐹 ∈ 𝐴 → ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}))
3		neldifsnd 4263	. . 3 ⊢ (ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) → ¬ ∅ ∈ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}))
4		ssel 3562	. . 3 ⊢ (ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) → (∅ ∈ ran 𝐹 → ∅ ∈ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})))
5	3, 4	mtod 188	. 2 ⊢ (ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) → ¬ ∅ ∈ ran 𝐹)
6	2, 5	syl 17	1 ⊢ (𝐹 ∈ 𝐴 → ¬ ∅ ∈ ran 𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596  ∀wral 2896   ∖ cdif 3537   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  {csn 4125  dom cdm 5038  ran crn 5039  ⟶wf 5800  ‘cfv 5804

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812

This theorem is referenced by: (None)