MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  neiflim Structured version   Visualization version   GIF version

Theorem neiflim 24099
Description: A point is a limit point of its neighborhood filter. (Contributed by Jeff Hankins, 7-Sep-2009.) (Revised by Stefan O'Rear, 9-Aug-2015.)
Assertion
Ref Expression
neiflim ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})))

Proof of Theorem neiflim
StepHypRef Expression
1 ssid 3967 . . . 4 ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴})
21jctr 533 . . 3 (𝐴𝑋 → (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴})))
32adantl 486 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴})))
4 simpl 487 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
5 snssi 4756 . . . . 5 (𝐴𝑋 → {𝐴} ⊆ 𝑋)
65adantl 486 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → {𝐴} ⊆ 𝑋)
7 snnzg 4745 . . . . 5 (𝐴𝑋 → {𝐴} ≠ ∅)
87adantl 486 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → {𝐴} ≠ ∅)
9 neifil 24005 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ {𝐴} ⊆ 𝑋 ∧ {𝐴} ≠ ∅) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
104, 6, 8, 9syl3anc 1396 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
11 elflim 24096 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})) ↔ (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴}))))
1210, 11syldan 602 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})) ↔ (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴}))))
133, 12mpbird 260 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wcel 2149  wne 2964  wss 3913  c0 4294  {csn 4594  cfv 6537  (class class class)co 7411  TopOnctopon 23035  neicnei 23222  Filcfil 23970   fLim cflim 24059
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-fbas 21487  df-top 23019  df-topon 23036  df-nei 23223  df-fil 23971  df-flim 24064
This theorem is referenced by:  flimcf  24107  cnpflf2  24125  cnpflf  24126  flfcntr  24168
  Copyright terms: Public domain W3C validator