Theorem: LambdaCalculi.LambdaTerm.replace'_const (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 : ℕ
c : C
⊢ replace' f n (const c) =
    match f n (const c) with
    | some u => u
    | none => const c
Tactic:
simp only [replace']
State after:
no goals