Proof of `Shuffle automata and shuffle-finite series` (5th statement)
What this proof establishes
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
The shuffle-finite series form an effective prevariety over a finite alphabet (paper §6, theorem): the effective prevariety has presentations given by shuffle automata, and its image is exactly the shuffle-finite series (by the coincidence, ).