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

Theorem neeq1iOLD 2743
Description: Obsolete proof of neeq1i 2742 as of 19-Nov-2019. (Contributed by NM, 29-Apr-2005.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
neeq1i.1  |-  A  =  B
Assertion
Ref Expression
neeq1iOLD  |-  ( A  =/=  C  <->  B  =/=  C )

Proof of Theorem neeq1iOLD
StepHypRef Expression
1 neeq1i.1 . 2  |-  A  =  B
2 neeq1 2738 . 2  |-  ( A  =  B  ->  ( A  =/=  C  <->  B  =/=  C ) )
31, 2ax-mp 5 1  |-  ( A  =/=  C  <->  B  =/=  C )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    = wceq 1395    =/= wne 2652
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-cleq 2449  df-ne 2654
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator