MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ne3anior Structured version   Visualization version   GIF version

Theorem ne3anior 3110
Description: A De Morgan's law for inequality. (Contributed by NM, 30-Sep-2013.)
Assertion
Ref Expression
ne3anior ((𝐴𝐵𝐶𝐷𝐸𝐹) ↔ ¬ (𝐴 = 𝐵𝐶 = 𝐷𝐸 = 𝐹))

Proof of Theorem ne3anior
StepHypRef Expression
1 3anor 1100 . 2 ((𝐴𝐵𝐶𝐷𝐸𝐹) ↔ ¬ (¬ 𝐴𝐵 ∨ ¬ 𝐶𝐷 ∨ ¬ 𝐸𝐹))
2 nne 3020 . . 3 𝐴𝐵𝐴 = 𝐵)
3 nne 3020 . . 3 𝐶𝐷𝐶 = 𝐷)
4 nne 3020 . . 3 𝐸𝐹𝐸 = 𝐹)
52, 3, 43orbi123i 1148 . 2 ((¬ 𝐴𝐵 ∨ ¬ 𝐶𝐷 ∨ ¬ 𝐸𝐹) ↔ (𝐴 = 𝐵𝐶 = 𝐷𝐸 = 𝐹))
61, 5xchbinx 335 1 ((𝐴𝐵𝐶𝐷𝐸𝐹) ↔ ¬ (𝐴 = 𝐵𝐶 = 𝐷𝐸 = 𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 207  w3o 1078  w3a 1079   = wceq 1528  wne 3016
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-ne 3017
This theorem is referenced by:  eldiftp  4618
  Copyright terms: Public domain W3C validator