Proof of `Syntactic set-algebras and rankwise finiteness` (1st statement)
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 small variable map into n variables has domain size at most n times the small-map bound. Thus the possible small entries form a finite set, and initial/root profiles range over two finite powersets.