Assume that R is irreducible, non-reduced and of rank ≥2.
(i) The set R0 of indivisible roots is a root system in V; this system is irreducible and reduced; and W(R0)=W(R).
(ii) Let A be the set of roots α for which (α∣α) takes the smallest value λ. Then any two non-proportional elements of A are orthogonal.
(iii) Let B be the set of β∈R such that (β∣β)=2λ. Then B=∅, R0=A∪B, R=A∪B∪2A.
If α∈R−R0, then 21α∈R, but 21(21α)∈/R (Prop. 8), so 21α∈R0. This proves that R0 satisfies (RS1). It is clear that, for all α∈R, sα,α−(R0)=R0, so R0 satisfies (RSII) and (RSIII). Since α∈R−R0 implies that 21α∈R0 and since sα=sα/2, we have W(R)=W(R0). Thus R0 is irreducible (Cor. of Prop. 5), and it is evidently reduced.
Since R is not reduced, there exists α∈R0 such that 2α∈R. Since R0 is irreducible and dimV≥2, α cannot be proportional or orthogonal to every root. Let β∈R0 be such that n(β,α)=0 and β is not proportional to α. Changing β to −β if necessary, we can assume that n(β,α)>0. Now 21n(β,α)=n(β,2α)∈Z, so n(β,α)∈2Z. From the list in no. 3, n(β,α)=2, (β∣β)=2(α∣α). Since R0 is reduced, Prop. 12 shows that, for all γ∈R0, either (γ∣γ)=(α∣α) or (γ∣γ)=2(α∣α). Also, the above shows that, for all γ∈R−R0, the vector 21γ is an element of R0 such that (21γ∣21γ)=(α∣α). Thus, λ=(α∣α), B=∅, R0=A∪B, and R⊆A∪B∪2A; on the other hand, if γ∈A, there exists g∈W(R) such that γ=g(α) (Prop. 11), so 2γ=g(2α)∈R; thus 2A⊆R and R=A∪B∪2A. Finally, let γ,γ′ be two non-proportional elements of A. Then
n(2γ,γ′)=2n(γ,γ′)=4n(γ,2γ′)∈4Z,and∣n(γ,γ′)∣≤1
since γ and γ′ have the same length, so n(γ,γ′)=0 and (γ∣γ′)=0.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.