We give a new proof of the completeness theorem for the smallest normal modal propositional logic K with the additional 
modal operator representing transitive closure of accessibility relation.