Let H be a subgroup of Z. There exists one and only one integer a⩾0 such that H=aZ.
If H={0}, then H=0Z. Suppose that H={0}. The subgroup H has an element x=0. Then x>0 or −x>0, and therefore H has elements >0. Let a be the smallest element >0 in H. The subgroup aZ generated by a is contained in H; we show that H⊂aZ. Let y∈H. By Proposition 16, there exists an integer r such that y≡r(moda) and 0⩽r<a. A fortioriy≡r(modH), whence r∈H. But this is only possible if r=0 and therefore y∈aZ. The integer a is unique: if H={0}, then necessarily a=0, and if H={0}, the integer a is the order of Z/H.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.