| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A way of showing two classes are not equal. |
| Ref | Expression |
|---|---|
| nelneq |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 1534 |
. . . 4
| |
| 2 | 1 | biimpcd 155 |
. . 3
|
| 3 | 2 | con3d 95 |
. 2
|
| 4 | 3 | imp 350 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: disjne 2315 difsn 2464 suc11reg 4605 renepnft 5537 renemnft 5538 topnem 10507 fipfil 10563 fipfil2 10564 fipfil2OLD 10565 cnfilca 10583 cnfilcaOLD 10584 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 963 ax-17 971 ax-4 973 ax-5o 975 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-cleq 1469 df-clel 1472 |