proposition: Lemma upathPR (G : sgraph) (x y : G) A : reflect (exists p : seq G, @upath (srestrict A) x y p) (connect (restrict A (--)) x y).
proof: Proof. exact: (@upathP (srestrict A)). Qed.
imports: Coq(Setoid CMorphisms) mathcomp(all_ssreflect) GraphTheory(edone preliminaries bij digraph)