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 679 | . 2 | |
2 | or12 715 | . 2 | |
3 | orcom 679 | . . 3 | |
4 | 3 | orbi2i 711 | . 2 |
5 | 1, 2, 4 | 3bitri 204 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 103 wo 661 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 |
This theorem depends on definitions: df-bi 115 |
This theorem is referenced by: pm2.31 717 pm2.32 718 or32 719 or4 720 3orass 922 dveeq2 1736 dveeq2or 1737 sbequilem 1759 dvelimALT 1927 dvelimfv 1928 dvelimor 1935 unass 3129 ltxr 8849 lcmass 10467 |
Copyright terms: Public domain | W3C validator |