Proof of `Small profiles of finite presentations` (1st statement)
groundedproofs/Lax369799Proofs/BoundedProfiles.lean · lax-369799
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
A variable map with fibres bounded by b has domain size at most n times b. Thus the possible bounded entries form a finite set, and initial/root profiles range over two finite powersets.