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

Theorem xaddmnf1 9805
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 7976 . . . 4  |- -oo  e.  RR*
2 xaddval 9802 . . . 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 423 . . 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 274 . 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 3537 . . 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 7975 . . . . . 6  |- -oo  =/= +oo
7 ifnefalse 3537 . . . . . 6  |-  ( -oo  =/= +oo  ->  if ( -oo  = +oo ,  0 , -oo )  = -oo )
86, 7ax-mp 5 . . . . 5  |-  if ( -oo  = +oo , 
0 , -oo )  = -oo
9 ifnefalse 3537 . . . . . . 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 2170 . . . . . . 7  |- -oo  = -oo
1211iftruei 3532 . . . . . 6  |-  if ( -oo  = -oo , -oo ,  ( A  + -oo ) )  = -oo
1310, 12eqtri 2191 . . . . 5  |-  if ( -oo  = +oo , +oo ,  if ( -oo  = -oo , -oo , 
( A  + -oo ) ) )  = -oo
14 ifeq12 3542 . . . . 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 424 . . . 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 9800 . . . . 5  |-  ( A  e.  RR*  -> DECID  A  = -oo )
17 ifiddc 3559 . . . . 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 2215 . . 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 2225 . 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 2203 1  |-  ( ( A  e.  RR*  /\  A  =/= +oo )  ->  ( A +e -oo )  = -oo )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103  DECID wdc 829    = wceq 1348    e. wcel 2141    =/= wne 2340   ifcif 3526  (class class class)co 5853   0cc0 7774    + caddc 7777   +oocpnf 7951   -oocmnf 7952   RR*cxr 7953   +ecxad 9727
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1re 7868  ax-addrcl 7871  ax-rnegex 7883
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-xr 7958  df-xadd 9730
This theorem is referenced by:  xaddnepnf  9815  xaddcom  9818  xnegdi  9825  xleadd1a  9830  xsubge0  9838  xposdif  9839  xlesubadd  9840  xleaddadd  9844  xblss2ps  13198  xblss2  13199
  Copyright terms: Public domain W3C validator