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

Proof of `Provable simplification of rational terms`

groundedproofs/Lax149335Proofs/Results/GeneralCompleteness.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

The grouplift-drop factorisation of the appendix gives a group-lift α:A→Cα : A → C with a one-sided inverse α−1α⁻¹, i.e. α;α−1≡idα ; α⁻¹ ≡ id, such that α−1;fα⁻¹ ; f and α−1;gα⁻¹ ; g are provably equivalent to drops. By Lemma 7.3 there is a lift σ:C→Bσ : C → B with inverse σ−1σ⁻¹ such that σ−1σ⁻¹ composed with these drops gives simple rational terms. The term π=σ−1;α−1π = σ⁻¹ ; α⁻¹ is surjective, since (α;σ);π≡id(α ; σ) ; π ≡ id.