proposition: Lemma cindexR0p p : cindexR 0 p = 0.
proof: Proof. by rewrite /cindexR big1 // => q _; rewrite jump0p. 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)