proposition: Lemma vvalid_reachable_sub_cons: forall {roots: list root_t} {g : LGraph} {x: VType} (v : VType), vvalid (reachable_sub_labeledgraph g (filter_sum_right roots)) x -> vvalid (reachable_sub_labeledgraph g (v :: filter_sum_right roots)) x.
proof: Proof. intros. simpl in *. unfold predicate_vvalid in *. destruct H. rewrite !reachable_through_set_eq. split; [auto | right]. assumption. 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