HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem necon3i 1597
Description: Contrapositive inference for inequality.
Hypothesis
Ref Expression
necon3i.1 |- (A = B -> C = D)
Assertion
Ref Expression
necon3i |- (C =/= D -> A =/= B)

Proof of Theorem necon3i
StepHypRef Expression
1 necon3i.1 . 2 |- (A = B -> C = D)
2 id 59 . . 3 |- ((A = B -> C = D) -> (A = B -> C = D))
32necon3d 1596 . 2 |- ((A = B -> C = D) -> (C =/= D -> A =/= B))
41, 3ax-mp 7 1 |- (C =/= D -> A =/= B)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 953   =/= wne 1577
This theorem is referenced by:  onnev 3232  xpnz 3452  unixp 3503  inf3lem2 4586  infeq5 4593  ivthlem8 7223  ivthlem8OLD 7232  nmlno0lem 8385  blocni 8396  nmlnop0ALT 9835  fiiu2 10377
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-ne 1579
Copyright terms: Public domain