Independent sets into which all the vertices of the graph can be split


How to prove that if $ G$ is an acyclic transitive digraph, then the least independent sets into which all vertices of G can be divided is equal to the size of the longest paths to $ G$ ?