where (i1,…,ip) denotes the set of strictly increasing sequences of integers in the interval [1,q].
We argue by induction on q, the case q=0 being trivial. If q⩾1, we have C(s1…sq).C(w)⊂C(s1).C(s2…sq).C(w). By the induction hypothesis, C(s2…sq).C(w) is contained in the union of the C(sj1…sjpw), where
2≤j1<⋯<jp≤q.
By (T3), the set C(s1).C(sj1…sjpw) is contained in the union of the sets C(s1sj1…sjpw) and C(sj1…sjpw). This proves the lemma.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.