proposition: Lemma transitive_trans_clos_list : forall l, Transitive (trans_clos_list l).
proof: Proof. intro l. apply transitive_list_fold_left_trans_add_edge_list. apply transitive_empty. Qed.
imports: Coq(OrderedType) CoLoR(RelUtil LogicUtil BoolUtil FGraph)