At max flow, there is no augmenting path from to in the residual graph.
This means is unreachable from using edges with remaining capacity. The vertices reachable from form set . Since , you have . Edges crossing from to are saturated because they have no remaining capacity. These saturated edges are the bottleneck. Their total capacity equals the max flow. The max-flow min-cut theorem guarantees this.