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

Proof of `Acceptance from finite families of covering components`

groundedproofs/Lax369799Proofs/FiniteCoverFamilies.lean · lax-369799

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.

Read the Lean proof on GitHub

Description

The accepting filter has a least element. Monotonicity accepts the closed disjoint family, whose surjective cover transfers its evaluation to the target while retaining all vertices.