It's true.
Ford and Fulkerson proved the max flow min cut theorem, which basically states that the max flow of a graph is equal to the minimum cut.
Now, the minimum cut corresponds to the sum of the capacities of some set of edges in the graph. What would happen if you chose to decrease the capacity of one of those edges? (I'll let you work out the rest of the proof.)