proposition: Lemma transitive_list_fold_left_trans_add_edge_list : forall l g, Transitive g -> Transitive (fold_left trans_add_edge_list l g).
proof: Proof. induction l; simpl. auto. intros g tg. apply IHl. apply transitive_trans_add_edge_list. hyp. Qed.
imports: Coq(OrderedType) CoLoR(RelUtil LogicUtil BoolUtil FGraph)