| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A way of showing two classes are not equal. |
| Ref | Expression |
|---|---|
| clneq |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 1149 |
. . . 4
| |
| 2 | 1 | biimpcd 137 |
. . 3
|
| 3 | 2 | con3d 87 |
. 2
|
| 4 | 3 | imp 277 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: suc11reg 3456 |
| 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 |