Minimal-member bound for a Razborov-closed family

An $r$-closed family has at most $(r-1{)}^k$ inclusion-minimal members of cardinality $k$. This limits the number of cliques accepted by a proper closed approximation.