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

Theorem xnegneg 10067
Description: Extended real version of negneg 8428. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xnegneg  |-  ( A  e.  RR*  ->  -e  -e A  =  A )

Proof of Theorem xnegneg
StepHypRef Expression
1 elxr 10010 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 rexneg 10064 . . . . 5  |-  ( A  e.  RR  ->  -e
A  =  -u A
)
3 xnegeq 10061 . . . . 5  |-  (  -e A  =  -u A  -> 
-e  -e
A  =  -e -u A )
42, 3syl 14 . . . 4  |-  ( A  e.  RR  ->  -e  -e A  =  -e -u A )
5 renegcl 8439 . . . . 5  |-  ( A  e.  RR  ->  -u A  e.  RR )
6 rexneg 10064 . . . . 5  |-  ( -u A  e.  RR  ->  -e -u A  =  -u -u A )
75, 6syl 14 . . . 4  |-  ( A  e.  RR  ->  -e -u A  =  -u -u A
)
8 recn 8164 . . . . 5  |-  ( A  e.  RR  ->  A  e.  CC )
98negnegd 8480 . . . 4  |-  ( A  e.  RR  ->  -u -u A  =  A )
104, 7, 93eqtrd 2268 . . 3  |-  ( A  e.  RR  ->  -e  -e A  =  A )
11 xnegmnf 10063 . . . 4  |-  -e -oo  = +oo
12 xnegeq 10061 . . . . . 6  |-  ( A  = +oo  ->  -e
A  =  -e +oo )
13 xnegpnf 10062 . . . . . 6  |-  -e +oo  = -oo
1412, 13eqtrdi 2280 . . . . 5  |-  ( A  = +oo  ->  -e
A  = -oo )
15 xnegeq 10061 . . . . 5  |-  (  -e A  = -oo  -> 
-e  -e
A  =  -e -oo )
1614, 15syl 14 . . . 4  |-  ( A  = +oo  ->  -e  -e A  =  -e -oo )
17 id 19 . . . 4  |-  ( A  = +oo  ->  A  = +oo )
1811, 16, 173eqtr4a 2290 . . 3  |-  ( A  = +oo  ->  -e  -e A  =  A )
19 xnegeq 10061 . . . . . 6  |-  ( A  = -oo  ->  -e
A  =  -e -oo )
2019, 11eqtrdi 2280 . . . . 5  |-  ( A  = -oo  ->  -e
A  = +oo )
21 xnegeq 10061 . . . . 5  |-  (  -e A  = +oo  -> 
-e  -e
A  =  -e +oo )
2220, 21syl 14 . . . 4  |-  ( A  = -oo  ->  -e  -e A  =  -e +oo )
23 id 19 . . . 4  |-  ( A  = -oo  ->  A  = -oo )
2413, 22, 233eqtr4a 2290 . . 3  |-  ( A  = -oo  ->  -e  -e A  =  A )
2510, 18, 243jaoi 1339 . 2  |-  ( ( A  e.  RR  \/  A  = +oo  \/  A  = -oo )  ->  -e  -e A  =  A )
261, 25sylbi 121 1  |-  ( A  e.  RR*  ->  -e  -e A  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ w3o 1003    = wceq 1397    e. wcel 2202   RRcr 8030   +oocpnf 8210   -oocmnf 8211   RR*cxr 8212   -ucneg 8350    -ecxne 10003
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-sub 8351  df-neg 8352  df-xneg 10006
This theorem is referenced by:  xneg11  10068  xltneg  10070  xnegdi  10102  xnpcan  10106  xrnegiso  11822  infxrnegsupex  11823  xrnegcon1d  11824  xrminmax  11825  xrmin1inf  11827  xrmin2inf  11828  xrltmininf  11830  xrlemininf  11831  xrminltinf  11832  xrminadd  11835
  Copyright terms: Public domain W3C validator