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

Theorem add20 8696
Description: Two nonnegative numbers are zero iff their sum is zero. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
add20  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  +  B )  =  0  <->  ( A  =  0  /\  B  =  0 ) ) )

Proof of Theorem add20
StepHypRef Expression
1 simpllr 536 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  0  <_  A
)
2 simplrl 537 . . . . . . . . . 10  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  e.  RR )
3 simplll 535 . . . . . . . . . 10  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  A  e.  RR )
4 addge02 8695 . . . . . . . . . 10  |-  ( ( B  e.  RR  /\  A  e.  RR )  ->  ( 0  <_  A  <->  B  <_  ( A  +  B ) ) )
52, 3, 4syl2anc 411 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( 0  <_  A 
<->  B  <_  ( A  +  B ) ) )
61, 5mpbid 147 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  <_  ( A  +  B )
)
7 simpr 110 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( A  +  B )  =  0 )
86, 7breqtrd 4119 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  <_  0
)
9 simplrr 538 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  0  <_  B
)
10 0red 8223 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  0  e.  RR )
112, 10letri3d 8337 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( B  =  0  <->  ( B  <_ 
0  /\  0  <_  B ) ) )
128, 9, 11mpbir2and 953 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  =  0 )
1312oveq2d 6044 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( A  +  B )  =  ( A  +  0 ) )
143recnd 8250 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  A  e.  CC )
1514addridd 8370 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( A  + 
0 )  =  A )
1613, 7, 153eqtr3rd 2273 . . . 4  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  A  =  0 )
1716, 12jca 306 . . 3  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( A  =  0  /\  B  =  0 ) )
1817ex 115 . 2  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  +  B )  =  0  ->  ( A  =  0  /\  B  =  0 ) ) )
19 oveq12 6037 . . 3  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( A  +  B )  =  ( 0  +  0 ) )
20 00id 8362 . . 3  |-  ( 0  +  0 )  =  0
2119, 20eqtrdi 2280 . 2  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( A  +  B )  =  0 )
2218, 21impbid1 142 1  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  +  B )  =  0  <->  ( A  =  0  /\  B  =  0 ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   class class class wbr 4093  (class class class)co 6028   RRcr 8074   0cc0 8075    + caddc 8078    <_ cle 8257
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 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-apti 8190  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  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-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-iota 5293  df-fv 5341  df-ov 6031  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262
This theorem is referenced by:  add20i  8714  xnn0xadd0  10146  sumsqeq0  10926  ccat0  11222  4sqlem15  13041  4sqlem16  13042  2sqlem7  15923  vtxd0nedgbfi  16223
  Copyright terms: Public domain W3C validator