MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  negeu Structured version   Visualization version   GIF version

Theorem negeu 10150
Description: Existential uniqueness of negatives. Theorem I.2 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
negeu ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem negeu
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cnegex 10096 . . 3 (𝐴 ∈ ℂ → ∃𝑦 ∈ ℂ (𝐴 + 𝑦) = 0)
21adantr 480 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃𝑦 ∈ ℂ (𝐴 + 𝑦) = 0)
3 simpl 472 . . . 4 ((𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0) → 𝑦 ∈ ℂ)
4 simpr 476 . . . 4 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
5 addcl 9897 . . . 4 ((𝑦 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑦 + 𝐵) ∈ ℂ)
63, 4, 5syl2anr 494 . . 3 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) → (𝑦 + 𝐵) ∈ ℂ)
7 simplrr 797 . . . . . . . 8 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → (𝐴 + 𝑦) = 0)
87oveq1d 6564 . . . . . . 7 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑦) + 𝐵) = (0 + 𝐵))
9 simplll 794 . . . . . . . 8 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ ℂ)
10 simplrl 796 . . . . . . . 8 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → 𝑦 ∈ ℂ)
11 simpllr 795 . . . . . . . 8 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → 𝐵 ∈ ℂ)
129, 10, 11addassd 9941 . . . . . . 7 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑦) + 𝐵) = (𝐴 + (𝑦 + 𝐵)))
1311addid2d 10116 . . . . . . 7 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → (0 + 𝐵) = 𝐵)
148, 12, 133eqtr3rd 2653 . . . . . 6 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → 𝐵 = (𝐴 + (𝑦 + 𝐵)))
1514eqeq2d 2620 . . . . 5 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑥) = 𝐵 ↔ (𝐴 + 𝑥) = (𝐴 + (𝑦 + 𝐵))))
16 simpr 476 . . . . . 6 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → 𝑥 ∈ ℂ)
1710, 11addcld 9938 . . . . . 6 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → (𝑦 + 𝐵) ∈ ℂ)
189, 16, 17addcand 10118 . . . . 5 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑥) = (𝐴 + (𝑦 + 𝐵)) ↔ 𝑥 = (𝑦 + 𝐵)))
1915, 18bitrd 267 . . . 4 ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑥) = 𝐵𝑥 = (𝑦 + 𝐵)))
2019ralrimiva 2949 . . 3 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) → ∀𝑥 ∈ ℂ ((𝐴 + 𝑥) = 𝐵𝑥 = (𝑦 + 𝐵)))
21 reu6i 3364 . . 3 (((𝑦 + 𝐵) ∈ ℂ ∧ ∀𝑥 ∈ ℂ ((𝐴 + 𝑥) = 𝐵𝑥 = (𝑦 + 𝐵))) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 𝐵)
226, 20, 21syl2anc 691 . 2 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑦 ∈ ℂ ∧ (𝐴 + 𝑦) = 0)) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 𝐵)
232, 22rexlimddv 3017 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wral 2896  wrex 2897  ∃!wreu 2898  (class class class)co 6549  cc 9813  0cc0 9815   + caddc 9818
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-ltxr 9958
This theorem is referenced by:  subcl  10159  subadd  10163
  Copyright terms: Public domain W3C validator