Metamath Proof Explorer


Theorem dgradd

Description: The degree of a sum of polynomials is at most the maximum of the degrees. (Contributed by Mario Carneiro, 24-Jul-2014)

Ref Expression
Hypotheses dgradd.1 ⊢ M = deg ⁡ F
dgradd.2 ⊢ N = deg ⁡ G
Assertion dgradd ⊢ F ∈ Poly ⁡ S ∧ G ∈ Poly ⁡ S → deg ⁡ F + f G ≤ if M ≤ N N M

Proof

Step Hyp Ref Expression
1 dgradd.1 ⊢ M = deg ⁡ F
2 dgradd.2 ⊢ N = deg ⁡ G
3 eqid ⊢ coeff ⁡ F = coeff ⁡ F
4 eqid ⊢ coeff ⁡ G = coeff ⁡ G
5 3 4 1 2 coeaddlem ⊢ F ∈ Poly ⁡ S ∧ G ∈ Poly ⁡ S → coeff ⁡ F + f G = coeff ⁡ F + f coeff ⁡ G ∧ deg ⁡ F + f G ≤ if M ≤ N N M
6 5 simprd ⊢ F ∈ Poly ⁡ S ∧ G ∈ Poly ⁡ S → deg ⁡ F + f G ≤ if M ≤ N N M