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

Theorem xnn0xadd0 10009
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 9380 . . . 4  |-  ( A  e. NN0* 
<->  ( A  e.  NN0  \/  A  = +oo )
)
2 elxnn0 9380 . . . . . . 7  |-  ( B  e. NN0* 
<->  ( B  e.  NN0  \/  B  = +oo )
)
3 nn0re 9324 . . . . . . . . . . . . 13  |-  ( A  e.  NN0  ->  A  e.  RR )
4 nn0re 9324 . . . . . . . . . . . . 13  |-  ( B  e.  NN0  ->  B  e.  RR )
5 rexadd 9994 . . . . . . . . . . . . 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 2215 . . . . . . . . . . 11  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( ( A +e B )  =  0  <->  ( A  +  B )  =  0 ) )
8 nn0ge0 9340 . . . . . . . . . . . . 13  |-  ( A  e.  NN0  ->  0  <_  A )
93, 8jca 306 . . . . . . . . . . . 12  |-  ( A  e.  NN0  ->  ( A  e.  RR  /\  0  <_  A ) )
10 nn0ge0 9340 . . . . . . . . . . . . 13  |-  ( B  e.  NN0  ->  0  <_  B )
114, 10jca 306 . . . . . . . . . . . 12  |-  ( B  e.  NN0  ->  ( B  e.  RR  /\  0  <_  B ) )
12 add20 8567 . . . . . . . . . . . 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 5965 . . . . . . . . . . . . 13  |-  ( B  = +oo  ->  ( A +e B )  =  ( A +e +oo ) )
1817eqeq1d 2215 . . . . . . . . . . . 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 9382 . . . . . . . . . . . . . 14  |-  ( A  e.  NN0  ->  A  e. NN0*
)
21 xnn0xrnemnf 9390 . . . . . . . . . . . . . 14  |-  ( A  e. NN0*  ->  ( A  e. 
RR*  /\  A  =/= -oo ) )
22 xaddpnf1 9988 . . . . . . . . . . . . . 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 2215 . . . . . . . . . . 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 8092 . . . . . . . . . . . . 13  |-  0  e.  RR
28 renepnf 8140 . . . . . . . . . . . . 13  |-  ( 0  e.  RR  ->  0  =/= +oo )
2927, 28ax-mp 5 . . . . . . . . . . . 12  |-  0  =/= +oo
3029nesymi 2423 . . . . . . . . . . 11  |-  -. +oo  =  0
3130pm2.21i 647 . . . . . . . . . 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 718 . . . . . . 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 5964 . . . . . . . . 9  |-  ( A  = +oo  ->  ( A +e B )  =  ( +oo +e B ) )
3837eqeq1d 2215 . . . . . . . 8  |-  ( A  = +oo  ->  (
( A +e
B )  =  0  <-> 
( +oo +e B )  =  0 ) )
39 xnn0xrnemnf 9390 . . . . . . . . . 10  |-  ( B  e. NN0*  ->  ( B  e. 
RR*  /\  B  =/= -oo ) )
40 xaddpnf2 9989 . . . . . . . . . 10  |-  ( ( B  e.  RR*  /\  B  =/= -oo )  ->  ( +oo +e B )  = +oo )
4139, 40syl 14 . . . . . . . . 9  |-  ( B  e. NN0*  ->  ( +oo +e B )  = +oo )
4241eqeq1d 2215 . . . . . . . 8  |-  ( B  e. NN0*  ->  ( ( +oo +e B )  =  0  <-> +oo  =  0 ) )
4338, 42sylan9bb 462 . . . . . . 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 718 . . . 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 5966 . . 3  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( A +e B )  =  ( 0 +e 0 ) )
50 0xr 8139 . . . 4  |-  0  e.  RR*
51 xaddid1 10004 . . . 4  |-  ( 0  e.  RR*  ->  ( 0 +e 0 )  =  0 )
5250, 51ax-mp 5 . . 3  |-  ( 0 +e 0 )  =  0
5349, 52eqtrdi 2255 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 710    = wceq 1373    e. wcel 2177    =/= wne 2377   class class class wbr 4051  (class class class)co 5957   RRcr 7944   0cc0 7945    + caddc 7948   +oocpnf 8124   -oocmnf 8125   RR*cxr 8126    <_ cle 8128   NN0cn0 9315  NN0*cxnn0 9378   +ecxad 9912
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-addcom 8045  ax-addass 8047  ax-i2m1 8050  ax-0lt1 8051  ax-0id 8053  ax-rnegex 8054  ax-pre-ltirr 8057  ax-pre-ltwlin 8058  ax-pre-lttrn 8059  ax-pre-apti 8060  ax-pre-ltadd 8061
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3003  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-if 3576  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-br 4052  df-opab 4114  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-iota 5241  df-fun 5282  df-fv 5288  df-ov 5960  df-oprab 5961  df-mpo 5962  df-pnf 8129  df-mnf 8130  df-xr 8131  df-ltxr 8132  df-le 8133  df-inn 9057  df-n0 9316  df-xnn0 9379  df-xadd 9915
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator