Suppose that L=∅ and that Jλ=∅ for each λ∈L. If for e achindex λ∈L the family (Xλ,ι)ι∈Jλ is a partition of Xλ=⋃ι∈JλXλ,ι, then the family (∏λ∈LXλ,f(λ))f∈I is a partition of ∏λ∈LXλ.
If we set
Pf=λ∈L∏Xλ,f(λ),
then, by virtue of the first formula of Proposition 9, it is sufficient to show that Pf=∅ for all f∈I and that Pf∩Pg=∅ whenever f and g are distinct elements of I. The first point follows from Proposition 5, Corollary 2. As to the second, if f=g, there exists λ∈L such that
f(λ)=g(λ)
and therefore, by virtue of the hypothesis, Xλ,f(λ)∩Xλ,g(λ)=∅. It follows that there is no graph belonging to Pf∩Pg; for if G were such a graph, we would have G(λ)∈Xλ,f(λ)∩Xλ,g(λ)=∅, which is absurd.
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.