proposition: Lemma plain_eq : plain -> forall x, edge (edge x) = x.
proof: Proof. by move/plainP=> plainG x; case: (plainG x). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype path fingraph) fourcolor(hypermap jordan)