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