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

Theorem xpncan 10167
Description: Extended real version of pncan 8444. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xpncan  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  (
( A +e
B ) +e  -e B )  =  A )

Proof of Theorem xpncan
StepHypRef Expression
1 rexneg 10126 . . . 4  |-  ( B  e.  RR  ->  -e
B  =  -u B
)
21adantl 277 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  -e
B  =  -u B
)
32oveq2d 6044 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  (
( A +e
B ) +e  -e B )  =  ( ( A +e B ) +e -u B ) )
4 renegcl 8499 . . . . . 6  |-  ( B  e.  RR  ->  -u B  e.  RR )
54ad2antlr 489 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  = -oo )  ->  -u B  e.  RR )
6 rexr 8284 . . . . . 6  |-  ( -u B  e.  RR  ->  -u B  e.  RR* )
7 renepnf 8286 . . . . . 6  |-  ( -u B  e.  RR  ->  -u B  =/= +oo )
8 xaddmnf2 10145 . . . . . 6  |-  ( (
-u B  e.  RR*  /\  -u B  =/= +oo )  ->  ( -oo +e -u B )  = -oo )
96, 7, 8syl2anc 411 . . . . 5  |-  ( -u B  e.  RR  ->  ( -oo +e -u B )  = -oo )
105, 9syl 14 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  = -oo )  ->  ( -oo +e -u B )  = -oo )
11 oveq1 6035 . . . . . 6  |-  ( A  = -oo  ->  ( A +e B )  =  ( -oo +e B ) )
12 rexr 8284 . . . . . . . 8  |-  ( B  e.  RR  ->  B  e.  RR* )
13 renepnf 8286 . . . . . . . 8  |-  ( B  e.  RR  ->  B  =/= +oo )
14 xaddmnf2 10145 . . . . . . . 8  |-  ( ( B  e.  RR*  /\  B  =/= +oo )  ->  ( -oo +e B )  = -oo )
1512, 13, 14syl2anc 411 . . . . . . 7  |-  ( B  e.  RR  ->  ( -oo +e B )  = -oo )
1615adantl 277 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  ( -oo +e B )  = -oo )
1711, 16sylan9eqr 2286 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  = -oo )  ->  ( A +e B )  = -oo )
1817oveq1d 6043 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  = -oo )  ->  ( ( A +e B ) +e -u B
)  =  ( -oo +e -u B
) )
19 simpr 110 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  = -oo )  ->  A  = -oo )
2010, 18, 193eqtr4d 2274 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  = -oo )  ->  ( ( A +e B ) +e -u B
)  =  A )
21 simpll 527 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  A  e.  RR* )
22 simpr 110 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  A  =/= -oo )
2312ad2antlr 489 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  B  e.  RR* )
24 renemnf 8287 . . . . . 6  |-  ( B  e.  RR  ->  B  =/= -oo )
2524ad2antlr 489 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  B  =/= -oo )
264ad2antlr 489 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  -u B  e.  RR )
2726, 6syl 14 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  -u B  e.  RR* )
28 renemnf 8287 . . . . . 6  |-  ( -u B  e.  RR  ->  -u B  =/= -oo )
2926, 28syl 14 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  -u B  =/= -oo )
30 xaddass 10165 . . . . 5  |-  ( ( ( A  e.  RR*  /\  A  =/= -oo )  /\  ( B  e.  RR*  /\  B  =/= -oo )  /\  ( -u B  e. 
RR*  /\  -u B  =/= -oo ) )  ->  (
( A +e
B ) +e -u B )  =  ( A +e ( B +e -u B ) ) )
3121, 22, 23, 25, 27, 29, 30syl222anc 1290 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( ( A +e B ) +e -u B
)  =  ( A +e ( B +e -u B
) ) )
32 simplr 529 . . . . . . . 8  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  B  e.  RR )
3332, 26rexaddd 10150 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( B +e -u B )  =  ( B  +  -u B ) )
3432recnd 8267 . . . . . . . 8  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  B  e.  CC )
3534negidd 8539 . . . . . . 7  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( B  +  -u B )  =  0 )
3633, 35eqtrd 2264 . . . . . 6  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( B +e -u B )  =  0 )
3736oveq2d 6044 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( A +e ( B +e -u B ) )  =  ( A +e 0 ) )
38 xaddid1 10158 . . . . . 6  |-  ( A  e.  RR*  ->  ( A +e 0 )  =  A )
3938ad2antrr 488 . . . . 5  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( A +e 0 )  =  A )
4037, 39eqtrd 2264 . . . 4  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( A +e ( B +e -u B ) )  =  A )
4131, 40eqtrd 2264 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR )  /\  A  =/= -oo )  ->  ( ( A +e B ) +e -u B
)  =  A )
42 xrmnfdc 10139 . . . . . 6  |-  ( A  e.  RR*  -> DECID  A  = -oo )
43 exmiddc 844 . . . . . 6  |-  (DECID  A  = -oo  ->  ( A  = -oo  \/  -.  A  = -oo ) )
4442, 43syl 14 . . . . 5  |-  ( A  e.  RR*  ->  ( A  = -oo  \/  -.  A  = -oo )
)
45 df-ne 2404 . . . . . 6  |-  ( A  =/= -oo  <->  -.  A  = -oo )
4645orbi2i 770 . . . . 5  |-  ( ( A  = -oo  \/  A  =/= -oo )  <->  ( A  = -oo  \/  -.  A  = -oo ) )
4744, 46sylibr 134 . . . 4  |-  ( A  e.  RR*  ->  ( A  = -oo  \/  A  =/= -oo ) )
4847adantr 276 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  ( A  = -oo  \/  A  =/= -oo ) )
4920, 41, 48mpjaodan 806 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  (
( A +e
B ) +e -u B )  =  A )
503, 49eqtrd 2264 1  |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  (
( A +e
B ) +e  -e B )  =  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716  DECID wdc 842    = wceq 1398    e. wcel 2202    =/= wne 2403  (class class class)co 6028   RRcr 8091   0cc0 8092    + caddc 8095   +oocpnf 8270   -oocmnf 8271   RR*cxr 8272   -ucneg 8410    -ecxne 10065   +ecxad 10066
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-pnf 8275  df-mnf 8276  df-xr 8277  df-sub 8411  df-neg 8412  df-xneg 10068  df-xadd 10069
This theorem is referenced by:  xnpcan  10168  xleadd1  10171  xrmaxaddlem  11900
  Copyright terms: Public domain W3C validator