Theorem addinvcom 42796

Description: A number commutes with its additive inverse. Compare remulinvcom 42797. (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 3959	. . . . 5 ⊢ (𝜑 → ℂ ⊆ ℂ)
2		simpl 482	. . . . . . 7 ⊢ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
3	2	rgenw 3056	. . . . . 6 ⊢ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
4	3	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5		addinvcom.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
6		sn-negex12 42781	. . . . . 6 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
7	5, 6	syl 17	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8		0cn 11136	. . . . . 6 ⊢ 0 ∈ ℂ
9		sn-subeu 42791	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
10	5, 8, 9	sylancl 587	. . . . 5 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11		riotass2 7355	. . . . 5 ⊢ (((ℂ ⊆ ℂ ∧ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)) ∧ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)) → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
12	1, 4, 7, 10, 11	syl22anc 839	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
13		addinvcom.1	. . . . 5 ⊢ (𝜑 → (𝐴 + 𝐵) = 0)
14		addinvcom.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ)
15		oveq2 7376	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
16	15	eqeq1d 2739	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
17	16	riota2 7350	. . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
18	14, 10, 17	syl2anc 585	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
19	13, 18	mpbid 232	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
20	12, 19	eqtrd 2772	. . 3 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21		reurmo 3355	. . . . . 6 ⊢ (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
22	2	rmoimi 3702	. . . . . 6 ⊢ (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
23	10, 21, 22	3syl 18	. . . . 5 ⊢ (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24		reu5 3354	. . . . 5 ⊢ (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
25	7, 23, 24	sylanbrc 584	. . . 4 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26		oveq1 7375	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
27	26	eqeq1d 2739	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
28	16, 27	anbi12d 633	. . . . 5 ⊢ (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
29	28	riota2 7350	. . . 4 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
30	14, 25, 29	syl2anc 585	. . 3 ⊢ (𝜑 → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
31	20, 30	mpbird 257	. 2 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0))
32	31	simprd 495	1 ⊢ (𝜑 → (𝐵 + 𝐴) = 0)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  ∃!wreu 3350  ∃*wrmo 3351   ⊆ wss 3903  ℩crio 7324  (class class class)co 7368  ℂcc 11036  0cc0 11038   + caddc 11041

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-po 5540  df-so 5541  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-ltxr 11183  df-2 12220  df-3 12221  df-resub 42730

This theorem is referenced by: (None)