inductive Lean.Meta.Origin : Type

• decl: Lake.Name → Lean.Meta.Origin

  A global declaration in the environment.

• fvar: Lean.FVarId → Lean.Meta.Origin

  A local hypothesis. When contextual := true is enabled, this fvar may exist in an extension of the current local context; it will not be used for rewriting by simp once it is out of scope but it may end up in the usedSimps trace.

• stx: Lake.Name → Lean.Syntax → Lean.Meta.Origin

  A proof term provided directly to a call to simp [ref, ...] where ref is the provided simp argument (of kind Parser.Tactic.simpLemma). The id is a unique identifier for the call.

• other: Lake.Name → Lean.Meta.Origin

  Some other origin. name should not collide with the other types for erasure to work correctly, and simp trace will ignore this lemma. The other origins should be preferred if possible.

An Origin is an identifier for simp theorems which indicates roughly what action the user took which lead to this theorem existing in the simp set.

instance Lean.Meta.instInhabitedOrigin : Inhabited Lean.Meta.Origin

instance Lean.Meta.instReprOrigin : Repr Lean.Meta.Origin

def Lean.Meta.Origin.key : Lean.Meta.Origin → Lake.Name

A unique identifier corresponding to the origin.

instance Lean.Meta.instBEqOrigin : BEq Lean.Meta.Origin

instance Lean.Meta.instHashableOrigin : Hashable Lean.Meta.Origin

@[inline, reducible]

abbrev Lean.Meta.SimpTheoremKey : Type

structure Lean.Meta.SimpTheorem : Type

• keys : Array Lean.Meta.SimpTheoremKey
• levelParams : Array Lake.Name

  It stores universe parameter names for universe polymorphic proofs. Recall that it is non-empty only when we elaborate an expression provided by the user. When proof is just a constant, we can use the universe parameter names stored in the declaration.

• proof : Lean.Expr
• priority : Nat
• post : Bool
• perm : Bool

  perm is true if lhs and rhs are identical modulo permutation of variables.

• origin : Lean.Meta.Origin

  origin is mainly relevant for producing trace messages. It is also viewed an id used to "erase" simp theorems from SimpTheorems.

• rfl : Bool

  rfl is true if proof is by Eq.refl or rfl.

The fields levelParams and proof are used to encode the proof of the simp theorem. If the proof is a global declaration c, we store Expr.const c [] at proof without the universe levels, and levelParams is set to #[] When using the lemma, we create fresh universe metavariables. Motivation: most simp theorems are global declarations, and this approach is faster and saves memory.

The field levelParams is not empty only when we elaborate an expression provided by the user, and it contains universe metavariables. Then, we use abstractMVars to abstract the universe metavariables and create new fresh universe parameters that are stored at the field levelParams.

instance Lean.Meta.instInhabitedSimpTheorem : Inhabited Lean.Meta.SimpTheorem

partial def Lean.Meta.isRflProofCore (type : Lean.Expr) (proof : Lean.Expr) : Lean.CoreM Bool

partial def Lean.Meta.isRflTheorem (declName : Lake.Name) : Lean.CoreM Bool

def Lean.Meta.isRflProof (proof : Lean.Expr) : Lean.MetaM Bool

instance Lean.Meta.instToFormatSimpTheorem : Lean.ToFormat Lean.Meta.SimpTheorem

def Lean.Meta.ppOrigin {m : Type → Type} [Monad m] [Lean.MonadEnv m] [Lean.MonadError m] : Lean.Meta.Origin → m Lean.MessageData

def Lean.Meta.ppSimpTheorem {m : Type → Type} [Monad m] [MonadLiftT IO m] [Lean.MonadEnv m] [Lean.MonadError m] (s : Lean.Meta.SimpTheorem) : m Lean.MessageData

instance Lean.Meta.instBEqSimpTheorem : BEq Lean.Meta.SimpTheorem

@[inline, reducible]

abbrev Lean.Meta.SimpTheoremTree : Type

structure Lean.Meta.SimpTheorems : Type

• pre : Lean.Meta.SimpTheoremTree
• post : Lean.Meta.SimpTheoremTree
• lemmaNames : Lean.PHashSet Lean.Meta.Origin
• toUnfold : Lean.PHashSet Lake.Name
• erased : Lean.PHashSet Lean.Meta.Origin
• toUnfoldThms : Lean.PHashMap Lake.Name (Array Lake.Name)

instance Lean.Meta.instInhabitedSimpTheorems : Inhabited Lean.Meta.SimpTheorems

def Lean.Meta.addSimpTheoremEntry (d : Lean.Meta.SimpTheorems) (e : Lean.Meta.SimpTheorem) : Lean.Meta.SimpTheorems

def Lean.Meta.addSimpTheoremEntry.updateLemmaNames (e : Lean.Meta.SimpTheorem) (s : Lean.PHashSet Lean.Meta.Origin) : Lean.PHashSet Lean.Meta.Origin

def Lean.Meta.SimpTheorems.addDeclToUnfoldCore (d : Lean.Meta.SimpTheorems) (declName : Lake.Name) : Lean.Meta.SimpTheorems

def Lean.Meta.SimpTheorems.isDeclToUnfold (d : Lean.Meta.SimpTheorems) (declName : Lake.Name) : Bool

Return true if declName is tagged to be unfolded using unfoldDefinition? (i.e., without using equational theorems).

def Lean.Meta.SimpTheorems.isLemma (d : Lean.Meta.SimpTheorems) (thmId : Lean.Meta.Origin) : Bool

def Lean.Meta.SimpTheorems.registerDeclToUnfoldThms (d : Lean.Meta.SimpTheorems) (declName : Lake.Name) (eqThms : Array Lake.Name) : Lean.Meta.SimpTheorems

Register the equational theorems for the given definition.

partial def Lean.Meta.SimpTheorems.eraseCore (d : Lean.Meta.SimpTheorems) (thmId : Lean.Meta.Origin) : Lean.Meta.SimpTheorems

def Lean.Meta.SimpTheorems.erase {m : Type → Type} [Monad m] [Lean.MonadError m] (d : Lean.Meta.SimpTheorems) (thmId : Lean.Meta.Origin) : m Lean.Meta.SimpTheorems

inductive Lean.Meta.SimpEntry : Type

• thm: Lean.Meta.SimpTheorem → Lean.Meta.SimpEntry
• toUnfold: Lake.Name → Lean.Meta.SimpEntry
• toUnfoldThms: Lake.Name → Array Lake.Name → Lean.Meta.SimpEntry

instance Lean.Meta.instInhabitedSimpEntry : Inhabited Lean.Meta.SimpEntry

@[inline, reducible]

abbrev Lean.Meta.SimpExtension : Type

def Lean.Meta.SimpExtension.getTheorems (ext : Lean.Meta.SimpExtension) : Lean.CoreM Lean.Meta.SimpTheorems

def Lean.Meta.addSimpTheorem (ext : Lean.Meta.SimpExtension) (declName : Lake.Name) (post : Bool) (inv : Bool) (attrKind : Lean.AttributeKind) (prio : Nat) : Lean.MetaM Unit

def Lean.Meta.mkSimpAttr (attrName : Lake.Name) (attrDescr : String) (ext : Lean.Meta.SimpExtension) (ref : autoParam Lake.Name _auto✝) : IO Unit

def Lean.Meta.mkSimpExt (name : autoParam Lake.Name _auto✝) : IO Lean.Meta.SimpExtension

@[inline, reducible]

abbrev Lean.Meta.SimpExtensionMap : Type

opaque Lean.Meta.simpExtensionMapRef : IO.Ref Lean.Meta.SimpExtensionMap

def Lean.Meta.registerSimpAttr (attrName : Lake.Name) (attrDescr : String) (ref : autoParam Lake.Name _auto✝) : IO Lean.Meta.SimpExtension

opaque Lean.Meta.simpExtension : Lean.Meta.SimpExtension

def Lean.Meta.getSimpExtension? (attrName : Lake.Name) : IO (Option Lean.Meta.SimpExtension)

def Lean.Meta.getSimpTheorems : Lean.CoreM Lean.Meta.SimpTheorems

def Lean.Meta.SimpTheorems.addConst (s : Lean.Meta.SimpTheorems) (declName : Lake.Name) (post : optParam Bool true) (inv : optParam Bool false) (prio : optParam Nat 1000) : Lean.MetaM Lean.Meta.SimpTheorems

Auxiliary method for adding a global declaration to a SimpTheorems datastructure.

def Lean.Meta.SimpTheorem.getValue (simpThm : Lean.Meta.SimpTheorem) : Lean.MetaM Lean.Expr

def Lean.Meta.mkSimpTheorems (id : Lean.Meta.Origin) (levelParams : Array Lake.Name) (proof : Lean.Expr) (post : optParam Bool true) (inv : optParam Bool false) (prio : optParam Nat 1000) : Lean.MetaM (Array Lean.Meta.SimpTheorem)

Auxiliary method for creating simp theorems from a proof term val.

def Lean.Meta.SimpTheorems.add (s : Lean.Meta.SimpTheorems) (id : Lean.Meta.Origin) (levelParams : Array Lake.Name) (proof : Lean.Expr) (inv : optParam Bool false) (post : optParam Bool true) (prio : optParam Nat 1000) : Lean.MetaM Lean.Meta.SimpTheorems

Auxiliary method for adding a local simp theorem to a SimpTheorems datastructure.

def Lean.Meta.SimpTheorems.addDeclToUnfold (d : Lean.Meta.SimpTheorems) (declName : Lake.Name) : Lean.MetaM Lean.Meta.SimpTheorems

@[inline, reducible]

abbrev Lean.Meta.SimpTheoremsArray : Type

def Lean.Meta.SimpTheoremsArray.addTheorem (thmsArray : Lean.Meta.SimpTheoremsArray) (id : Lean.Meta.Origin) (h : Lean.Expr) : Lean.MetaM Lean.Meta.SimpTheoremsArray

def Lean.Meta.SimpTheoremsArray.eraseTheorem (thmsArray : Lean.Meta.SimpTheoremsArray) (thmId : Lean.Meta.Origin) : Lean.Meta.SimpTheoremsArray

def Lean.Meta.SimpTheoremsArray.isErased (thmsArray : Lean.Meta.SimpTheoremsArray) (thmId : Lean.Meta.Origin) : Bool

def Lean.Meta.SimpTheoremsArray.isDeclToUnfold (thmsArray : Lean.Meta.SimpTheoremsArray) (declName : Lake.Name) : Bool

def Lean.Parser.Command.registerSimpAttr : Lean.ParserDescr