proposition: Lemma forestT_unique : is_forest [set: G] -> forall x y, unique (fun p : Path x y => irred p).
proof: Proof. move => H x y p q Ip Iq. exact: H. Qed.
imports: Coq(Setoid CMorphisms) mathcomp(all_ssreflect) GraphTheory(edone preliminaries bij digraph)