Proof of `Encoding finite projection-game answers as binary words` (2nd statement)
groundedproofs/Lax253009Proofs/ProjectionEncoding.lean · lax-253009
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
There are at least w Boolean words of length w; apply finite cardinality.