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

Theorem necomi 2370
Description: Inference from commutative law for inequality. (Contributed by NM, 17-Oct-2012.)
Hypothesis
Ref Expression
necomi.1  |-  A  =/= 
B
Assertion
Ref Expression
necomi  |-  B  =/= 
A

Proof of Theorem necomi
StepHypRef Expression
1 necomi.1 . 2  |-  A  =/= 
B
2 necom 2369 . 2  |-  ( A  =/=  B  <->  B  =/=  A )
31, 2mpbi 144 1  |-  B  =/= 
A
Colors of variables: wff set class
Syntax hints:    =/= wne 2285
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 588  ax-in2 589  ax-5 1408  ax-gen 1410  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-cleq 2110  df-ne 2286
This theorem is referenced by:  0nep0  4059  xp01disj  6298  xp01disjl  6299  djulclb  6908  djuinr  6916  pnfnemnf  7788  mnfnepnf  7789  ltneii  7828  1ne0  8756  0ne2  8893  fzprval  9830  0tonninf  10180  1tonninf  10181
  Copyright terms: Public domain W3C validator