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

Theorem neanior 1631
Description: A DeMorgan's law for inequality.
Assertion
Ref Expression
neanior |- ((A =/= B /\ C =/= D) <-> -. (A = B \/ C = D))

Proof of Theorem neanior
StepHypRef Expression
1 df-ne 1579 . . 3 |- (A =/= B <-> -. A = B)
2 df-ne 1579 . . 3 |- (C =/= D <-> -. C = D)
31, 2anbi12i 481 . 2 |- ((A =/= B /\ C =/= D) <-> (-. A = B /\ -. C = D))
4 pm4.56 311 . 2 |- ((-. A = B /\ -. C = D) <-> -. (A = B \/ C = D))
53, 4bitr 173 1 |- ((A =/= B /\ C =/= D) <-> -. (A = B \/ C = D))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 146   \/ wo 222   /\ wa 223   = wceq 953   =/= wne 1577
This theorem is referenced by:  om00 4190  om00el 4191  muln0bt 5666  nmlno0lem 8385  nmlnop0ALT 9835  irred 10229  mdsym 10246  neiopne 10369
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-or 224  df-an 225  df-ne 1579
Copyright terms: Public domain