Theorem caov31 6108

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

Hypotheses

Ref	Expression
caov.1	|- A e. _V
caov.2	|- B e. _V
caov.3	|- C e. _V
caov.com	|- ( x F y ) = ( y F x )
caov.ass	|- ( ( x F y ) F z ) = ( x F ( y F z ) )

Assertion

Ref	Expression
caov31	|- ( ( A F B ) F C ) = ( ( C F B ) F A )

Distinct variable groups:   x, y, z, A   x, B, y, z   x, C, y, z   x, F, y, z

Proof of Theorem caov31

Step	Hyp	Ref	Expression
1		caov.1	. . . 4 |- A e. _V
2		caov.3	. . . 4 |- C e. _V
3		caov.2	. . . 4 |- B e. _V
4		caov.ass	. . . 4 |- ( ( x F y ) F z ) = ( x F ( y F z ) )
5	1, 2, 3, 4	caovass 6079	. . 3 |- ( ( A F C ) F B ) = ( A F ( C F B ) )
6		caov.com	. . . 4 |- ( x F y ) = ( y F x )
7	1, 2, 3, 6, 4	caov12 6107	. . 3 |- ( A F ( C F B ) ) = ( C F ( A F B ) )
8	5, 7	eqtri 2214	. 2 |- ( ( A F C ) F B ) = ( C F ( A F B ) )
9	1, 3, 2, 6, 4	caov32 6106	. 2 |- ( ( A F B ) F C ) = ( ( A F C ) F B )
10	2, 1, 3, 6, 4	caov32 6106	. . 3 |- ( ( C F A ) F B ) = ( ( C F B ) F A )
11	2, 1, 3, 4	caovass 6079	. . 3 |- ( ( C F A ) F B ) = ( C F ( A F B ) )
12	10, 11	eqtr3i 2216	. 2 |- ( ( C F B ) F A ) = ( C F ( A F B ) )
13	8, 9, 12	3eqtr4i 2224	1 |- ( ( A F B ) F C ) = ( ( C F B ) F A )

Syntax hints:   = wceq 1364   e. wcel 2164   _Vcvv 2760  (class class class)co 5918

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-iota 5215  df-fv 5262  df-ov 5921

This theorem is referenced by:  caov13  6109