Theorem caov13 6864

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
caov13	|- ( 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 caov13

Step	Hyp	Ref	Expression
1		caov.1	. . 3 |- A e. _V
2		caov.2	. . 3 |- B e. _V
3		caov.3	. . 3 |- C e. _V
4		caov.com	. . 3 |- ( x F y ) = ( y F x )
5		caov.ass	. . 3 |- ( ( x F y ) F z ) = ( x F ( y F z ) )
6	1, 2, 3, 4, 5	caov31 6863	. 2 |- ( ( A F B ) F C ) = ( ( C F B ) F A )
7	1, 2, 3, 5	caovass 6834	. 2 |- ( ( A F B ) F C ) = ( A F ( B F C ) )
8	3, 2, 1, 5	caovass 6834	. 2 |- ( ( C F B ) F A ) = ( C F ( B F A ) )
9	6, 7, 8	3eqtr3i 2652	1 |- ( A F ( B F C ) ) = ( C F ( B F A ) )

Syntax hints:   = wceq 1483   e. wcel 1990   _Vcvv 3200  (class class class)co 6650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653

This theorem is referenced by:  ltsonq  9791  mulcmpblnrlem  9891