proposition: Lemma ltmx_irrefl m n : irreflexive (@ltmx F m m n).
proof: Proof. by move=> A; rewrite /ltmx submx_refl andbF. 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)