 Boundedness theorem for well-order codes

Every analytic set contained in $\mathrm{WF}$ has bounded rank: if $A\subseteq \mathrm{WF}$ is analytic, thenIn particular, the well-order codes produced continuously from all counterplays against one strategy have bounded ranks whenever they are all well-founded.