I assume that you meant by removed constraints is something like redundant constraints, otherwise, by that, the feasibility space of the primal is totally changing.
Based on the duality theorem, the feasibility of the primal is the optimality of the dual, and the optimality of the primal is the feasibility of the dual. Also, the constraints in the primal are already converted to the corresponding dual variables. Now, let's show what's happened to the primal and dual with the redundant constraints.
\begin{array}{l}
\text{Maximize} & Z = 3x_1 + 2x_2\\
\text{subject to:}& \\
&x_1 + x_2 \leq 9\\
&3x_1 + x_2 \leq 18\\
&x_1 \leq 7\\
&x_2 \leq 6\\
&x_1,x_2\geq 0,
\end{array}
The feasible space of the problem is as follows:
as you can see the last two constraints are redundant and can be omitted without changing the problem's feasible space and the optimal solution.
Now, consider the dual form of the original primal:
\begin{array}{l}
\text{Minimize} & W = 9y_1 + 18y_2 + 7y_3 + 6y_4\\
\text{subject to:}& \\
&y_1 + 3y_2 + y_3 \geq 3\\
&y_1 + y_2 + y_4 \geq 2\\
&y_1,y_2,y_3,y_4\geq 0,
\end{array}
By omitting the primal last two constraints, one can see the variables $y_3$ and $y_4$ would be removed from the dual without changing the solution space and also optimal value.
Actually, this is a tiny problem and I am really not sure if may it be a general rule or not.