We prove that there exists a noncappable enumeration degree strictly below 0' e.

It is shown that if A and C are sets of degrees uniformly recursive in 0' with $\mathbf{0} \nonin \mathscr{C}$ then there is a degree b with b' = 0', b ∪ c = 0' for every c ∈ C, and $\mathbf{a} \nleq \mathbf{b}$ for every a ∈ A ∼ {0}. The proof is given as an oracle construction recursive in 0'. It follows that any nonrecursive degree below 0' can be joined to 0' by a degree strictly below 0'. (...) Also, if $\mathbf{a ' and a" = 0" then there is a degree b such that a ∪ b = 0' and a ∩ b = 0. (shrink)