proposition: Lemma mem_remfF f (k : K) : k \in f.[~ k] = false.
proof: Proof. by rewrite mem_remf1 eqxx. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)