Let w∈W and s∈S be such that l(sw)≤l(w). For any sequence s=(s1,…,sq) of elements of S with w=s1…sq, there exists an integer j such that 1≤j≤q and
ss1…sj−1=s1…sj−1sj.
Let p be the length of w and w′=sw. By the Remark of no. 3, l(w′)≡l(w)+1 mod. 2. The hypothesis l(w′)≤l(w) and the relation
∣l(w)−l(w′)∣≤l(ww′−1)=l(s)=1
thus leads to l(w′)=p−1. Choose a reduced decomposition
(s1′,…,sp−1′)
of w′ and put s=(s,s1′,…,sp−1′) and Φ(s′)=(t1′,…,tp′). It is clear that s′ is a reduced decomposition of w and that t1′=s. The elements t1′,…,tp′ being distinct by Lemma 2, we have n(s′,s)=1. Since w is the product of the sequence s, we have n(s,s)≡n(s′,s) mod. 2 by Lemma 1, hence n(s,s)=0. Consequently, s is equal to one of the elements tj of the sequence Φ(s), hence the lemma.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.