Proof of `SelMajSAT is PP-complete and SelEqSAT is C₌P-complete` (1st statement)
groundedproofs/Lax175070Proofs/Bridge.lean · lax-175070
What this proof establishes
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, transported to the concept's problem along the agreement.