Table of ContentsTable of Contents User Sandbox < Previous   Next >
Related theorems
Unicode version

Theorem emnfil 10566
Description: The empty set is not a filter. Bourbaki TG I.36 def 1 note.
Assertion
Ref Expression
emnfil |- -. (/) e. Fil

Proof of Theorem emnfil
StepHypRef Expression
1 noel 2284 . 2 |- -. U.(/) e. (/)
2 eqid 1475 . . 3 |- U.(/) = U.(/)
32filusb 10561 . 2 |- ((/) e. Fil -> U.(/) e. (/))
41, 3mto 106 1 |- -. (/) e. Fil
Colors of variables: wff set class
Syntax hints:  -. wn 2   e. wcel 958  (/)c0 2280  U.cuni 2503  Filcfil 10556
This theorem is referenced by:  cnfilca 10583  cnfilcaOLD 10584
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ral 1649  df-v 1812  df-dif 2049  df-in 2051  df-ss 2053  df-nul 2281  df-uni 2504  df-fil 10557
Copyright terms: Public domain