Proof of `Every RE-hard problem is undecidable`
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 theorem: code halting is undecidable since Mathlib's halting problem is, and an RE-hard problem is reduced to by code halting.