elabTerm for Tactics and basic tactics that use it.

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

Runs a term elaborator inside a tactic, finalizing elaboration with Term.synthesizeSyntheticMVars.

• mayPostpone controls the postponement behavior of Term.synthesizeSyntheticMVars.

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

def Lean.Elab.Tactic.elabTerm (stx : Syntax) (expectedType? : Option Expr) (mayPostpone : Bool := false) : TacticM 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 : Syntax) (expectedType? : Option Expr) (mayPostpone : Bool := false) : TacticM 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.logUnassignedAndAbort (mvarIds : Array MVarId) : TacticM Unit

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

def Lean.Elab.Tactic.closeMainGoalUsing (tacName : Name) (x : Expr → Name → TacticM Expr) (checkNewUnassigned : Bool := true) : TacticM Unit

Try to close main goal using x target tag, where target is the type of the main goal and tag is its user name.

If checkNewUnassigned is true, then throws an error if the resulting value has metavariables that were created during the execution of x. If it is false, then it is the responsibility of x to add such metavariables to the goal list.

During the execution of x:

• The local context is that of the main goal.
• The goal list has the main goal removed.
• It is allowable to modify the goal list, for example with Lean.Elab.Tactic.pushGoals.

On failure, the main goal remains at the front of the goal list.

def Lean.Elab.Tactic.evalExact : Tactic

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

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

def Lean.Elab.Tactic.collectFreshMVars {m : Type → Type u_1} [Monad m] [MonadLiftT MetaM m] (k : m Expr) : m (Expr × Array MVarId)

Execute k, and collect any fresh metavariables created during the execution of k.

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

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

• parentTag and tagSuffix are used to tag untagged goals with Lean.Elab.Tactic.tagUntaggedGoals.
• If allowNaturalHoles is true, then _'s are allowed and create new goals.

def Lean.Elab.Tactic.elabTermWithHoles (stx : Syntax) (expectedType? : Option Expr) (tagSuffix : Name) (allowNaturalHoles : Bool := false) (parentTag? : Option Name := none) : TacticM (Expr × List 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 tag parentTag? (or the main goal's tag if parentTag? is none). If multiple unnamed goals are encountered, tagSuffix is appended to this 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 : Syntax) (tagSuffix : Name) (allowNaturalHoles : Bool) : TacticM Unit

If allowNaturalHoles == true, then we allow the resultant expression to contain unassigned "natural" metavariables. Recall that "natural" 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 ?<hole-name>.

def Lean.Elab.Tactic.evalRefine : Tactic

def Lean.Elab.Tactic.evalRefine' : Tactic

def Lean.Elab.Tactic.evalSpecialize : Tactic

def Lean.Elab.Tactic.elabTermForApply (stx : Syntax) (mayPostpone : Bool := true) : TacticM 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 : Syntax) : TacticM FVarId

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

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

def Lean.Elab.Tactic.evalApply : Tactic

def Lean.Elab.Tactic.evalConstructor : Tactic

def Lean.Elab.Tactic.evalWithReducible : Tactic

def Lean.Elab.Tactic.evalWithReducibleAndInstances : Tactic

def Lean.Elab.Tactic.evalWithUnfoldingAll : Tactic

def Lean.Elab.Tactic.evalWithUnfoldingNone : Tactic

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

Elaborate stx. If it is 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 : Tactic