Metamath Proof Explorer


Theorem renegneg

Description: A real number is equal to the negative of its negative. Compare negneg . (Contributed by SN, 13-Feb-2024)

Ref Expression
Assertion renegneg ⊢ A ∈ ℝ → 0 - ℝ 0 - ℝ A = A

Proof

Step Hyp Ref Expression
1 rernegcl ⊢ A ∈ ℝ → 0 - ℝ A ∈ ℝ
2 rernegcl ⊢ 0 - ℝ A ∈ ℝ → 0 - ℝ 0 - ℝ A ∈ ℝ
3 1 2 syl ⊢ A ∈ ℝ → 0 - ℝ 0 - ℝ A ∈ ℝ
4 id ⊢ A ∈ ℝ → A ∈ ℝ
5 renegid ⊢ A ∈ ℝ → A + 0 - ℝ A = 0
6 elre0re ⊢ A ∈ ℝ → 0 ∈ ℝ
7 5 6 eqeltrd ⊢ A ∈ ℝ → A + 0 - ℝ A ∈ ℝ
8 readdrid ⊢ A ∈ ℝ → A + 0 = A
9 repncan3 ⊢ 0 - ℝ A ∈ ℝ ∧ 0 ∈ ℝ → 0 - ℝ A + 0 - ℝ 0 - ℝ A = 0
10 1 6 9 syl2anc ⊢ A ∈ ℝ → 0 - ℝ A + 0 - ℝ 0 - ℝ A = 0
11 10 oveq2d ⊢ A ∈ ℝ → A + 0 - ℝ A + 0 - ℝ 0 - ℝ A = A + 0
12 readdlid ⊢ A ∈ ℝ → 0 + A = A
13 8 11 12 3eqtr4d ⊢ A ∈ ℝ → A + 0 - ℝ A + 0 - ℝ 0 - ℝ A = 0 + A
14 recn ⊢ A ∈ ℝ → A ∈ ℂ
15 1 recnd ⊢ A ∈ ℝ → 0 - ℝ A ∈ ℂ
16 3 recnd ⊢ A ∈ ℝ → 0 - ℝ 0 - ℝ A ∈ ℂ
17 14 15 16 addassd ⊢ A ∈ ℝ → A + 0 - ℝ A + 0 - ℝ 0 - ℝ A = A + 0 - ℝ A + 0 - ℝ 0 - ℝ A
18 5 oveq1d ⊢ A ∈ ℝ → A + 0 - ℝ A + A = 0 + A
19 13 17 18 3eqtr4d ⊢ A ∈ ℝ → A + 0 - ℝ A + 0 - ℝ 0 - ℝ A = A + 0 - ℝ A + A
20 readdcan ⊢ 0 - ℝ 0 - ℝ A ∈ ℝ ∧ A ∈ ℝ ∧ A + 0 - ℝ A ∈ ℝ → A + 0 - ℝ A + 0 - ℝ 0 - ℝ A = A + 0 - ℝ A + A ↔ 0 - ℝ 0 - ℝ A = A
21 20 biimpa ⊢ 0 - ℝ 0 - ℝ A ∈ ℝ ∧ A ∈ ℝ ∧ A + 0 - ℝ A ∈ ℝ ∧ A + 0 - ℝ A + 0 - ℝ 0 - ℝ A = A + 0 - ℝ A + A → 0 - ℝ 0 - ℝ A = A
22 3 4 7 19 21 syl31anc ⊢ A ∈ ℝ → 0 - ℝ 0 - ℝ A = A