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

Theorem 3ianor 1120
Description: Negated triple conjunction expressed in terms of triple disjunction. (Contributed by Jeff Hankins, 15-Aug-2009.) (Proof shortened by Andrew Salmon, 13-May-2011.) Shorten with xchnxbir 335. (Revised by Wolf Lammen, 8-Apr-2022.)
Assertion
Ref Expression
3ianor (¬ (𝜑𝜓𝜒) ↔ (¬ 𝜑 ∨ ¬ 𝜓 ∨ ¬ 𝜒))

Proof of Theorem 3ianor
StepHypRef Expression
1 ianor 995 . . 3 (¬ (𝜑𝜓) ↔ (¬ 𝜑 ∨ ¬ 𝜓))
21orbi1i 924 . 2 ((¬ (𝜑𝜓) ∨ ¬ 𝜒) ↔ ((¬ 𝜑 ∨ ¬ 𝜓) ∨ ¬ 𝜒))
3 ianor 995 . . 3 (¬ ((𝜑𝜓) ∧ 𝜒) ↔ (¬ (𝜑𝜓) ∨ ¬ 𝜒))
4 df-3an 1101 . . 3 ((𝜑𝜓𝜒) ↔ ((𝜑𝜓) ∧ 𝜒))
53, 4xchnxbir 335 . 2 (¬ (𝜑𝜓𝜒) ↔ (¬ (𝜑𝜓) ∨ ¬ 𝜒))
6 df-3or 1100 . 2 ((¬ 𝜑 ∨ ¬ 𝜓 ∨ ¬ 𝜒) ↔ ((¬ 𝜑 ∨ ¬ 𝜓) ∨ ¬ 𝜒))
72, 5, 63bitr4i 305 1 (¬ (𝜑𝜓𝜒) ↔ (¬ 𝜑 ∨ ¬ 𝜓 ∨ ¬ 𝜒))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wa 399  wo 858  w3o 1098  w3a 1099
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 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101
This theorem is referenced by:  3anor  1121  tppreqb  4767  otthne  5456  fr3nr  7757  bropopvvv  8071  prinfzo0  13706  elfznelfzo  13781  ssnn0fi  14000  hashtpg  14500  hash3tpde  14508  swrdnd0  14673  pfxnd0  14704  lcmfunsnlem2lem2  16675  prm23ge5  16853  2irrexpq  26798  lpni  30685  xrdifh  32984  dvasin  38208  dflim5  43911  limcicciooub  46216  2zrngnring  48885
  Copyright terms: Public domain W3C validator