Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.