Bijection from a finite group

Stream: new members

[Brendan Seamas Murphy]

I have some type A with elements x0, x1 : A and proofs x0 ≠ x1, ∀ x, x = x0 ∨ x = x1. What's the easiest way to turn this into an equivalence fin 2 ≃ A?