proposition: Lemma count_eq_zero_of_Forall_not : forall P l, Forall (fun x => ~ P x) l -> count P l = 0.
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)