Theorem caov32d 7623

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

Hypotheses

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

Assertion

Ref	Expression
caov32d	⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐴𝐹𝐶)𝐹𝐵))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caov32d

Step	Hyp	Ref	Expression
1		caovd.com	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
2		caovd.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
3		caovd.3	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑆)
4	1, 2, 3	caovcomd 7599	. . 3 ⊢ (𝜑 → (𝐵𝐹𝐶) = (𝐶𝐹𝐵))
5	4	oveq2d 7421	. 2 ⊢ (𝜑 → (𝐴𝐹(𝐵𝐹𝐶)) = (𝐴𝐹(𝐶𝐹𝐵)))
6		caovd.ass	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)))
7		caovd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
8	6, 7, 2, 3	caovassd 7602	. 2 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))
9	6, 7, 3, 2	caovassd 7602	. 2 ⊢ (𝜑 → ((𝐴𝐹𝐶)𝐹𝐵) = (𝐴𝐹(𝐶𝐹𝐵)))
10	5, 8, 9	3eqtr4d 2782	1 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐴𝐹𝐶)𝐹𝐵))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  (class class class)co 7405

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-iota 6492  df-fv 6548  df-ov 7408

This theorem is referenced by:  caov31d  7625