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

Theorem or23 219
Description: A rearrangement of disjuncts.
Assertion
Ref Expression
or23 |- (((ph \/ ps) \/ ch) <-> ((ph \/ ch) \/ ps))

Proof of Theorem or23
StepHypRef Expression
1 orcom 209 . . 3 |- ((ps \/ ch) <-> (ch \/ ps))
21orbi2i 214 . 2 |- ((ph \/ (ps \/ ch)) <-> (ph \/ (ch \/ ps)))
3 orass 218 . 2 |- (((ph \/ ps) \/ ch) <-> (ph \/ (ps \/ ch)))
4 orass 218 . 2 |- (((ph \/ ch) \/ ps) <-> (ph \/ (ch \/ ps)))
52, 3, 43bitr4 158 1 |- (((ph \/ ps) \/ ch) <-> ((ph \/ ch) \/ ps))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   \/ wo 195
This theorem is referenced by:  sspsstri 1572  wereu 2197  ordtri3or 2230  ordtri3 2234  psslinpr 3929
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-or 197
metamath.org