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

Theorem xnegid 9928
Description: Extended real version of negid 8268. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xnegid  |-  ( A  e.  RR*  ->  ( A +e  -e
A )  =  0 )

Proof of Theorem xnegid
StepHypRef Expression
1 elxr 9845 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 rexneg 9899 . . . . 5  |-  ( A  e.  RR  ->  -e
A  =  -u A
)
32oveq2d 5935 . . . 4  |-  ( A  e.  RR  ->  ( A +e  -e
A )  =  ( A +e -u A ) )
4 renegcl 8282 . . . . 5  |-  ( A  e.  RR  ->  -u A  e.  RR )
5 rexadd 9921 . . . . 5  |-  ( ( A  e.  RR  /\  -u A  e.  RR )  ->  ( A +e -u A )  =  ( A  +  -u A ) )
64, 5mpdan 421 . . . 4  |-  ( A  e.  RR  ->  ( A +e -u A
)  =  ( A  +  -u A ) )
7 recn 8007 . . . . 5  |-  ( A  e.  RR  ->  A  e.  CC )
87negidd 8322 . . . 4  |-  ( A  e.  RR  ->  ( A  +  -u A )  =  0 )
93, 6, 83eqtrd 2230 . . 3  |-  ( A  e.  RR  ->  ( A +e  -e
A )  =  0 )
10 id 19 . . . . 5  |-  ( A  = +oo  ->  A  = +oo )
11 xnegeq 9896 . . . . . 6  |-  ( A  = +oo  ->  -e
A  =  -e +oo )
12 xnegpnf 9897 . . . . . 6  |-  -e +oo  = -oo
1311, 12eqtrdi 2242 . . . . 5  |-  ( A  = +oo  ->  -e
A  = -oo )
1410, 13oveq12d 5937 . . . 4  |-  ( A  = +oo  ->  ( A +e  -e
A )  =  ( +oo +e -oo ) )
15 pnfaddmnf 9919 . . . 4  |-  ( +oo +e -oo )  =  0
1614, 15eqtrdi 2242 . . 3  |-  ( A  = +oo  ->  ( A +e  -e
A )  =  0 )
17 id 19 . . . . 5  |-  ( A  = -oo  ->  A  = -oo )
18 xnegeq 9896 . . . . . 6  |-  ( A  = -oo  ->  -e
A  =  -e -oo )
19 xnegmnf 9898 . . . . . 6  |-  -e -oo  = +oo
2018, 19eqtrdi 2242 . . . . 5  |-  ( A  = -oo  ->  -e
A  = +oo )
2117, 20oveq12d 5937 . . . 4  |-  ( A  = -oo  ->  ( A +e  -e
A )  =  ( -oo +e +oo ) )
22 mnfaddpnf 9920 . . . 4  |-  ( -oo +e +oo )  =  0
2321, 22eqtrdi 2242 . . 3  |-  ( A  = -oo  ->  ( A +e  -e
A )  =  0 )
249, 16, 233jaoi 1314 . 2  |-  ( ( A  e.  RR  \/  A  = +oo  \/  A  = -oo )  ->  ( A +e  -e
A )  =  0 )
251, 24sylbi 121 1  |-  ( A  e.  RR*  ->  ( A +e  -e
A )  =  0 )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ w3o 979    = wceq 1364    e. wcel 2164  (class class class)co 5919   RRcr 7873   0cc0 7874    + caddc 7877   +oocpnf 8053   -oocmnf 8054   RR*cxr 8055   -ucneg 8193    -ecxne 9838   +ecxad 9839
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-iota 5216  df-fun 5257  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-pnf 8058  df-mnf 8059  df-xr 8060  df-sub 8194  df-neg 8195  df-xneg 9841  df-xadd 9842
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator