Deleting vertices from a biconnected graph with preserving biconnectinity

Let $G$ be a biconnected graph and $W$ be a set which consists of inner vertices of parts-blocks of the graph $G$ and contains at least one vertex of each such part. It is proved that the graph $G-W$ is biconnected.