proposition: Lemma mark_invalid_refl: forall (g: Graph) root, ~ vvalid g root -> mark g root g.
proof: Proof. intros. pose proof SIMPLE_MARK_GRAPH.mark_invalid_refls g (inj g) root H. rewrite -> mark_inj. split; [reflexivity | auto]. 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