proposition: Lemma set0Pn A : reflect (exists x, x \in A) (A != set0).
proof: Proof. by rewrite -cards_eq0; apply: existsP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop)