Consider the set
$$ S = { \frac{1}{x} : x \in \mathbb{N} } $$
This set has the Least upper bound property since every non empty subset has a least upper bound in S. How is the greatest lower bound property implied in this case? Consider the subset $E = S$, and since $0 \notin S $, it doesn't have a lower bound in $S$, so by definition, glb property does not hold true.
Rudin says on page 4 that, every ordered set with the least-upper bound property also has the greatest-lower bound property.