MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  3or6 Structured version   Unicode version

Theorem 3or6 1301
Description: Analog of or4 528 for triple conjunction. (Contributed by Scott Fenton, 16-Mar-2011.)
Assertion
Ref Expression
3or6  |-  ( ( ( ph  \/  ps )  \/  ( ch  \/  th )  \/  ( ta  \/  et ) )  <-> 
( ( ph  \/  ch  \/  ta )  \/  ( ps  \/  th  \/  et ) ) )

Proof of Theorem 3or6
StepHypRef Expression
1 or4 528 . . 3  |-  ( ( ( ( ph  \/  ch )  \/  ta )  \/  ( ( ps  \/  th )  \/  et ) )  <->  ( (
( ph  \/  ch )  \/  ( ps  \/  th ) )  \/  ( ta  \/  et ) ) )
2 or4 528 . . . 4  |-  ( ( ( ph  \/  ch )  \/  ( ps  \/  th ) )  <->  ( ( ph  \/  ps )  \/  ( ch  \/  th ) ) )
32orbi1i 520 . . 3  |-  ( ( ( ( ph  \/  ch )  \/  ( ps  \/  th ) )  \/  ( ta  \/  et ) )  <->  ( (
( ph  \/  ps )  \/  ( ch  \/  th ) )  \/  ( ta  \/  et ) ) )
41, 3bitr2i 250 . 2  |-  ( ( ( ( ph  \/  ps )  \/  ( ch  \/  th ) )  \/  ( ta  \/  et ) )  <->  ( (
( ph  \/  ch )  \/  ta )  \/  ( ( ps  \/  th )  \/  et ) ) )
5 df-3or 966 . 2  |-  ( ( ( ph  \/  ps )  \/  ( ch  \/  th )  \/  ( ta  \/  et ) )  <-> 
( ( ( ph  \/  ps )  \/  ( ch  \/  th ) )  \/  ( ta  \/  et ) ) )
6 df-3or 966 . . 3  |-  ( (
ph  \/  ch  \/  ta )  <->  ( ( ph  \/  ch )  \/  ta ) )
7 df-3or 966 . . 3  |-  ( ( ps  \/  th  \/  et )  <->  ( ( ps  \/  th )  \/  et ) )
86, 7orbi12i 521 . 2  |-  ( ( ( ph  \/  ch  \/  ta )  \/  ( ps  \/  th  \/  et ) )  <->  ( (
( ph  \/  ch )  \/  ta )  \/  ( ( ps  \/  th )  \/  et ) ) )
94, 5, 83bitr4i 277 1  |-  ( ( ( ph  \/  ps )  \/  ( ch  \/  th )  \/  ( ta  \/  et ) )  <-> 
( ( ph  \/  ch  \/  ta )  \/  ( ps  \/  th  \/  et ) ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    \/ wo 368    \/ w3o 964
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 185  df-or 370  df-3or 966
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator