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

State before:
ι : Type u_1
inst✝² : Fintype ι
inst✝¹ : DecidableEq ι
inst✝ : Encodable ι
⊢ fintypeEquivFin.symm 1 = true
Tactic:
simp [fintypeEquivFin]
State after:
ι : Type u_1
inst✝² : Fintype ι
inst✝¹ : DecidableEq ι
inst✝ : Encodable ι
⊢ (sortedUniv Bool).get (cast ⋯ 1) = true

State before:
ι : Type u_1
inst✝² : Fintype ι
inst✝¹ : DecidableEq ι
inst✝ : Encodable ι
⊢ (sortedUniv Bool).get (cast ⋯ 1) = true
Tactic:
rfl
State after:
no goals