proposition: Lemma vert_bound: forall (g: UAdjMatGG) v, vvalid g v <-> 0 <= v < size.
proof: Proof. intros. apply (vvalid_meaning g). Qed.
imports: VST.floyd.proofauto CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.lib.find_lemmas CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.undirected_graph CertiGraph.graph.MathAdjMatGraph