xaddeq0 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > xaddeq0		Structured version Visualization version GIF version

Theorem xaddeq0 32683

Description: Two extended reals which add up to zero are each other's negatives. (Contributed by Thierry Arnoux, 13-Jun-2017.)

**Assertion**
Ref	Expression
xaddeq0	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 ↔ 𝐴 = -_𝑒𝐵))

**Proof of Theorem xaddeq0**
Step	Hyp	Ref	Expression
1		elxr 13083	. . 3 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		simpll 766	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 ∈ ℝ)
3	2	rexrd 11231	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 ∈ ℝ^)
4		xnegneg 13181	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → -_𝑒-_𝑒𝐴 = 𝐴)
5	3, 4	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒-_𝑒𝐴 = 𝐴)
6	3	xnegcld 13267	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐴 ∈ ℝ^)
7		xaddlid 13209	. . . . . . . . 9 ⊢ (-_𝑒𝐴 ∈ ℝ^* → (0 +_𝑒 -_𝑒𝐴) = -_𝑒𝐴)
8	6, 7	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (0 +_𝑒 -_𝑒𝐴) = -_𝑒𝐴)
9		simplr 768	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
10		xaddcom 13207	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
11	3, 9, 10	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
12	11	oveq1d 7405	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐴 +_𝑒 𝐵) +_𝑒 -_𝑒𝐴) = ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴))
13		simpr 484	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
14	13	oveq1d 7405	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐴 +_𝑒 𝐵) +_𝑒 -_𝑒𝐴) = (0 +_𝑒 -_𝑒𝐴))
15		xpncan 13218	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐴 ∈ ℝ) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
16	15	ancoms 458	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
17	16	adantr 480	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
18	12, 14, 17	3eqtr3d 2773	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (0 +_𝑒 -_𝑒𝐴) = 𝐵)
19	8, 18	eqtr3d 2767	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐴 = 𝐵)
20		xnegeq 13174	. . . . . . 7 ⊢ (-_𝑒𝐴 = 𝐵 → -_𝑒-_𝑒𝐴 = -_𝑒𝐵)
21	19, 20	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒-_𝑒𝐴 = -_𝑒𝐵)
22	5, 21	eqtr3d 2767	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
23	22	ex 412	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
24		simpll 766	. . . . . 6 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = +∞)
25		simplr 768	. . . . . . . . . 10 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
26	24	oveq1d 7405	. . . . . . . . . . . . 13 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (+∞ +_𝑒 𝐵))
27		simpr 484	. . . . . . . . . . . . 13 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
28	26, 27	eqtr3d 2767	. . . . . . . . . . . 12 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (+∞ +_𝑒 𝐵) = 0)
29		0re 11183	. . . . . . . . . . . . 13 ⊢ 0 ∈ ℝ
30		renepnf 11229	. . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ → 0 ≠ +∞)
31	29, 30	mp1i 13	. . . . . . . . . . . 12 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 0 ≠ +∞)
32	28, 31	eqnetrd 2993	. . . . . . . . . . 11 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (+∞ +_𝑒 𝐵) ≠ +∞)
33	32	neneqd 2931	. . . . . . . . . 10 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ (+∞ +_𝑒 𝐵) = +∞)
34		xaddpnf2 13194	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) → (+∞ +_𝑒 𝐵) = +∞)
35	34	stoic1a 1772	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ ¬ (+∞ +_𝑒 𝐵) = +∞) → ¬ 𝐵 ≠ -∞)
36	25, 33, 35	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ 𝐵 ≠ -∞)
37		nne 2930	. . . . . . . . 9 ⊢ (¬ 𝐵 ≠ -∞ ↔ 𝐵 = -∞)
38	36, 37	sylib 218	. . . . . . . 8 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 = -∞)
39		xnegeq 13174	. . . . . . . 8 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = -_𝑒-∞)
40	38, 39	syl 17	. . . . . . 7 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐵 = -_𝑒-∞)
41		xnegmnf 13177	. . . . . . 7 ⊢ -_𝑒-∞ = +∞
42	40, 41	eqtr2di 2782	. . . . . 6 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → +∞ = -_𝑒𝐵)
43	24, 42	eqtrd 2765	. . . . 5 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
44	43	ex 412	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
45		simpll 766	. . . . . 6 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -∞)
46		simplr 768	. . . . . . . . . 10 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
47	45	oveq1d 7405	. . . . . . . . . . . . 13 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (-∞ +_𝑒 𝐵))
48		simpr 484	. . . . . . . . . . . . 13 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
49	47, 48	eqtr3d 2767	. . . . . . . . . . . 12 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (-∞ +_𝑒 𝐵) = 0)
50		renemnf 11230	. . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ → 0 ≠ -∞)
51	29, 50	mp1i 13	. . . . . . . . . . . 12 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 0 ≠ -∞)
52	49, 51	eqnetrd 2993	. . . . . . . . . . 11 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (-∞ +_𝑒 𝐵) ≠ -∞)
53	52	neneqd 2931	. . . . . . . . . 10 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ (-∞ +_𝑒 𝐵) = -∞)
54		xaddmnf2 13196	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) → (-∞ +_𝑒 𝐵) = -∞)
55	54	stoic1a 1772	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ ¬ (-∞ +_𝑒 𝐵) = -∞) → ¬ 𝐵 ≠ +∞)
56	46, 53, 55	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ 𝐵 ≠ +∞)
57		nne 2930	. . . . . . . . 9 ⊢ (¬ 𝐵 ≠ +∞ ↔ 𝐵 = +∞)
58	56, 57	sylib 218	. . . . . . . 8 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 = +∞)
59		xnegeq 13174	. . . . . . . 8 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -_𝑒+∞)
60	58, 59	syl 17	. . . . . . 7 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐵 = -_𝑒+∞)
61		xnegpnf 13176	. . . . . . 7 ⊢ -_𝑒+∞ = -∞
62	60, 61	eqtr2di 2782	. . . . . 6 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -∞ = -_𝑒𝐵)
63	45, 62	eqtrd 2765	. . . . 5 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
64	63	ex 412	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
65	23, 44, 64	3jaoian 1432	. . 3 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
66	1, 65	sylanb 581	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
67		simpr 484	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → 𝐴 = -_𝑒𝐵)
68	67	oveq1d 7405	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐴 +_𝑒 𝐵) = (-_𝑒𝐵 +_𝑒 𝐵))
69		xnegcl 13180	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
70	69	ad2antlr 727	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐴 = -_𝑒𝐵) → -_𝑒𝐵 ∈ ℝ^)
71		simplr 768	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐴 = -_𝑒𝐵) → 𝐵 ∈ ℝ^)
72		xaddcom 13207	. . . . 5 ⊢ ((-_𝑒𝐵 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (-_𝑒𝐵 +_𝑒 𝐵) = (𝐵 +_𝑒 -_𝑒𝐵))
73	70, 71, 72	syl2anc 584	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (-_𝑒𝐵 +_𝑒 𝐵) = (𝐵 +_𝑒 -_𝑒𝐵))
74		xnegid 13205	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (𝐵 +_𝑒 -_𝑒𝐵) = 0)
75	74	ad2antlr 727	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐵 +_𝑒 -_𝑒𝐵) = 0)
76	68, 73, 75	3eqtrd 2769	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐴 +_𝑒 𝐵) = 0)
77	76	ex 412	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 = -_𝑒𝐵 → (𝐴 +_𝑒 𝐵) = 0))
78	66, 77	impbid 212	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 ↔ 𝐴 = -_𝑒𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ w3o 1085 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 (class class class)co 7390 ℝcr 11074 0cc0 11075 +∞cpnf 11212 -∞cmnf 11213 ℝ^*cxr 11214 -_𝑒cxne 13076 +_𝑒 cxad 13077

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-sub 11414 df-neg 11415 df-xneg 13079 df-xadd 13080

This theorem is referenced by: xrsinvgval 32953

W3C validator