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

Theorem orass 218
Description: Associative law for disjunction. Theorem *4.33 of [WhiteheadRussell] p. 118.
Assertion
Ref Expression
orass |- (((ph \/ ps) \/ ch) <-> (ph \/ (ps \/ ch)))

Proof of Theorem orass
StepHypRef Expression
1 or12 217 . 2 |- ((ch \/ (ph \/ ps)) <-> (ph \/ (ch \/ ps)))
2 orcom 209 . 2 |- (((ph \/ ps) \/ ch) <-> (ch \/ (ph \/ ps)))
3 orcom 209 . . 3 |- ((ps \/ ch) <-> (ch \/ ps))
43orbi2i 214 . 2 |- ((ph \/ (ps \/ ch)) <-> (ph \/ (ch \/ ps)))
51, 2, 43bitr4 158 1 |- (((ph \/ ps) \/ ch) <-> (ph \/ (ps \/ ch)))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   \/ wo 195
This theorem is referenced by:  or23 219  or4 220  3orass 584  eueq3 1430  unass 1615
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