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

Theorem caov4d 6061
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 ) ) )
caovd.4  |-  ( ph  ->  D  e.  S )
caovd.cl  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  e.  S )
Assertion
Ref Expression
caov4d  |-  ( ph  ->  ( ( A F B ) F ( C F D ) )  =  ( ( A F C ) F ( B F D ) ) )
Distinct variable groups:    x, y, z, A    x, B, y, z    x, C, y, z    x, D, y, z    ph, x, y, z   
x, F, y, z   
x, S, y, z

Proof of Theorem caov4d
StepHypRef Expression
1 caovd.2 . . . 4  |-  ( ph  ->  B  e.  S )
2 caovd.3 . . . 4  |-  ( ph  ->  C  e.  S )
3 caovd.4 . . . 4  |-  ( ph  ->  D  e.  S )
4 caovd.com . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
5 caovd.ass . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( ( x F y ) F z )  =  ( x F ( y F z ) ) )
61, 2, 3, 4, 5caov12d 6058 . . 3  |-  ( ph  ->  ( B F ( C F D ) )  =  ( C F ( B F D ) ) )
76oveq2d 5893 . 2  |-  ( ph  ->  ( A F ( B F ( C F D ) ) )  =  ( A F ( C F ( B F D ) ) ) )
8 caovd.1 . . 3  |-  ( ph  ->  A  e.  S )
9 caovd.cl . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  e.  S )
109, 2, 3caovcld 6030 . . 3  |-  ( ph  ->  ( C F D )  e.  S )
115, 8, 1, 10caovassd 6036 . 2  |-  ( ph  ->  ( ( A F B ) F ( C F D ) )  =  ( A F ( B F ( C F D ) ) ) )
129, 1, 3caovcld 6030 . . 3  |-  ( ph  ->  ( B F D )  e.  S )
135, 8, 2, 12caovassd 6036 . 2  |-  ( ph  ->  ( ( A F C ) F ( B F D ) )  =  ( A F ( C F ( B F D ) ) ) )
147, 11, 133eqtr4d 2220 1  |-  ( ph  ->  ( ( A F B ) F ( C F D ) )  =  ( ( A F C ) F ( B F D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 978    = wceq 1353    e. wcel 2148  (class class class)co 5877
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-iota 5180  df-fv 5226  df-ov 5880
This theorem is referenced by:  caov411d  6062  caov42d  6063  ecopovtrn  6634  ecopovtrng  6637  addcmpblnq  7368  mulcmpblnq  7369  ordpipqqs  7375  distrnqg  7388  ltsonq  7399  ltanqg  7401  ltmnqg  7402  addcmpblnq0  7444  mulcmpblnq0  7445  distrnq0  7460  prarloclemlo  7495  addlocprlemeqgt  7533  addcanprleml  7615  recexprlem1ssl  7634  recexprlem1ssu  7635  mulcmpblnrlemg  7741  distrsrg  7760  ltasrg  7771  mulgt0sr  7779  prsradd  7787  axdistr  7875
  Copyright terms: Public domain W3C validator