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

Theorem 0nelfil 23791
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 23790 . 2 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
2 0nelfb 23773 . 2 (𝐹 ∈ (fBas‘𝑋) → ¬ ∅ ∈ 𝐹)
31, 2syl 17 1 (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wcel 2113  c0 4283  cfv 6490  fBascfbas 21295  Filcfil 23787
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fv 6498  df-fbas 21304  df-fil 23788
This theorem is referenced by:  fileln0  23792  isfil2  23798  infil  23805  filuni  23827  filufint  23862  rnelfmlem  23894  fmfnfm  23900  fclscmpi  23971
  Copyright terms: Public domain W3C validator