proposition: Lemma evalid_inf_iff: forall (g: UAdjMatGG) e, evalid g e <-> elabel g e < inf.
proof: Proof. intros; split; intros. apply (evalid_meaning g); auto. destruct (evalid_dec g e). auto. exfalso. rewrite (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