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

Theorem nner 2250
Description: Negation of inequality. (Contributed by Jim Kingdon, 23-Dec-2018.)
Assertion
Ref Expression
nner  |-  ( A  =  B  ->  -.  A  =/=  B )

Proof of Theorem nner
StepHypRef Expression
1 df-ne 2247 . . 3  |-  ( A  =/=  B  <->  -.  A  =  B )
21biimpi 118 . 2  |-  ( A  =/=  B  ->  -.  A  =  B )
32con2i 590 1  |-  ( A  =  B  ->  -.  A  =/=  B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1285    =/= wne 2246
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-in1 577  ax-in2 578
This theorem depends on definitions:  df-bi 115  df-ne 2247
This theorem is referenced by:  nn0eln0  4367  funtpg  4981  fin0  6419  sizenncl  9820
  Copyright terms: Public domain W3C validator