proposition: Lemma reachable_through_empty (g: Gph): Same_set (reachable_through_set g nil) (Empty_set V).
proof: Proof. split; repeat intro. destruct H; destruct H; apply in_nil in H; tauto. hnf in H; 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