MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ecovcom Unicode version

Theorem ecovcom 6785
Description: Lemma used to transfer a commutative law via an equivalence relation. (Contributed by NM, 29-Aug-1995.) (Revised by David Abernethy, 4-Jun-2013.)
Hypotheses
Ref Expression
ecovcom.1  |-  C  =  ( ( S  X.  S ) /.  .~  )
ecovcom.2  |-  ( ( ( x  e.  S  /\  y  e.  S
)  /\  ( z  e.  S  /\  w  e.  S ) )  -> 
( [ <. x ,  y >. ]  .~  .+ 
[ <. z ,  w >. ]  .~  )  =  [ <. D ,  G >. ]  .~  )
ecovcom.3  |-  ( ( ( z  e.  S  /\  w  e.  S
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( [ <. z ,  w >. ]  .~  .+  [
<. x ,  y >. ]  .~  )  =  [ <. H ,  J >. ]  .~  )
ecovcom.4  |-  D  =  H
ecovcom.5  |-  G  =  J
Assertion
Ref Expression
ecovcom  |-  ( ( A  e.  C  /\  B  e.  C )  ->  ( A  .+  B
)  =  ( B 
.+  A ) )
Distinct variable groups:    x, y,
z, w, A    z, B, w    x,  .+ , y,
z, w    x,  .~ , y, z, w    x, S, y, z, w    z, C, w
Allowed substitution hints:    B( x, y)    C( x, y)    D( x, y, z, w)    G( x, y, z, w)    H( x, y, z, w)    J( x, y, z, w)

Proof of Theorem ecovcom
StepHypRef Expression
1 ecovcom.1 . 2  |-  C  =  ( ( S  X.  S ) /.  .~  )
2 oveq1 5881 . . 3  |-  ( [
<. x ,  y >. ]  .~  =  A  -> 
( [ <. x ,  y >. ]  .~  .+ 
[ <. z ,  w >. ]  .~  )  =  ( A  .+  [ <. z ,  w >. ]  .~  ) )
3 oveq2 5882 . . 3  |-  ( [
<. x ,  y >. ]  .~  =  A  -> 
( [ <. z ,  w >. ]  .~  .+  [
<. x ,  y >. ]  .~  )  =  ( [ <. z ,  w >. ]  .~  .+  A
) )
42, 3eqeq12d 2310 . 2  |-  ( [
<. x ,  y >. ]  .~  =  A  -> 
( ( [ <. x ,  y >. ]  .~  .+ 
[ <. z ,  w >. ]  .~  )  =  ( [ <. z ,  w >. ]  .~  .+  [
<. x ,  y >. ]  .~  )  <->  ( A  .+  [ <. z ,  w >. ]  .~  )  =  ( [ <. z ,  w >. ]  .~  .+  A ) ) )
5 oveq2 5882 . . 3  |-  ( [
<. z ,  w >. ]  .~  =  B  -> 
( A  .+  [ <. z ,  w >. ]  .~  )  =  ( A  .+  B ) )
6 oveq1 5881 . . 3  |-  ( [
<. z ,  w >. ]  .~  =  B  -> 
( [ <. z ,  w >. ]  .~  .+  A )  =  ( B  .+  A ) )
75, 6eqeq12d 2310 . 2  |-  ( [
<. z ,  w >. ]  .~  =  B  -> 
( ( A  .+  [
<. z ,  w >. ]  .~  )  =  ( [ <. z ,  w >. ]  .~  .+  A
)  <->  ( A  .+  B )  =  ( B  .+  A ) ) )
8 ecovcom.4 . . . 4  |-  D  =  H
9 ecovcom.5 . . . 4  |-  G  =  J
10 opeq12 3814 . . . . 5  |-  ( ( D  =  H  /\  G  =  J )  -> 
<. D ,  G >.  = 
<. H ,  J >. )
11 eceq1 6712 . . . . 5  |-  ( <. D ,  G >.  = 
<. H ,  J >.  ->  [ <. D ,  G >. ]  .~  =  [ <. H ,  J >. ]  .~  )
1210, 11syl 15 . . . 4  |-  ( ( D  =  H  /\  G  =  J )  ->  [ <. D ,  G >. ]  .~  =  [ <. H ,  J >. ]  .~  )
138, 9, 12mp2an 653 . . 3  |-  [ <. D ,  G >. ]  .~  =  [ <. H ,  J >. ]  .~
14 ecovcom.2 . . 3  |-  ( ( ( x  e.  S  /\  y  e.  S
)  /\  ( z  e.  S  /\  w  e.  S ) )  -> 
( [ <. x ,  y >. ]  .~  .+ 
[ <. z ,  w >. ]  .~  )  =  [ <. D ,  G >. ]  .~  )
15 ecovcom.3 . . . 4  |-  ( ( ( z  e.  S  /\  w  e.  S
)  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( [ <. z ,  w >. ]  .~  .+  [
<. x ,  y >. ]  .~  )  =  [ <. H ,  J >. ]  .~  )
1615ancoms 439 . . 3  |-  ( ( ( x  e.  S  /\  y  e.  S
)  /\  ( z  e.  S  /\  w  e.  S ) )  -> 
( [ <. z ,  w >. ]  .~  .+  [
<. x ,  y >. ]  .~  )  =  [ <. H ,  J >. ]  .~  )
1713, 14, 163eqtr4a 2354 . 2  |-  ( ( ( x  e.  S  /\  y  e.  S
)  /\  ( z  e.  S  /\  w  e.  S ) )  -> 
( [ <. x ,  y >. ]  .~  .+ 
[ <. z ,  w >. ]  .~  )  =  ( [ <. z ,  w >. ]  .~  .+  [
<. x ,  y >. ]  .~  ) )
181, 4, 7, 172ecoptocl 6765 1  |-  ( ( A  e.  C  /\  B  e.  C )  ->  ( A  .+  B
)  =  ( B 
.+  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1632    e. wcel 1696   <.cop 3656    X. cxp 4703  (class class class)co 5874   [cec 6674   /.cqs 6675
This theorem is referenced by:  addcomsr  8725  mulcomsr  8727  axmulcom  8793
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-xp 4711  df-cnv 4713  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fv 5279  df-ov 5877  df-ec 6678  df-qs 6682
  Copyright terms: Public domain W3C validator