Theorem: LambdaCalculi.LambdaTerm.replace'_inl (LambdaCalculi/LambdaCalculus.lean)

State before:
p : LambdaParams
U : Type u_1
C : Type u_2
f : ℕ → LambdaTerm p U C → Option (LambdaTerm p U C)
n : ℕ
h : p.coprod = true
τ : LambdaType p U
l : LambdaTerm p U C
⊢ replace' f n (inl h τ l) =
    match f n (inl h τ l) with
    | some u => u
    | none => inl h τ (replace' f n l)
Tactic:
simp only [replace']
State after:
no goals