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

Theorem 0nelfil 21463
 Description: The empty set doesn't belong to a filter. (Contributed by FL, 20-Jul-2007.) (Revised by Mario Carneiro, 28-Jul-2015.)
Assertion
Ref Expression
0nelfil (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹)

Proof of Theorem 0nelfil
StepHypRef Expression
1 filfbas 21462 . 2 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
2 0nelfb 21445 . 2 (𝐹 ∈ (fBas‘𝑋) → ¬ ∅ ∈ 𝐹)
31, 2syl 17 1 (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∈ wcel 1977  ∅c0 3874  ‘cfv 5804  fBascfbas 19555  Filcfil 21459 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fv 5812  df-fbas 19564  df-fil 21460 This theorem is referenced by:  fileln0  21464  isfil2  21470  infil  21477  filuni  21499  filufint  21534  rnelfmlem  21566  fmfnfm  21572  fclscmpi  21643
 Copyright terms: Public domain W3C validator