Draft — mutable and not usable as a dependency; its citation marks the draft state.

Proof of `k-types refine each other`

groundedproofs/Lax314295Proofs/Results.lean · lax-314295

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

In the paper

Description

Equal (k+1)(k+1)-types have equal kk-types (Lemma C.4.15, refinement): induction on kk (Transducers.tppropertiesTransducers.tp_properties, first conjunct).

Attribution

Lemma C.4.15 of Transducers, Part C; formalised by Aristotle (Harmonic), PartC/KTypes.leanPartC/KTypes.lean, PartC/MSO.leanPartC/MSO.lean.