Proof of `Deterministic directed product flow–cut algorithm`
groundedproofs/Lax455465Proofs/ProductCorollaries.lean · lax-455465
What this proof establishes
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
Specialize the general algorithm to directed input words. Asymmetric capacities require no symmetry assumption.
Proof strategy
The implication conditioned on undirected mode has a false antecedent. All certificate and execution guarantees are inherited directly.