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

Theorem xnegid 10055
Description: Extended real version of negid 8393. (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 9972 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 rexneg 10026 . . . . 5  |-  ( A  e.  RR  ->  -e
A  =  -u A
)
32oveq2d 6017 . . . 4  |-  ( A  e.  RR  ->  ( A +e  -e
A )  =  ( A +e -u A ) )
4 renegcl 8407 . . . . 5  |-  ( A  e.  RR  ->  -u A  e.  RR )
5 rexadd 10048 . . . . 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 8132 . . . . 5  |-  ( A  e.  RR  ->  A  e.  CC )
87negidd 8447 . . . 4  |-  ( A  e.  RR  ->  ( A  +  -u A )  =  0 )
93, 6, 83eqtrd 2266 . . 3  |-  ( A  e.  RR  ->  ( A +e  -e
A )  =  0 )
10 id 19 . . . . 5  |-  ( A  = +oo  ->  A  = +oo )
11 xnegeq 10023 . . . . . 6  |-  ( A  = +oo  ->  -e
A  =  -e +oo )
12 xnegpnf 10024 . . . . . 6  |-  -e +oo  = -oo
1311, 12eqtrdi 2278 . . . . 5  |-  ( A  = +oo  ->  -e
A  = -oo )
1410, 13oveq12d 6019 . . . 4  |-  ( A  = +oo  ->  ( A +e  -e
A )  =  ( +oo +e -oo ) )
15 pnfaddmnf 10046 . . . 4  |-  ( +oo +e -oo )  =  0
1614, 15eqtrdi 2278 . . 3  |-  ( A  = +oo  ->  ( A +e  -e
A )  =  0 )
17 id 19 . . . . 5  |-  ( A  = -oo  ->  A  = -oo )
18 xnegeq 10023 . . . . . 6  |-  ( A  = -oo  ->  -e
A  =  -e -oo )
19 xnegmnf 10025 . . . . . 6  |-  -e -oo  = +oo
2018, 19eqtrdi 2278 . . . . 5  |-  ( A  = -oo  ->  -e
A  = +oo )
2117, 20oveq12d 6019 . . . 4  |-  ( A  = -oo  ->  ( A +e  -e
A )  =  ( -oo +e +oo ) )
22 mnfaddpnf 10047 . . . 4  |-  ( -oo +e +oo )  =  0
2321, 22eqtrdi 2278 . . 3  |-  ( A  = -oo  ->  ( A +e  -e
A )  =  0 )
249, 16, 233jaoi 1337 . 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 1001    = wceq 1395    e. wcel 2200  (class class class)co 6001   RRcr 7998   0cc0 7999    + caddc 8002   +oocpnf 8178   -oocmnf 8179   RR*cxr 8180   -ucneg 8318    -ecxne 9965   +ecxad 9966
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 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110
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-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-xr 8185  df-sub 8319  df-neg 8320  df-xneg 9968  df-xadd 9969
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator