The largest feasible source-to-sink flow has value equal to the smallest cut capacity. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Definitions first
Weighted paths minimize \(\sum_{e\in P}w(e)\), flows use values \(f:E\to\mathbf R_{\ge0}\) with conservation, and matchings enforce degree at most one. Each problem has a dual obstruction.
I keep the defining relation \(\mathsf D\) above the derived relation \(\mathsf C\). This exposes whether cancellation used \(x\ne0\) and whether the conclusion is canonical.
A small case in full
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
The reusable statement
The aligned summary deliberately puts the datum and conclusion on different rows. Mathematically, this is the distinction between specifying an object and proving a property of it.
A nearby false statement
Dijkstra requires nonnegative edge weights, while flow capacities must be interpreted on a directed residual network even when the original graph is undirected.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.