proposition: Lemma indexall_mem x s : nilp (indexall x s) = (x \notin s).
proof: Proof. by rewrite /indexall findall_nilp has_pred1. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat seq path eqtype choice bigop) pcm(options prelude pred)