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

Theorem xnegid 10211
Description: Extended real version of negid 8536. (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 10128 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 rexneg 10182 . . . . 5  |-  ( A  e.  RR  ->  -e
A  =  -u A
)
32oveq2d 6074 . . . 4  |-  ( A  e.  RR  ->  ( A +e  -e
A )  =  ( A +e -u A ) )
4 renegcl 8550 . . . . 5  |-  ( A  e.  RR  ->  -u A  e.  RR )
5 rexadd 10204 . . . . 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 8276 . . . . 5  |-  ( A  e.  RR  ->  A  e.  CC )
87negidd 8590 . . . 4  |-  ( A  e.  RR  ->  ( A  +  -u A )  =  0 )
93, 6, 83eqtrd 2271 . . 3  |-  ( A  e.  RR  ->  ( A +e  -e
A )  =  0 )
10 id 19 . . . . 5  |-  ( A  = +oo  ->  A  = +oo )
11 xnegeq 10179 . . . . . 6  |-  ( A  = +oo  ->  -e
A  =  -e +oo )
12 xnegpnf 10180 . . . . . 6  |-  -e +oo  = -oo
1311, 12eqtrdi 2283 . . . . 5  |-  ( A  = +oo  ->  -e
A  = -oo )
1410, 13oveq12d 6076 . . . 4  |-  ( A  = +oo  ->  ( A +e  -e
A )  =  ( +oo +e -oo ) )
15 pnfaddmnf 10202 . . . 4  |-  ( +oo +e -oo )  =  0
1614, 15eqtrdi 2283 . . 3  |-  ( A  = +oo  ->  ( A +e  -e
A )  =  0 )
17 id 19 . . . . 5  |-  ( A  = -oo  ->  A  = -oo )
18 xnegeq 10179 . . . . . 6  |-  ( A  = -oo  ->  -e
A  =  -e -oo )
19 xnegmnf 10181 . . . . . 6  |-  -e -oo  = +oo
2018, 19eqtrdi 2283 . . . . 5  |-  ( A  = -oo  ->  -e
A  = +oo )
2117, 20oveq12d 6076 . . . 4  |-  ( A  = -oo  ->  ( A +e  -e
A )  =  ( -oo +e +oo ) )
22 mnfaddpnf 10203 . . . 4  |-  ( -oo +e +oo )  =  0
2321, 22eqtrdi 2283 . . 3  |-  ( A  = -oo  ->  ( A +e  -e
A )  =  0 )
249, 16, 233jaoi 1340 . 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 1004    = wceq 1398    e. wcel 2205  (class class class)co 6058   RRcr 8142   0cc0 8143    + caddc 8146   +oocpnf 8321   -oocmnf 8322   RR*cxr 8323   -ucneg 8461    -ecxne 10121   +ecxad 10122
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-sub 8462  df-neg 8463  df-xneg 10124  df-xadd 10125
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator