proposition: Lemma fsubsetUl A B : A `<=` A `|` B.
proof: Proof. by apply/fsubsetP => a; rewrite inE => ->. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)