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

Theorem orass 683
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 646 . 2
2 or12 682 . 2
3 orcom 646 . . 3
43orbi2i 678 . 2
51, 2, 43bitri 195 1
Colors of variables: wff set class
Syntax hints:   wb 98   wo 628
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 629
This theorem depends on definitions:  df-bi 110
This theorem is referenced by:  pm2.31  684  pm2.32  685  or32  686  or4  687  3orass  887  dveeq2  1693  dveeq2or  1694  sbequilem  1716  dvelimALT  1883  dvelimfv  1884  dvelimor  1891  unass  3094  ltxr  8465
  Copyright terms: Public domain W3C validator