Metamath Proof Explorer


Theorem neeq2d

Description: Deduction for inequality. (Contributed by NM, 25-Oct-1999) (Proof shortened by Wolf Lammen, 19-Nov-2019)

Ref Expression
Hypothesis neeq1d.1
|- ( ph -> A = B )
Assertion neeq2d
|- ( ph -> ( C =/= A <-> C =/= B ) )

Proof

Step Hyp Ref Expression
1 neeq1d.1
 |-  ( ph -> A = B )
2 1 eqeq2d
 |-  ( ph -> ( C = A <-> C = B ) )
3 2 necon3bid
 |-  ( ph -> ( C =/= A <-> C =/= B ) )