chore: docstring

Co-authored-by: Tobias Grosser <[email protected]>

Author: luisacicolini

src/Init/Data/BitVec/Basic.lean

@@ -843,7 +843,7 @@ def smulOverflow {w : Nat} (x y : BitVec w) : Bool :=
   (x.toInt * y.toInt ≥ 2 ^ (w - 1)) || (x.toInt * y.toInt < - 2 ^ (w - 1))
 
 /--
-  Count the number of leading zeroes downward from the `n`-th bit to the `0`-th bit.
+  Count the number of leading zeros downward from the `n`-th bit to the `0`-th bit.
 -/
 def clzAux {w : Nat} (x : BitVec w) (n : Nat) : Nat :=
   match n with