Metamath Proof Explorer


Theorem nn0gcdid0

Description: The gcd of a nonnegative integer with 0 is itself. (Contributed by Paul Chapman, 31-Mar-2011)

Ref Expression
Assertion nn0gcdid0 ⊢ N ∈ ℕ 0 → N gcd 0 = N

Proof

Step Hyp Ref Expression
1 nn0z ⊢ N ∈ ℕ 0 → N ∈ ℤ
2 gcdid0 ⊢ N ∈ ℤ → N gcd 0 = N
3 1 2 syl ⊢ N ∈ ℕ 0 → N gcd 0 = N
4 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
5 nn0ge0 ⊢ N ∈ ℕ 0 → 0 ≤ N
6 4 5 absidd ⊢ N ∈ ℕ 0 → N = N
7 3 6 eqtrd ⊢ N ∈ ℕ 0 → N gcd 0 = N