proposition: Lemma mset0I A : mset0 `&` A = mset0.
proof: Proof. by apply/msetP => x; rewrite !msetE min0n. Qed.
imports: mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop tuple) finmap