Theorem flimelbas 21992

Description: A limit point of a filter belongs to its base set. (Contributed by Jeff Hankins, 4-Sep-2009.) (Revised by Mario Carneiro, 9-Apr-2015.)

Hypothesis

Ref	Expression
flimuni.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
flimelbas	⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐴 ∈ 𝑋)

Proof of Theorem flimelbas

Step	Hyp	Ref	Expression
1		flimuni.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
2	1	elflim2 21988	. . 3 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) ↔ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹)))
3	2	simprbi 484	. 2 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))
4	3	simpld 482	1 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐴 ∈ 𝑋)

Syntax hints:   → wi 4   ∧ wa 382   ∧ w3a 1071   = wceq 1631   ∈ wcel 2145   ⊆ wss 3723  𝒫 cpw 4298  {csn 4317  ∪ cuni 4575  ran crn 5251  ‘cfv 6030  (class class class)co 6796  Topctop 20918  neicnei 21122  Filcfil 21869   fLim cflim 21958

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4227  df-pw 4300  df-sn 4318  df-pr 4320  df-op 4324  df-uni 4576  df-br 4788  df-opab 4848  df-id 5158  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-iota 5993  df-fun 6032  df-fv 6038  df-ov 6799  df-oprab 6800  df-mpt2 6801  df-top 20919  df-flim 21963

This theorem is referenced by:  flimfil  21993  flimss2  21996  flimss1  21997  flimclsi  22002  hausflimi  22004  flimsncls  22010  cnpflfi  22023  cnflf  22026  cnflf2  22027  flimcfil  23331