elabTerm for Tactics and basic tactics that use it.

def Lean.Elab.Tactic.runTermElab {α : Type} (k : Lean.Elab.TermElabM α) (mayPostpone : optParam Bool false) : Lean.Elab.Tactic.TacticM α

Runs a term elaborator inside a tactic.

This function ensures that term elaboration fails when backtracking, i.e., in first| tac term | other.

def Lean.Elab.Tactic.runTermElab.go {α : Type} (k : Lean.Elab.TermElabM α) (mayPostpone : optParam Bool false) : Lean.Elab.TermElabM α

def Lean.Elab.Tactic.elabTerm (stx : Lean.Syntax) (expectedType? : Option Lean.Expr) (mayPostpone : optParam Bool false) : Lean.Elab.Tactic.TacticM Lean.Expr

Elaborate stx in the current MVarContext. If given, the expectedType will be used to help elaboration but not enforced (use elabTermEnsuringType to enforce an expected type).

def Lean.Elab.Tactic.elabTermEnsuringType (stx : Lean.Syntax) (expectedType? : Option Lean.Expr) (mayPostpone : optParam Bool false) : Lean.Elab.Tactic.TacticM Lean.Expr

Elaborate stx in the current MVarContext. If given, the expectedType will be used to help elaboration and then a TypeMismatchError will be thrown if the elaborated type doesn't match.

def Lean.Elab.Tactic.closeMainGoalUsing (x : Lean.Expr → Lean.Elab.Tactic.TacticM Lean.Expr) (checkUnassigned : optParam Bool true) : Lean.Elab.Tactic.TacticM Unit

Try to close main goal using x target, where target is the type of the main goal.

def Lean.Elab.Tactic.logUnassignedAndAbort (mvarIds : Array Lean.MVarId) : Lean.Elab.Tactic.TacticM Unit

def Lean.Elab.Tactic.filterOldMVars (mvarIds : Array Lean.MVarId) (mvarCounterSaved : Nat) : Lean.MetaM (Array Lean.MVarId)

def Lean.Elab.Tactic.evalExact : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.sortMVarIdArrayByIndex {m : Type → Type} [Lean.MonadMCtx m] [Monad m] (mvarIds : Array Lean.MVarId) : m (Array Lean.MVarId)

def Lean.Elab.Tactic.sortMVarIdsByIndex {m : Type → Type} [Lean.MonadMCtx m] [Monad m] (mvarIds : List Lean.MVarId) : m (List Lean.MVarId)

def Lean.Elab.Tactic.withCollectingNewGoalsFrom (k : Lean.Elab.Tactic.TacticM Lean.Expr) (tagSuffix : Lake.Name) (allowNaturalHoles : optParam Bool false) : Lean.Elab.Tactic.TacticM (Lean.Expr × List Lean.MVarId)

Execute k, and collect new "holes" in the resulting expression.

def Lean.Elab.Tactic.withCollectingNewGoalsFrom.go (k : Lean.Elab.Tactic.TacticM Lean.Expr) (tagSuffix : Lake.Name) (allowNaturalHoles : optParam Bool false) : Lean.Elab.Tactic.TacticM (Lean.Expr × List Lean.MVarId)

def Lean.Elab.Tactic.elabTermWithHoles (stx : Lean.Syntax) (expectedType? : Option Lean.Expr) (tagSuffix : Lake.Name) (allowNaturalHoles : optParam Bool false) : Lean.Elab.Tactic.TacticM (Lean.Expr × List Lean.MVarId)

Elaborates stx and collects the MVarIds of any holes that were created during elaboration.

With allowNaturalHoles := false (the default), any new natural holes (_) which cannot be synthesized during elaboration cause elabTermWithHoles to fail. (Natural goals appearing in stx which were created prior to elaboration are permitted.)

Unnamed MVarIds are renamed to share the main goal's tag. If multiple unnamed goals are encountered, tagSuffix is appended to the main goal's tag along with a numerical index.

Note:

• Previously-created MVarIds which appear in stx are not returned.
• All parts of elabTermWithHoles operate at the current MCtxDepth, and therefore may assign metavariables.
• When allowNaturalHoles := true, stx is elaborated under withAssignableSyntheticOpaque, meaning that .syntheticOpaque metavariables might be assigned during elaboration. This is a consequence of the implementation.

def Lean.Elab.Tactic.refineCore (stx : Lean.Syntax) (tagSuffix : Lake.Name) (allowNaturalHoles : Bool) : Lean.Elab.Tactic.TacticM Unit

If allowNaturalHoles == true, then we allow the resultant expression to contain unassigned "natural" metavariables. Recall that "natutal" metavariables are created for explicit holes _ and implicit arguments. They are meant to be filled by typing constraints. "Synthetic" metavariables are meant to be filled by tactics and are usually created using the synthetic hole notation ?.

def Lean.Elab.Tactic.evalRefine : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalRefine' : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalSpecialize : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.elabTermForApply (stx : Lean.Syntax) (mayPostpone : optParam Bool true) : Lean.Elab.Tactic.TacticM Lean.Expr

Given a tactic

apply f

we want the apply tactic to create all metavariables. The following definition will return @f for f. That is, it will not create metavariables for implicit arguments. A similar method is also used in Lean 3. This method is useful when applying lemmas such as:

theorem infLeRight {s t : Set α} : s ⊓ t ≤ t

where s ≤ t here is defined as

∀ {x : α}, x ∈ s → x ∈ t

def Lean.Elab.Tactic.getFVarId (id : Lean.Syntax) : Lean.Elab.Tactic.TacticM Lean.FVarId

def Lean.Elab.Tactic.getFVarIds (ids : Array Lean.Syntax) : Lean.Elab.Tactic.TacticM (Array Lean.FVarId)

def Lean.Elab.Tactic.evalApplyLikeTactic (tac : Lean.MVarId → Lean.Expr → Lean.MetaM (List Lean.MVarId)) (e : Lean.Syntax) : Lean.Elab.Tactic.TacticM Unit

def Lean.Elab.Tactic.evalApply : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalConstructor : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalWithReducible : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalWithReducibleAndInstances : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalWithUnfoldingAll : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.elabAsFVar (stx : Lean.Syntax) (userName? : optParam (Option Lake.Name) none) : Lean.Elab.Tactic.TacticM Lean.FVarId

Elaborate stx. If it a free variable, return it. Otherwise, assert it, and return the free variable. Note that, the main goal is updated when Meta.assert is used in the second case.

def Lean.Elab.Tactic.evalRename : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalDecide : Lean.Elab.Tactic.Tactic

def Lean.Elab.Tactic.evalNativeDecide : Lean.Elab.Tactic.Tactic