 Immunity of incompressible strings

If an infinite computably enumerable family contained only incompressible strings, select its first enumerated string of length at least $n$. This is a total computable selection rule, and its selected string has a description of length $O(\log n)$ encoding the threshold. For large $n$ that is shorter than the selected string. This contradiction proves immunity.