We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic property for building filter models with special purpose features. Relying on the notion of easy intersection type theory, given -terms M and E, with E simple easy, we successfully build a filter model which equates interpretation of M and E, hence proving that simple easiness implies easiness. We finally prove that a class of -terms generated by 22 are simple easy, so providing alternative proof of easiness for them.