MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  filn0 Structured version   Unicode version

Theorem filn0 17894
Description: The empty set is not a filter. Remark below def. 1 of [BourbakiTop1] p. I.36. (Contributed by FL, 30-Oct-2007.) (Revised by Stefan O'Rear, 28-Jul-2015.)
Assertion
Ref Expression
filn0  |-  ( F  e.  ( Fil `  X
)  ->  F  =/=  (/) )

Proof of Theorem filn0
StepHypRef Expression
1 filtop 17887 . 2  |-  ( F  e.  ( Fil `  X
)  ->  X  e.  F )
2 ne0i 3634 . 2  |-  ( X  e.  F  ->  F  =/=  (/) )
31, 2syl 16 1  |-  ( F  e.  ( Fil `  X
)  ->  F  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1725    =/= wne 2599   (/)c0 3628   ` cfv 5454   Filcfil 17877
This theorem is referenced by:  ufileu  17951  filufint  17952  uffixfr  17955  uffix2  17956  uffixsn  17957  hausflim  18013  fclsval  18040  isfcls  18041  fclsopn  18046  fclsfnflim  18059  filnetlem4  26410
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-sep 4330  ax-nul 4338  ax-pow 4377  ax-pr 4403
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2285  df-mo 2286  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-nel 2602  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-sbc 3162  df-csb 3252  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-pw 3801  df-sn 3820  df-pr 3821  df-op 3823  df-uni 4016  df-br 4213  df-opab 4267  df-mpt 4268  df-id 4498  df-xp 4884  df-rel 4885  df-cnv 4886  df-co 4887  df-dm 4888  df-rn 4889  df-res 4890  df-ima 4891  df-iota 5418  df-fun 5456  df-fv 5462  df-fbas 16699  df-fil 17878
  Copyright terms: Public domain W3C validator