proposition: Lemma mark_func: forall m root m1 m2 (R_DEC: ReachDecidable g root (negateP m)), mark m root m1 -> mark m root m2 -> (m1 ~=~ m2)%NodePred.
proof: Proof. intros. intro; intros. destruct H as [? ?]. destruct H0 as [? ?]. destruct (R_DEC n). - specialize (H n r). specialize (H0 n r). tauto. - specialize (H2 n n0). specialize (H1 n n0). tauto. Qed.
imports: Coq.Logic.ProofIrrelevance CertiGraph.lib.Ensembles_ext Coq.Lists.List Coq.Classes.Morphisms CertiGraph.lib.Coqlib CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext VST.msl.Coqlib2 CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.subgraph2