structure Lean.Meta.SimpAll.Entry : Type

• fvarId : Lean.FVarId
• userName : Lean.Name
• id : Lean.Meta.Origin
• origType : Lean.Expr
• type : Lean.Expr
• proof : Lean.Expr

instance Lean.Meta.SimpAll.instInhabitedEntry : Inhabited Lean.Meta.SimpAll.Entry

structure Lean.Meta.SimpAll.State : Type

• modified : Bool
• mvarId : Lean.MVarId
• entries : Array Lean.Meta.SimpAll.Entry
• ctx : Lean.Meta.Simp.Context
• simprocs : Lean.Meta.Simp.SimprocsArray
• usedTheorems : Lean.Meta.Simp.UsedSimps
• diag : Lean.Meta.Simp.Diagnostics

@[reducible, inline]

abbrev Lean.Meta.SimpAll.M (α : Type) : Type

def Lean.Meta.SimpAll.main : Lean.Meta.SimpAll.M (Option Lean.MVarId)

def Lean.Meta.simpAll (mvarId : Lean.MVarId) (ctx : Lean.Meta.Simp.Context) (simprocs : Lean.Meta.Simp.SimprocsArray := #[]) (stats : Lean.Meta.Simp.Stats := { usedTheorems := { map := { root := Lean.PersistentHashMap.Node.entries Lean.PersistentHashMap.mkEmptyEntriesArray }, size := 0 }, diag := { usedThmCounter := { root := Lean.PersistentHashMap.Node.entries Lean.PersistentHashMap.mkEmptyEntriesArray }, triedThmCounter := { root := Lean.PersistentHashMap.Node.entries Lean.PersistentHashMap.mkEmptyEntriesArray }, congrThmCounter := { root := Lean.PersistentHashMap.Node.entries Lean.PersistentHashMap.mkEmptyEntriesArray }, thmsWithBadKeys := { root := Lean.PersistentArrayNode.node (Array.mkEmpty Lean.PersistentArray.branching.toNat), tail := Array.mkEmpty Lean.PersistentArray.branching.toNat, size := 0, shift := Lean.PersistentArray.initShift, tailOff := 0 } } }) : Lean.MetaM (Option Lean.MVarId × Lean.Meta.Simp.Stats)