MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  necon1d Structured version   Unicode version

Theorem necon1d 2607
Description: Contrapositive law deduction for inequality. (Contributed by NM, 28-Dec-2008.) (Proof shortened by Andrew Salmon, 25-May-2011.)
Hypothesis
Ref Expression
necon1d.1  |-  ( ph  ->  ( A  =/=  B  ->  C  =  D ) )
Assertion
Ref Expression
necon1d  |-  ( ph  ->  ( C  =/=  D  ->  A  =  B ) )

Proof of Theorem necon1d
StepHypRef Expression
1 necon1d.1 . . 3  |-  ( ph  ->  ( A  =/=  B  ->  C  =  D ) )
2 nne 2583 . . 3  |-  ( -.  C  =/=  D  <->  C  =  D )
31, 2syl6ibr 227 . 2  |-  ( ph  ->  ( A  =/=  B  ->  -.  C  =/=  D
) )
43necon4ad 2602 1  |-  ( ph  ->  ( C  =/=  D  ->  A  =  B ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1399    =/= wne 2577
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 185  df-ne 2579
This theorem is referenced by:  disji  4355  mul02lem2  9668  xblss2ps  20989  xblss2  20990  lgsne0  23725  h1datomi  26616  eigorthi  26872  disjif  27568  lineintmo  29960  2llnmat  35661  2lnat  35921  tendospcanN  37163  dihmeetlem13N  37459  dochkrshp  37526
  Copyright terms: Public domain W3C validator