proposition: Lemma mproper_sub A B : A `<` B -> A `<=` B.
proof: Proof. by rewrite msubEproper orbC => ->. Qed.
imports: mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop tuple) finmap