Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > or4 | Structured version Visualization version GIF version |
Description: Rearrangement of 4 disjuncts. (Contributed by NM, 12-Aug-1994.) |
Ref | Expression |
---|---|
or4 | ⊢ (((𝜑 ∨ 𝜓) ∨ (𝜒 ∨ 𝜃)) ↔ ((𝜑 ∨ 𝜒) ∨ (𝜓 ∨ 𝜃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | or12 918 | . . 3 ⊢ ((𝜓 ∨ (𝜒 ∨ 𝜃)) ↔ (𝜒 ∨ (𝜓 ∨ 𝜃))) | |
2 | 1 | orbi2i 910 | . 2 ⊢ ((𝜑 ∨ (𝜓 ∨ (𝜒 ∨ 𝜃))) ↔ (𝜑 ∨ (𝜒 ∨ (𝜓 ∨ 𝜃)))) |
3 | orass 919 | . 2 ⊢ (((𝜑 ∨ 𝜓) ∨ (𝜒 ∨ 𝜃)) ↔ (𝜑 ∨ (𝜓 ∨ (𝜒 ∨ 𝜃)))) | |
4 | orass 919 | . 2 ⊢ (((𝜑 ∨ 𝜒) ∨ (𝜓 ∨ 𝜃)) ↔ (𝜑 ∨ (𝜒 ∨ (𝜓 ∨ 𝜃)))) | |
5 | 2, 3, 4 | 3bitr4i 303 | 1 ⊢ (((𝜑 ∨ 𝜓) ∨ (𝜒 ∨ 𝜃)) ↔ ((𝜑 ∨ 𝜒) ∨ (𝜓 ∨ 𝜃))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∨ wo 844 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 206 df-or 845 |
This theorem is referenced by: or42 925 orordi 926 orordir 927 3or6 1446 swoer 8526 xmullem2 12997 swrdnnn0nd 14367 clsk1indlem3 41623 |
Copyright terms: Public domain | W3C validator |