structure Lean.Meta.Grind.CasesEntry : Type

• declName : Name
• eager : Bool

def Lean.Meta.Grind.instInhabitedCasesEntry.default : CasesEntry

instance Lean.Meta.Grind.instInhabitedCasesEntry : Inhabited CasesEntry

@[reducible, inline]

abbrev Lean.Meta.Grind.CasesTypesArray : Type

A collection of CasesTypes.

def Lean.Meta.Grind.isBuiltinEagerCases (declName : Name) : Bool

Returns true if declName is the name of inductive type/predicate that even grind only case splits on. Remark: we added support for them to reduce the noise in the tactic generated by grind?

def Lean.Meta.Grind.CasesTypes.contains (s : CasesTypes) (declName : Name) : Bool

Returns true if s contains a declName.

def Lean.Meta.Grind.CasesTypes.erase (s : CasesTypes) (declName : Name) : CasesTypes

Removes the given declaration from s.

def Lean.Meta.Grind.CasesTypes.find? (s : CasesTypes) (declName : Name) : Option Bool

def Lean.Meta.Grind.CasesTypes.isEagerSplit (s : CasesTypes) (declName : Name) : Bool

def Lean.Meta.Grind.CasesTypes.isSplit (s : CasesTypes) (declName : Name) : Bool

def Lean.Meta.Grind.isCasesAttrCandidate? (declName : Name) (eager : Bool) : CoreM (Option Name)

def Lean.Meta.Grind.isCasesAttrCandidate (declName : Name) (eager : Bool) : CoreM Bool

def Lean.Meta.Grind.isCasesAttrPredicateCandidate? (declName : Name) (eager : Bool) : MetaM (Option InductiveVal)

def Lean.Meta.Grind.validateCasesAttr (declName : Name) (eager : Bool) : CoreM Unit

def Lean.Meta.Grind.CasesTypes.eraseDecl (s : CasesTypes) (declName : Name) : CoreM CasesTypes

def Lean.Meta.Grind.ensureNotBuiltinCases (declName : Name) : CoreM Unit

def Lean.Meta.Grind.cases (mvarId : MVarId) (e : Expr) : MetaM (List MVarId)

The grind tactic includes an auxiliary cases tactic that is not intended for direct use by users. This method implements it. This tactic is automatically applied when introducing local declarations with a type tagged with [grind_cases]. It is also used for "case-splitting" on terms during the search.

It differs from the user-facing Lean cases tactic in the following ways:

• It avoids unnecessary revert and intro operations.

• It does not introduce new local declarations for each minor premise. Instead, the grind tactic preprocessor is responsible for introducing them.

• If the major premise type is an indexed family, auxiliary declarations and (heterogeneous) equalities are introduced. However, these equalities are not resolved using unifyEqs. Instead, the grind tactic employs union-find and congruence closure to process these auxiliary equalities. This approach avoids applying substitution to propositions that have already been internalized by grind.