proposition: Lemma gepl_DoubleNoDup: forall g l, DoubleNoDup l -> DoubleNoDup (gen_edge_pair_list g l).
proof: Proof. intros g l. revert g. induction l; intros. 1: unfold gen_edge_pair_list; simpl; constructor. unfold gen_edge_pair_list. simpl. fold (gen_edge_pair_list g l). destruct a as [v1 v2]. apply DoubleNoDup_cons_iff in H. destruct H as [? [? [? ?]]]. rewrite DoubleNoDup_app_iff. split3; [apply gsepl_DoubleNoDup | apply IHl|]; trivial. intros. apply gsepl_InEither in H3. intro. apply gepl_InEither in H4. red in H3. simpl in H3. destruct H3; rewrite H3 in H4; contradiction. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph