proposition: Lemma bareissE n (M : 'M[{poly R}]_(1 + n)) (H : forall p (h h' : p < 1 + n), pminor h h' M \is monic) : bareiss M = \det M.
proof: Proof. rewrite /bareiss -(@bareiss_recE n 1 M) ?monic1 ?expr1n ?mul1r //. by move=> k f g; rewrite expr1n rdvd1p. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq path ssralg) mathcomp(fintype perm choice matrix bigop zmodp poly polydiv mxpoly) CoqEAL(minor hrel param refinements seqmx)