Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  gneispa Structured version   Visualization version   GIF version

Theorem gneispa 40358
Description: Each point 𝑝 of the neighborhood space has at least one neighborhood; each neighborhood of 𝑝 contains 𝑝. Axiom A of Seifert and Threlfall. (Contributed by RP, 5-Apr-2021.)
Hypothesis
Ref Expression
gneispace.x 𝑋 = 𝐽
Assertion
Ref Expression
gneispa (𝐽 ∈ Top → ∀𝑝𝑋 (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
Distinct variable groups:   𝑛,𝐽,𝑝   𝑛,𝑋
Allowed substitution hint:   𝑋(𝑝)

Proof of Theorem gneispa
StepHypRef Expression
1 snssi 4733 . . . . . 6 (𝑝𝑋 → {𝑝} ⊆ 𝑋)
2 gneispace.x . . . . . . 7 𝑋 = 𝐽
32tpnei 21657 . . . . . 6 (𝐽 ∈ Top → ({𝑝} ⊆ 𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
41, 3syl5ib 245 . . . . 5 (𝐽 ∈ Top → (𝑝𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
54imp 407 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → 𝑋 ∈ ((nei‘𝐽)‘{𝑝}))
65ne0d 4298 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ((nei‘𝐽)‘{𝑝}) ≠ ∅)
7 elnei 21647 . . . . 5 ((𝐽 ∈ Top ∧ 𝑝𝑋𝑛 ∈ ((nei‘𝐽)‘{𝑝})) → 𝑝𝑛)
873expia 1113 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝑝}) → 𝑝𝑛))
98ralrimiv 3178 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛)
106, 9jca 512 . 2 ((𝐽 ∈ Top ∧ 𝑝𝑋) → (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
1110ralrimiva 3179 1 (𝐽 ∈ Top → ∀𝑝𝑋 (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1528  wcel 2105  wne 3013  wral 3135  wss 3933  c0 4288  {csn 4557   cuni 4830  cfv 6348  Topctop 21429  neicnei 21633
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-reu 3142  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-top 21430  df-nei 21634
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator