I had exactly this in mind (or the proof that the set of rational numbers are countable), but mistakenly thought it was called the 'diagonal argument' because you would get the bijection to the natural numbers by counting diagonally through the table.
It's that finite Cartesian products of countable sets are countable https://proofwiki.org/wiki/Cartesian_Product_of_Countable_Se...