Metamath Proof Explorer


Theorem sgnval2

Description: Value of the signum of a real number, expresssed using absolute value. (Contributed by Thierry Arnoux, 9-Nov-2025)

Ref Expression
Assertion sgnval2 ⊢ A ∈ ℝ ∧ A ≠ 0 → sgn ⁡ A = A A

Proof

Step Hyp Ref Expression
1 simpl ⊢ A ∈ ℝ ∧ A ≠ 0 → A ∈ ℝ
2 0red ⊢ A ∈ ℝ ∧ A ≠ 0 → 0 ∈ ℝ
3 1 recnd ⊢ A ∈ ℝ ∧ A ≠ 0 → A ∈ ℂ
4 3 adantr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A ∈ ℂ
5 simplr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A ≠ 0
6 4 4 5 divneg2d ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → − A A = A − A
7 simpr ⊢ A ∈ ℝ ∧ A ≠ 0 → A ≠ 0
8 3 7 dividd ⊢ A ∈ ℝ ∧ A ≠ 0 → A A = 1
9 8 adantr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A A = 1
10 9 negeqd ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → − A A = − 1
11 6 10 eqtr3d ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A − A = − 1
12 absnid ⊢ A ∈ ℝ ∧ A ≤ 0 → A = − A
13 12 adantlr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A = − A
14 13 oveq2d ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A A = A − A
15 1 rexrd ⊢ A ∈ ℝ ∧ A ≠ 0 → A ∈ ℝ *
16 1 adantr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A ∈ ℝ
17 0red ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → 0 ∈ ℝ
18 simpr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A ≤ 0
19 7 necomd ⊢ A ∈ ℝ ∧ A ≠ 0 → 0 ≠ A
20 19 adantr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → 0 ≠ A
21 16 17 18 20 leneltd ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → A < 0
22 sgnn ⊢ A ∈ ℝ * ∧ A < 0 → sgn ⁡ A = − 1
23 15 21 22 syl2an2r ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → sgn ⁡ A = − 1
24 11 14 23 3eqtr4rd ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ A ≤ 0 → sgn ⁡ A = A A
25 8 adantr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → A A = 1
26 1 adantr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → A ∈ ℝ
27 simpr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → 0 ≤ A
28 26 27 absidd ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → A = A
29 28 oveq2d ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → A A = A A
30 simplr ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → A ≠ 0
31 26 27 30 ne0gt0d ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → 0 < A
32 sgnp ⊢ A ∈ ℝ * ∧ 0 < A → sgn ⁡ A = 1
33 15 31 32 syl2an2r ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → sgn ⁡ A = 1
34 25 29 33 3eqtr4rd ⊢ A ∈ ℝ ∧ A ≠ 0 ∧ 0 ≤ A → sgn ⁡ A = A A
35 1 2 24 34 lecasei ⊢ A ∈ ℝ ∧ A ≠ 0 → sgn ⁡ A = A A