Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
(AFT) is essentially present in Theorem 13 of The adjoint functor theorem and the Yoneda embedding (Ulmer, 1971), though one must unwind "every cocontinuous functor" to get the result in the case of a specific cocontinuous functor.
"I think there may not be much more to say at this level of generality" — it's also not clear to me. However, it doesn't seem unreasonable that there might be at least sufficient syntactic conditions that cover examples like the powerset monad and CHS monad. It is perhaps helpful to rephrase the condition that $T$ be varietal in these ways, but these reformulations are very direct, and it's not clear that there aren't stronger results at this level of generality.
This isn't quite the same phenomenon, but ternary factorisation systems share similar structure in being overlapping factorisation systems in some sense, though they're stronger than the notion you're interested in (at least when $R_1 = L_2$).