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 32952

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 13118	. . 3 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		simpll 776	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 ∈ ℝ)
3	2	rexrd 11232	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 ∈ ℝ^)
4		xnegneg 13217	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → -_𝑒-_𝑒𝐴 = 𝐴)
5	3, 4	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒-_𝑒𝐴 = 𝐴)
6	3	xnegcld 13303	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐴 ∈ ℝ^)
7		xaddlid 13245	. . . . . . . . 9 ⊢ (-_𝑒𝐴 ∈ ℝ^* → (0 +_𝑒 -_𝑒𝐴) = -_𝑒𝐴)
8	6, 7	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (0 +_𝑒 -_𝑒𝐴) = -_𝑒𝐴)
9		simplr 778	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
10		xaddcom 13243	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
11	3, 9, 10	syl2anc 593	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
12	11	oveq1d 7411	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐴 +_𝑒 𝐵) +_𝑒 -_𝑒𝐴) = ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴))
13		simpr 488	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
14	13	oveq1d 7411	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐴 +_𝑒 𝐵) +_𝑒 -_𝑒𝐴) = (0 +_𝑒 -_𝑒𝐴))
15		xpncan 13254	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐴 ∈ ℝ) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
16	15	ancoms 462	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
17	16	adantr 484	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
18	12, 14, 17	3eqtr3d 2805	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (0 +_𝑒 -_𝑒𝐴) = 𝐵)
19	8, 18	eqtr3d 2799	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐴 = 𝐵)
20		xnegeq 13210	. . . . . . 7 ⊢ (-_𝑒𝐴 = 𝐵 → -_𝑒-_𝑒𝐴 = -_𝑒𝐵)
21	19, 20	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒-_𝑒𝐴 = -_𝑒𝐵)
22	5, 21	eqtr3d 2799	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
23	22	ex 416	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
24		simpll 776	. . . . . 6 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = +∞)
25		simplr 778	. . . . . . . . . 10 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
26	24	oveq1d 7411	. . . . . . . . . . . . 13 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (+∞ +_𝑒 𝐵))
27		simpr 488	. . . . . . . . . . . . 13 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
28	26, 27	eqtr3d 2799	. . . . . . . . . . . 12 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (+∞ +_𝑒 𝐵) = 0)
29		0re 11183	. . . . . . . . . . . . 13 ⊢ 0 ∈ ℝ
30		renepnf 11230	. . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ → 0 ≠ +∞)
31	29, 30	mp1i 13	. . . . . . . . . . . 12 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 0 ≠ +∞)
32	28, 31	eqnetrd 3024	. . . . . . . . . . 11 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (+∞ +_𝑒 𝐵) ≠ +∞)
33	32	neneqd 2962	. . . . . . . . . 10 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ (+∞ +_𝑒 𝐵) = +∞)
34		xaddpnf2 13230	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) → (+∞ +_𝑒 𝐵) = +∞)
35	34	stoic1a 1792	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ ¬ (+∞ +_𝑒 𝐵) = +∞) → ¬ 𝐵 ≠ -∞)
36	25, 33, 35	syl2anc 593	. . . . . . . . 9 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ 𝐵 ≠ -∞)
37		nne 2961	. . . . . . . . 9 ⊢ (¬ 𝐵 ≠ -∞ ↔ 𝐵 = -∞)
38	36, 37	sylib 220	. . . . . . . 8 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 = -∞)
39		xnegeq 13210	. . . . . . . 8 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = -_𝑒-∞)
40	38, 39	syl 17	. . . . . . 7 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐵 = -_𝑒-∞)
41		xnegmnf 13213	. . . . . . 7 ⊢ -_𝑒-∞ = +∞
42	40, 41	eqtr2di 2814	. . . . . 6 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → +∞ = -_𝑒𝐵)
43	24, 42	eqtrd 2797	. . . . 5 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
44	43	ex 416	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
45		simpll 776	. . . . . 6 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -∞)
46		simplr 778	. . . . . . . . . 10 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
47	45	oveq1d 7411	. . . . . . . . . . . . 13 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (-∞ +_𝑒 𝐵))
48		simpr 488	. . . . . . . . . . . . 13 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
49	47, 48	eqtr3d 2799	. . . . . . . . . . . 12 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (-∞ +_𝑒 𝐵) = 0)
50		renemnf 11231	. . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ → 0 ≠ -∞)
51	29, 50	mp1i 13	. . . . . . . . . . . 12 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 0 ≠ -∞)
52	49, 51	eqnetrd 3024	. . . . . . . . . . 11 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (-∞ +_𝑒 𝐵) ≠ -∞)
53	52	neneqd 2962	. . . . . . . . . 10 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ (-∞ +_𝑒 𝐵) = -∞)
54		xaddmnf2 13232	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) → (-∞ +_𝑒 𝐵) = -∞)
55	54	stoic1a 1792	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ ¬ (-∞ +_𝑒 𝐵) = -∞) → ¬ 𝐵 ≠ +∞)
56	46, 53, 55	syl2anc 593	. . . . . . . . 9 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ 𝐵 ≠ +∞)
57		nne 2961	. . . . . . . . 9 ⊢ (¬ 𝐵 ≠ +∞ ↔ 𝐵 = +∞)
58	56, 57	sylib 220	. . . . . . . 8 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 = +∞)
59		xnegeq 13210	. . . . . . . 8 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -_𝑒+∞)
60	58, 59	syl 17	. . . . . . 7 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐵 = -_𝑒+∞)
61		xnegpnf 13212	. . . . . . 7 ⊢ -_𝑒+∞ = -∞
62	60, 61	eqtr2di 2814	. . . . . 6 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -∞ = -_𝑒𝐵)
63	45, 62	eqtrd 2797	. . . . 5 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
64	63	ex 416	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
65	23, 44, 64	3jaoian 1450	. . 3 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
66	1, 65	sylanb 590	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
67		simpr 488	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → 𝐴 = -_𝑒𝐵)
68	67	oveq1d 7411	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐴 +_𝑒 𝐵) = (-_𝑒𝐵 +_𝑒 𝐵))
69		xnegcl 13216	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
70	69	ad2antlr 737	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐴 = -_𝑒𝐵) → -_𝑒𝐵 ∈ ℝ^)
71		simplr 778	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐴 = -_𝑒𝐵) → 𝐵 ∈ ℝ^)
72		xaddcom 13243	. . . . 5 ⊢ ((-_𝑒𝐵 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (-_𝑒𝐵 +_𝑒 𝐵) = (𝐵 +_𝑒 -_𝑒𝐵))
73	70, 71, 72	syl2anc 593	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (-_𝑒𝐵 +_𝑒 𝐵) = (𝐵 +_𝑒 -_𝑒𝐵))
74		xnegid 13241	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (𝐵 +_𝑒 -_𝑒𝐵) = 0)
75	74	ad2antlr 737	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐵 +_𝑒 -_𝑒𝐵) = 0)
76	68, 73, 75	3eqtrd 2801	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐴 +_𝑒 𝐵) = 0)
77	76	ex 416	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 = -_𝑒𝐵 → (𝐴 +_𝑒 𝐵) = 0))
78	66, 77	impbid 214	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 ↔ 𝐴 = -_𝑒𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ w3o 1097 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 (class class class)co 7396 ℝcr 11072 0cc0 11073 +∞cpnf 11213 -∞cmnf 11214 ℝ^*cxr 11215 -_𝑒cxne 13111 +_𝑒 cxad 13112

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-1st 7970 df-2nd 7971 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-sub 11416 df-neg 11417 df-xneg 13114 df-xadd 13115

This theorem is referenced by: xrsinvgval 33183

W3C validator