proposition: Lemma mproper_neq A B : A `<` B -> A != B.
proof: Proof. by rewrite mproperEneq; case/andP. Qed.
imports: mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop tuple) finmap