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

Theorem gneispaceel2 45103
Description: Every neighborhood of a point in a generic neighborhood space contains that point. (Contributed by RP, 15-Apr-2021.)
Hypothesis
Ref Expression
gneispace.a 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}
Assertion
Ref Expression
gneispaceel2 ((𝐹 ∈ 𝐴 ∧ 𝑃 ∈ dom 𝐹 ∧ 𝑁 ∈ (𝐹‘𝑃)) → 𝑃 ∈ 𝑁)
Distinct variable groups:   𝑛,𝐹,𝑝,𝑓   𝐹,𝑠,𝑓   𝑓,𝑛,𝑝   𝑃,𝑝,𝑛   𝑛,𝑁
Allowed substitution hints:   𝐴(𝑓, 𝑛, 𝑠, 𝑝)   𝑃(𝑓, 𝑠)   𝑁(𝑓, 𝑠, 𝑝)

Proof of Theorem gneispaceel2
StepHypRef Expression
1 gneispace.a . . . . 5 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}
21gneispaceel 45102 . . . 4 (𝐹 ∈ 𝐴 → ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)𝑝 ∈ 𝑛)
3 fveq2 6877 . . . . . 6 (𝑝 = 𝑃 → (𝐹‘𝑝) = (𝐹‘𝑃))
4 eleq1 2849 . . . . . 6 (𝑝 = 𝑃 → (𝑝 ∈ 𝑛 ↔ 𝑃 ∈ 𝑛))
53, 4raleqbidv 3335 . . . . 5 (𝑝 = 𝑃 → (∀𝑛 ∈ (𝐹‘𝑝)𝑝 ∈ 𝑛 ↔ ∀𝑛 ∈ (𝐹‘𝑃)𝑃 ∈ 𝑛))
65rspccv 3574 . . . 4 (∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)𝑝 ∈ 𝑛 → (𝑃 ∈ dom 𝐹 → ∀𝑛 ∈ (𝐹‘𝑃)𝑃 ∈ 𝑛))
72, 6syl 18 . . 3 (𝐹 ∈ 𝐴 → (𝑃 ∈ dom 𝐹 → ∀𝑛 ∈ (𝐹‘𝑃)𝑃 ∈ 𝑛))
8 eleq2 2850 . . . 4 (𝑛 = 𝑁 → (𝑃 ∈ 𝑛 ↔ 𝑃 ∈ 𝑁))
98rspccv 3574 . . 3 (∀𝑛 ∈ (𝐹‘𝑃)𝑃 ∈ 𝑛 → (𝑁 ∈ (𝐹‘𝑃) → 𝑃 ∈ 𝑁))
107, 9syl6 36 . 2 (𝐹 ∈ 𝐴 → (𝑃 ∈ dom 𝐹 → (𝑁 ∈ (𝐹‘𝑃) → 𝑃 ∈ 𝑁)))
11103imp 1128 1 ((𝐹 ∈ 𝐴 ∧ 𝑃 ∈ dom 𝐹 ∧ 𝑁 ∈ (𝐹‘𝑃)) → 𝑃 ∈ 𝑁)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {csn 4584  dom cdm 5651  ⟶wf 6527  ‘cfv 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator