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 43005
Description: A number commutes with its additive inverse. Compare remulinvcom 43006. (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 3959 . . . . 5 (𝜑 → ℂ ⊆ ℂ)
2 simpl 486 . . . . . . 7 (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
32rgenw 3079 . . . . . 6 𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
43a1i 11 . . . . 5 (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5 addinvcom.a . . . . . 6 (𝜑𝐴 ∈ ℂ)
6 sn-negex12 42990 . . . . . 6 (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
75, 6syl 17 . . . . 5 (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8 0cn 11168 . . . . . 6 0 ∈ ℂ
9 sn-subeu 43000 . . . . . 6 ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
105, 8, 9sylancl 595 . . . . 5 (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11 riotass2 7379 . . . . 5 (((ℂ ⊆ ℂ ∧ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)) ∧ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)) → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
121, 4, 7, 10, 11syl22anc 849 . . . 4 (𝜑 → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
13 addinvcom.1 . . . . 5 (𝜑 → (𝐴 + 𝐵) = 0)
14 addinvcom.b . . . . . 6 (𝜑𝐵 ∈ ℂ)
15 oveq2 7400 . . . . . . . 8 (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
1615eqeq1d 2763 . . . . . . 7 (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
1716riota2 7374 . . . . . 6 ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
1814, 10, 17syl2anc 593 . . . . 5 (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
1913, 18mpbid 234 . . . 4 (𝜑 → (𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
2012, 19eqtrd 2796 . . 3 (𝜑 → (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21 reurmo 3369 . . . . . 6 (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
222rmoimi 3704 . . . . . 6 (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
2310, 21, 223syl 18 . . . . 5 (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24 reu5 3368 . . . . 5 (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
257, 23, 24sylanbrc 592 . . . 4 (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26 oveq1 7399 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
2726eqeq1d 2763 . . . . . 6 (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
2816, 27anbi12d 641 . . . . 5 (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
2928riota2 7374 . . . 4 ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
3014, 25, 29syl2anc 593 . . 3 (𝜑 → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
3120, 30mpbird 259 . 2 (𝜑 → ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0))
3231simprd 499 1 (𝜑 → (𝐵 + 𝐴) = 0)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  ∃!wreu 3364  ∃*wrmo 3365  wss 3904  crio 7348  (class class class)co 7392  cc 11068  0cc0 11070   + caddc 11073
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-resscn 11127  ax-1cn 11128  ax-icn 11129  ax-addcl 11130  ax-addrcl 11131  ax-mulcl 11132  ax-mulrcl 11133  ax-addass 11135  ax-mulass 11136  ax-distr 11137  ax-i2m1 11138  ax-1ne0 11139  ax-1rid 11140  ax-rnegex 11141  ax-rrecex 11142  ax-cnre 11143  ax-pre-lttri 11144  ax-pre-lttrn 11145  ax-pre-ltadd 11146
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-po 5553  df-so 5554  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-er 8673  df-en 8924  df-dom 8925  df-sdom 8926  df-pnf 11215  df-mnf 11216  df-ltxr 11218  df-2 12277  df-3 12278  df-resub 42939
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator