Theorem flimelbas 24156

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ⊆ wss 3906  𝒫 cpw 4564  {csn 4591  ∪ cuni 4874  ran crn 5664  ‘cfv 6540  (class class class)co 7416  Topctop 23080  neicnei 23284  Filcfil 24033   fLim cflim 24122

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-top 23081  df-flim 24127

This theorem is used by:  flimfil  24157  flimss2  24160  flimss1  24161  flimclsi  24166  hausflimi  24168  flimsncls  24174  cnpflfi  24187  cnflf  24190  cnflf2  24191  flimcfil  25504