| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqneqall | Unicode version | ||
| Description: A contradiction concerning equality implies anything. (Contributed by Alexander van der Vekens, 25-Jan-2018.) |
| Ref | Expression |
|---|---|
| eqneqall |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 2413 |
. 2
| |
| 2 | pm2.24 626 |
. 2
| |
| 3 | 1, 2 | biimtrid 152 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-in2 620 |
| This theorem depends on definitions: df-bi 117 df-ne 2413 |
| This theorem is referenced by: ssprsseq 3856 eldju2ndl 7363 eldju2ndr 7364 modfzo0difsn 10757 nno 12590 prm2orodd 12821 prm23lt5 12959 dvdsprmpweqnn 13032 logbgcd1irr 15830 gausslemma2dlem0f 15925 gausslemma2dlem0i 15928 2lgs 15975 2lgsoddprm 15984 umgrnloop2 16144 uhgr2edg 16199 umgrclwwlkge2 16395 |
| Copyright terms: Public domain | W3C validator |