ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  caov13d Unicode version

Theorem caov13d 5715
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  |-  ( ph  ->  A  e.  S )
caovd.2  |-  ( ph  ->  B  e.  S )
caovd.3  |-  ( ph  ->  C  e.  S )
caovd.com  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
caovd.ass  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( ( x F y ) F z )  =  ( x F ( y F z ) ) )
Assertion
Ref Expression
caov13d  |-  ( ph  ->  ( 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    ph, x, y, z   
x, F, y, z   
x, S, y, z

Proof of Theorem caov13d
StepHypRef Expression
1 caovd.1 . . 3  |-  ( ph  ->  A  e.  S )
2 caovd.2 . . 3  |-  ( ph  ->  B  e.  S )
3 caovd.3 . . 3  |-  ( ph  ->  C  e.  S )
4 caovd.com . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
5 caovd.ass . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( ( x F y ) F z )  =  ( x F ( y F z ) ) )
61, 2, 3, 4, 5caov31d 5714 . 2  |-  ( ph  ->  ( ( A F B ) F C )  =  ( ( C F B ) F A ) )
75, 1, 2, 3caovassd 5691 . 2  |-  ( ph  ->  ( ( A F B ) F C )  =  ( A F ( B F C ) ) )
85, 3, 2, 1caovassd 5691 . 2  |-  ( ph  ->  ( ( C F B ) F A )  =  ( C F ( B F A ) ) )
96, 7, 83eqtr3d 2122 1  |-  ( ph  ->  ( A F ( B F C ) )  =  ( C F ( B F A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    /\ w3a 920    = wceq 1285    e. wcel 1434  (class class class)co 5543
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-v 2604  df-un 2978  df-sn 3412  df-pr 3413  df-op 3415  df-uni 3610  df-br 3794  df-iota 4897  df-fv 4940  df-ov 5546
This theorem is referenced by:  enq0tr  6686  mullocprlem  6822  mulcmpblnrlemg  6979
  Copyright terms: Public domain W3C validator