Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Saturating and Perfect Matchings, Decided in the Same Time` (2nd statement)

groundedproofs/Lax117284Proofs/Bipartite/Machine.lean · lax-117284

What this proof establishes

no assumptions

cor✓Lax117284.BipartiteDecision (2nd statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The same program, ending with a comparison of the count with nn: a matching saturating the left side exists exactly when the matching number is nn (GraphBridge.existssaturatingiffGraphBridge.exists_saturating_iff).