$A$ and $B$ being independent is a common, but actually strong assumption. It implies one special property for the joint probability density function:
$$
f_{AB}(a,b)=f_{A}(a)f_{B}(b)
$$
If $X$ is a random variable of its own, the joint probability of $X$, $A$ and $B$ is :
$$
f_{XAB}(x,a,b)
$$
But the conditional probability of $X$ given $A$ and $B$ has the following property:
$$
f_{X|AB}(x|a,b) = \frac{f_{XAB}(x,a,b)}{f_{AB}(a,b)}
$$
And therefore:
$$
f_{X|AB}(x|a,b)f_{AB}(a,b) = f_{XAB}(x,a,b)
$$
And if $A$ and $B$ are independent:
$$
f_{X|AB}(x|a,b)f_{A}(a)f_{B}(b) = f_{XAB}(x,a,b)
$$
And from that it's possible to derive some of the identities you may need:
$$
E(X|(A,B))= \int_{\Omega_X} x f_{X|AB}(x|a,b) dx = \int_{\Omega_X} x \frac{f_{XAB}(x,a,b)}{f_{AB}(a,b)} dx
$$
Now, in a general case I believe $E[X|(A,B)] \neq E[E[X|A]|B]$ Because when computing E[X|A] the result is a function $g(a)$, in the sense that is may algebraically depend on the assumed value of $A$, but the result would be no longer a function of the random variable $B$ (nor of an algebraic value $b$), thus:
$$
E[E[X|A]|B] = E[g(a)|B] = g(a) = \int_{\omega_{X}} f_{X|A}(x|a)\, dx
$$
The expectation given both $A$ and $B$ is a function $h$ of both algebraic values $a$ and $b$:
$$
E[X|(A,B)] = \int_{\Omega_{X|(A,B)}} f_{X|AB}(x|a,b) dx = h(a,b)
$$
If however, $X$ was assumed independent of both $A$ and $B$, then $E[X] = E[X|(A,B)] = E[E[X|A]|B]$ because the values of $A$ and $B$ wouldn't matter.
If X is not a random variable with its distribution, but a function of $A$ and $B$, then, the principle above holds:
$$
X= w(A,B) \Rightarrow
$$
$$
E[X|(A,B)] = \int_{\Omega_{A,B}}w(a,b) f_{AB|AB}(a,b)\, da\, db = w(a,b)
$$
$$
E[X|A] = \int_{\Omega_{A,B}}w(a,b) f_{B|A}(b|a)\, db = g(a)
$$