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

Theorem caov4d 6154
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 6151 . . 3  |-  ( ph  ->  ( B F ( C F D ) )  =  ( C F ( B F D ) ) )
76oveq2d 5983 . 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 6123 . . 3  |-  ( ph  ->  ( C F D )  e.  S )
115, 8, 1, 10caovassd 6129 . 2  |-  ( ph  ->  ( ( A F B ) F ( C F D ) )  =  ( A F ( B F ( C F D ) ) ) )
129, 1, 3caovcld 6123 . . 3  |-  ( ph  ->  ( B F D )  e.  S )
135, 8, 2, 12caovassd 6129 . 2  |-  ( ph  ->  ( ( A F C ) F ( B F D ) )  =  ( A F ( C F ( B F D ) ) ) )
147, 11, 133eqtr4d 2250 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 981    = wceq 1373    e. wcel 2178  (class class class)co 5967
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-un 3178  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-iota 5251  df-fv 5298  df-ov 5970
This theorem is referenced by:  caov411d  6155  caov42d  6156  ecopovtrn  6742  ecopovtrng  6745  addcmpblnq  7515  mulcmpblnq  7516  ordpipqqs  7522  distrnqg  7535  ltsonq  7546  ltanqg  7548  ltmnqg  7549  addcmpblnq0  7591  mulcmpblnq0  7592  distrnq0  7607  prarloclemlo  7642  addlocprlemeqgt  7680  addcanprleml  7762  recexprlem1ssl  7781  recexprlem1ssu  7782  mulcmpblnrlemg  7888  distrsrg  7907  ltasrg  7918  mulgt0sr  7926  prsradd  7934  axdistr  8022
  Copyright terms: Public domain W3C validator