There is a weak choice principle called $DC_\lambda$ which holds in $L(V_{\lambda+1})$ under the assumption of a non-trivial elementary embedding $$j:L(V_{\lambda+1})\prec L(V_{\lambda+1})$$ and it is known that this choice principle is not sufficient to split the ordinals below $\lambda^+$ (a regular cardinal) which have cofinality $\omega$ into disjoint stationary sets.

Is there a choice principle $\Phi$, which, when augmented with $DC_\lambda$ and strictly weaker than full AC that suffices to prove Solovay's Theorem on Partition of Stationary Sets? A little more specifically, what is the minimal $\Phi$ such that $T=ZF + DC_\lambda + \Phi$ where $$T\vdash \text{All stationary subsets of }\lambda^+\text{ have a disjoint partition into stationary sets}?$$ One such candidate could be $Unif(V_{\lambda+1}\times V_{\lambda+1})$: given any $R\subseteq V_{\lambda +1}\times V_{\lambda +1}$ there exists some function $f\subset R$ with the same domain as $R$. (This question is related to both A proposed axiom of Laver (updated) and Model of ZF + $\neg$C in which Solovay's Theorem on stationary sets fails? .)

Are there other weak choice principles $\Phi$ that could be considered?

Are there (perhaps) some partition properties with infinite exponents that would prohibit Solovay's Theorem?

EDIT: While I am interested in the more general question (which I believe Asaf Karagila has addressed in the comments and chat), I am really specifically interested in the context that Woodin's Axiom $I_0$ holds. Specifically, any assertion $\Phi$ I'm looking for can't imply that $[\lambda]^\omega$ is well-ordered (in conjunction with $DC_\lambda$).

onlySolovay's theorem (and its consequences) would be... Solovay's theorem! :-) – Asaf Karagila Nov 1 '13 at 10:25