Theorem 3orcomb 1076

Description: Commutation law for triple disjunction. (Contributed by Scott Fenton, 20-Apr-2011.) (Proof shortened by Wolf Lammen, 8-Apr-2022.)

Assertion

Ref	Expression
3orcomb	⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓))

Proof of Theorem 3orcomb

Step	Hyp	Ref	Expression
1		3orcoma 1075	. 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜓 ∨ 𝜑 ∨ 𝜒))
2		3orrot 1074	. 2 ⊢ ((𝜓 ∨ 𝜑 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓))
3	1, 2	bitri 267	1 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ 𝜒 ∨ 𝜓))

Syntax hints:   ↔ wb 198   ∨ w3o 1068

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 199  df-or 835  df-3or 1070

This theorem is referenced by:  eueq3  3618  swoso  8128  swrdnd  13828  colcom  26061  legso  26102  lncom  26125  soseq  32657  colinearperm1  33084  frege129d  39512  ordelordALT  40330  ordelordALTVD  40660