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

 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 (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 + 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0)))

StepHypRef Expression
1 simpllr 494 . . . . . . . . 9 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 0 ≤ 𝐴)
2 simplrl 495 . . . . . . . . . 10 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐵 ∈ ℝ)
3 simplll 493 . . . . . . . . . 10 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐴 ∈ ℝ)
4 addge02 7541 . . . . . . . . . 10 ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 ≤ 𝐴𝐵 ≤ (𝐴 + 𝐵)))
52, 3, 4syl2anc 397 . . . . . . . . 9 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → (0 ≤ 𝐴𝐵 ≤ (𝐴 + 𝐵)))
61, 5mpbid 139 . . . . . . . 8 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐵 ≤ (𝐴 + 𝐵))
7 simpr 107 . . . . . . . 8 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → (𝐴 + 𝐵) = 0)
86, 7breqtrd 3815 . . . . . . 7 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐵 ≤ 0)
9 simplrr 496 . . . . . . 7 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 0 ≤ 𝐵)
10 0red 7085 . . . . . . . 8 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 0 ∈ ℝ)
112, 10letri3d 7191 . . . . . . 7 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → (𝐵 = 0 ↔ (𝐵 ≤ 0 ∧ 0 ≤ 𝐵)))
128, 9, 11mpbir2and 862 . . . . . 6 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐵 = 0)
1312oveq2d 5555 . . . . 5 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → (𝐴 + 𝐵) = (𝐴 + 0))
143recnd 7112 . . . . . 6 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐴 ∈ ℂ)
1514addid1d 7222 . . . . 5 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → (𝐴 + 0) = 𝐴)
1613, 7, 153eqtr3rd 2097 . . . 4 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → 𝐴 = 0)
1716, 12jca 294 . . 3 ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) ∧ (𝐴 + 𝐵) = 0) → (𝐴 = 0 ∧ 𝐵 = 0))
1817ex 112 . 2 (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 + 𝐵) = 0 → (𝐴 = 0 ∧ 𝐵 = 0)))
19 oveq12 5548 . . 3 ((𝐴 = 0 ∧ 𝐵 = 0) → (𝐴 + 𝐵) = (0 + 0))
20 00id 7214 . . 3 (0 + 0) = 0
2119, 20syl6eq 2104 . 2 ((𝐴 = 0 ∧ 𝐵 = 0) → (𝐴 + 𝐵) = 0)
2218, 21impbid1 134 1 (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 + 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 101   ↔ wb 102   = wceq 1259   ∈ wcel 1409   class class class wbr 3791  (class class class)co 5539  ℝcr 6945  0cc0 6946   + caddc 6949   ≤ cle 7119 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-cnex 7032  ax-resscn 7033  ax-1cn 7034  ax-1re 7035  ax-icn 7036  ax-addcl 7037  ax-addrcl 7038  ax-mulcl 7039  ax-addcom 7041  ax-addass 7043  ax-i2m1 7046  ax-0id 7049  ax-rnegex 7050  ax-pre-ltirr 7053  ax-pre-apti 7056  ax-pre-ltadd 7057 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-nel 2315  df-ral 2328  df-rex 2329  df-rab 2332  df-v 2576  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-br 3792  df-opab 3846  df-xp 4378  df-cnv 4380  df-iota 4894  df-fv 4937  df-ov 5542  df-pnf 7120  df-mnf 7121  df-xr 7122  df-ltxr 7123  df-le 7124 This theorem is referenced by:  add20i  7557  sumsqeq0  9492
 Copyright terms: Public domain W3C validator