| 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 3670 oneltri 6361 soseq 8103 swoso 8672 swrdnd 14582 elnnzs 28401 colcom 28634 legso 28675 lncom 28698 vonf1owev 35304 colinearperm1 36258 frege129d 44071 ordelordALT 44845 ordelordALTVD 45174 chnerlem3 47195 usgrexmpl2nb3 48347 |
| Copyright terms: Public domain | W3C validator |