proposition: Lemma gsepl_InEither: forall x g a, InEither x (gen_single_edge_pair_list g a) -> IsEither (fst x) a.
proof: Proof. intros. destruct a as [v1 v2]. red. simpl. unfold gen_single_edge_pair_list in H. remember (get_edges g v1). assert (forall e, In e l -> fst e = v1) by (intros; subst l; apply get_edges_fst in H0; assumption). clear Heql g. induction l; simpl in *; [inversion H|]. rewrite InEither_cons_iff in H. destruct a as [v idx]. simpl in *. assert (v = v1) by (change v with (fst (v, idx)); apply H0; left; reflexivity). subst v. destruct H. - red in H. simpl in H. destruct H; subst; simpl; intuition. - apply IHl; auto. 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