fact: Definition del_edge_liftS (G : diGraph) (a b : G) (p : pathS (del_edge a b)) := let: existT (x,y) p' := p in PathS (Build_Path (del_edge_lift_proof (valP p'))).
imports: HB(structures) Coq(Setoid CMorphisms) mathcomp(all_ssreflect) GraphTheory(edone preliminaries bij)