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 31658

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 13037	. . 3 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		simpll 765	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 ∈ ℝ)
3	2	rexrd 11205	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 ∈ ℝ^)
4		xnegneg 13133	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → -_𝑒-_𝑒𝐴 = 𝐴)
5	3, 4	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒-_𝑒𝐴 = 𝐴)
6	3	xnegcld 13219	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐴 ∈ ℝ^)
7		xaddid2 13161	. . . . . . . . 9 ⊢ (-_𝑒𝐴 ∈ ℝ^* → (0 +_𝑒 -_𝑒𝐴) = -_𝑒𝐴)
8	6, 7	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (0 +_𝑒 -_𝑒𝐴) = -_𝑒𝐴)
9		simplr 767	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
10		xaddcom 13159	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
11	3, 9, 10	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
12	11	oveq1d 7372	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐴 +_𝑒 𝐵) +_𝑒 -_𝑒𝐴) = ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴))
13		simpr 485	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
14	13	oveq1d 7372	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐴 +_𝑒 𝐵) +_𝑒 -_𝑒𝐴) = (0 +_𝑒 -_𝑒𝐴))
15		xpncan 13170	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐴 ∈ ℝ) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
16	15	ancoms 459	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
17	16	adantr 481	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ((𝐵 +_𝑒 𝐴) +_𝑒 -_𝑒𝐴) = 𝐵)
18	12, 14, 17	3eqtr3d 2784	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (0 +_𝑒 -_𝑒𝐴) = 𝐵)
19	8, 18	eqtr3d 2778	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐴 = 𝐵)
20		xnegeq 13126	. . . . . . 7 ⊢ (-_𝑒𝐴 = 𝐵 → -_𝑒-_𝑒𝐴 = -_𝑒𝐵)
21	19, 20	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒-_𝑒𝐴 = -_𝑒𝐵)
22	5, 21	eqtr3d 2778	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
23	22	ex 413	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
24		simpll 765	. . . . . 6 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = +∞)
25		simplr 767	. . . . . . . . . 10 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
26	24	oveq1d 7372	. . . . . . . . . . . . 13 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (+∞ +_𝑒 𝐵))
27		simpr 485	. . . . . . . . . . . . 13 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
28	26, 27	eqtr3d 2778	. . . . . . . . . . . 12 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (+∞ +_𝑒 𝐵) = 0)
29		0re 11157	. . . . . . . . . . . . 13 ⊢ 0 ∈ ℝ
30		renepnf 11203	. . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ → 0 ≠ +∞)
31	29, 30	mp1i 13	. . . . . . . . . . . 12 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 0 ≠ +∞)
32	28, 31	eqnetrd 3011	. . . . . . . . . . 11 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (+∞ +_𝑒 𝐵) ≠ +∞)
33	32	neneqd 2948	. . . . . . . . . 10 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ (+∞ +_𝑒 𝐵) = +∞)
34		xaddpnf2 13146	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) → (+∞ +_𝑒 𝐵) = +∞)
35	34	stoic1a 1774	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ ¬ (+∞ +_𝑒 𝐵) = +∞) → ¬ 𝐵 ≠ -∞)
36	25, 33, 35	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ 𝐵 ≠ -∞)
37		nne 2947	. . . . . . . . 9 ⊢ (¬ 𝐵 ≠ -∞ ↔ 𝐵 = -∞)
38	36, 37	sylib 217	. . . . . . . 8 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 = -∞)
39		xnegeq 13126	. . . . . . . 8 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = -_𝑒-∞)
40	38, 39	syl 17	. . . . . . 7 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐵 = -_𝑒-∞)
41		xnegmnf 13129	. . . . . . 7 ⊢ -_𝑒-∞ = +∞
42	40, 41	eqtr2di 2793	. . . . . 6 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → +∞ = -_𝑒𝐵)
43	24, 42	eqtrd 2776	. . . . 5 ⊢ (((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
44	43	ex 413	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
45		simpll 765	. . . . . 6 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -∞)
46		simplr 767	. . . . . . . . . 10 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 ∈ ℝ^)
47	45	oveq1d 7372	. . . . . . . . . . . . 13 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = (-∞ +_𝑒 𝐵))
48		simpr 485	. . . . . . . . . . . . 13 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (𝐴 +_𝑒 𝐵) = 0)
49	47, 48	eqtr3d 2778	. . . . . . . . . . . 12 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (-∞ +_𝑒 𝐵) = 0)
50		renemnf 11204	. . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ → 0 ≠ -∞)
51	29, 50	mp1i 13	. . . . . . . . . . . 12 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 0 ≠ -∞)
52	49, 51	eqnetrd 3011	. . . . . . . . . . 11 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → (-∞ +_𝑒 𝐵) ≠ -∞)
53	52	neneqd 2948	. . . . . . . . . 10 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ (-∞ +_𝑒 𝐵) = -∞)
54		xaddmnf2 13148	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) → (-∞ +_𝑒 𝐵) = -∞)
55	54	stoic1a 1774	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ ¬ (-∞ +_𝑒 𝐵) = -∞) → ¬ 𝐵 ≠ +∞)
56	46, 53, 55	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → ¬ 𝐵 ≠ +∞)
57		nne 2947	. . . . . . . . 9 ⊢ (¬ 𝐵 ≠ +∞ ↔ 𝐵 = +∞)
58	56, 57	sylib 217	. . . . . . . 8 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐵 = +∞)
59		xnegeq 13126	. . . . . . . 8 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -_𝑒+∞)
60	58, 59	syl 17	. . . . . . 7 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -_𝑒𝐵 = -_𝑒+∞)
61		xnegpnf 13128	. . . . . . 7 ⊢ -_𝑒+∞ = -∞
62	60, 61	eqtr2di 2793	. . . . . 6 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → -∞ = -_𝑒𝐵)
63	45, 62	eqtrd 2776	. . . . 5 ⊢ (((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 +_𝑒 𝐵) = 0) → 𝐴 = -_𝑒𝐵)
64	63	ex 413	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
65	23, 44, 64	3jaoian 1429	. . 3 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
66	1, 65	sylanb 581	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 → 𝐴 = -_𝑒𝐵))
67		simpr 485	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → 𝐴 = -_𝑒𝐵)
68	67	oveq1d 7372	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐴 +_𝑒 𝐵) = (-_𝑒𝐵 +_𝑒 𝐵))
69		xnegcl 13132	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
70	69	ad2antlr 725	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐴 = -_𝑒𝐵) → -_𝑒𝐵 ∈ ℝ^)
71		simplr 767	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐴 = -_𝑒𝐵) → 𝐵 ∈ ℝ^)
72		xaddcom 13159	. . . . 5 ⊢ ((-_𝑒𝐵 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (-_𝑒𝐵 +_𝑒 𝐵) = (𝐵 +_𝑒 -_𝑒𝐵))
73	70, 71, 72	syl2anc 584	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (-_𝑒𝐵 +_𝑒 𝐵) = (𝐵 +_𝑒 -_𝑒𝐵))
74		xnegid 13157	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (𝐵 +_𝑒 -_𝑒𝐵) = 0)
75	74	ad2antlr 725	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐵 +_𝑒 -_𝑒𝐵) = 0)
76	68, 73, 75	3eqtrd 2780	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐴 = -_𝑒𝐵) → (𝐴 +_𝑒 𝐵) = 0)
77	76	ex 413	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 = -_𝑒𝐵 → (𝐴 +_𝑒 𝐵) = 0))
78	66, 77	impbid 211	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴 +_𝑒 𝐵) = 0 ↔ 𝐴 = -_𝑒𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ w3o 1086 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 (class class class)co 7357 ℝcr 11050 0cc0 11051 +∞cpnf 11186 -∞cmnf 11187 ℝ^*cxr 11188 -_𝑒cxne 13030 +_𝑒 cxad 13031

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 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127

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 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-po 5545 df-so 5546 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7921 df-2nd 7922 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-sub 11387 df-neg 11388 df-xneg 13033 df-xadd 13034

This theorem is referenced by: xrsinvgval 31868

W3C validator