proposition: Lemma uf_root_vgamma: forall (g: UFGraph) v n, vvalid g v -> vgamma g v = (n, v) -> uf_root g v v.
proof: Proof. intros. split; [apply reachable_refl | intros; apply (parent_loop g _ n)]; auto. Qed.
imports: Coq.Sets.Ensembles Coq.Lists.List CertiGraph.lib.EquivDec_ext CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph CertiGraph.graph.MathGraph CertiGraph.graph.LstGraph CertiGraph.graph.UnionFind