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

Theorem addlid 11444
Description: 0 is a left identity for addition. This used to be one of our complex number axioms, until it was discovered that it was dependent on the others. Based on ideas by Eric Schmidt. (Contributed by Scott Fenton, 3-Jan-2013.)
Assertion
Ref Expression
addlid (𝐴 ∈ ℂ → (0 + 𝐴) = 𝐴)

Proof of Theorem addlid
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnegex 11442 . 2 (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
2 cnegex 11442 . . . 4 (𝑥 ∈ ℂ → ∃𝑦 ∈ ℂ (𝑥 + 𝑦) = 0)
32ad2antrl 728 . . 3 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0)) → ∃𝑦 ∈ ℂ (𝑥 + 𝑦) = 0)
4 0cn 11253 . . . . . . . . . 10 0 ∈ ℂ
5 addass 11242 . . . . . . . . . 10 ((0 ∈ ℂ ∧ 0 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((0 + 0) + 𝑦) = (0 + (0 + 𝑦)))
64, 4, 5mp3an12 1453 . . . . . . . . 9 (𝑦 ∈ ℂ → ((0 + 0) + 𝑦) = (0 + (0 + 𝑦)))
76adantr 480 . . . . . . . 8 ((𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0) → ((0 + 0) + 𝑦) = (0 + (0 + 𝑦)))
873ad2ant3 1136 . . . . . . 7 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → ((0 + 0) + 𝑦) = (0 + (0 + 𝑦)))
9 00id 11436 . . . . . . . . 9 (0 + 0) = 0
109oveq1i 7441 . . . . . . . 8 ((0 + 0) + 𝑦) = (0 + 𝑦)
11 simp1 1137 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → 𝐴 ∈ ℂ)
12 simp2l 1200 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → 𝑥 ∈ ℂ)
13 simp3l 1202 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → 𝑦 ∈ ℂ)
1411, 12, 13addassd 11283 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → ((𝐴 + 𝑥) + 𝑦) = (𝐴 + (𝑥 + 𝑦)))
15 simp2r 1201 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (𝐴 + 𝑥) = 0)
1615oveq1d 7446 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → ((𝐴 + 𝑥) + 𝑦) = (0 + 𝑦))
17 simp3r 1203 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (𝑥 + 𝑦) = 0)
1817oveq2d 7447 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (𝐴 + (𝑥 + 𝑦)) = (𝐴 + 0))
1914, 16, 183eqtr3rd 2786 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (𝐴 + 0) = (0 + 𝑦))
20 addrid 11441 . . . . . . . . . 10 (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴)
21203ad2ant1 1134 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (𝐴 + 0) = 𝐴)
2219, 21eqtr3d 2779 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (0 + 𝑦) = 𝐴)
2310, 22eqtrid 2789 . . . . . . 7 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → ((0 + 0) + 𝑦) = 𝐴)
2422oveq2d 7447 . . . . . . 7 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (0 + (0 + 𝑦)) = (0 + 𝐴))
258, 23, 243eqtr3rd 2786 . . . . . 6 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0) ∧ (𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0)) → (0 + 𝐴) = 𝐴)
26253expia 1122 . . . . 5 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0)) → ((𝑦 ∈ ℂ ∧ (𝑥 + 𝑦) = 0) → (0 + 𝐴) = 𝐴))
2726expd 415 . . . 4 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0)) → (𝑦 ∈ ℂ → ((𝑥 + 𝑦) = 0 → (0 + 𝐴) = 𝐴)))
2827rexlimdv 3153 . . 3 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0)) → (∃𝑦 ∈ ℂ (𝑥 + 𝑦) = 0 → (0 + 𝐴) = 𝐴))
293, 28mpd 15 . 2 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ (𝐴 + 𝑥) = 0)) → (0 + 𝐴) = 𝐴)
301, 29rexlimddv 3161 1 (𝐴 ∈ ℂ → (0 + 𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1540  wcel 2108  wrex 3070  (class class class)co 7431  cc 11153  0cc0 11155   + caddc 11158
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-po 5592  df-so 5593  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-er 8745  df-en 8986  df-dom 8987  df-sdom 8988  df-pnf 11297  df-mnf 11298  df-ltxr 11300
This theorem is referenced by:  addcan  11445  addlidi  11449  addlidd  11462  negneg  11559  fzo0addel  13757  fzoaddel2  13759  divfl0  13864  modid  13936  modsumfzodifsn  13985  swrdspsleq  14703  swrds1  14704  isercolllem3  15703  sumrblem  15747  summolem2a  15751  fsum0diag2  15819  eftlub  16145  gcdid  16564  cnaddablx  19886  cnaddabl  19887  cnaddid  19888  cncrng  21401  cncrngOLD  21402  cnlmod  25173  ptolemy  26538  logtayl  26702  leibpilem2  26984  axcontlem2  28980  cnaddabloOLD  30600  cnidOLD  30601  gsumzrsum  33062  dvcosax  45941  2zrngamnd  48163  aacllem  49320
  Copyright terms: Public domain W3C validator