proposition: Lemma bin_graph_precise_right: forall (g: Graph) x r, vvalid g x -> dst g (x, R) = r -> precise (graph r g).
proof: Proof. intros. apply precise_graph. 1: apply RGF. apply weak_valid_vvalid_dec. pose proof (right_valid g x H). simpl in H1. destruct (@valid_graph _ _ _ _ g _ (maGraph g) (x, R) H1). rewrite H0 in H3. apply H3. Qed.
imports: CertiGraph.lib.Ensembles_ext Coq.Lists.List VST.msl.seplog VST.msl.log_normalize CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.seplog CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.BinGraph CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph CertiGraph.msl_application.Graph Coq.Logic.Classical