The theorem in question, Theorem 4, appears as an auxiliary part of a paper by Chang and Mott,1 whose main result was the presentation and justification of a new method for computing irredundant normal forms based on the concepts of abbreviated presence function, ratio function, and iterated consensus of prime implicants. The validity of the authors' method is unchallenged by the counterexample of Cutler and Muroga. Rather, their counterexample is intended only to question auxiliary Theorem 4, which attempts to specify new conditions for the absolute dispensability of prime implicants.