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

Theorem xaddmnf1 10073
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 8226 . . . 4  |- -oo  e.  RR*
2 xaddval 10070 . . . 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 3614 . . 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 8225 . . . . . 6  |- -oo  =/= +oo
7 ifnefalse 3614 . . . . . 6  |-  ( -oo  =/= +oo  ->  if ( -oo  = +oo ,  0 , -oo )  = -oo )
86, 7ax-mp 5 . . . . 5  |-  if ( -oo  = +oo , 
0 , -oo )  = -oo
9 ifnefalse 3614 . . . . . . 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 2229 . . . . . . 7  |- -oo  = -oo
1211iftruei 3609 . . . . . 6  |-  if ( -oo  = -oo , -oo ,  ( A  + -oo ) )  = -oo
1310, 12eqtri 2250 . . . . 5  |-  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo , 
( A  + -oo ) ) )  = -oo
14 ifeq12 3620 . . . . 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 10068 . . . . 5  |-  ( A  e.  RR*  -> DECID  A  = -oo )
17 ifiddc 3639 . . . . 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 2274 . . 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 2284 . 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 2262 1  |-  ( ( A  e.  RR*  /\  A  =/= +oo )  ->  ( A +e -oo )  = -oo )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104  DECID wdc 839    = wceq 1395    e. wcel 2200    =/= wne 2400   ifcif 3603  (class class class)co 6013   0cc0 8022    + caddc 8025   +oocpnf 8201   -oocmnf 8202   RR*cxr 8203   +ecxad 9995
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119  ax-rnegex 8131
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-xadd 9998
This theorem is referenced by:  xaddnepnf  10083  xaddcom  10086  xnegdi  10093  xleadd1a  10098  xsubge0  10106  xposdif  10107  xlesubadd  10108  xleaddadd  10112  xblss2ps  15118  xblss2  15119
  Copyright terms: Public domain W3C validator