`Lean.Meta.mkAppMInst'`🔗

Definition

Similar to mkAppMInst, but takes an Expr instead of a constant name.

def

Lean.Meta.mkAppMInst' (f : Expr) (xs : Array Expr) (n_insts : ℕ) :
  MetaM Expr
Lean.Meta.mkAppMInst' (f : Expr)
  (xs : Array Expr) (n_insts : ℕ) :
  MetaM Expr

Code

def Lean.Meta.mkAppMInst' (f : Expr) (xs : Array Expr) (n_insts : Nat) : MetaM Expr := do
  let e ← mkAppM' f xs
  let nones : Array (Option Expr) := Array.replicate n_insts none
  mkAppOptM' e nones

Actions: Source · Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

Dependency graph

Nothing to draw. Its statement rests on no other declaration in this project, and names nothing from a package left unaudited — so the graph is this declaration alone. That is the answer, not a missing picture.

Audit surface: 0 project declarations, 12 external constants

✓ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.

Lean.Meta.mkAppMInst'🔗

`Lean.Meta.mkAppMInst'`🔗