proposition: Lemma weight_inf_bound: forall (g: UAdjMatGG) e, elabel g e <= inf.
proof: Proof. intros. destruct (evalid_dec g e). apply Z.lt_le_incl. apply (evalid_meaning g e). auto. apply (invalid_edge_weight g) in n. replace (elabel g e) with inf in * by trivial. lia. 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