Specifically: for an IsDecEquivalence structure/DecSetoid bundle, it might be a useful enhancement to have proofs that the underlying relation
x ≈ y is equivalent to True (x ≟ y), and thus, for example, we have 'reflexivity modulo True' ie. x ≟ x ≡ yes _ etc. , cf. Relation.Binary.PropositionalEquality.{≡-≟-identity|≢-≟-identity} for analogues in the case for _≡_.
Issue: avoiding lots of repetitive reasoning by decision on x ≟ y, and going via contradiction in the non-equal case... etc.
Opportunity: potentially lots for downstream refactoring?