![]() |
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 1092 | . 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜓 ∨ 𝜑 ∨ 𝜒)) | |
2 | 3orrot 1091 | . 2 ⊢ ((𝜓 ∨ 𝜑 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓)) | |
3 | 1, 2 | bitri 275 | 1 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∨ w3o 1085 |
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 848 df-3or 1087 |
This theorem is referenced by: eueq3 3719 soseq 8182 swoso 8777 swrdnd 14688 elnnzs 28401 colcom 28580 legso 28621 lncom 28644 colinearperm1 36043 oneltri 43246 frege129d 43752 ordelordALT 44534 ordelordALTVD 44864 usgrexmpl2nb3 47928 |
Copyright terms: Public domain | W3C validator |