Proof of `Kuhn's Algorithm Computes a Maximum Matching` (2nd statement)
groundedproofs/Lax117284Proofs/Bipartite/GraphBridge.lean · lax-117284
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The result of the algorithm is a relation matching, hence a matching subgraph of the same size; and every matching subgraph is a relation matching of the same size, which the algorithm's result outnumbers. So the set of sizes of matchings has the result's size as its greatest element.