Metamath Proof Explorer


Theorem 2neggcd

Description: Negating both operands of the gcd operator does not alter the result. (Contributed by AV, 7-Nov-2026)

Ref Expression
Assertion 2neggcd ⊢ M ∈ ℤ ∧ N ∈ ℤ → -M gcd -N = M gcd N

Proof

Step Hyp Ref Expression
1 znegcl ⊢ M ∈ ℤ → − M ∈ ℤ
2 gcdneg ⊢ − M ∈ ℤ ∧ N ∈ ℤ → -M gcd -N = -M gcd N
3 1 2 sylan ⊢ M ∈ ℤ ∧ N ∈ ℤ → -M gcd -N = -M gcd N
4 neggcd ⊢ M ∈ ℤ ∧ N ∈ ℤ → -M gcd N = M gcd N
5 3 4 eqtrd ⊢ M ∈ ℤ ∧ N ∈ ℤ → -M gcd -N = M gcd N