Skip to content

[ refactor ] proofs in Relation.Nullary.Decidable and a reexport in Function.Related.TypeIsomorphisms #2737

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 4 commits into
base: master
Choose a base branch
from

Conversation

jamesmckinna
Copy link
Contributor

@jamesmckinna jamesmckinna commented Jun 20, 2025

This a conservative refactoring which:

  • cleans up the proof of Relation.Nullary.Decidable.True-↔ to:
    • [ cosmetic ] reuse existing definitions toWitness/fromWitness from Relation.Nullary.Decidable.Core
    • [ add ] appeal to a new local lemma from-to which could be lifted out to top-level?
  • [ refactor ] avoids the redundant repetition in Function.Related.TypeIsomorphisms by a public renaming export of the above, cf. [DRY] Refactor algebraic properties of types #2489
  • cleans up the proof of Relation.Nullary.Decidable.via-injection to:
    • [ cosmetic] clarify the local opening of the Injection argument injection
  • tidies up the relevant imports to reflect the above refactorings

As such, no CHANGELOG required, but could potentially:

  • add from-to (suitably named) as top-level lemma
  • deprecate Function.Related.TypeIsomorphisms.True↔ in favour of Relation.Nullary.Decidable.True-↔

@jamesmckinna jamesmckinna added this to the v2.3 milestone Jun 20, 2025
@jamesmckinna jamesmckinna changed the title [ refactor ] proofs in Relation.Nullary.Decidable and its reexport in Function.Related.TypeIsomorphisms [ refactor ] proofs in Relation.Nullary.Decidable and a reexport in Function.Related.TypeIsomorphisms Jun 20, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants