proposition: Lemma set_inP (T : finType) (A : {pred T}) (p : pred T) x : reflect (x \in A /\ p x) (x \in [set x in A | p x]).
proof: Proof. rewrite !inE; exact: andP. Qed.
imports: Coq(Setoid Morphisms) mathcomp(all_ssreflect) GraphTheory(edone)