Equations
- Lean.binductionOnSuffix = "binductionOn"
Instances For
Equations
- Lean.mkCasesOnName indDeclName = Lean.Name.mkStr indDeclName Lean.casesOnSuffix
Instances For
Equations
- Lean.mkRecOnName indDeclName = Lean.Name.mkStr indDeclName Lean.recOnSuffix
Instances For
Equations
- Lean.mkBRecOnName indDeclName = Lean.Name.mkStr indDeclName Lean.brecOnSuffix
Instances For
Equations
- Lean.mkBInductionOnName indDeclName = Lean.Name.mkStr indDeclName Lean.binductionOnSuffix
Instances For
Equations
- Lean.mkBelowName indDeclName = Lean.Name.mkStr indDeclName Lean.belowSuffix
Instances For
@[export lean_mark_aux_recursor]
Equations
- Lean.markAuxRecursor env declName = Lean.TagDeclarationExtension.tag Lean.auxRecExt env declName
Instances For
@[export lean_is_aux_recursor]
Equations
- Lean.isAuxRecursor env declName = (Lean.TagDeclarationExtension.isTagged Lean.auxRecExt env declName || declName == `Eq.ndrec || declName == `Eq.ndrecOn)
Instances For
def
Lean.isAuxRecursorWithSuffix
(env : Lean.Environment)
(declName : Lake.Name)
(suffix : Lake.Name)
:
Equations
- Lean.isAuxRecursorWithSuffix env declName suffix = match declName with | Lean.Name.str pre s => Lean.Name.mkSimple s == suffix && Lean.isAuxRecursor env declName | x => false
Instances For
Equations
- Lean.isCasesOnRecursor env declName = Lean.isAuxRecursorWithSuffix env declName (Lean.Name.mkSimple Lean.casesOnSuffix)
Instances For
Equations
- Lean.isRecOnRecursor env declName = Lean.isAuxRecursorWithSuffix env declName (Lean.Name.mkSimple Lean.recOnSuffix)
Instances For
Equations
- Lean.isBRecOnRecursor env declName = Lean.isAuxRecursorWithSuffix env declName (Lean.Name.mkSimple Lean.brecOnSuffix)
Instances For
@[export lean_mark_no_confusion]
Equations
Instances For
@[export lean_is_no_confusion]