Theorem addinvcom 40958

Description: A number commutes with its additive inverse. Compare remulinvcom 40959. (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 3970	. . . . 5 ⊢ (𝜑 → ℂ ⊆ ℂ)
2		simpl 483	. . . . . . 7 ⊢ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
3	2	rgenw 3064	. . . . . 6 ⊢ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)
4	3	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0))
5		addinvcom.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
6		sn-negex12 40943	. . . . . 6 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
7	5, 6	syl 17	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
8		0cn 11156	. . . . . 6 ⊢ 0 ∈ ℂ
9		sn-subeu 40953	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
10	5, 8, 9	sylancl 586	. . . . 5 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
11		riotass2 7349	. . . . 5 ⊢ (((ℂ ⊆ ℂ ∧ ∀𝑥 ∈ ℂ (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) → (𝐴 + 𝑥) = 0)) ∧ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)) → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
12	1, 4, 7, 10, 11	syl22anc 837	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0))
13		addinvcom.1	. . . . 5 ⊢ (𝜑 → (𝐴 + 𝐵) = 0)
14		addinvcom.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ)
15		oveq2 7370	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
16	15	eqeq1d 2733	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + 𝐵) = 0))
17	16	riota2 7344	. . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
18	14, 10, 17	syl2anc 584	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ↔ (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵))
19	13, 18	mpbid 231	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) = 𝐵)
20	12, 19	eqtrd 2771	. . 3 ⊢ (𝜑 → (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵)
21		reurmo 3354	. . . . . 6 ⊢ (∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
22	2	rmoimi 3703	. . . . . 6 ⊢ (∃*𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
23	10, 21, 22	3syl 18	. . . . 5 ⊢ (𝜑 → ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
24		reu5 3353	. . . . 5 ⊢ (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ (∃𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ∧ ∃*𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)))
25	7, 23, 24	sylanbrc 583	. . . 4 ⊢ (𝜑 → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0))
26		oveq1 7369	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 + 𝐴) = (𝐵 + 𝐴))
27	26	eqeq1d 2733	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑥 + 𝐴) = 0 ↔ (𝐵 + 𝐴) = 0))
28	16, 27	anbi12d 631	. . . . 5 ⊢ (𝑥 = 𝐵 → (((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0) ↔ ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0)))
29	28	riota2 7344	. . . 4 ⊢ ((𝐵 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
30	14, 25, 29	syl2anc 584	. . 3 ⊢ (𝜑 → (((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0) ↔ (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) = 0 ∧ (𝑥 + 𝐴) = 0)) = 𝐵))
31	20, 30	mpbird 256	. 2 ⊢ (𝜑 → ((𝐴 + 𝐵) = 0 ∧ (𝐵 + 𝐴) = 0))
32	31	simprd 496	1 ⊢ (𝜑 → (𝐵 + 𝐴) = 0)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3060  ∃wrex 3069  ∃!wreu 3349  ∃*wrmo 3350   ⊆ wss 3913  ℩crio 7317  (class class class)co 7362  ℂcc 11058  0cc0 11060   + caddc 11063

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677  ax-resscn 11117  ax-1cn 11118  ax-icn 11119  ax-addcl 11120  ax-addrcl 11121  ax-mulcl 11122  ax-mulrcl 11123  ax-addass 11125  ax-mulass 11126  ax-distr 11127  ax-i2m1 11128  ax-1ne0 11129  ax-1rid 11130  ax-rnegex 11131  ax-rrecex 11132  ax-cnre 11133  ax-pre-lttri 11134  ax-pre-lttrn 11135  ax-pre-ltadd 11136

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3351  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-po 5550  df-so 5551  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-riota 7318  df-ov 7365  df-oprab 7366  df-mpo 7367  df-er 8655  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11200  df-mnf 11201  df-ltxr 11203  df-2 12225  df-3 12226  df-resub 40893

This theorem is referenced by: (None)