proposition: Lemma mset1Dr x a B : x \in B -> x \in a +` B.
proof: Proof. by move=> Bx; rewrite !inE predU1r. Qed.
imports: mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop tuple) finmap