English
For Num a,b, the gcd of a and b, viewed as a natural number, equals Nat.gcd a and b; equivalently, gcd aligns with the Nat gcd after coercions.
Русский
Для чисел Num a,b наибольший общий делитель в натуральном виде равен Nat.gcd a b (после приведения типов).
LaTeX
$$$(gcd\ a\ b : \mathbb{N}) = Nat.gcd\ a\ b$$$
Lean4
@[simp, norm_cast]
theorem div_to_nat : ∀ n d, ((n / d : Num) : ℕ) = n / d
| 0, 0 => by simp
| 0, pos _ => (Nat.zero_div _).symm
| pos _, 0 => (Nat.div_zero _).symm
| pos _, pos _ => PosNum.div'_to_nat _ _