proposition: Lemma setU1r x a B : x \in B -> x \in a |: B.
proof: Proof. by move=> Bx; rewrite !inE predU1r. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop)