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

Theorem xaddmnf1 10082
Description: Addition of negative infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xaddmnf1  |-  ( ( A  e.  RR*  /\  A  =/= +oo )  ->  ( A +e -oo )  = -oo )

Proof of Theorem xaddmnf1
StepHypRef Expression
1 mnfxr 8235 . . . 4  |- -oo  e.  RR*
2 xaddval 10079 . . . 4  |-  ( ( A  e.  RR*  /\ -oo  e.  RR* )  ->  ( A +e -oo )  =  if ( A  = +oo ,  if ( -oo  = -oo , 
0 , +oo ) ,  if ( A  = -oo ,  if ( -oo  = +oo , 
0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo ) ) ) ) ) )
31, 2mpan2 425 . . 3  |-  ( A  e.  RR*  ->  ( A +e -oo )  =  if ( A  = +oo ,  if ( -oo  = -oo , 
0 , +oo ) ,  if ( A  = -oo ,  if ( -oo  = +oo , 
0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo ) ) ) ) ) )
43adantr 276 . 2  |-  ( ( A  e.  RR*  /\  A  =/= +oo )  ->  ( A +e -oo )  =  if ( A  = +oo ,  if ( -oo  = -oo , 
0 , +oo ) ,  if ( A  = -oo ,  if ( -oo  = +oo , 
0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo ) ) ) ) ) )
5 ifnefalse 3616 . . 3  |-  ( A  =/= +oo  ->  if ( A  = +oo ,  if ( -oo  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( -oo  = +oo , 
0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo ) ) ) ) )  =  if ( A  = -oo ,  if ( -oo  = +oo ,  0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo )
) ) ) )
6 mnfnepnf 8234 . . . . . 6  |- -oo  =/= +oo
7 ifnefalse 3616 . . . . . 6  |-  ( -oo  =/= +oo  ->  if ( -oo  = +oo ,  0 , -oo )  = -oo )
86, 7ax-mp 5 . . . . 5  |-  if ( -oo  = +oo , 
0 , -oo )  = -oo
9 ifnefalse 3616 . . . . . . 7  |-  ( -oo  =/= +oo  ->  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo )
) )  =  if ( -oo  = -oo , -oo ,  ( A  + -oo ) ) )
106, 9ax-mp 5 . . . . . 6  |-  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo , 
( A  + -oo ) ) )  =  if ( -oo  = -oo , -oo ,  ( A  + -oo )
)
11 eqid 2231 . . . . . . 7  |- -oo  = -oo
1211iftruei 3611 . . . . . 6  |-  if ( -oo  = -oo , -oo ,  ( A  + -oo ) )  = -oo
1310, 12eqtri 2252 . . . . 5  |-  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo , 
( A  + -oo ) ) )  = -oo
14 ifeq12 3622 . . . . 5  |-  ( ( if ( -oo  = +oo ,  0 , -oo )  = -oo  /\  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo , 
( A  + -oo ) ) )  = -oo )  ->  if ( A  = -oo ,  if ( -oo  = +oo ,  0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo )
) ) )  =  if ( A  = -oo , -oo , -oo ) )
158, 13, 14mp2an 426 . . . 4  |-  if ( A  = -oo ,  if ( -oo  = +oo ,  0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo )
) ) )  =  if ( A  = -oo , -oo , -oo )
16 xrmnfdc 10077 . . . . 5  |-  ( A  e.  RR*  -> DECID  A  = -oo )
17 ifiddc 3641 . . . . 5  |-  (DECID  A  = -oo  ->  if ( A  = -oo , -oo , -oo )  = -oo )
1816, 17syl 14 . . . 4  |-  ( A  e.  RR*  ->  if ( A  = -oo , -oo , -oo )  = -oo )
1915, 18eqtrid 2276 . . 3  |-  ( A  e.  RR*  ->  if ( A  = -oo ,  if ( -oo  = +oo ,  0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo )
) ) )  = -oo )
205, 19sylan9eqr 2286 . 2  |-  ( ( A  e.  RR*  /\  A  =/= +oo )  ->  if ( A  = +oo ,  if ( -oo  = -oo ,  0 , +oo ) ,  if ( A  = -oo ,  if ( -oo  = +oo , 
0 , -oo ) ,  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo ,  ( A  + -oo ) ) ) ) )  = -oo )
214, 20eqtrd 2264 1  |-  ( ( A  e.  RR*  /\  A  =/= +oo )  ->  ( A +e -oo )  = -oo )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104  DECID wdc 841    = wceq 1397    e. wcel 2202    =/= wne 2402   ifcif 3605  (class class class)co 6017   0cc0 8031    + caddc 8034   +oocpnf 8210   -oocmnf 8211   RR*cxr 8212   +ecxad 10004
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 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128  ax-rnegex 8140
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 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-xadd 10007
This theorem is referenced by:  xaddnepnf  10092  xaddcom  10095  xnegdi  10102  xleadd1a  10107  xsubge0  10115  xposdif  10116  xlesubadd  10117  xleaddadd  10121  xblss2ps  15127  xblss2  15128
  Copyright terms: Public domain W3C validator