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

Theorem nebi 2084
Description: Contraposition law for inequality.
Assertion
Ref Expression
nebi |- ((A = B <-> C = D) <-> (A =/= B <-> C =/= D))

Proof of Theorem nebi
StepHypRef Expression
1 id 73 . . 3 |- ((A = B <-> C = D) -> (A = B <-> C = D))
21necon3bid 2035 . 2 |- ((A = B <-> C = D) -> (A =/= B <-> C =/= D))
3 id 73 . . 3 |- ((A =/= B <-> C =/= D) -> (A =/= B <-> C =/= D))
43necon4bid 2078 . 2 |- ((A =/= B <-> C =/= D) -> (A = B <-> C = D))
52, 4impbii 174 1 |- ((A = B <-> C = D) <-> (A =/= B <-> C =/= D))
Colors of variables: wff set class
Syntax hints:   <-> wb 163   = wceq 1298   =/= wne 2017
This theorem is referenced by:  mulgcdlem2 13757
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 164  df-an 242  df-ne 2019
Copyright terms: Public domain