For over two decades we have been proving identities involving plethystic operators (vertex operators for some people) by manipulations which politely could be called ``heuristic''. But deep down I felt them to be quite ``fishy''. But referees accepted them and we felt nevertheless confident since we always got the right answer, as amply confirmed by computer experimentations. But suddenly this summer an example popped up where our manipulations yielded a patently false answer. Panic? Yes ... for a while. In this talk we will present how in the end all of this finally, and belatedly could be made completely rigorous. \\ This talk will be a continuation of the talk from last week.