Proof of `coNP is closed under first-order reductions` (2nd statement)
groundedproofs/Lax564036Proofs/Bridge.lean · lax-564036
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 closure of universal second-order definability under first-order reductions.