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 40487
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 4743 . . . . . 6 (𝑝𝑋 → {𝑝} ⊆ 𝑋)
2 gneispace.x . . . . . . 7 𝑋 = 𝐽
32tpnei 21731 . . . . . 6 (𝐽 ∈ Top → ({𝑝} ⊆ 𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
41, 3syl5ib 246 . . . . 5 (𝐽 ∈ Top → (𝑝𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
54imp 409 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → 𝑋 ∈ ((nei‘𝐽)‘{𝑝}))
65ne0d 4303 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ((nei‘𝐽)‘{𝑝}) ≠ ∅)
7 elnei 21721 . . . . 5 ((𝐽 ∈ Top ∧ 𝑝𝑋𝑛 ∈ ((nei‘𝐽)‘{𝑝})) → 𝑝𝑛)
873expia 1117 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝑝}) → 𝑝𝑛))
98ralrimiv 3183 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛)
106, 9jca 514 . 2 ((𝐽 ∈ Top ∧ 𝑝𝑋) → (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
1110ralrimiva 3184 1 (𝐽 ∈ Top → ∀𝑝𝑋 (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  wne 3018  wral 3140  wss 3938  c0 4293  {csn 4569   cuni 4840  cfv 6357  Topctop 21503  neicnei 21707
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-top 21504  df-nei 21708
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator