HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem snnzg 3118
Description: The singleton of a set is not empty.
Assertion
Ref Expression
snnzg |- (A e. B -> {A} =/= (/))

Proof of Theorem snnzg
StepHypRef Expression
1 snidg 3067 . 2 |- (A e. B -> A e. {A})
2 ne0i 2881 . 2 |- (A e. {A} -> {A} =/= (/))
31, 2syl 12 1 |- (A e. B -> {A} =/= (/))
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 1300   =/= wne 2017  (/)c0 2875  {csn 3044
This theorem is referenced by:  snnz 3119  1stconst 5070  2ndconst 5071  domrancur1b 14548  prsubrtr 14763  limfilnei 14943  conttnf 14944  conttnf2 14945  cnpfillim4 14947  tarsuc2 15245  uffixfr 15575  fixufil 15576  neiplim 15586  flimcls 15588  cnpfillim 15589  fclsfnflim 15614  elpaddat 17265  elpadd2at 17267
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-dif 2597  df-nul 2876  df-sn 3049
Copyright terms: Public domain