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

Theorem xnegneg 10165
Description: Extended real version of negneg 8522. (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 10108 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 rexneg 10162 . . . . 5  |-  ( A  e.  RR  ->  -e
A  =  -u A
)
3 xnegeq 10159 . . . . 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 8533 . . . . 5  |-  ( A  e.  RR  ->  -u A  e.  RR )
6 rexneg 10162 . . . . 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 8259 . . . . 5  |-  ( A  e.  RR  ->  A  e.  CC )
98negnegd 8574 . . . 4  |-  ( A  e.  RR  ->  -u -u A  =  A )
104, 7, 93eqtrd 2269 . . 3  |-  ( A  e.  RR  ->  -e  -e A  =  A )
11 xnegmnf 10161 . . . 4  |-  -e -oo  = +oo
12 xnegeq 10159 . . . . . 6  |-  ( A  = +oo  ->  -e
A  =  -e +oo )
13 xnegpnf 10160 . . . . . 6  |-  -e +oo  = -oo
1412, 13eqtrdi 2281 . . . . 5  |-  ( A  = +oo  ->  -e
A  = -oo )
15 xnegeq 10159 . . . . 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 2291 . . 3  |-  ( A  = +oo  ->  -e  -e A  =  A )
19 xnegeq 10159 . . . . . 6  |-  ( A  = -oo  ->  -e
A  =  -e -oo )
2019, 11eqtrdi 2281 . . . . 5  |-  ( A  = -oo  ->  -e
A  = +oo )
21 xnegeq 10159 . . . . 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 2291 . . 3  |-  ( A  = -oo  ->  -e  -e A  =  A )
2510, 18, 243jaoi 1340 . 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 1004    = wceq 1398    e. wcel 2203   RRcr 8125   +oocpnf 8304   -oocmnf 8305   RR*cxr 8306   -ucneg 8444    -ecxne 10101
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-addcom 8226  ax-addass 8228  ax-distr 8230  ax-i2m1 8231  ax-0id 8234  ax-rnegex 8235  ax-cnre 8237
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-iota 5311  df-fun 5353  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-pnf 8309  df-mnf 8310  df-xr 8311  df-sub 8445  df-neg 8446  df-xneg 10104
This theorem is referenced by:  xneg11  10166  xltneg  10168  xnegdi  10200  xnpcan  10204  xrnegiso  11943  infxrnegsupex  11944  xrnegcon1d  11945  xrminmax  11946  xrmin1inf  11948  xrmin2inf  11949  xrltmininf  11951  xrlemininf  11952  xrminltinf  11953  xrminadd  11956
  Copyright terms: Public domain W3C validator