Theorem an13 660

Description: A rearrangement of conjuncts. (Contributed by NM, 24-Jun-2012.) (Proof shortened by Wolf Lammen, 31-Dec-2012.)

Assertion

Ref	Expression
an13	⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒)) ↔ (𝜒 ∧ (𝜓 ∧ 𝜑)))

Proof of Theorem an13

Step	Hyp	Ref	Expression
1		an21 657	. 2 ⊢ (((𝜓 ∧ 𝜑) ∧ 𝜒) ↔ (𝜑 ∧ (𝜓 ∧ 𝜒)))
2		ancom 466	. 2 ⊢ (((𝜓 ∧ 𝜑) ∧ 𝜒) ↔ (𝜒 ∧ (𝜓 ∧ 𝜑)))
3	1, 2	bitr3i 280	1 ⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒)) ↔ (𝜒 ∧ (𝜓 ∧ 𝜑)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402

This theorem is used by:  an31  661  opeliun2xp  5719  elsnxp  6293  dchrelbas3  27558  dfiota3  36665  bj-dfmpoa  38019  islpln5  40572  islvol5  40616  dibelval3  42184