let x := (Finset.univ.filter fun j => r c j).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
⊢ 2 * z * z + 2 * z + 1 ≤ (Finset.filter (fun p => JudgePair.Agree r p c) 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
x : ℕ := (Finset.filter (fun j => r c j) Finset.univ).card
⊢ 2 * z * z + 2 * z + 1 ≤ (Finset.filter (fun p => JudgePair.Agree r p c) Finset.univ).card