inductive Lean.Meta.SplitKind : Type

• ite : SplitKind
• match : SplitKind
• both : SplitKind

def Lean.Meta.SplitKind.considerIte : SplitKind → Bool

def Lean.Meta.SplitKind.considerMatch : SplitKind → Bool

structure Lean.Meta.FindSplitImpl.Context : Type

• exceptionSet : ExprSet
• kind : SplitKind

@[reducible, inline]

unsafe abbrev Lean.Meta.FindSplitImpl.FindM (α : Type) : Type

@[inline]

unsafe def Lean.Meta.FindSplitImpl.checkVisited (e : Expr) : OptionT FindM Unit

unsafe def Lean.Meta.FindSplitImpl.visit (e : Expr) : OptionT FindM Expr

unsafe def Lean.Meta.FindSplitImpl.visit.visitApp? (e : Expr) : FindM (Option Expr)

def Lean.Meta.findSplit? (e : Expr) (kind : SplitKind := SplitKind.both) (exceptionSet : ExprSet := ∅) : MetaM (Option Expr)

Return an if-then-else or match-expr to split.

partial def Lean.Meta.findSplit?.go (kind : SplitKind := SplitKind.both) (exceptionSet : ExprSet := ∅) (e : Expr) : MetaM (Option Expr)

def Lean.Meta.findSplit?.find? (kind : SplitKind := SplitKind.both) (exceptionSet : ExprSet := ∅) (e : Expr) : MetaM (Option Expr)

def Lean.Meta.SplitIf.getSimpContext : MetaM Simp.Context

Default Simp.Context for simpIf methods. It contains all congruence theorems, but just the rewriting rules for reducing if expressions.

def Lean.Meta.SplitIf.mkDischarge? (useDecide : Bool := false) : MetaM Simp.Discharge

def Lean.Meta.SplitIf.splitIfAt? (mvarId : MVarId) (e : Expr) (hName? : Option Name) : MetaM (Option (ByCasesSubgoal × ByCasesSubgoal))

def Lean.Meta.simpIfTarget (mvarId : MVarId) (useDecide : Bool := false) : MetaM MVarId

def Lean.Meta.simpIfLocalDecl (mvarId : MVarId) (fvarId : FVarId) : MetaM MVarId

def Lean.Meta.splitIfTarget? (mvarId : MVarId) (hName? : Option Name := none) : MetaM (Option (ByCasesSubgoal × ByCasesSubgoal))

def Lean.Meta.splitIfLocalDecl? (mvarId : MVarId) (fvarId : FVarId) (hName? : Option Name := none) : MetaM (Option (MVarId × MVarId))