proposition: Lemma count_le_length : forall P l, count P l <= length l.
proof: Proof. Proof using. intros. apply length_filter. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)