Proof of `Decoding, and well-formed graph crawling is NP-complete` (1st statement)
groundedproofs/Lax117614Proofs/Bridge.lean · lax-117614
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.
Description
The library's soundness theorem for its decoder, the structure a presentation presents being the concept's.