def Lean.MVarId.ensureNoMVar (mvarId : MVarId) : MetaM Unit

Throws an exception if target of the given goal contains metavariables.

def Lean.MVarId.instantiateGoalMVars (mvarId : MVarId) : MetaM MVarId

Instantiates metavariables occurring in the target and hypotheses.

def Lean.MVarId.abstractMVars (mvarId : MVarId) : MetaM MVarId

Abstracts metavariables occurring in the target.

def Lean.MVarId.transformTarget (mvarId : MVarId) (f : Expr → MetaM Expr) : MetaM MVarId

def Lean.MVarId.unfoldReducible (mvarId : MVarId) : MetaM MVarId

Unfolds all reducible declarations occurring in the goal's target.

def Lean.MVarId.betaReduce (mvarId : MVarId) : MetaM MVarId

Beta-reduces the goal's target.

def Lean.MVarId.byContra? (mvarId : MVarId) : MetaM (Option MVarId)

If the target is not False, applies byContradiction.

def Lean.MVarId.clearImplDetails (mvarId : MVarId) : MetaM MVarId

Clears auxiliary and implementation detail decls used to encode recursive declarations and implementation details.

• grind eliminates auxiliary declarations to ensure they are not accidentally used by its proof automation.
• grind eliminates implementation detail declarations because they have a support role.

def Lean.Meta.Grind.eraseIrrelevantMData (e : Expr) : CoreM Expr

In the grind tactic, during Expr internalization, we don't expect to find Expr.mdata. This function ensures Expr.mdata is not found during internalization. Recall that we do not internalize Expr.lam children. Recall that we still have to process Expr.forallE because of ForallProp.lean. Moreover, we may not want to reduce p → q to ¬p ∨ q when (p q : Prop).

def Lean.Meta.Grind.foldProjs (e : Expr) : MetaM Expr

Converts nested Expr.projs into projection applications if possible.

def Lean.Meta.Grind.normalizeLevels (e : Expr) : CoreM Expr

Normalizes universe levels in constants and sorts.

@[extern lean_grind_normalize]

opaque Lean.Meta.Grind.normalize (e : Expr) (config : Grind.Config) : MetaM Expr

Normalizes the given expression using the grind simplification theorems and simprocs. This function is used for normalizing E-matching patterns. Note that it does not return a proof.

def Lean.Meta.Grind.markAsMatchCond (e : Expr) : Expr

Returns Grind.MatchCond e. We have special support for propagating is truth value. See comment at MatchCond.lean.

def Lean.Meta.Grind.isMatchCond (e : Expr) : Bool

def Lean.Meta.Grind.markAsPreMatchCond (e : Expr) : Expr

Returns Grind.PreMatchCond e. Recall that Grind.PreMatchCond is an identity function, but the simproc reducePreMatchCond is used to prevent the term e from being simplified. Grind.PreMatchCond is later converted into Grind.MatchCond. See comment at MatchCond.lean.

def Lean.Meta.Grind.isPreMatchCond (e : Expr) : Bool

def Lean.Meta.Grind.reducePreMatchCond : Simp.DSimproc

def Lean.Meta.Grind.addPreMatchCondSimproc (s : Simprocs) : CoreM Simprocs

Adds reducePreMatchCond to s

def Lean.Meta.Grind.replacePreMatchCond (e : Expr) : MetaM Simp.Result

Converts Grind.PreMatchCond into Grind.MatchCond. Recall that Grind.PreMatchCond uses default reducibility setting, but Grind.MatchCond does not.

def Lean.Meta.Grind.isIte (e : Expr) : Bool

def Lean.Meta.Grind.isDIte (e : Expr) : Bool

def Lean.Meta.Grind.getBinOp (e : Expr) : Option Expr