NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  orass Unicode version

Theorem orass 510
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

Proof of Theorem orass
StepHypRef Expression
1 orcom 376 . 2
2 or12 509 . 2
3 orcom 376 . . 3
43orbi2i 505 . 2
51, 2, 43bitri 262 1
Colors of variables: wff setvar class
Syntax hints:   wb 176   wo 357
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 177  df-or 359
This theorem is referenced by:  pm2.31  511  pm2.32  512  or32  513  or4  514  3orass  937  axi12  2333  unass  3420
  Copyright terms: Public domain W3C validator