proposition: Lemma cindexpC a b p c : cindex a b p (c%:P) = 0.
proof: Proof. have [lt_ab|le_ba] := ltrP a b; last by rewrite cindexEba. by rewrite /cindex /jump rootsC big_nil. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice path fintype) mathcomp(div bigop order ssralg poly polydiv ssrnum perm zmodp ssrint) mathcomp(polyorder polyrcf interval matrix mxtens)