I am trying to prove something by contradiction and I am stuck as described below:
From the (false) assumption, I have shown that for any $i \in \mathbf{N}$, $A_i \neq \emptyset$ and that $A_1 \supseteq A_2 \supseteq A_3 \supseteq ...$ (the inclusion is not necessarily proper). Each $A_i$ is a set of functions from $\mathbf{N}$ to $\lbrace 0,1 \rbrace$. (So I believe it's not bounded or even continuous. Edited from here: Any element in each A_i is some function $f: \mathbb{N} \rightarrow \lbrace 0,1 \rbrace $ with some special property associated with $i$. So each $A_i$ is already defined. )
To achieve a contradiction useful for my proof, I either want to show that this descending chain is impossible or that $ \bigcap_{n=1}^{\infty}A_{n} \neq \emptyset$ because I can then proceed my argument.
The latter seemed obvious to me at first, but when trying to write down a proof, I couldn't. Do I need to use any special tool for this, e.g., AC? Or I can't just say either of the two?
Thanks so much!
The set of functions from $\Bbb{N}$ is $\{0,1\}$ is equinumerous with $\Bbb{R}$. So your problem is equivalent to the same question with sets of reals. But then it's easy to find a chain of the type you don't want: just let $A_i=(i,\infty)$.