I have come across the following notation on a cryptography lecture slide that supposedly defines the modulo function:
$\forall a, n. \exists q, r. a = q \times n + r \text{ where } 0 \leq r < n$
Whilst I have a general idea of what it's doing, I am struggling to understand a few parts of the notation, which I have highlighted in red below:
$\forall a\color{red}{,} n\color{red}{.} \exists q\color{red}{,} r\color{red}{.} a = q \times n + r \text{ where } 0 \leq r < n$
What is the meaning of the commas and dots in this definition? It seems to me the dots are separating statements, so it reads:
For all $a$ and $n$ there exists a $q$ and $a$ for which $a = q \times n + r$ where $0 \leq r < n$.
Is that accurate?