Theorem: LambdaCalculi.LambdaTerm.replace'_lambda (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.lambda = true
τ : LambdaType p U
t : LambdaTerm p U C
⊢ replace' f n (lambda h τ t) =
    match f n (lambda h τ t) with
    | some u => u
    | none => lambda h τ (replace' f (n + 1) t)
Tactic:
simp only [replace']
State after:
no goals