opaque Lean.Meta.tactic.hygienic : Lean.Option Bool

def Lean.Meta.mkFreshBinderNameForTactic (binderName : Lean.Name) : Lean.MetaM Lean.Name

Similar to mkFreshUserName, but takes into account tactic.hygienic option value. If tactic.hygienic = true, then the current macro scopes are applied to binderName. If not, then an unused (accessible) name (based on binderName) in the local context is used.

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.introNCore (mvarId : Lean.MVarId) (n : Nat) (givenNames : List Lean.Name) (useNamesForExplicitOnly : Bool) (preserveBinderNames : Bool) : Lean.MetaM (Array Lean.FVarId × Lean.MVarId)

Equations

• One or more equations did not get rendered due to their size.

@[reducible, inline]

abbrev Lean.MVarId.introN (mvarId : Lean.MVarId) (n : Nat) (givenNames : optParam (List Lean.Name) []) (useNamesForExplicitOnly : optParam Bool false) : Lean.MetaM (Array Lean.FVarId × Lean.MVarId)

Introduce n binders in the goal mvarId.

Equations

• mvarId.introN n givenNames useNamesForExplicitOnly = Lean.Meta.introNCore mvarId n givenNames useNamesForExplicitOnly false

@[reducible, inline]

abbrev Lean.MVarId.introNP (mvarId : Lean.MVarId) (n : Nat) : Lean.MetaM (Array Lean.FVarId × Lean.MVarId)

Introduce n binders in the goal mvarId. The new hypotheses are named using the binder names. The suffix P stands for "preserving`.

Equations

• mvarId.introNP n = Lean.Meta.introNCore mvarId n [] false true

def Lean.MVarId.intro (mvarId : Lean.MVarId) (name : Lean.Name) : Lean.MetaM (Lean.FVarId × Lean.MVarId)

Introduce one binder using name as the new hypothesis name.

Equations

• mvarId.intro name = do let __discr ← mvarId.introN 1 [name] match __discr with | (fvarIds, mvarId) => pure (fvarIds[0]!, mvarId)

def Lean.Meta.intro1Core (mvarId : Lean.MVarId) (preserveBinderNames : Bool) : Lean.MetaM (Lean.FVarId × Lean.MVarId)

Equations

• One or more equations did not get rendered due to their size.

@[reducible, inline]

abbrev Lean.MVarId.intro1 (mvarId : Lean.MVarId) : Lean.MetaM (Lean.FVarId × Lean.MVarId)

Introduce one object from the goal mvarid, without preserving the name used in the binder. Returns a pair made of the newly introduced variable (which will have an inaccessible name) and the new goal. This will fail if there is nothing to introduce, ie when the goal does not start with a forall, lambda or let.

Equations

• mvarId.intro1 = Lean.Meta.intro1Core mvarId false

@[reducible, inline]

abbrev Lean.MVarId.intro1P (mvarId : Lean.MVarId) : Lean.MetaM (Lean.FVarId × Lean.MVarId)

Introduce one object from the goal mvarid, preserving the name used in the binder. Returns a pair made of the newly introduced variable and the new goal. This will fail if there is nothing to introduce, ie when the goal does not start with a forall, lambda or let.

Equations

• mvarId.intro1P = Lean.Meta.intro1Core mvarId true

partial def Lean.Meta.getIntrosSize : Lean.Expr → Nat

Calculate the number of new hypotheses that would be created by intros, i.e. the number of binders which can be introduced without unfolding definitions.

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

Introduce as many binders as possible without unfolding definitions.

Equations

• mvarId.intros = do let type ← mvarId.getType let type ← Lean.instantiateMVars type let n : Nat := Lean.Meta.getIntrosSize type if (n == 0) = true then pure (#[], mvarId) else mvarId.introN n