# Documentation

Std.Data.List.Count

# Counting in lists #

This file proves basic properties of List.countP and List.count, which count the number of elements of a list satisfying a predicate and equal to a given element respectively. Their definitions can be found in Std.Data.List.Basic.

@[simp]
theorem List.countP_nil {α : Type u_1} (p : αBool) :
List.countP p [] = 0
theorem List.countP_go_eq_add {α : Type u_1} (p : αBool) {n : Nat} (l : List α) :
= n +
@[simp]
theorem List.countP_cons_of_pos {α : Type u_1} (p : αBool) {a : α} (l : List α) (pa : p a = true) :
List.countP p (a :: l) = + 1
@[simp]
theorem List.countP_cons_of_neg {α : Type u_1} (p : αBool) {a : α} (l : List α) (pa : ¬p a = true) :
List.countP p (a :: l) =
theorem List.countP_cons {α : Type u_1} (p : αBool) (a : α) (l : List α) :
List.countP p (a :: l) = + if p a = true then 1 else 0
theorem List.length_eq_countP_add_countP {α : Type u_1} (p : αBool) (l : List α) :
= + List.countP (fun a => decide ¬p a = true) l
theorem List.countP_eq_length_filter {α : Type u_1} (p : αBool) (l : List α) :
theorem List.countP_le_length {α : Type u_1} (p : αBool) {l : List α} :
@[simp]
theorem List.countP_append {α : Type u_1} (p : αBool) (l₁ : List α) (l₂ : List α) :
List.countP p (l₁ ++ l₂) = List.countP p l₁ + List.countP p l₂
theorem List.countP_pos {α : Type u_1} (p : αBool) {l : List α} :
0 < a, a l p a = true
theorem List.countP_eq_zero {α : Type u_1} (p : αBool) {l : List α} :
= 0 ∀ (a : α), a l¬p a = true
theorem List.countP_eq_length {α : Type u_1} (p : αBool) {l : List α} :
= ∀ (a : α), a lp a = true
theorem List.Sublist.countP_le {α : Type u_1} (p : αBool) {l₁ : List α} {l₂ : List α} (s : List.Sublist l₁ l₂) :
theorem List.countP_filter {α : Type u_1} (p : αBool) (q : αBool) (l : List α) :
List.countP p () = List.countP (fun a => decide (p a = true q a = true)) l
@[simp]
theorem List.countP_true {α : Type u_1} {l : List α} :
List.countP (fun x => true) l =
@[simp]
theorem List.countP_false {α : Type u_1} {l : List α} :
List.countP (fun x => false) l = 0
@[simp]
theorem List.countP_map {α : Type u_2} {β : Type u_1} (p : βBool) (f : αβ) (l : List α) :
theorem List.countP_mono_left {α : Type u_1} {p : αBool} {q : αBool} {l : List α} (h : ∀ (x : α), x lp x = trueq x = true) :
theorem List.countP_congr {α : Type u_1} {p : αBool} {q : αBool} {l : List α} (h : ∀ (x : α), x l → (p x = true q x = true)) :
=

### count #

@[simp]
theorem List.count_nil {α : Type u_1} [] (a : α) :
List.count a [] = 0
theorem List.count_cons {α : Type u_1} [] (a : α) (b : α) (l : List α) :
List.count a (b :: l) = + if a = b then 1 else 0
@[simp]
theorem List.count_cons_self {α : Type u_1} [] (a : α) (l : List α) :
List.count a (a :: l) = + 1
@[simp]
theorem List.count_cons_of_ne {α : Type u_1} [] {a : α} {b : α} (h : a b) (l : List α) :
List.count a (b :: l) =
theorem List.count_tail {α : Type u_1} [] (l : List α) (a : α) (h : 0 < ) :
List.count a () = - if a = List.get l { val := 0, isLt := h } then 1 else 0
theorem List.count_le_length {α : Type u_1} [] (a : α) (l : List α) :
theorem List.Sublist.count_le {α : Type u_1} [] {l₁ : List α} {l₂ : List α} (h : List.Sublist l₁ l₂) (a : α) :
List.count a l₁ List.count a l₂
theorem List.count_le_count_cons {α : Type u_1} [] (a : α) (b : α) (l : List α) :
List.count a (b :: l)
theorem List.count_singleton {α : Type u_1} [] (a : α) :
List.count a [a] = 1
theorem List.count_singleton' {α : Type u_1} [] (a : α) (b : α) :
List.count a [b] = if a = b then 1 else 0
@[simp]
theorem List.count_append {α : Type u_1} [] (a : α) (l₁ : List α) (l₂ : List α) :
List.count a (l₁ ++ l₂) = List.count a l₁ + List.count a l₂
theorem List.count_concat {α : Type u_1} [] (a : α) (l : List α) :
theorem List.count_pos_iff_mem {α : Type u_1} [] {a : α} {l : List α} :
0 < a l
@[simp]
theorem List.count_eq_zero_of_not_mem {α : Type u_1} [] {a : α} {l : List α} (h : ¬a l) :
= 0
theorem List.not_mem_of_count_eq_zero {α : Type u_1} [] {a : α} {l : List α} (h : = 0) :
¬a l
theorem List.count_eq_zero {α : Type u_1} [] {a : α} {l : List α} :
= 0 ¬a l
theorem List.count_eq_length {α : Type u_1} [] {a : α} {l : List α} :
= ∀ (b : α), b la = b
@[simp]
theorem List.count_replicate_self {α : Type u_1} [] (a : α) (n : Nat) :
List.count a () = n
theorem List.count_replicate {α : Type u_1} [] (a : α) (b : α) (n : Nat) :
List.count a () = if a = b then n else 0
theorem List.filter_beq' {α : Type u_1} [] (l : List α) (a : α) :
List.filter (fun x => x == a) l = List.replicate () a
theorem List.filter_eq' {α : Type u_1} [] (l : List α) (a : α) :
List.filter (fun x => decide (x = a)) l = List.replicate () a
theorem List.filter_eq {α : Type u_1} [] (l : List α) (a : α) :
List.filter (fun x => decide (a = x)) l = List.replicate () a
theorem List.filter_beq {α : Type u_1} [] (l : List α) (a : α) :
List.filter (fun x => a == x) l = List.replicate () a
theorem List.le_count_iff_replicate_sublist {α : Type u_1} [] {n : Nat} {a : α} {l : List α} :
theorem List.replicate_count_eq_of_count_eq_length {α : Type u_1} [] {a : α} {l : List α} (h : = ) :
@[simp]
theorem List.count_filter {α : Type u_1} [] {p : αBool} {a : α} {l : List α} (h : p a = true) :
theorem List.count_le_count_map {α : Type u_2} [] {β : Type u_1} [] (l : List α) (f : αβ) (x : α) :
List.count (f x) (List.map f l)
theorem List.count_erase {α : Type u_1} [] (a : α) (b : α) (l : List α) :
List.count a () = - if a = b then 1 else 0
@[simp]
theorem List.count_erase_self {α : Type u_1} [] (a : α) (l : List α) :
List.count a () = - 1
@[simp]
theorem List.count_erase_of_ne {α : Type u_1} [] {a : α} {b : α} (ab : a b) (l : List α) :