Additional utilities in Lean.MVarId

def Lean.MVarId.synthInstance (g : Lean.MVarId) : Lean.MetaM Unit

Solve a goal by synthesizing an instance.

def Lean.MVarId.replace (g : Lean.MVarId) (hyp : Lean.FVarId) (proof : Lean.Expr) (typeNew : optParam (Option Lean.Expr) none) : Lean.MetaM Lean.Meta.AssertAfterResult

Replace hypothesis hyp in goal g with proof : typeNew. The new hypothesis is given the same user name as the original, it attempts to avoid reordering hypotheses, and the original is cleared if possible.

def Lean.MVarId.replace.findMaxFVar (e : Lean.Expr) : StateRefT' IO.RealWorld Lean.LocalDecl Lean.MetaM Unit

Finds the LocalDecl for the FVar in e with the highest index.

def Lean.MVarId.note (g : Lean.MVarId) (h : Lean.Name) (v : Lean.Expr) (t : optParam (Option Lean.Expr) none) : Lean.MetaM (Lean.FVarId × Lean.MVarId)

Add the hypothesis h : t, given v : t, and return the new FVarId.

def Lean.MVarId.let (g : Lean.MVarId) (h : Lean.Name) (v : Lean.Expr) (t : optParam (Option Lean.Expr) none) : Lean.MetaM (Lean.FVarId × Lean.MVarId)

Add the hypothesis h : t, given v : t, and return the new FVarId.

def Lean.MVarId.applyConst (mvar : Lean.MVarId) (c : Lean.Name) (cfg : optParam Lean.Meta.ApplyConfig { newGoals := Lean.Meta.ApplyNewGoals.nonDependentFirst, synthAssignedInstances := true, allowSynthFailures := false, approx := true }) : Lean.MetaM (List Lean.MVarId)

Short-hand for applying a constant to the goal.

def Lean.MVarId.existsi (mvar : Lean.MVarId) (es : List Lean.Expr) : Lean.MetaM Lean.MVarId

Has the effect of refine ⟨e₁,e₂,⋯, ?_⟩.

def Lean.MVarId.intros! (mvarId : Lean.MVarId) : Lean.MetaM (Array Lean.FVarId × Lean.MVarId)

Applies intro repeatedly until it fails. We use this instead of Lean.MVarId.intros to allowing unfolding. For example, if we want to do introductions for propositions like ¬p, the ¬ needs to be unfolded into → False, and intros does not do such unfolding.

partial def Lean.MVarId.intros!.run (mvarId : Lean.MVarId) (acc : Array Lean.FVarId) (g : Lean.MVarId) : Lean.MetaM (Array Lean.FVarId × Lean.MVarId)

Implementation of intros!.

def Lean.MVarId.subsingleton? (g : Lean.MVarId) : Lean.MetaM Bool

Check if a goal is of a subsingleton type.

def Lean.MVarId.independent? (L : List Lean.MVarId) (g : Lean.MVarId) : Lean.MetaM Bool

Check if a goal is "independent" of a list of other goals. We say a goal is independent of other goals if assigning a value to it can not change the solvability of the other goals.

This function only calculates a conservative approximation of this condition.

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

Try to convert an Iff into an Eq by applying iff_of_eq. If successful, returns the new goal, and otherwise returns the original MVarId.

This may be regarded as being a special case of Lean.MVarId.liftReflToEq, specifically for Iff.

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

Try to convert an Eq into an Iff by applying propext. If successful, then returns then new goal, otherwise returns the original MVarId.

def Lean.MVarId.proofIrrelHeq (mvarId : Lean.MVarId) : Lean.MetaM Bool

Try to close the goal with using proof_irrel_heq. Returns whether or not it succeeds.

We need to be somewhat careful not to assign metavariables while doing this, otherwise we might specialize Sort _ to Prop.

def Lean.MVarId.subsingletonElim (mvarId : Lean.MVarId) : Lean.MetaM Bool

Try to close the goal using Subsingleton.elim. Returns whether or not it succeeds.

We are careful to apply Subsingleton.elim in a way that does not assign any metavariables. This is to prevent the Subsingleton Prop instance from being used as justification to specialize Sort _ to Prop.

def Lean.Meta.getLocalHyps {m : Type → Type} [Monad m] [Lean.MonadLCtx m] : m (Array Lean.Expr)

Return local hypotheses which are not "implementation detail", as Exprs.

def Lean.Meta.countLocalHypsUsed {m : Type → Type} [Monad m] [Lean.MonadLCtx m] [Lean.MonadMCtx m] (e : Lean.Expr) : m Nat

Count how many local hypotheses appear in an expression.

def Lean.Meta.mapForallTelescope' (F : Lean.Expr → Lean.Expr → Lean.MetaM Lean.Expr) (forallTerm : Lean.Expr) : Lean.MetaM Lean.Expr

Given a monadic function F that takes a type and a term of that type and produces a new term, lifts this to the monadic function that opens a ∀ telescope, applies F to the body, and then builds the lambda telescope term for the new term.

def Lean.Meta.mapForallTelescope (F : Lean.Expr → Lean.MetaM Lean.Expr) (forallTerm : Lean.Expr) : Lean.MetaM Lean.Expr

Given a monadic function F that takes a term and produces a new term, lifts this to the monadic function that opens a ∀ telescope, applies F to the body, and then builds the lambda telescope term for the new term.

def Lean.MVarId.getType'' (mvarId : Lean.MVarId) : Lean.MetaM Lean.Expr

Get the type the given metavariable after instantiating metavariables and cleaning up annotations.

def Lean.Elab.Tactic.liftMetaTactic' (tac : Lean.MVarId → Lean.MetaM Lean.MVarId) : Lean.Elab.Tactic.TacticM Unit

Analogue of liftMetaTactic for tactics that return a single goal.

def Lean.Elab.Tactic.liftMetaFinishingTactic (tac : Lean.MVarId → Lean.MetaM Unit) : Lean.Elab.Tactic.TacticM Unit

Analogue of liftMetaTactic for tactics that do not return any goals.

def Lean.Elab.Tactic.run_for {α : Type} (mvarId : Lean.MVarId) (x : Lean.Elab.Tactic.TacticM α) : Lean.Elab.TermElabM (Option α × List Lean.MVarId)

Copy of Lean.Elab.Tactic.run that can return a value.