Theorem 3orass 1012

Description: Associative law for triple disjunction. (Contributed by NM, 8-Apr-1994.)

Assertion

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

Proof of Theorem 3orass

Step	Hyp	Ref	Expression
1		df-3or 1010	. 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ((𝜑 ∨ 𝜓) ∨ 𝜒))
2		orass 779	. 2 ⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒)))
3	1, 2	bitri 184	1 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒)))

This proof depends on syntax axioms:   ↔ wb 105   ∨ wo 720   ∨ w3o 1008

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721

This proof depends on definitions:  df-bi 117  df-3or 1010

This theorem is used by:  3orrot  1015  3orcomb  1018  3mix1  1197  3bior1fd  1393  sotritric  4471  sotritrieq  4472  ordtriexmid  4670  ontriexmidim  4671  acexmidlemcase  6083  nntri3or  6770  nntri2  6771  exmidontriimlem1  7583  elnnz  9665  elznn0  9670  elznn  9671  zapne  9730  nn01to3  10033  elxr  10195  bezoutlemmain  12800  nninfctlemfo  12842  lgsdilem  16351  gausslemma2dlem4  16388