Metamath Proof Explorer


Theorem xaddeq0

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

Ref Expression
Assertion xaddeq0 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A + 𝑒 B = 0 ↔ A = − B

Proof

Step Hyp Ref Expression
1 elxr ⊢ A ∈ ℝ * ↔ A ∈ ℝ ∨ A = +∞ ∨ A = −∞
2 simpll ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A ∈ ℝ
3 2 rexrd ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A ∈ ℝ *
4 xnegneg ⊢ A ∈ ℝ * → − − A = A
5 3 4 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → − − A = A
6 3 xnegcld ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → − A ∈ ℝ *
7 xaddlid ⊢ − A ∈ ℝ * → 0 + 𝑒 − A = − A
8 6 7 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → 0 + 𝑒 − A = − A
9 simplr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → B ∈ ℝ *
10 xaddcom ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A + 𝑒 B = B + 𝑒 A
11 3 9 10 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B = B + 𝑒 A
12 11 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B + 𝑒 − A = B + 𝑒 A + 𝑒 − A
13 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B = 0
14 13 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B + 𝑒 − A = 0 + 𝑒 − A
15 xpncan ⊢ B ∈ ℝ * ∧ A ∈ ℝ → B + 𝑒 A + 𝑒 − A = B
16 15 ancoms ⊢ A ∈ ℝ ∧ B ∈ ℝ * → B + 𝑒 A + 𝑒 − A = B
17 16 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → B + 𝑒 A + 𝑒 − A = B
18 12 14 17 3eqtr3d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → 0 + 𝑒 − A = B
19 8 18 eqtr3d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → − A = B
20 xnegeq ⊢ − A = B → − − A = − B
21 19 20 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → − − A = − B
22 5 21 eqtr3d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A = − B
23 22 ex ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A + 𝑒 B = 0 → A = − B
24 simpll ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A = +∞
25 simplr ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → B ∈ ℝ *
26 24 oveq1d ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B = +∞ + 𝑒 B
27 simpr ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B = 0
28 26 27 eqtr3d ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → +∞ + 𝑒 B = 0
29 0re ⊢ 0 ∈ ℝ
30 renepnf ⊢ 0 ∈ ℝ → 0 ≠ +∞
31 29 30 mp1i ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → 0 ≠ +∞
32 28 31 eqnetrd ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → +∞ + 𝑒 B ≠ +∞
33 32 neneqd ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → ¬ +∞ + 𝑒 B = +∞
34 xaddpnf2 ⊢ B ∈ ℝ * ∧ B ≠ −∞ → +∞ + 𝑒 B = +∞
35 34 stoic1a ⊢ B ∈ ℝ * ∧ ¬ +∞ + 𝑒 B = +∞ → ¬ B ≠ −∞
36 25 33 35 syl2anc ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → ¬ B ≠ −∞
37 nne ⊢ ¬ B ≠ −∞ ↔ B = −∞
38 36 37 sylib ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → B = −∞
39 xnegeq ⊢ B = −∞ → − B = − −∞
40 38 39 syl ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → − B = − −∞
41 xnegmnf ⊢ − −∞ = +∞
42 40 41 eqtr2di ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → +∞ = − B
43 24 42 eqtrd ⊢ A = +∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A = − B
44 43 ex ⊢ A = +∞ ∧ B ∈ ℝ * → A + 𝑒 B = 0 → A = − B
45 simpll ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A = −∞
46 simplr ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → B ∈ ℝ *
47 45 oveq1d ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B = −∞ + 𝑒 B
48 simpr ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A + 𝑒 B = 0
49 47 48 eqtr3d ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → −∞ + 𝑒 B = 0
50 renemnf ⊢ 0 ∈ ℝ → 0 ≠ −∞
51 29 50 mp1i ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → 0 ≠ −∞
52 49 51 eqnetrd ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → −∞ + 𝑒 B ≠ −∞
53 52 neneqd ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → ¬ −∞ + 𝑒 B = −∞
54 xaddmnf2 ⊢ B ∈ ℝ * ∧ B ≠ +∞ → −∞ + 𝑒 B = −∞
55 54 stoic1a ⊢ B ∈ ℝ * ∧ ¬ −∞ + 𝑒 B = −∞ → ¬ B ≠ +∞
56 46 53 55 syl2anc ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → ¬ B ≠ +∞
57 nne ⊢ ¬ B ≠ +∞ ↔ B = +∞
58 56 57 sylib ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → B = +∞
59 xnegeq ⊢ B = +∞ → − B = − +∞
60 58 59 syl ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → − B = − +∞
61 xnegpnf ⊢ − +∞ = −∞
62 60 61 eqtr2di ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → −∞ = − B
63 45 62 eqtrd ⊢ A = −∞ ∧ B ∈ ℝ * ∧ A + 𝑒 B = 0 → A = − B
64 63 ex ⊢ A = −∞ ∧ B ∈ ℝ * → A + 𝑒 B = 0 → A = − B
65 23 44 64 3jaoian ⊢ A ∈ ℝ ∨ A = +∞ ∨ A = −∞ ∧ B ∈ ℝ * → A + 𝑒 B = 0 → A = − B
66 1 65 sylanb ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A + 𝑒 B = 0 → A = − B
67 simpr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → A = − B
68 67 oveq1d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → A + 𝑒 B = − B + 𝑒 B
69 xnegcl ⊢ B ∈ ℝ * → − B ∈ ℝ *
70 69 ad2antlr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → − B ∈ ℝ *
71 simplr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → B ∈ ℝ *
72 xaddcom ⊢ − B ∈ ℝ * ∧ B ∈ ℝ * → − B + 𝑒 B = B + 𝑒 − B
73 70 71 72 syl2anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → − B + 𝑒 B = B + 𝑒 − B
74 xnegid ⊢ B ∈ ℝ * → B + 𝑒 − B = 0
75 74 ad2antlr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → B + 𝑒 − B = 0
76 68 73 75 3eqtrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A = − B → A + 𝑒 B = 0
77 76 ex ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A = − B → A + 𝑒 B = 0
78 66 77 impbid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A + 𝑒 B = 0 ↔ A = − B