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 41304
Description: A number commutes with its additive inverse. Compare remulinvcom 41305. (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 4006 . . . . 5 (𝜑 → ℂ ⊆ ℂ)
2 simpl 484 . . . . . . 7 (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
32rgenw 3066 . . . . . 6 𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
43a1i 11 . . . . 5 (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5 addinvcom.a . . . . . 6 (𝜑𝐴 ∈ ℂ)
6 sn-negex12 41289 . . . . . 6 (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
75, 6syl 17 . . . . 5 (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8 0cn 11206 . . . . . 6 0 ∈ ℂ
9 sn-subeu 41299 . . . . . 6 ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
105, 8, 9sylancl 587 . . . . 5 (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11 riotass2 7396 . . . . 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 7417 . . . . . . . 8 (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
1615eqeq1d 2735 . . . . . . 7 (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
1716riota2 7391 . . . . . 6 ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
1814, 10, 17syl2anc 585 . . . . 5 (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
1913, 18mpbid 231 . . . 4 (𝜑 → (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
2012, 19eqtrd 2773 . . 3 (𝜑 → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21 reurmo 3380 . . . . . 6 (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
222rmoimi 3739 . . . . . 6 (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
2310, 21, 223syl 18 . . . . 5 (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24 reu5 3379 . . . . 5 (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
257, 23, 24sylanbrc 584 . . . 4 (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26 oveq1 7416 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
2726eqeq1d 2735 . . . . . 6 (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
2816, 27anbi12d 632 . . . . 5 (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
2928riota2 7391 . . . 4 ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
3014, 25, 29syl2anc 585 . . 3 (𝜑 → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
3120, 30mpbird 257 . 2 (𝜑 → ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0))
3231simprd 497 1 (𝜑 → (𝐵 + 𝐴) = 0)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wral 3062  wrex 3071  ∃!wreu 3375  ∃*wrmo 3376  wss 3949  crio 7364  (class class class)co 7409  cc 11108  0cc0 11110   + caddc 11113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725  ax-resscn 11167  ax-1cn 11168  ax-icn 11169  ax-addcl 11170  ax-addrcl 11171  ax-mulcl 11172  ax-mulrcl 11173  ax-addass 11175  ax-mulass 11176  ax-distr 11177  ax-i2m1 11178  ax-1ne0 11179  ax-1rid 11180  ax-rnegex 11181  ax-rrecex 11182  ax-cnre 11183  ax-pre-lttri 11184  ax-pre-lttrn 11185  ax-pre-ltadd 11186
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-po 5589  df-so 5590  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-riota 7365  df-ov 7412  df-oprab 7413  df-mpo 7414  df-er 8703  df-en 8940  df-dom 8941  df-sdom 8942  df-pnf 11250  df-mnf 11251  df-ltxr 11253  df-2 12275  df-3 12276  df-resub 41239
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator