proposition: Lemma Zseq_NoDup: forall z, NoDup (Zseq z).
proof: Proof. unfold Zseq; intros. destruct z; simpl; try apply NoDup_nil. apply FinFun.Injective_map_NoDup. unfold FinFun.Injective. apply Nat2Z.inj. apply seq_NoDup. 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