proposition: Lemma rrm_non_vertex_id: forall index (roots: roots_t) l, (forall v, Znth index roots <> inr v) -> 0 <= index < Zlength roots -> restricted_roots_map index roots l = roots.
proof: Proof. intros. apply Znth_list_eq. split. - rewrite restricted_roots_map_Zlength; easy. - intros. rewrite restricted_roots_map_Zlength in H1 by easy. destruct (Z.eq_dec j index). + rewrite restricted_roots_map_Znth_same; auto. destruct (Znth j roots) eqn:? . * simpl. reflexivity. * exfalso. subst. apply (H v); auto. + rewrite restricted_roots_map_Znth_diff; 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