HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem or42 265
Description: Rearrangement of 4 disjuncts.
Assertion
Ref Expression
or42 |- (((ph \/ ps) \/ (ch \/ th)) <-> ((ph \/ ch) \/ (th \/ ps)))

Proof of Theorem or42
StepHypRef Expression
1 or4 264 . 2 |- (((ph \/ ps) \/ (ch \/ th)) <-> ((ph \/ ch) \/ (ps \/ th)))
2 orcom 246 . . 3 |- ((ps \/ th) <-> (th \/ ps))
32orbi2i 255 . 2 |- (((ph \/ ch) \/ (ps \/ th)) <-> ((ph \/ ch) \/ (th \/ ps)))
41, 3bitr 173 1 |- (((ph \/ ps) \/ (ch \/ th)) <-> ((ph \/ ch) \/ (th \/ ps)))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   \/ wo 222
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 147  df-or 224
Copyright terms: Public domain