Proof of `Conjugacy completeness`
groundedproofs/Lax149335Proofs/Results/RationalFunctions.lean · lax-149335
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
Soundness of the rules is checked rule by rule. Completeness is proved by induction on the input type: the rules for moving constants bring a term into a normal form determined by the input type, and the induction steps for products and lists use Levi's lemma, the latter together with the conjugacy rule.