let s := Finset.univ.filter fun p : JudgePair J => p.Agree r c
C : Type u_1
J : Type u_2
r : C → J → Prop
inst✝ : Fintype J
z : ℕ
hJ : Fintype.card J = 2 * z + 1
c : C
⊢ 2 * z * z ≤ (Finset.filter (fun p => JudgePair.Agree r p c ∧ p.Distinct) Finset.univ).card
C : Type u_1
J : Type u_2
r : C → J → Prop
inst✝ : Fintype J
z : ℕ
hJ : Fintype.card J = 2 * z + 1
c : C
s : Finset (JudgePair J) := Finset.filter (fun p => JudgePair.Agree r p c) Finset.univ
⊢ 2 * z * z ≤ (Finset.filter (fun p => JudgePair.Agree r p c ∧ p.Distinct) Finset.univ).card