Given a topological space $X$, Let $\mathcal O$, denote the set of all open covers of $X$.
We say that a space $X$ satisfies $S_1(\mathcal O,\mathcal O)$, if for every sequence of open covers $\{ \mathcal U_n : n \in \mathbb N \}$, there exists a sequence of open sets $\{ U_n : U_n \in \mathcal U_n \text{ for each } n \in \mathbb N \}$, which is an open cover of $X$.
Let $G_1(\mathcal O,\mathcal O)$ be the game with the following rules:
There are two players: ONE and TWO.
At each odd step $2n-1$, where $n \in \mathbb N$, ONE picks an open cover $\mathcal U_{2n-1}$ of $X$.
At each even step $2n$, where $n \in \mathbb N$, TWO responds by picking an open set $U_{2n} \in \mathcal U_{2n-1}$
If the sequence $\{ U_{2n} : n \in \mathbb N \}$ is an open cover of $X$ then TWO wins.
If the sequence $\{ U_{2n} : n \in \mathbb N \}$ is not an open cover of $X$ then ONE wins.
A strategy for ONE, is a function $F$, that, given any initial finite sequence of moves, $\{ \mathcal U_1, U_2, \mathcal U_3, U_4,...,U_{2n-2} \}$ of the game, produces the next move $\mathcal U_{2n-1}$.
A winning strategy for ONE, is a strategy $F$, such that $\bigcup_{n=1}^{\infty} U_{2n}$ is never a cover of $X$.
A strategy for TWO, is a function $F$, that, given any initial finite sequence of moves, $\{ \mathcal U_1, U_2, \mathcal U_3, U_4,...,\mathcal U_{2n-1} \}$ of the game, produces the next move $U_{2n}$
A winning strategy for TWO, is a strategy $F$, such that $\bigcup_{n=1}^{\infty} U_{2n}$ is allways a cover of $X$.
We say that a topological space $X$ satisfies $G_1(\mathcal O,\mathcal O)$ if TWO has a winning strategy for $G_1(\mathcal O,\mathcal O)$ in $X$.
I am trying to prove the claim below and have mannaged to prove only one direction. Any help?
This claim is some lighter version of theorem 3 in this article.
Claim: $X$ satisfies $S_1(\mathcal O,\mathcal O)$ if and only if TWO has a winning strategy for $G_1(\mathcal O,\mathcal O)$ in $X$.
Proof: First direction: Suppose that TWO has a winning strategy for $G_1(\mathcal O,\mathcal O)$ in $X$. Then, Given a sequence $\mathcal U_{2n-1} = \{ \mathcal U_1, \mathcal U_3, \mathcal U_5, ... \}$ of open covers of $X$, Start with $\{ \mathcal U_1 \}$, and let $U_2 = F(U_1)$, where $F$ is the winning strategy for TWO. Then, take $U_4 = F(\mathcal U_1,U_2,\mathcal U_3)$, at the $n$'th step, $U_{2n} = F(\mathcal U_1,U_2, \mathcal U_3,U_4,...,\mathcal U_{2n-1})$. It is clear that $\bigcup U_{2n}$ is an open cover of $X$ since $F$ is a winning strategy. Second direction: Suppose that $X$ satisfies $S_1(\mathcal O,\mathcal O)$. Then, for every sequence of open covers $\mathcal U_n$ of $X$, there is a sequence $\{ U_n : U_n \in \mathcal U_n, n \in \mathbb N \}$, such that $\bigcup U_n$ is an open cover of $X$. We have to show that TWO has a winning strategy in the game $G_1(\mathcal O,\mathcal O)$. So, how can I build this strategy?
Thank you!