proposition: Lemma col_leq_rank m n (A : 'M_(m, n)) : (n <= \rank A) = row_full A.
proof: Proof. by rewrite /row_full eqn_leq rank_leq_col. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype finfun bigop finset fingroup perm order) mathcomp(div prime binomial ssralg finalg zmodp matrix)