Proof of `DP is closed under first-order reductions` (1st 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 definability notion reads a problem on finite structures only.