| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 3orcomb | Structured version Visualization version GIF version | ||
| Description: Commutation law for triple disjunction. (Contributed by Scott Fenton, 20-Apr-2011.) (Proof shortened by Wolf Lammen, 8-Apr-2022.) |
| Ref | Expression |
|---|---|
| 3orcomb | ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3orcoma 1093 | . 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜓 ∨ 𝜑 ∨ 𝜒)) | |
| 2 | 3orrot 1092 | . 2 ⊢ ((𝜓 ∨ 𝜑 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓)) | |
| 3 | 1, 2 | bitri 275 | 1 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∨ w3o 1086 |
| 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 207 df-or 849 df-3or 1088 |
| This theorem is referenced by: eueq3 3658 oneltri 6362 soseq 8104 swoso 8673 swrdnd 14612 elnnzs 28411 colcom 28644 legso 28685 lncom 28708 vonf1owev 35310 colinearperm1 36264 frege129d 44212 ordelordALT 44986 ordelordALTVD 45315 chnerlem3 47334 usgrexmpl2nb3 48526 |
| Copyright terms: Public domain | W3C validator |