Proof of `Exhaustive search for small independent-set targets` (2nd statement)
groundedproofs/Lax263307Proofs/ExhaustiveTargets.lean · lax-263307
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 length of prescribed-size sublists is the binomial coefficient, which is at most the corresponding power of the list length.