Theorem flimelbas 23119

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 23115	. . 3 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) ↔ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹)))
3	2	simprbi 497	. 2 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))
4	3	simpld 495	1 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐴 ∈ 𝑋)

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ⊆ wss 3887  𝒫 cpw 4533  {csn 4561  ∪ cuni 4839  ran crn 5590  ‘cfv 6433  (class class class)co 7275  Topctop 22042  neicnei 22248  Filcfil 22996   fLim cflim 23085

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-top 22043  df-flim 23090

This theorem is referenced by:  flimfil  23120  flimss2  23123  flimss1  23124  flimclsi  23129  hausflimi  23131  flimsncls  23137  cnpflfi  23150  cnflf  23153  cnflf2  23154  flimcfil  24478