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 44718
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 4747 . . . . . 6 (𝑝𝑋 → {𝑝} ⊆ 𝑋)
2 gneispace.x . . . . . . 7 𝑋 = 𝐽
32tpnei 23239 . . . . . 6 (𝐽 ∈ Top → ({𝑝} ⊆ 𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
41, 3imbitrid 247 . . . . 5 (𝐽 ∈ Top → (𝑝𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
54imp 411 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → 𝑋 ∈ ((nei‘𝐽)‘{𝑝}))
65ne0d 4297 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ((nei‘𝐽)‘{𝑝}) ≠ ∅)
7 elnei 23229 . . . . 5 ((𝐽 ∈ Top ∧ 𝑝𝑋𝑛 ∈ ((nei‘𝐽)‘{𝑝})) → 𝑝𝑛)
873expia 1137 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝑝}) → 𝑝𝑛))
98ralrimiv 3156 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛)
106, 9jca 520 . 2 ((𝐽 ∈ Top ∧ 𝑝𝑋) → (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
1110ralrimiva 3157 1 (𝐽 ∈ Top → ∀𝑝𝑋 (((nei‘𝐽)‘{𝑝}) ≠ ∅ ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝑝})𝑝𝑛))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wne 2960  wral 3079  wss 3907  c0 4288  {csn 4585   cuni 4868  cfv 6525  Topctop 23011  neicnei 23215
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-top 23012  df-nei 23216
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator