Complexity of solving multiple problems of the same complexity?
Yes, you can test whether $A \cap B$ is in $\textsf{NP}$ by testing $A$ and $B$ separately. Actually, you have proven that the class $\textsf{NP}$ is closed under intersection. See this lecture note (Exercise 1) for details and other cases.