proposition: Lemma dividK m n (I : 'cV[R]_m) (J : 'cV[R]_n) : (I <= J)%IS -> divid I J *m J = I.
proof: Proof. by rewrite /divid; case: subidP => //= p; case: sig_eqW. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq path) mathcomp(ssralg fintype perm choice fingroup) mathcomp(matrix bigop zmodp mxalgebra poly) ssrcomplements