Proof of `Decoding, and well-formed graph crawling is NP-complete` (4th statement)
groundedproofs/Lax117614Proofs/Bridge.lean · lax-117614
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
Membership from the library's existential second-order definition of graph crawling, strengthened by the first-order well-formedness sentence; hardness from the library's ordered first-order reduction out of Set Cover, whose image is well-formed, Set Cover being NP-hard by the catalog's statement for it. Both are transported to the concept's problem along the agreements.