proposition: Lemma edgeless_graph_disconnected: forall u v, u <> v -> ~ connected edgeless_graph u v.
proof: Proof. unfold not; intros. destruct H0 as [p [? [? ?]]]. destruct p. inversion H1. destruct p. inversion H1; inversion H2. subst u; subst v. contradiction. destruct H0. destruct H0. destruct H0. destruct H0. pose proof (edgeless_graph_evalid x). contradiction. 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