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

Theorem mnfaddpnf 10086
Description: Addition of negative and positive infinity. This is often taken to be a "null" value or out of the domain, but we define it (somewhat arbitrarily) to be zero so that the resulting function is total, which simplifies proofs. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
mnfaddpnf  |-  ( -oo +e +oo )  =  0

Proof of Theorem mnfaddpnf
StepHypRef Expression
1 mnfxr 8236 . . 3  |- -oo  e.  RR*
2 pnfxr 8232 . . 3  |- +oo  e.  RR*
3 xaddval 10080 . . 3  |-  ( ( -oo  e.  RR*  /\ +oo  e.  RR* )  ->  ( -oo +e +oo )  =  if ( -oo  = +oo ,  if ( +oo  = -oo ,  0 , +oo ) ,  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo )
) ) ) ) )
41, 2, 3mp2an 426 . 2  |-  ( -oo +e +oo )  =  if ( -oo  = +oo ,  if ( +oo  = -oo ,  0 , +oo ) ,  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo )
) ) ) )
5 mnfnepnf 8235 . . . 4  |- -oo  =/= +oo
6 ifnefalse 3616 . . . 4  |-  ( -oo  =/= +oo  ->  if ( -oo  = +oo ,  if ( +oo  = -oo , 
0 , +oo ) ,  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo , 
( -oo  + +oo ) ) ) ) )  =  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo )
) ) ) )
75, 6ax-mp 5 . . 3  |-  if ( -oo  = +oo ,  if ( +oo  = -oo ,  0 , +oo ) ,  if ( -oo  = -oo ,  if ( +oo  = +oo , 
0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo ) ) ) ) )  =  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo )
) ) )
8 eqid 2231 . . . . 5  |- -oo  = -oo
98iftruei 3611 . . . 4  |-  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo )
) ) )  =  if ( +oo  = +oo ,  0 , -oo )
10 eqid 2231 . . . . 5  |- +oo  = +oo
1110iftruei 3611 . . . 4  |-  if ( +oo  = +oo , 
0 , -oo )  =  0
129, 11eqtri 2252 . . 3  |-  if ( -oo  = -oo ,  if ( +oo  = +oo ,  0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo )
) ) )  =  0
137, 12eqtri 2252 . 2  |-  if ( -oo  = +oo ,  if ( +oo  = -oo ,  0 , +oo ) ,  if ( -oo  = -oo ,  if ( +oo  = +oo , 
0 , -oo ) ,  if ( +oo  = +oo , +oo ,  if ( +oo  = -oo , -oo ,  ( -oo  + +oo ) ) ) ) )  =  0
144, 13eqtri 2252 1  |-  ( -oo +e +oo )  =  0
Colors of variables: wff set class
Syntax hints:    = wceq 1397    e. wcel 2202    =/= wne 2402   ifcif 3605  (class class class)co 6018   0cc0 8032    + caddc 8035   +oocpnf 8211   -oocmnf 8212   RR*cxr 8213   +ecxad 10005
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-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129  ax-rnegex 8141
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-xr 8218  df-xadd 10008
This theorem is referenced by:  xnegid  10094  xaddcom  10096  xnegdi  10103  xsubge0  10116  xposdif  10117  xrmaxadd  11839
  Copyright terms: Public domain W3C validator