proposition: Lemma oarc_uniqeL e e' x y u : edges_at G x = [fset e] -> oarc G e' x u y -> e' = e.
proof: Proof. rewrite oarc_cnv. exact: oarc_uniqeR. Qed.
imports: HB(structures) Coq(Relation_Definitions Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom rewriting) GraphTheory(finmap_plus)