Theorem caov32 7616

Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995.)

Hypotheses

Ref	Expression
caov.1	⊢ 𝐴 ∈ V
caov.2	⊢ 𝐵 ∈ V
caov.3	⊢ 𝐶 ∈ V
caov.com	⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
caov.ass	⊢ ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))

Assertion

Ref	Expression
caov32	⊢ ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐴𝐹𝐶)𝐹𝐵)

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

Proof of Theorem caov32

Step	Hyp	Ref	Expression
1		caov.2	. . . 4 ⊢ 𝐵 ∈ V
2		caov.3	. . . 4 ⊢ 𝐶 ∈ V
3		caov.com	. . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
4	1, 2, 3	caovcom 7586	. . 3 ⊢ (𝐵𝐹𝐶) = (𝐶𝐹𝐵)
5	4	oveq2i 7398	. 2 ⊢ (𝐴𝐹(𝐵𝐹𝐶)) = (𝐴𝐹(𝐶𝐹𝐵))
6		caov.1	. . 3 ⊢ 𝐴 ∈ V
7		caov.ass	. . 3 ⊢ ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))
8	6, 1, 2, 7	caovass 7589	. 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))
9	6, 2, 1, 7	caovass 7589	. 2 ⊢ ((𝐴𝐹𝐶)𝐹𝐵) = (𝐴𝐹(𝐶𝐹𝐵))
10	5, 8, 9	3eqtr4i 2762	1 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐴𝐹𝐶)𝐹𝐵)

Syntax hints:   = wceq 1540   ∈ wcel 2109  Vcvv 3447  (class class class)co 7387

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-iota 6464  df-fv 6519  df-ov 7390

This theorem is referenced by:  caov31  7618  addassnq  10911  ltexprlem7  10995  mulcmpblnrlem  11023  recexsrlem  11056  mulgt0sr  11058