Lax Lean Archive

Proof of `NP is a complexity class` (2nd statement)

groundedproofs/Lax904597Proofs/Bridge.lean · lax-904597

What this proof establishes

no assumptions

thm✓Lax904597.NPClass (2nd statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Over a relational vocabulary PP reduces to itself, so cofinal hardness is the usual one.