def Lean.Meta.abstractProof {m : Type → Type} [Monad m] [MonadLiftT MetaM m] [MonadEnv m] [MonadOptions m] [MonadFinally m] (proof : Expr) (cache : Bool := true) (postprocessType : Expr → m Expr := pure) : m Expr

Abstracts the given proof into an auxiliary theorem, suitably pre-processing its type.

def Lean.Meta.AbstractNestedProofs.getLambdaBody (e : Expr) : Expr

def Lean.Meta.AbstractNestedProofs.isNonTrivialProof (e : Expr) : MetaM Bool

structure Lean.Meta.AbstractNestedProofs.Context : Type

• cache : Bool

@[reducible, inline]

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

partial def Lean.Meta.AbstractNestedProofs.visit (e : Expr) : M Expr

def Lean.Meta.abstractNestedProofs (e : Expr) (cache : Bool := true) : MetaM Expr

Replace proofs nested in e with new lemmas. The new lemmas are named using getDeclNGen.