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 ( ( 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ) → ( - 𝑀 gcd - 𝑁 ) = ( 𝑀 gcd 𝑁 ) )

Proof

Step Hyp Ref Expression
1 znegcl ⊢ ( 𝑀 ∈ ℤ → - 𝑀 ∈ ℤ )
2 gcdneg ⊢ ( ( - 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ) → ( - 𝑀 gcd - 𝑁 ) = ( - 𝑀 gcd 𝑁 ) )
3 1 2 sylan ⊢ ( ( 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ) → ( - 𝑀 gcd - 𝑁 ) = ( - 𝑀 gcd 𝑁 ) )
4 neggcd ⊢ ( ( 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ) → ( - 𝑀 gcd 𝑁 ) = ( 𝑀 gcd 𝑁 ) )
5 3 4 eqtrd ⊢ ( ( 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ) → ( - 𝑀 gcd - 𝑁 ) = ( 𝑀 gcd 𝑁 ) )