ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  neldifsn Unicode version

Theorem neldifsn 3822
Description:  A is not in  ( B  \  { A } ). (Contributed by David Moews, 1-May-2017.)
Assertion
Ref Expression
neldifsn  |-  -.  A  e.  ( B  \  { A } )

Proof of Theorem neldifsn
StepHypRef Expression
1 neirr 2421 . 2  |-  -.  A  =/=  A
2 eldifsni 3821 . 2  |-  ( A  e.  ( B  \  { A } )  ->  A  =/=  A )
31, 2mto 668 1  |-  -.  A  e.  ( B  \  { A } )
Colors of variables: wff set class
Syntax hints:   -. wn 3    e. wcel 2203    =/= wne 2412    \ cdif 3207   {csn 3688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-v 2814  df-dif 3212  df-sn 3694
This theorem is referenced by:  neldifsnd  3823  findcard2s  7146  fvsetsid  13235
  Copyright terms: Public domain W3C validator