proposition: Lemma fset0U A : fset0 `|` A = A.
proof: Proof. by apply/fsetP => x; rewrite !inE orFb. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)