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

Theorem addsrpr 9345
Description: Addition of signed reals in terms of positive reals. (Contributed by NM, 3-Sep-1995.) (Revised by Mario Carneiro, 12-Aug-2015.) (New usage is discouraged.)
Assertion
Ref Expression
addsrpr  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( [ <. A ,  B >. ]  ~R  +R  [ <. C ,  D >. ]  ~R  )  =  [ <. ( A  +P.  C ) ,  ( B  +P.  D
) >. ]  ~R  )

Proof of Theorem addsrpr
Dummy variables  x  y  z  w  v  u  t  s  f 
g  h  a  b  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 4656 . 2  |-  <. ( A  +P.  C ) ,  ( B  +P.  D
) >.  e.  _V
2 opex 4656 . 2  |-  <. (
a  +P.  g ) ,  ( b  +P.  h ) >.  e.  _V
3 opex 4656 . 2  |-  <. (
c  +P.  t ) ,  ( d  +P.  s ) >.  e.  _V
4 enrex 9340 . 2  |-  ~R  e.  _V
5 enrer 9338 . 2  |-  ~R  Er  ( P.  X.  P. )
6 df-enr 9329 . 2  |-  ~R  =  { <. x ,  y
>.  |  ( (
x  e.  ( P. 
X.  P. )  /\  y  e.  ( P.  X.  P. ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ( z  +P.  u
)  =  ( w  +P.  v ) ) ) }
7 oveq12 6201 . . . 4  |-  ( ( z  =  a  /\  u  =  d )  ->  ( z  +P.  u
)  =  ( a  +P.  d ) )
8 oveq12 6201 . . . 4  |-  ( ( w  =  b  /\  v  =  c )  ->  ( w  +P.  v
)  =  ( b  +P.  c ) )
97, 8eqeqan12d 2474 . . 3  |-  ( ( ( z  =  a  /\  u  =  d )  /\  ( w  =  b  /\  v  =  c ) )  ->  ( ( z  +P.  u )  =  ( w  +P.  v
)  <->  ( a  +P.  d )  =  ( b  +P.  c ) ) )
109an42s 823 . 2  |-  ( ( ( z  =  a  /\  w  =  b )  /\  ( v  =  c  /\  u  =  d ) )  ->  ( ( z  +P.  u )  =  ( w  +P.  v
)  <->  ( a  +P.  d )  =  ( b  +P.  c ) ) )
11 oveq12 6201 . . . 4  |-  ( ( z  =  g  /\  u  =  s )  ->  ( z  +P.  u
)  =  ( g  +P.  s ) )
12 oveq12 6201 . . . 4  |-  ( ( w  =  h  /\  v  =  t )  ->  ( w  +P.  v
)  =  ( h  +P.  t ) )
1311, 12eqeqan12d 2474 . . 3  |-  ( ( ( z  =  g  /\  u  =  s )  /\  ( w  =  h  /\  v  =  t ) )  ->  ( ( z  +P.  u )  =  ( w  +P.  v
)  <->  ( g  +P.  s )  =  ( h  +P.  t ) ) )
1413an42s 823 . 2  |-  ( ( ( z  =  g  /\  w  =  h )  /\  ( v  =  t  /\  u  =  s ) )  ->  ( ( z  +P.  u )  =  ( w  +P.  v
)  <->  ( g  +P.  s )  =  ( h  +P.  t ) ) )
15 df-plpr 9327 . 2  |-  +pR  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( P.  X.  P. )  /\  y  e.  ( P.  X.  P. )
)  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( w  +P.  u ) ,  ( v  +P.  f ) >. )
) }
16 oveq12 6201 . . . 4  |-  ( ( w  =  a  /\  u  =  g )  ->  ( w  +P.  u
)  =  ( a  +P.  g ) )
17 oveq12 6201 . . . 4  |-  ( ( v  =  b  /\  f  =  h )  ->  ( v  +P.  f
)  =  ( b  +P.  h ) )
18 opeq12 4161 . . . 4  |-  ( ( ( w  +P.  u
)  =  ( a  +P.  g )  /\  ( v  +P.  f
)  =  ( b  +P.  h ) )  ->  <. ( w  +P.  u ) ,  ( v  +P.  f )
>.  =  <. ( a  +P.  g ) ,  ( b  +P.  h
) >. )
1916, 17, 18syl2an 477 . . 3  |-  ( ( ( w  =  a  /\  u  =  g )  /\  ( v  =  b  /\  f  =  h ) )  ->  <. ( w  +P.  u
) ,  ( v  +P.  f ) >.  =  <. ( a  +P.  g ) ,  ( b  +P.  h )
>. )
2019an4s 822 . 2  |-  ( ( ( w  =  a  /\  v  =  b )  /\  ( u  =  g  /\  f  =  h ) )  ->  <. ( w  +P.  u
) ,  ( v  +P.  f ) >.  =  <. ( a  +P.  g ) ,  ( b  +P.  h )
>. )
21 oveq12 6201 . . . 4  |-  ( ( w  =  c  /\  u  =  t )  ->  ( w  +P.  u
)  =  ( c  +P.  t ) )
22 oveq12 6201 . . . 4  |-  ( ( v  =  d  /\  f  =  s )  ->  ( v  +P.  f
)  =  ( d  +P.  s ) )
23 opeq12 4161 . . . 4  |-  ( ( ( w  +P.  u
)  =  ( c  +P.  t )  /\  ( v  +P.  f
)  =  ( d  +P.  s ) )  ->  <. ( w  +P.  u ) ,  ( v  +P.  f )
>.  =  <. ( c  +P.  t ) ,  ( d  +P.  s
) >. )
2421, 22, 23syl2an 477 . . 3  |-  ( ( ( w  =  c  /\  u  =  t )  /\  ( v  =  d  /\  f  =  s ) )  ->  <. ( w  +P.  u ) ,  ( v  +P.  f )
>.  =  <. ( c  +P.  t ) ,  ( d  +P.  s
) >. )
2524an4s 822 . 2  |-  ( ( ( w  =  c  /\  v  =  d )  /\  ( u  =  t  /\  f  =  s ) )  ->  <. ( w  +P.  u ) ,  ( v  +P.  f )
>.  =  <. ( c  +P.  t ) ,  ( d  +P.  s
) >. )
26 oveq12 6201 . . . 4  |-  ( ( w  =  A  /\  u  =  C )  ->  ( w  +P.  u
)  =  ( A  +P.  C ) )
27 oveq12 6201 . . . 4  |-  ( ( v  =  B  /\  f  =  D )  ->  ( v  +P.  f
)  =  ( B  +P.  D ) )
28 opeq12 4161 . . . 4  |-  ( ( ( w  +P.  u
)  =  ( A  +P.  C )  /\  ( v  +P.  f
)  =  ( B  +P.  D ) )  ->  <. ( w  +P.  u ) ,  ( v  +P.  f )
>.  =  <. ( A  +P.  C ) ,  ( B  +P.  D
) >. )
2926, 27, 28syl2an 477 . . 3  |-  ( ( ( w  =  A  /\  u  =  C )  /\  ( v  =  B  /\  f  =  D ) )  ->  <. ( w  +P.  u
) ,  ( v  +P.  f ) >.  =  <. ( A  +P.  C ) ,  ( B  +P.  D ) >.
)
3029an4s 822 . 2  |-  ( ( ( w  =  A  /\  v  =  B )  /\  ( u  =  C  /\  f  =  D ) )  ->  <. ( w  +P.  u
) ,  ( v  +P.  f ) >.  =  <. ( A  +P.  C ) ,  ( B  +P.  D ) >.
)
31 df-plr 9331 . 2  |-  +R  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e. 
R.  /\  y  e.  R. )  /\  E. a E. b E. c E. d ( ( x  =  [ <. a ,  b >. ]  ~R  /\  y  =  [ <. c ,  d >. ]  ~R  )  /\  z  =  [
( <. a ,  b
>.  +pR  <. c ,  d
>. ) ]  ~R  )
) }
32 df-nr 9330 . 2  |-  R.  =  ( ( P.  X.  P. ) /.  ~R  )
33 addcmpblnr 9342 . 2  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  (
c  e.  P.  /\  d  e.  P. )
)  /\  ( (
g  e.  P.  /\  h  e.  P. )  /\  ( t  e.  P.  /\  s  e.  P. )
) )  ->  (
( ( a  +P.  d )  =  ( b  +P.  c )  /\  ( g  +P.  s )  =  ( h  +P.  t ) )  ->  <. ( a  +P.  g ) ,  ( b  +P.  h
) >.  ~R  <. ( c  +P.  t ) ,  ( d  +P.  s
) >. ) )
341, 2, 3, 4, 5, 6, 10, 14, 15, 20, 25, 30, 31, 32, 33ovec 7312 1  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( [ <. A ,  B >. ]  ~R  +R  [ <. C ,  D >. ]  ~R  )  =  [ <. ( A  +P.  C ) ,  ( B  +P.  D
) >. ]  ~R  )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1370    e. wcel 1758   <.cop 3983  (class class class)co 6192   [cec 7201   P.cnp 9129    +P. cpp 9131    +pR cplpr 9134    ~R cer 9136   R.cnr 9137    +R cplr 9141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952  ax-ext 2430  ax-sep 4513  ax-nul 4521  ax-pow 4570  ax-pr 4631  ax-un 6474  ax-inf2 7950
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-ral 2800  df-rex 2801  df-reu 2802  df-rmo 2803  df-rab 2804  df-v 3072  df-sbc 3287  df-csb 3389  df-dif 3431  df-un 3433  df-in 3435  df-ss 3442  df-pss 3444  df-nul 3738  df-if 3892  df-pw 3962  df-sn 3978  df-pr 3980  df-tp 3982  df-op 3984  df-uni 4192  df-int 4229  df-iun 4273  df-br 4393  df-opab 4451  df-mpt 4452  df-tr 4486  df-eprel 4732  df-id 4736  df-po 4741  df-so 4742  df-fr 4779  df-we 4781  df-ord 4822  df-on 4823  df-lim 4824  df-suc 4825  df-xp 4946  df-rel 4947  df-cnv 4948  df-co 4949  df-dm 4950  df-rn 4951  df-res 4952  df-ima 4953  df-iota 5481  df-fun 5520  df-fn 5521  df-f 5522  df-f1 5523  df-fo 5524  df-f1o 5525  df-fv 5526  df-ov 6195  df-oprab 6196  df-mpt2 6197  df-om 6579  df-1st 6679  df-2nd 6680  df-recs 6934  df-rdg 6968  df-1o 7022  df-oadd 7026  df-omul 7027  df-er 7203  df-ec 7205  df-qs 7209  df-ni 9144  df-pli 9145  df-mi 9146  df-lti 9147  df-plpq 9180  df-mpq 9181  df-ltpq 9182  df-enq 9183  df-nq 9184  df-erq 9185  df-plq 9186  df-mq 9187  df-1nq 9188  df-rq 9189  df-ltnq 9190  df-np 9253  df-plp 9255  df-ltp 9257  df-plpr 9327  df-enr 9329  df-nr 9330  df-plr 9331
This theorem is referenced by:  addclsr  9353  addcomsr  9357  addasssr  9358  distrsr  9361  m1p1sr  9362  0idsr  9367  ltasr  9370
  Copyright terms: Public domain W3C validator