chore: normalize spelling

src/Lean/Elab/Term.lean

@@ -1196,7 +1196,7 @@ private def decorateErrorMessageWithLambdaImplicitVars (ex : Exception) (impFVar
     if impFVars.isEmpty then
       return Exception.error ref msg
     else
-      let mut msg := m!"{msg}\nthe following variables have been introduced by the implicit lamda feature"
+      let mut msg := m!"{msg}\nthe following variables have been introduced by the implicit lambda feature"
       for impFVar in impFVars do
         let auxMsg := m!"{impFVar} : {← inferType impFVar}"
         let auxMsg ← addMessageContext auxMsg

tests/lean/mulcommErrorMessage.lean.expected.out

@@ -4,7 +4,7 @@ has type
   (a : ?m) → (b : ?m a) → ?m a b : Sort (imax ?u ?u ?u)
 but is expected to have type
   a✝ * b✝ = b✝ * a✝ : Prop
-the following variables have been introduced by the implicit lamda feature
+the following variables have been introduced by the implicit lambda feature
   a✝ : Bool
   b✝ : Bool
 you can disable implict lambdas using `@` or writing a lambda expression with `{}` or `[]` binder annotations.
@@ -20,7 +20,7 @@ has type
   (a b : Bool) → ?m a b a : Sort (imax 1 1 ?u)
 but is expected to have type
   a✝ * b✝ = b✝ * a✝ : Prop
-the following variables have been introduced by the implicit lamda feature
+the following variables have been introduced by the implicit lambda feature
   a✝ : Bool
   b✝ : Bool
 you can disable implict lambdas using `@` or writing a lambda expression with `{}` or `[]` binder annotations.

tests/lean/run/meta.lean

@@ -21,7 +21,7 @@ def mkLam1 : MetaM Expr :=
     -- Double backticks instruct Lean to resolve the names at compilation time
     let b ← mkAppM ``HAdd.hAdd #[x, y] -- `x + y`
     let b ← mkAppM ``HAdd.hAdd #[b, x] -- `x + y + x`
-    /- `mkLamdaFVars` converts the free variables into de-Bruijn bound variables, and construct the lambda for us. -/
+    /- `mkLambdaFVars` converts the free variables into de-Bruijn bound variables, and construct the lambda for us. -/
     mkLambdaFVars #[x, y] b
 
 #eval execShow mkLam1