Theorem: Fintype.app_invFun (LeanSAT/Upstream/ToMathlib.lean)

State before:
α : Type u_1
α' : Type u_2
inst✝¹ : Fintype α
inst✝ : DecidableEq α'
f : α ↪ α'
f' : α → α'
x : { x // x ∈ Finset.map f Finset.univ }
⊢ f' = f.toFun → f' ((invFun f) x) = ↑x
Tactic:
rintro rfl
State after:
α : Type u_1
α' : Type u_2
inst✝¹ : Fintype α
inst✝ : DecidableEq α'
f : α ↪ α'
x : { x // x ∈ Finset.map f Finset.univ }
⊢ f.toFun ((invFun f) x) = ↑x

State before:
α : Type u_1
α' : Type u_2
inst✝¹ : Fintype α
inst✝ : DecidableEq α'
f : α ↪ α'
x : { x // x ∈ Finset.map f Finset.univ }
⊢ f.toFun ((invFun f) x) = ↑x
Tactic:
simp [invFun, Finset.app_mapEquiv_symm]
State after:
no goals