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

Theorem 3ioran 1095
 Description: Negated triple disjunction as triple conjunction. (Contributed by Scott Fenton, 19-Apr-2011.)
Assertion
Ref Expression
3ioran (¬ (𝜑𝜓𝜒) ↔ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒))

Proof of Theorem 3ioran
StepHypRef Expression
1 ioran 512 . . 3 (¬ (𝜑𝜓) ↔ (¬ 𝜑 ∧ ¬ 𝜓))
21anbi1i 733 . 2 ((¬ (𝜑𝜓) ∧ ¬ 𝜒) ↔ ((¬ 𝜑 ∧ ¬ 𝜓) ∧ ¬ 𝜒))
3 ioran 512 . . 3 (¬ ((𝜑𝜓) ∨ 𝜒) ↔ (¬ (𝜑𝜓) ∧ ¬ 𝜒))
4 df-3or 1073 . . 3 ((𝜑𝜓𝜒) ↔ ((𝜑𝜓) ∨ 𝜒))
53, 4xchnxbir 322 . 2 (¬ (𝜑𝜓𝜒) ↔ (¬ (𝜑𝜓) ∧ ¬ 𝜒))
6 df-3an 1074 . 2 ((¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒) ↔ ((¬ 𝜑 ∧ ¬ 𝜓) ∧ ¬ 𝜒))
72, 5, 63bitr4i 292 1 (¬ (𝜑𝜓𝜒) ↔ (¬ 𝜑 ∧ ¬ 𝜓 ∧ ¬ 𝜒))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 196   ∨ wo 382   ∧ wa 383   ∨ w3o 1071   ∧ w3a 1072 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 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074 This theorem is referenced by:  3oran  1099  cadnot  1695  lcmftp  15543  prm23ge5  15714  cnfldfunALT  19953  fbunfip  21866  frgrregord013  27555  wl-nfeqfb  33628
 Copyright terms: Public domain W3C validator