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

Proof of `Composition and pullbacks without reachability pruning` (2nd statement)

groundedproofs/Lax369799Proofs/FiniteStructureTheorems.lean · lax-369799

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.

Read the Lean proof on GitHub

Description

Take the entire fiber product with componentwise marks and transitions. Enumeration retains unreachable vertices. Pairing vertex maps proves the universal property, and global surjectivity lifts all vertices separately.