Proof of `Completeness for a degree is mutual reducibility` (3rd statement)
groundedproofs/Lax604544Proofs/Bridge.lean · lax-604544
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, by composition of reductions.