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

Theorem add20 8632
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 534 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  0  <_  A
)
2 simplrl 535 . . . . . . . . . 10  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  e.  RR )
3 simplll 533 . . . . . . . . . 10  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  A  e.  RR )
4 addge02 8631 . . . . . . . . . 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 4109 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  <_  0
)
9 simplrr 536 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  0  <_  B
)
10 0red 8158 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  0  e.  RR )
112, 10letri3d 8273 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( B  =  0  <->  ( B  <_ 
0  /\  0  <_  B ) ) )
128, 9, 11mpbir2and 950 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  B  =  0 )
1312oveq2d 6023 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( A  +  B )  =  ( A  +  0 ) )
143recnd 8186 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  A  e.  CC )
1514addridd 8306 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  +  B
)  =  0 )  ->  ( A  + 
0 )  =  A )
1613, 7, 153eqtr3rd 2271 . . . 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 6016 . . 3  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( A  +  B )  =  ( 0  +  0 ) )
20 00id 8298 . . 3  |-  ( 0  +  0 )  =  0
2119, 20eqtrdi 2278 . 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 1395    e. wcel 2200   class class class wbr 4083  (class class class)co 6007   RRcr 8009   0cc0 8010    + caddc 8013    <_ cle 8193
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-i2m1 8115  ax-0id 8118  ax-rnegex 8119  ax-pre-ltirr 8122  ax-pre-apti 8125  ax-pre-ltadd 8126
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-cnv 4727  df-iota 5278  df-fv 5326  df-ov 6010  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198
This theorem is referenced by:  add20i  8650  xnn0xadd0  10075  sumsqeq0  10852  ccat0  11144  4sqlem15  12943  4sqlem16  12944  2sqlem7  15815
  Copyright terms: Public domain W3C validator