Theorem or32dd 35366

Description: A rearrangement of disjuncts, in double deduction form. (Contributed by Giovanni Mascellani, 19-Mar-2018.)

Hypothesis

Ref	Expression
or32dd.1	⊢ (𝜑 → (𝜓 → ((𝜒 ∨ 𝜃) ∨ 𝜏)))

Assertion

Ref	Expression
or32dd	⊢ (𝜑 → (𝜓 → ((𝜒 ∨ 𝜏) ∨ 𝜃)))

Proof of Theorem or32dd

Step	Hyp	Ref	Expression
1		or32dd.1	. 2 ⊢ (𝜑 → (𝜓 → ((𝜒 ∨ 𝜃) ∨ 𝜏)))
2		or32 922	. 2 ⊢ (((𝜒 ∨ 𝜏) ∨ 𝜃) ↔ ((𝜒 ∨ 𝜃) ∨ 𝜏))
3	1, 2	syl6ibr 254	1 ⊢ (𝜑 → (𝜓 → ((𝜒 ∨ 𝜏) ∨ 𝜃)))

Syntax hints:   → wi 4   ∨ wo 843

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 209  df-or 844

This theorem is referenced by:  mpobi123f  35434  mptbi12f  35438  ac6s6  35444