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

Theorem nelneq 2138
Description: A way of showing two classes are not equal. (Contributed by NM, 1-Apr-1997.)
Assertion
Ref Expression
nelneq  |-  ( ( A  e.  C  /\  -.  B  e.  C
)  ->  -.  A  =  B )

Proof of Theorem nelneq
StepHypRef Expression
1 eleq1 2100 . . 3  |-  ( A  =  B  ->  ( A  e.  C  <->  B  e.  C ) )
21biimpcd 148 . 2  |-  ( A  e.  C  ->  ( A  =  B  ->  B  e.  C ) )
32con3and 564 1  |-  ( ( A  e.  C  /\  -.  B  e.  C
)  ->  -.  A  =  B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 97    = wceq 1243    e. wcel 1393
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-17 1419  ax-ial 1427  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-cleq 2033  df-clel 2036
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator