Proof of `Clique number equals the maximum number of accepting random choices` (1st statement)
groundedproofs/Lax323828Proofs/ConsistencyGraph.lean · lax-323828
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
Apply soundness to a maximum clique and completeness to every proof.