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

Theorem xnn0xadd0 10269
Description: The sum of two extended nonnegative integers is  0 iff each of the two extended nonnegative integers is 
0. (Contributed by AV, 14-Dec-2020.)
Assertion
Ref Expression
xnn0xadd0  |-  ( ( A  e. NN0*  /\  B  e. NN0* )  ->  ( ( A +e B )  =  0  <->  ( A  =  0  /\  B  =  0 ) ) )

Proof of Theorem xnn0xadd0
StepHypRef Expression
1 elxnn0 9632 . . . 4  |-  ( A  e. NN0* 
<->  ( A  e.  NN0  \/  A  = +oo )
)
2 elxnn0 9632 . . . . . . 7  |-  ( B  e. NN0* 
<->  ( B  e.  NN0  \/  B  = +oo )
)
3 nn0re 9572 . . . . . . . . . . . . 13  |-  ( A  e.  NN0  ->  A  e.  RR )
4 nn0re 9572 . . . . . . . . . . . . 13  |-  ( B  e.  NN0  ->  B  e.  RR )
5 rexadd 10254 . . . . . . . . . . . . 13  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A +e
B )  =  ( A  +  B ) )
63, 4, 5syl2an 289 . . . . . . . . . . . 12  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( A +e
B )  =  ( A  +  B ) )
76eqeq1d 2247 . . . . . . . . . . 11  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( ( A +e B )  =  0  <->  ( A  +  B )  =  0 ) )
8 nn0ge0 9588 . . . . . . . . . . . . 13  |-  ( A  e.  NN0  ->  0  <_  A )
93, 8jca 306 . . . . . . . . . . . 12  |-  ( A  e.  NN0  ->  ( A  e.  RR  /\  0  <_  A ) )
10 nn0ge0 9588 . . . . . . . . . . . . 13  |-  ( B  e.  NN0  ->  0  <_  B )
114, 10jca 306 . . . . . . . . . . . 12  |-  ( B  e.  NN0  ->  ( B  e.  RR  /\  0  <_  B ) )
12 add20 8802 . . . . . . . . . . . 12  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  +  B )  =  0  <->  ( A  =  0  /\  B  =  0 ) ) )
139, 11, 12syl2an 289 . . . . . . . . . . 11  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( ( A  +  B )  =  0  <-> 
( A  =  0  /\  B  =  0 ) ) )
147, 13bitrd 188 . . . . . . . . . 10  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( ( A +e B )  =  0  <->  ( A  =  0  /\  B  =  0 ) ) )
1514biimpd 144 . . . . . . . . 9  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) )
1615expcom 116 . . . . . . . 8  |-  ( B  e.  NN0  ->  ( A  e.  NN0  ->  ( ( A +e B )  =  0  -> 
( A  =  0  /\  B  =  0 ) ) ) )
17 oveq2 6093 . . . . . . . . . . . . 13  |-  ( B  = +oo  ->  ( A +e B )  =  ( A +e +oo ) )
1817eqeq1d 2247 . . . . . . . . . . . 12  |-  ( B  = +oo  ->  (
( A +e
B )  =  0  <-> 
( A +e +oo )  =  0
) )
1918adantr 276 . . . . . . . . . . 11  |-  ( ( B  = +oo  /\  A  e.  NN0 )  -> 
( ( A +e B )  =  0  <->  ( A +e +oo )  =  0 ) )
20 nn0xnn0 9634 . . . . . . . . . . . . . 14  |-  ( A  e.  NN0  ->  A  e. NN0*
)
21 xnn0xrnemnf 9642 . . . . . . . . . . . . . 14  |-  ( A  e. NN0*  ->  ( A  e. 
RR*  /\  A  =/= -oo ) )
22 xaddpnf1 10248 . . . . . . . . . . . . . 14  |-  ( ( A  e.  RR*  /\  A  =/= -oo )  ->  ( A +e +oo )  = +oo )
2320, 21, 223syl 17 . . . . . . . . . . . . 13  |-  ( A  e.  NN0  ->  ( A +e +oo )  = +oo )
2423adantl 277 . . . . . . . . . . . 12  |-  ( ( B  = +oo  /\  A  e.  NN0 )  -> 
( A +e +oo )  = +oo )
2524eqeq1d 2247 . . . . . . . . . . 11  |-  ( ( B  = +oo  /\  A  e.  NN0 )  -> 
( ( A +e +oo )  =  0  <-> +oo  =  0 ) )
2619, 25bitrd 188 . . . . . . . . . 10  |-  ( ( B  = +oo  /\  A  e.  NN0 )  -> 
( ( A +e B )  =  0  <-> +oo  =  0 ) )
27 0re 8326 . . . . . . . . . . . . 13  |-  0  e.  RR
28 renepnf 8373 . . . . . . . . . . . . 13  |-  ( 0  e.  RR  ->  0  =/= +oo )
2927, 28ax-mp 5 . . . . . . . . . . . 12  |-  0  =/= +oo
3029nesymi 2466 . . . . . . . . . . 11  |-  -. +oo  =  0
3130pm2.21i 655 . . . . . . . . . 10  |-  ( +oo  =  0  ->  ( A  =  0  /\  B  =  0 ) )
3226, 31biimtrdi 163 . . . . . . . . 9  |-  ( ( B  = +oo  /\  A  e.  NN0 )  -> 
( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) )
3332ex 115 . . . . . . . 8  |-  ( B  = +oo  ->  ( A  e.  NN0  ->  (
( A +e
B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) ) )
3416, 33jaoi 728 . . . . . . 7  |-  ( ( B  e.  NN0  \/  B  = +oo )  ->  ( A  e.  NN0  ->  ( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) ) )
352, 34sylbi 121 . . . . . 6  |-  ( B  e. NN0*  ->  ( A  e. 
NN0  ->  ( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) ) )
3635com12 30 . . . . 5  |-  ( A  e.  NN0  ->  ( B  e. NN0*  ->  ( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) ) )
37 oveq1 6092 . . . . . . . . 9  |-  ( A  = +oo  ->  ( A +e B )  =  ( +oo +e B ) )
3837eqeq1d 2247 . . . . . . . 8  |-  ( A  = +oo  ->  (
( A +e
B )  =  0  <-> 
( +oo +e B )  =  0 ) )
39 xnn0xrnemnf 9642 . . . . . . . . . 10  |-  ( B  e. NN0*  ->  ( B  e. 
RR*  /\  B  =/= -oo ) )
40 xaddpnf2 10249 . . . . . . . . . 10  |-  ( ( B  e.  RR*  /\  B  =/= -oo )  ->  ( +oo +e B )  = +oo )
4139, 40syl 14 . . . . . . . . 9  |-  ( B  e. NN0*  ->  ( +oo +e B )  = +oo )
4241eqeq1d 2247 . . . . . . . 8  |-  ( B  e. NN0*  ->  ( ( +oo +e B )  =  0  <-> +oo  =  0 ) )
4338, 42sylan9bb 466 . . . . . . 7  |-  ( ( A  = +oo  /\  B  e. NN0* )  ->  ( ( A +e
B )  =  0  <-> +oo  =  0 ) )
4443, 31biimtrdi 163 . . . . . 6  |-  ( ( A  = +oo  /\  B  e. NN0* )  ->  ( ( A +e
B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) )
4544ex 115 . . . . 5  |-  ( A  = +oo  ->  ( B  e. NN0*  ->  ( ( A +e B )  =  0  -> 
( A  =  0  /\  B  =  0 ) ) ) )
4636, 45jaoi 728 . . . 4  |-  ( ( A  e.  NN0  \/  A  = +oo )  ->  ( B  e. NN0*  ->  ( ( A +e
B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) ) )
471, 46sylbi 121 . . 3  |-  ( A  e. NN0*  ->  ( B  e. NN0* 
->  ( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) ) )
4847imp 124 . 2  |-  ( ( A  e. NN0*  /\  B  e. NN0* )  ->  ( ( A +e B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) )
49 oveq12 6094 . . 3  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( A +e B )  =  ( 0 +e 0 ) )
50 0xr 8372 . . . 4  |-  0  e.  RR*
51 xaddid1 10264 . . . 4  |-  ( 0  e.  RR*  ->  ( 0 +e 0 )  =  0 )
5250, 51ax-mp 5 . . 3  |-  ( 0 +e 0 )  =  0
5349, 52eqtrdi 2287 . 2  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( A +e B )  =  0 )
5448, 53impbid1 142 1  |-  ( ( A  e. NN0*  /\  B  e. NN0* )  ->  ( ( A +e B )  =  0  <->  ( A  =  0  /\  B  =  0 ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209    =/= wne 2420   class class class wbr 4130  (class class class)co 6085   RRcr 8178   0cc0 8179    + caddc 8182   +oocpnf 8357   -oocmnf 8358   RR*cxr 8359    <_ cle 8361   NN0cn0 9563  NN0*cxnn0 9630   +ecxad 10172
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-inn 9305  df-n0 9564  df-xnn0 9631  df-xadd 10175
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator