proposition: Corollary vertex_representable: forall (g: EdgeListGG) v, vvalid g v -> Int.min_signed <= v < Int.max_signed.
proof: Proof. intros. apply (vertex_valid g) in H. pose proof Int.min_signed_neg. lia. Qed.
imports: VST.floyd.proofauto CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph CertiGraph.graph.undirected_graph