I apologize if this is off topic but I think it fits. I am trying to succinctly describe a logical check for an algorithm which is a logical or. That is I want to say that we remove any cells $k$ with any grid corner $i$ that satisfies
\begin{equation} \left[\begin{array}{cc} x_i^{(k)} & y_i^{(k)}\end{array}\right]\left[\begin{array}{c} x_i^{(k)} \\ y_i^{(k)} \end{array}\right]>d_{max}^2 \end{equation}
where $x_i^{(k)}$ and $y_i^{(k)}$ are the $x-$ and $y-$ components of the $i^{th}$ vertex of the $k^{th}$ cell. What I would like it to look like is something like
\begin{equation} \left[\begin{array}{cc} x_i^{(k)} & y_i^{(k)}\end{array}\right]\left[\begin{array}{c} x_i^{(k)} \\ y_i^{(k)} \end{array}\right]>d_{max}^2\text{, }\forall i\in 1-4 \end{equation}
where instead of $\forall$ meaning "for all" it really means "for any". I know the $\forall$ can occasionally mean "for any" but in my experience it only means this when "for any" implies "for all."
Is there some other notation I can use for this or should I just use a somewhat lengthy explanation like I have given in this question. I know one simple way to do it would be to write out all of the logical "or"s which wouldn't be too bad in this case since there's only 4 options, but I am interested for future cases as well where there may be many options (which of course I could just write out using an elipses but again I'm hoping there's a more succinct way to do this that I just haven't come across yet).