Proof of `RE is closed under first-order reductions` (1st statement)
groundedproofs/Lax624099Proofs/Bridge.lean · lax-624099
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 definability with value invention under first-order reductions.