Let (Xι)ι∈I be a family of sets. Then ι∈I∏Xι=∅ if and only if there exists ι∈I such that Xι=∅.
If we have Xι=∅ for each ι∈I, then it follows from Corollary 1 that ι∈I∏Xι=∅; conversely, if ι∈I∏Xι=∅, the relation prα(ι∈I∏Xι)⊂Xα shows that Xα=∅ for each α∈I.
Hence, if we have a family (Xι)ι∈I of non-empty sets, we may introduce (as an auxiliary constant) a function f with domain I such that f(ι)∈Xι for all ι∈I. In practice one says : "take an element xι in each Xι". Intuitively, we have thus "chosen" an element xι in each set Xι; the introduction of the logical sign τ and the criteria governing its use absolve us from the necessity of formulating an "axiom of choice" to legalize this operation (cf. Summary of Results, §4, no. 10).
Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.