Theorem 3orass 1008

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 1006	. 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ((𝜑 ∨ 𝜓) ∨ 𝜒))
2		orass 775	. 2 ⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒)))
3	1, 2	bitri 184	1 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒)))

Syntax hints:   ↔ wb 105   ∨ wo 716   ∨ w3o 1004

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717

This theorem depends on definitions:  df-bi 117  df-3or 1006

This theorem is referenced by:  3orrot  1011  3orcomb  1014  3mix1  1193  3bior1fd  1389  sotritric  4445  sotritrieq  4446  ordtriexmid  4643  ontriexmidim  4644  acexmidlemcase  6045  nntri3or  6726  nntri2  6727  exmidontriimlem1  7528  elnnz  9587  elznn0  9592  elznn  9593  zapne  9652  nn01to3  9949  elxr  10109  bezoutlemmain  12694  nninfctlemfo  12736  lgsdilem  15900  gausslemma2dlem4  15937