Theorem caov13d

Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995) (Revised by Mario Carneiro, 30-Dec-2014)

	Ref	Expression
Hypotheses	caovd.1	⊢ ( 𝜑 → 𝐴 ∈ 𝑆 )
	caovd.2	⊢ ( 𝜑 → 𝐵 ∈ 𝑆 )
	caovd.3	⊢ ( 𝜑 → 𝐶 ∈ 𝑆 )
	caovd.com	⊢ ( ( 𝜑 ∧ ( 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ) ) → ( 𝑥 𝐹 𝑦 ) = ( 𝑦 𝐹 𝑥 ) )
	caovd.ass	⊢ ( ( 𝜑 ∧ ( 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆 ) ) → ( ( 𝑥 𝐹 𝑦 ) 𝐹 𝑧 ) = ( 𝑥 𝐹 ( 𝑦 𝐹 𝑧 ) ) )
Assertion	caov13d	⊢ ( 𝜑 → ( 𝐴 𝐹 ( 𝐵 𝐹 𝐶 ) ) = ( 𝐶 𝐹 ( 𝐵 𝐹 𝐴 ) ) )

Proof

Step	Hyp	Ref	Expression
1		caovd.1	⊢ ( 𝜑 → 𝐴 ∈ 𝑆 )
2		caovd.2	⊢ ( 𝜑 → 𝐵 ∈ 𝑆 )
3		caovd.3	⊢ ( 𝜑 → 𝐶 ∈ 𝑆 )
4		caovd.com	⊢ ( ( 𝜑 ∧ ( 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ) ) → ( 𝑥 𝐹 𝑦 ) = ( 𝑦 𝐹 𝑥 ) )
5		caovd.ass	⊢ ( ( 𝜑 ∧ ( 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆 ) ) → ( ( 𝑥 𝐹 𝑦 ) 𝐹 𝑧 ) = ( 𝑥 𝐹 ( 𝑦 𝐹 𝑧 ) ) )
6	1 2 3 4 5	caov31d	⊢ ( 𝜑 → ( ( 𝐴 𝐹 𝐵 ) 𝐹 𝐶 ) = ( ( 𝐶 𝐹 𝐵 ) 𝐹 𝐴 ) )
7	5 1 2 3	caovassd	⊢ ( 𝜑 → ( ( 𝐴 𝐹 𝐵 ) 𝐹 𝐶 ) = ( 𝐴 𝐹 ( 𝐵 𝐹 𝐶 ) ) )
8	5 3 2 1	caovassd	⊢ ( 𝜑 → ( ( 𝐶 𝐹 𝐵 ) 𝐹 𝐴 ) = ( 𝐶 𝐹 ( 𝐵 𝐹 𝐴 ) ) )
9	6 7 8	3eqtr3d	⊢ ( 𝜑 → ( 𝐴 𝐹 ( 𝐵 𝐹 𝐶 ) ) = ( 𝐶 𝐹 ( 𝐵 𝐹 𝐴 ) ) )