Theorem: Encodable.fintypeArrowEquivFinArrow_symm_app (Logic/Vorspiel/Computability.lean)

State before:
ι : Type u_1
inst✝² : Fintype ι
inst✝¹ : DecidableEq ι
inst✝ : Encodable ι
α : Sort u_2
i : ι
v : Fin (Fintype.card ι) → α
⊢ fintypeArrowEquivFinArrow.symm v i = v (fintypeEquivFin i)
Tactic:
rfl
State after:
no goals