proposition: Lemma monic_wd : forall (p p' : RX) n, p [=] p' -> monic n p -> monic n p'.
proof: Proof. unfold monic in |- *. intros. elim H0. clear H0. intros. split. Step_final (nth_coeff n p). apply degree_le_wd with p; auto. Qed.
imports: CoRN.algebra.CPoly_NthCoeff CoRN.algebra.CFields CoRN.tactics.Rational Lia