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

Proof of `Simplification of rational terms`

groundedproofs/Lax149335Proofs/Results/RationalFunctions.lean · lax-149335

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.

Read the Lean proof on GitHub

Description

By Theorem 7.7 (provable simplification), there is a surjective term ππ after which both terms are provably equivalent to simple rational terms of the compositional syntax. By soundness, the denotation of ππ is surjective, and the denotations of the two compositions are those of simple rational terms of the compositional syntax, which are represented by simple rational terms of Definition 2.5.