proposition: Lemma relation_list_head: forall {A: Type} a (l: list (relation A)), same_relation _ (relation_list (a :: l)) (compond_relation a (relation_list l)).
proof: Proof. intros. apply monoid_fold_left_head. + apply compond_eq_left. + apply compond_eq_right. + apply compond_assoc. Qed.
imports: Coq.Classes.Morphisms Coq.Lists.List CertiGraph.lib.Coqlib CertiGraph.lib.List_ext CertiGraph.lib.List_Func_ext CertiGraph.lib.Relation_ext