Theorem addinvcom 43749

Description: A number commutes with its additive inverse. Compare remulinvcom 43750. (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.

Step	Hyp	Ref	Expression
1		ssidd 3936	. . . . 5 ⊢ (𝜑 → ℂ ⊆ ℂ)
2		simpl 488	. . . . . . 7 ⊢ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
3	2	rgenw 3084	. . . . . 6 ⊢ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
4	3	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5		addinvcom.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
6		sn-negex12 43734	. . . . . 6 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
7	5, 6	syl 18	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8		0cn 11337	. . . . . 6 ⊢ 0 ∈ ℂ
9		sn-subeu 43744	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
10	5, 8, 9	sylancl 598	. . . . 5 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11		riotass2 7438	. . . . 5 ⊢ (((ℂ ⊆ ℂ ∧ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)) ∧ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)) → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
12	1, 4, 7, 10, 11	syl22anc 852	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
13		addinvcom.1	. . . . 5 ⊢ (𝜑 → (𝐴 + 𝐵) = 0)
14		addinvcom.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ)
15		oveq2 7459	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
16	15	eqeq1d 2765	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
17	16	riota2 7433	. . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
18	14, 10, 17	syl2anc 596	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
19	13, 18	mpbid 235	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
20	12, 19	eqtrd 2798	. . 3 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21		reurmo 3372	. . . . . 6 ⊢ (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
22	2	rmoimi 3703	. . . . . 6 ⊢ (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
23	10, 21, 22	3syl 19	. . . . 5 ⊢ (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24		reu5 3371	. . . . 5 ⊢ (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
25	7, 23, 24	sylanbrc 595	. . . 4 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26		oveq1 7458	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
27	26	eqeq1d 2765	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
28	16, 27	anbi12d 644	. . . . 5 ⊢ (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
29	28	riota2 7433	. . . 4 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
30	14, 25, 29	syl2anc 596	. . 3 ⊢ (𝜑 → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
31	20, 30	mpbird 260	. 2 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0))
32	31	simprd 501	1 ⊢ (𝜑 → (𝐵 + 𝐴) = 0)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∃!wreu 3367  ∃*wrmo 3368   ⊆ wss 3900  ℩crio 7407  (class class class)co 7451  ℂcc 11237  0cc0 11239   + caddc 11242

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-po 5566  df-so 5567  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-ltxr 11387  df-2 12445  df-3 12446  df-resub 43683

This theorem is used by: (None)