proposition: Theorem finite_reachable_computable: forall x, vvalid G x -> (EnumCovered V (reachable G x)) -> {l': list V | reachable_list G x l' /\ NoDup l'}.
proof: Proof. intros. remember (construct_reachable (length (proj1_sig X), x :: nil, nil)). pose proof (finite_reachable_computable' x X l H Heql). exists l; auto. Qed.
imports: Coq.Sets.Finite_sets Coq.Arith.Arith Coq.Logic.ProofIrrelevance Coq.Logic.FunctionalExtensionality Coq.Sorting.Permutation Coq.micromega.Lia CertiGraph.lib.Coqlib CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles Coq.Lists.List VST.msl.Coqlib2 CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph