proposition: Lemma reachable_set_list_EnumCovered: forall (g: Gph) S l, reachable_set_list g S l -> EnumCovered V (reachable_through_set g S).
proof: Proof. unfold reachable_set_list, EnumCovered, Ensembles.In. intros. exists (nodup equiv_dec l). split. + apply NoDup_nodup. + intros y ?. specialize (H y). rewrite nodup_In. tauto. Qed.
imports: Coq.Logic.ProofIrrelevance Coq.micromega.Lia CertiGraph.lib.Coqlib CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model Coq.Lists.List Coq.Lists.ListDec