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

Theorem caov12d 6274
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
caov12d  |-  ( ph  ->  ( A F ( B F C ) )  =  ( B F ( A F C ) ) )
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 caov12d
StepHypRef Expression
1 caovd.com . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
2 caovd.1 . . . 4  |-  ( ph  ->  A  e.  S )
3 caovd.2 . . . 4  |-  ( ph  ->  B  e.  S )
41, 2, 3caovcomd 6249 . . 3  |-  ( ph  ->  ( A F B )  =  ( B F A ) )
54oveq1d 6103 . 2  |-  ( ph  ->  ( ( A F B ) F C )  =  ( ( B F A ) F C ) )
6 caovd.ass . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( ( x F y ) F z )  =  ( x F ( y F z ) ) )
7 caovd.3 . . 3  |-  ( ph  ->  C  e.  S )
86, 2, 3, 7caovassd 6252 . 2  |-  ( ph  ->  ( ( A F B ) F C )  =  ( A F ( B F C ) ) )
96, 3, 2, 7caovassd 6252 . 2  |-  ( ph  ->  ( ( B F A ) F C )  =  ( B F ( A F C ) ) )
105, 8, 93eqtr3d 2279 1  |-  ( ph  ->  ( A F ( B F C ) )  =  ( B F ( A F C ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209  (class class class)co 6088
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-iota 5340  df-fv 5388  df-ov 6091
This theorem is used by:  caov4d  6277  caovimo  6286  ltaddnq  7780  ltexnqq  7781  enq0tr  7807  mullocprlem  7943  1idprl  7963  1idpru  7964  cauappcvgprlemdisj  8024  mulcmpblnrlemg  8113  lttrsr  8135  ltsosr  8137  0idsr  8140  1idsr  8141  recexgt0sr  8146  mulgt0sr  8151  axmulass  8246
  Copyright terms: Public domain W3C validator