While this submission is a draft, it cannot be used by other submissions.

Proof of `Quantitative automata for the finite bisimulation theorem`

groundedproofs/Lax369799Proofs/QuantitativeAutomata.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.

Read the Lean proof on GitHub

Description

Use the bounded-profile codes to bound the two syntactic sorts and the quantitative linked-pair construction for the branch condition. Clone normalization changes only the transition table, preserving these bounds.