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

Proof of `Unary types selected by extremal refinement` (2nd statement)

groundedproofs/Lax369799Proofs/ExtremalUnaryTypes.lean · lax-369799

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

Normalize the accepting context, minimize its unary data, and take the rank-one split witness. Its lower bound and acceptance hold also in rank one.