Theorem orass 684

Description: Associative law for disjunction. Theorem *4.33 of [WhiteheadRussell] p. 118. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
orass	|- ( ( ( ph \/ ps ) \/ ch ) <-> ( ph \/ ( ps \/ ch ) ) )

Proof of Theorem orass

Step	Hyp	Ref	Expression
1		orcom 647	. 2 |- ( ( ( ph \/ ps ) \/ ch ) <-> ( ch \/ ( ph \/ ps ) ) )
2		or12 683	. 2 |- ( ( ch \/ ( ph \/ ps ) ) <-> ( ph \/ ( ch \/ ps ) ) )
3		orcom 647	. . 3 |- ( ( ch \/ ps ) <-> ( ps \/ ch ) )
4	3	orbi2i 679	. 2 |- ( ( ph \/ ( ch \/ ps ) ) <-> ( ph \/ ( ps \/ ch ) ) )
5	1, 2, 4	3bitri 195	1 |- ( ( ( ph \/ ps ) \/ ch ) <-> ( ph \/ ( ps \/ ch ) ) )

Syntax hints:   <-> wb 98   \/ wo 629

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630

This theorem depends on definitions:  df-bi 110

This theorem is referenced by:  pm2.31  685  pm2.32  686  or32  687  or4  688  3orass  888  dveeq2  1696  dveeq2or  1697  sbequilem  1719  dvelimALT  1886  dvelimfv  1887  dvelimor  1894  unass  3100  ltxr  8695