proposition: Lemma Forall_not_of_count_eq_zero : forall P l, count P l = 0 -> Forall (fun x => ~ P x) l.
proof: Proof. Proof using. introv. rewrite~ Forall_not_eq_count_eq_zero. Qed.
imports: TLC(LibTactics LibLogic LibOperation LibReflect LibProd LibNat LibInt LibOption LibWf) TLC(LibInt)