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

Theorem neiflim 24131
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 3959 . . . 4 ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴})
21jctr 533 . . 3 (𝐴𝑋 → (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴})))
32adantl 486 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ ((nei‘𝐽)‘{𝐴})))
4 simpl 487 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
5 snssi 4751 . . . . 5 (𝐴𝑋 → {𝐴} ⊆ 𝑋)
65adantl 486 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → {𝐴} ⊆ 𝑋)
7 snnzg 4740 . . . . 5 (𝐴𝑋 → {𝐴} ≠ ∅)
87adantl 486 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → {𝐴} ≠ ∅)
9 neifil 24037 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ {𝐴} ⊆ 𝑋 ∧ {𝐴} ≠ ∅) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
104, 6, 8, 9syl3anc 1398 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
11 elflim 24128 . . 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 2143  wne 2958  wss 3905  c0 4286  {csn 4589  cfv 6536  (class class class)co 7410  TopOnctopon 23067  neicnei 23254  Filcfil 24002   fLim cflim 24091
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 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
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-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-fbas 21519  df-top 23051  df-topon 23068  df-nei 23255  df-fil 24003  df-flim 24096
This theorem is referenced by:  flimcf  24139  cnpflf2  24157  cnpflf  24158  flfcntr  24200
  Copyright terms: Public domain W3C validator