Proof of `Small profiles of finite presentations` (3rd statement)
groundedproofs/Lax369799Proofs/FiniteProfiles.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
Map a profile class to the class of its reachable restriction. This map is injective, and the bounded-profile quotient of reachable systems is finite by the finite-entry counting argument.