Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > orass | Unicode version |
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.) |
Ref | Expression |
---|---|
orass |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | orcom 723 | . 2 | |
2 | or12 761 | . 2 | |
3 | orcom 723 | . . 3 | |
4 | 3 | orbi2i 757 | . 2 |
5 | 1, 2, 4 | 3bitri 205 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wo 703 |
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 704 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: pm2.31 763 pm2.32 764 or32 765 or4 766 3orass 976 dveeq2 1808 dveeq2or 1809 sbequilem 1831 dvelimALT 2003 dvelimfv 2004 dvelimor 2011 unass 3284 ltxr 9732 lcmass 12039 |
Copyright terms: Public domain | W3C validator |