The successor of a computable ordinal is computable, and the set of all computable ordinals is closed downwards.
A computable ordinal's successor is still computable, and the entire collection of computable ordinals remains closed under taking lower elements.