Users' Mathboxes Mathbox for Steven Nguyen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  addinvcom Structured version   Visualization version   GIF version

Theorem addinvcom 42683
Description: A number commutes with its additive inverse. Compare remulinvcom 42684. (Contributed by SN, 5-May-2024.)
Hypotheses
Ref Expression
addinvcom.a (𝜑𝐴 ∈ ℂ)
addinvcom.b (𝜑𝐵 ∈ ℂ)
addinvcom.1 (𝜑 → (𝐴 + 𝐵) = 0)
Assertion
Ref Expression
addinvcom (𝜑 → (𝐵 + 𝐴) = 0)

Proof of Theorem addinvcom
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssidd 3957 . . . . 5 (𝜑 → ℂ ⊆ ℂ)
2 simpl 482 . . . . . . 7 (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
32rgenw 3055 . . . . . 6 𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
43a1i 11 . . . . 5 (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5 addinvcom.a . . . . . 6 (𝜑𝐴 ∈ ℂ)
6 sn-negex12 42668 . . . . . 6 (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
75, 6syl 17 . . . . 5 (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8 0cn 11124 . . . . . 6 0 ∈ ℂ
9 sn-subeu 42678 . . . . . 6 ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
105, 8, 9sylancl 586 . . . . 5 (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11 riotass2 7345 . . . . 5 (((ℂ ⊆ ℂ ∧ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)) ∧ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)) → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
121, 4, 7, 10, 11syl22anc 838 . . . 4 (𝜑 → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
13 addinvcom.1 . . . . 5 (𝜑 → (𝐴 + 𝐵) = 0)
14 addinvcom.b . . . . . 6 (𝜑𝐵 ∈ ℂ)
15 oveq2 7366 . . . . . . . 8 (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
1615eqeq1d 2738 . . . . . . 7 (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
1716riota2 7340 . . . . . 6 ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
1814, 10, 17syl2anc 584 . . . . 5 (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
1913, 18mpbid 232 . . . 4 (𝜑 → (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
2012, 19eqtrd 2771 . . 3 (𝜑 → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21 reurmo 3353 . . . . . 6 (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
222rmoimi 3700 . . . . . 6 (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
2310, 21, 223syl 18 . . . . 5 (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24 reu5 3352 . . . . 5 (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
257, 23, 24sylanbrc 583 . . . 4 (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26 oveq1 7365 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
2726eqeq1d 2738 . . . . . 6 (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
2816, 27anbi12d 632 . . . . 5 (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
2928riota2 7340 . . . 4 ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
3014, 25, 29syl2anc 584 . . 3 (𝜑 → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
3120, 30mpbird 257 . 2 (𝜑 → ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0))
3231simprd 495 1 (𝜑 → (𝐵 + 𝐴) = 0)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3051  wrex 3060  ∃!wreu 3348  ∃*wrmo 3349  wss 3901  crio 7314  (class class class)co 7358  cc 11024  0cc0 11026   + caddc 11029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11168  df-mnf 11169  df-ltxr 11171  df-2 12208  df-3 12209  df-resub 42617
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator