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

Theorem clneq2 1169
Description: A way of showing two classes are not equal.
Assertion
Ref Expression
clneq2 |- ((A e. B /\ -. A e. C) -> -. B = C)

Proof of Theorem clneq2
StepHypRef Expression
1 eleq2 1150 . . . 4 |- (B = C -> (A e. B <-> A e. C))
21biimpcd 137 . . 3 |- (A e. B -> (B = C -> A e. C))
32con3d 87 . 2 |- (A e. B -> (-. A e. C -> -. B = C))
43imp 277 1 |- ((A e. B /\ -. A e. C) -> -. B = C)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   = wceq 1091   e. wcel 1092
This theorem is referenced by:  ssnelpss 1751  opth2 1909  opthwiener 1914
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-gen 677  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-cleq 1097  df-clel 1099
metamath.org