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 44839
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 4752 . . . . . 6 (𝑝𝑋 → {𝑝} ⊆ 𝑋)
2 gneispace.x . . . . . . 7 𝑋 = 𝐽
32tpnei 23259 . . . . . 6 (𝐽 ∈ Top → ({𝑝} ⊆ 𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
41, 3imbitrid 247 . . . . 5 (𝐽 ∈ Top → (𝑝𝑋𝑋 ∈ ((nei‘𝐽)‘{𝑝})))
54imp 411 . . . 4 ((𝐽 ∈ Top ∧ 𝑝𝑋) → 𝑋 ∈ ((nei‘𝐽)‘{𝑝}))
65ne0d 4296 . . 3 ((𝐽 ∈ Top ∧ 𝑝𝑋) → ((nei‘𝐽)‘{𝑝}) ≠ ∅)
7 elnei 23249 . . . . 5 ((𝐽 ∈ Top ∧ 𝑝𝑋𝑛 ∈ ((nei‘𝐽)‘{𝑝})) → 𝑝𝑛)
873expia 1139 . . . 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 1570  wcel 2143  wne 2958  wral 3079  wss 3906  c0 4287  {csn 4590   cuni 4873  cfv 6538  Topctop 23031  neicnei 23235
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-top 23032  df-nei 23236
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator