Theorem: Primrec.w_elim (Logic/Vorspiel/W.lean)

State before:
τ : Type u_1
σ : Type u_2
α : Type u_3
γ : Type u_4
β : α → Type u_5
inst✝⁸ : Primcodable τ
inst✝⁷ : Primcodable σ
inst✝⁶ : Primcodable α
inst✝⁵ : (a : α) → Fintype (β a)
inst✝⁴ : (a : α) → DecidableEq (β a)
inst✝³ : (a : α) → Primcodable (β a)
inst✝² : PrimrecCard β
inst✝¹ : Primcodable γ
inst✝ : Inhabited γ
f : (a : α) × (β a → γ) → γ
hf : Primrec₂ fun a l => f ⟨a, fintypeArrowEquivFinArrow.symm fun i => l.getI ↑i⟩
w : WType β
⊢ elimL (fun a l => f ⟨a, fintypeArrowEquivFinArrow.symm fun i => l.getI ↑i⟩) w = elim γ f w
Tactic:
simp[elim_eq_elimL]
State after:
no goals