proposition: Lemma transitive_trans_add_edge_list : forall g a, Transitive g -> Transitive (trans_add_edge_list g a).
proof: Proof. intros. unfold trans_add_edge_list. destruct (f a). destruct p as [x l]. apply transitive_list_fold_left_trans_add_edge. hyp. hyp. Qed.
imports: Coq(OrderedType) CoLoR(RelUtil LogicUtil BoolUtil FGraph)