proposition: Lemma CK4F_split_cpL : CK4F (igraph input z).
proof: Proof. apply: CK4F_igraph => //; first exact: (@mem_cpl G). by rewrite eq_sym. Qed.
imports: Coq(RelationClasses Morphisms Setoid Lia) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries) GraphTheory(digraph sgraph minor checkpoint cp_minor) GraphTheory(setoid_bigop structures pttdom ptt) GraphTheory(mgraph mgraph2 skeleton bounded)