proposition: Lemma mark_is_componded_mark: forall root x, inclusion Graph (mark x) (componded root (mark x)).
proof: Proof. intros. unfold componded. rewrite <- (compond_eq_right (mark x)) at 1. rewrite <- (compond_eq_left (mark x)) at 1. repeat apply compond_relation_inclusion. + apply eq_do_nothing. + hnf; auto. + apply eq_do_nothing. Qed.
imports: Coq.Logic.ProofIrrelevance Coq.Classes.Morphisms VST.msl.Coqlib2 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.Relation_ext CertiGraph.lib.relation_list CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.graph_gen CertiGraph.graph.subgraph2 CertiGraph.graph.dual_graph