proposition: Lemma lift_pathp (G H : relType) (f : G -> H) a b p' : (forall x y, f x -- f y -> x -- y) -> injective f -> pathp (f a) (f b) p' -> {subset p' <= codom f} -> exists p, pathp a b p /\ map f p = p'.
proof: Proof. move => I. apply: lift_pathp_on. auto. Qed.
imports: HB(structures) Coq(Setoid CMorphisms) mathcomp(all_ssreflect) GraphTheory(edone preliminaries bij)