I was just working on some review textbook problems in James Stewart's Multivariable Calculus when I encountered a problem that looked like the following:
Find the distance between the point $(1,2,3)$ and the $xz$-plane.
I've seen questions that ask for the shortest distance between a point and a plane, but I haven't seen this sort of problem yet.
The way I tackled this problem is by using the distance formula like this:
I called the point $A(1,2,3)$ and called the $xz$-plane as $T(x,0,z)$ and then did $||AT||=\sqrt{(x-1)^2+(-2)^2+(z-3)^2}=\sqrt{(x-1)^2+4+(z-3)^2}$. I'm not sure how to proceed after this. (Maybe this is as far as it goes, because there are infinitely many distances from a point to a plane, depending on what $x$ and $z$ are?)
Any hints would be appreciated. Thanks.

Espy that $\mathbb{n} \neq D$ necessarily.