Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > orass | GIF 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 647 | . 2 ⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜒 ∨ (𝜑 ∨ 𝜓))) | |
2 | or12 683 | . 2 ⊢ ((𝜒 ∨ (𝜑 ∨ 𝜓)) ↔ (𝜑 ∨ (𝜒 ∨ 𝜓))) | |
3 | orcom 647 | . . 3 ⊢ ((𝜒 ∨ 𝜓) ↔ (𝜓 ∨ 𝜒)) | |
4 | 3 | orbi2i 679 | . 2 ⊢ ((𝜑 ∨ (𝜒 ∨ 𝜓)) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒))) |
5 | 1, 2, 4 | 3bitri 195 | 1 ⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒))) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 98 ∨ wo 629 |
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 630 |
This theorem depends on definitions: df-bi 110 |
This theorem is referenced by: pm2.31 685 pm2.32 686 or32 687 or4 688 3orass 888 dveeq2 1696 dveeq2or 1697 sbequilem 1719 dvelimALT 1886 dvelimfv 1887 dvelimor 1894 unass 3100 ltxr 8695 |
Copyright terms: Public domain | W3C validator |