If d is the gcd, then by the extended Euclidean algorithm there are polynomials p and q with d = pa + qb. Thus the common divisor c is also a divisor of d and its degree is less than or equal to the degree of d. This implies that c is a scalar multiple of d and thus also a greatest common divisor of a and b.