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

Theorem elndif 2732
Description: A set does not belong to a class excluding it.
Assertion
Ref Expression
elndif |- (A e. B -> -. A e. (C \ B))

Proof of Theorem elndif
StepHypRef Expression
1 eldifn 2731 . 2 |- (A e. (C \ B) -> -. A e. B)
21con2i 113 1 |- (A e. B -> -. A e. (C \ B))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   e. wcel 1300   \ cdif 2590
This theorem is referenced by:  peano5 3975  xrsupss 7287  xrinfmss 7288  dif1enOLD 10173  bnj112 12457  dfon2lem6 13854  unprj 14511  subntr 15425  cptclsscpt 15432  ist1-2 15542  ufinffr 15578
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-v 2294  df-dif 2597
Copyright terms: Public domain