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

Theorem rexadd 9663
Description: The extended real addition operation when both arguments are real. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
rexadd  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A +e
B )  =  ( A  +  B ) )

Proof of Theorem rexadd
StepHypRef Expression
1 rexr 7833 . . 3  |-  ( A  e.  RR  ->  A  e.  RR* )
2 rexr 7833 . . 3  |-  ( B  e.  RR  ->  B  e.  RR* )
3 xaddval 9656 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A +e B )  =  if ( A  = +oo ,  if ( B  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo , 
( A  +  B
) ) ) ) ) )
41, 2, 3syl2an 287 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A +e
B )  =  if ( A  = +oo ,  if ( B  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) ) ) )
5 renepnf 7835 . . . . 5  |-  ( A  e.  RR  ->  A  =/= +oo )
6 ifnefalse 3488 . . . . 5  |-  ( A  =/= +oo  ->  if ( A  = +oo ,  if ( B  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo , 
( A  +  B
) ) ) ) )  =  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo , 
( A  +  B
) ) ) ) )
75, 6syl 14 . . . 4  |-  ( A  e.  RR  ->  if ( A  = +oo ,  if ( B  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) ) )  =  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) ) )
8 renemnf 7836 . . . . 5  |-  ( A  e.  RR  ->  A  =/= -oo )
9 ifnefalse 3488 . . . . 5  |-  ( A  =/= -oo  ->  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo , 
( A  +  B
) ) ) )  =  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo , 
( A  +  B
) ) ) )
108, 9syl 14 . . . 4  |-  ( A  e.  RR  ->  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) )  =  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) )
117, 10eqtrd 2173 . . 3  |-  ( A  e.  RR  ->  if ( A  = +oo ,  if ( B  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( B  = +oo ,  0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) ) )  =  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) )
12 renepnf 7835 . . . . 5  |-  ( B  e.  RR  ->  B  =/= +oo )
13 ifnefalse 3488 . . . . 5  |-  ( B  =/= +oo  ->  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) )  =  if ( B  = -oo , -oo ,  ( A  +  B ) ) )
1412, 13syl 14 . . . 4  |-  ( B  e.  RR  ->  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) )  =  if ( B  = -oo , -oo ,  ( A  +  B ) ) )
15 renemnf 7836 . . . . 5  |-  ( B  e.  RR  ->  B  =/= -oo )
16 ifnefalse 3488 . . . . 5  |-  ( B  =/= -oo  ->  if ( B  = -oo , -oo ,  ( A  +  B ) )  =  ( A  +  B
) )
1715, 16syl 14 . . . 4  |-  ( B  e.  RR  ->  if ( B  = -oo , -oo ,  ( A  +  B ) )  =  ( A  +  B ) )
1814, 17eqtrd 2173 . . 3  |-  ( B  e.  RR  ->  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) )  =  ( A  +  B ) )
1911, 18sylan9eq 2193 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  if ( A  = +oo ,  if ( B  = -oo , 
0 , +oo ) ,  if ( A  = -oo ,  if ( B  = +oo , 
0 , -oo ) ,  if ( B  = +oo , +oo ,  if ( B  = -oo , -oo ,  ( A  +  B ) ) ) ) )  =  ( A  +  B
) )
204, 19eqtrd 2173 1  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A +e
B )  =  ( A  +  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332    e. wcel 1481    =/= wne 2309   ifcif 3477  (class class class)co 5780   RRcr 7641   0cc0 7642    + caddc 7645   +oocpnf 7819   -oocmnf 7820   RR*cxr 7821   +ecxad 9585
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4052  ax-pow 4104  ax-pr 4137  ax-un 4361  ax-setind 4458  ax-cnex 7733  ax-resscn 7734  ax-1re 7736  ax-addrcl 7739  ax-rnegex 7751
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2913  df-dif 3076  df-un 3078  df-in 3080  df-ss 3087  df-if 3478  df-pw 3515  df-sn 3536  df-pr 3537  df-op 3539  df-uni 3743  df-br 3936  df-opab 3996  df-id 4221  df-xp 4551  df-rel 4552  df-cnv 4553  df-co 4554  df-dm 4555  df-iota 5094  df-fun 5131  df-fv 5137  df-ov 5783  df-oprab 5784  df-mpo 5785  df-pnf 7824  df-mnf 7825  df-xr 7826  df-xadd 9588
This theorem is referenced by:  rexsub  9664  rexaddd  9665  xaddnemnf  9668  xaddnepnf  9669  xnegid  9670  xaddcom  9672  xaddid1  9673  xnn0xadd0  9678  xnegdi  9679  xaddass  9680  xltadd1  9687  isxmet2d  12549  mettri2  12563  bl2in  12604  xmeter  12637
  Copyright terms: Public domain W3C validator