proposition: Lemma simple_cons x p : simple (x :: p) = (x \notin fband p) && simple p.
proof: Proof. by rewrite !simple_recI. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype path fingraph) fourcolor(hypermap jordan)