Theorem addinvcom 43307

Description: A number commutes with its additive inverse. Compare remulinvcom 43308. (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 3954	. . . . 5 ⊢ (𝜑 → ℂ ⊆ ℂ)
2		simpl 488	. . . . . . 7 ⊢ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
3	2	rgenw 3080	. . . . . 6 ⊢ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
4	3	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5		addinvcom.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
6		sn-negex12 43292	. . . . . 6 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
7	5, 6	syl 18	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8		0cn 11222	. . . . . 6 ⊢ 0 ∈ ℂ
9		sn-subeu 43302	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
10	5, 8, 9	sylancl 598	. . . . 5 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11		riotass2 7400	. . . . 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 7421	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
16	15	eqeq1d 2762	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
17	16	riota2 7395	. . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
18	14, 10, 17	syl2anc 596	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
19	13, 18	mpbid 235	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
20	12, 19	eqtrd 2795	. . 3 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21		reurmo 3368	. . . . . 6 ⊢ (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
22	2	rmoimi 3700	. . . . . 6 ⊢ (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
23	10, 21, 22	3syl 19	. . . . 5 ⊢ (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24		reu5 3367	. . . . 5 ⊢ (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
25	7, 23, 24	sylanbrc 595	. . . 4 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26		oveq1 7420	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
27	26	eqeq1d 2762	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
28	16, 27	anbi12d 644	. . . . 5 ⊢ (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
29	28	riota2 7395	. . . 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 2145  ∀wral 3076  ∃wrex 3086  ∃!wreu 3363  ∃*wrmo 3364   ⊆ wss 3899  ℩crio 7369  (class class class)co 7413  ℂcc 11122  0cc0 11124   + caddc 11127

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11269  df-mnf 11270  df-ltxr 11272  df-2 12327  df-3 12328  df-resub 43241

This theorem is used by: (None)