Theorem 3orbi123i 835

Description: Join 3 biconditionals with disjunction.

Hypotheses

Ref	Expression
bi3.1	|- (ph <-> ps)
bi3.2	|- (ch <-> th)
bi3.3	|- (ta <-> et)

Assertion

Ref	Expression
3orbi123i	|- ((ph \/ ch \/ ta) <-> (ps \/ th \/ et))

Proof of Theorem 3orbi123i

Step	Hyp	Ref	Expression
1		bi3.1	. . . 4 |- (ph <-> ps)
2		bi3.2	. . . 4 |- (ch <-> th)
3	1, 2	orbi12i 264	. . 3 |- ((ph \/ ch) <-> (ps \/ th))
4		bi3.3	. . 3 |- (ta <-> et)
5	3, 4	orbi12i 264	. 2 |- (((ph \/ ch) \/ ta) <-> ((ps \/ th) \/ et))
6		df-3or 788	. 2 |- ((ph \/ ch \/ ta) <-> ((ph \/ ch) \/ ta))
7		df-3or 788	. 2 |- ((ps \/ th \/ et) <-> ((ps \/ th) \/ et))
8	5, 6, 7	3bitr4i 190	1 |- ((ph \/ ch \/ ta) <-> (ps \/ th \/ et))

Syntax hints:   <-> wb 153   \/ wo 229   \/ w3o 786

This theorem is referenced by:  wecmpep 2998  ordon 3044  cnvso 3580  zorn 4859

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 154  df-or 231  df-3or 788

Copyright terms: Public domain