ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  orass Unicode version

Theorem orass 741
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
StepHypRef Expression
1 orcom 702 . 2  |-  ( ( ( ph  \/  ps )  \/  ch )  <->  ( ch  \/  ( ph  \/  ps ) ) )
2 or12 740 . 2  |-  ( ( ch  \/  ( ph  \/  ps ) )  <->  ( ph  \/  ( ch  \/  ps ) ) )
3 orcom 702 . . 3  |-  ( ( ch  \/  ps )  <->  ( ps  \/  ch )
)
43orbi2i 736 . 2  |-  ( (
ph  \/  ( ch  \/  ps ) )  <->  ( ph  \/  ( ps  \/  ch ) ) )
51, 2, 43bitri 205 1  |-  ( ( ( ph  \/  ps )  \/  ch )  <->  (
ph  \/  ( ps  \/  ch ) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    \/ wo 682
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  pm2.31  742  pm2.32  743  or32  744  or4  745  3orass  950  dveeq2  1771  dveeq2or  1772  sbequilem  1794  dvelimALT  1963  dvelimfv  1964  dvelimor  1971  unass  3203  ltxr  9517  lcmass  11678
  Copyright terms: Public domain W3C validator