If you work in homogeneous coordinates, you can view this problem as one of finding the plane defined by three points: the direction vectors of the two lines (represented by points at infinity) and a finite point on the first line, all of which you can read from the equations of the two lines.
You’ve found the two direction vectors, and a point on $D_1$ is, by inspection $(-1,1,2)$. The plane is represented by a homogeneous vector $\mathbf p$ with the property that its dot product with any point on the plane vanishes. (It’s components are just the coefficients of the implicit plane equation $ax+by+cz+d=0$.) So, applying this condition to the three points gives you a system of homogeneous linear equations in the components of this vector, therefore it lies in the null space of the matrix $$\begin{bmatrix} -1&1&2&1 \\ 2&-1&3&0 \\ -1&2&-3&0 \end{bmatrix}.$$ Such a vector can be solved by any of the usual methods, such as row reduction, producing $[1,-1,-1,4]^T$, which corresponds to the implicit Cartesian equation $x-y-z+4=0$.
Equivalently, the homogeneous coordinate vectors of these three known points are linearly independent, and any point on the plane can be written as a linear combination of them, so an equation of the plane is $$\begin{vmatrix} x&y&z&1 \\ -1&1&2&1 \\ 2&-1&3&0 \\ -1&2&-3&0 \end{vmatrix} = 0,$$ which simplifies to the same equation as derived above. This approach uses the fact that the determinant of a matrix vanishes iff its rows are linearly dependent. (This determinant is a four-dimensional analogue of the cross product.)