Proof of `Exhaustive search for small independent-set targets` (1st 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
Every enumerated sublist has no duplicates and length . Conversely, filter the vertex list by the desired finite set to obtain its unique ordered sublist.