proposition: Lemma minor_eq m n p (f1 g1 : 'I_p -> 'I_m) (f2 g2 : 'I_p -> 'I_n) (h1 : f1 =1 g1) (h2 : f2 =1 g2) (M : 'M[R]_(m,n)) : minor f1 f2 M = minor g1 g2 M.
proof: Proof. by rewrite /minor (submatrix_eq M h1 h2). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq path ssralg) mathcomp(fintype perm choice finfun matrix bigop zmodp poly mxpoly)