inductive Lean.Meta.Match.Pattern : Type

• inaccessible (e : Expr) : Pattern
• var (fvarId : FVarId) : Pattern
• ctor (ctorName : Name) (us : List Level) (params : List Expr) (fields : List Pattern) : Pattern
• val (e : Expr) : Pattern
• arrayLit (type : Expr) (xs : List Pattern) : Pattern
• as (varId : FVarId) (p : Pattern) (hId : FVarId) : Pattern

@[implicit_reducible]

instance Lean.Meta.Match.instInhabitedPattern : Inhabited Pattern

def Lean.Meta.Match.instInhabitedPattern.default : Pattern

partial def Lean.Meta.Match.Pattern.toMessageData : Pattern → MessageData

def Lean.Meta.Match.Pattern.toExpr (p : Pattern) (annotate : Bool := false) : MetaM Expr

partial def Lean.Meta.Match.Pattern.applyFVarSubst (s : FVarSubst) : Pattern → Pattern

Apply the free variable substitution s to the given pattern

def Lean.Meta.Match.Pattern.replaceFVarId (fvarId : FVarId) (v : Expr) (p : Pattern) : Pattern

partial def Lean.Meta.Match.Pattern.hasExprMVar : Pattern → Bool

partial def Lean.Meta.Match.Pattern.collectFVars (p : Pattern) : StateRefT' IO.RealWorld CollectFVars.State MetaM Unit

partial def Lean.Meta.Match.instantiatePatternMVars : Pattern → MetaM Pattern

structure Lean.Meta.Match.AltLHS : Type

• ref : Syntax
• fvarDecls : List LocalDecl
• patterns : List Pattern

@[implicit_reducible]

instance Lean.Meta.Match.instInhabitedAltLHS : Inhabited AltLHS

def Lean.Meta.Match.instInhabitedAltLHS.default : AltLHS

def Lean.Meta.Match.AltLHS.collectFVars (altLHS : AltLHS) : StateRefT' IO.RealWorld CollectFVars.State MetaM Unit

def Lean.Meta.Match.instantiateAltLHSMVars (altLHS : AltLHS) : MetaM AltLHS

structure Lean.Meta.Match.Alt : Type

Match alternative

• ref : Syntax

  Syntax object for providing position information

• idx : Nat

  Original alternative index. Alternatives can be split, this index is the original position of the alternative that generated this one.

• rhs : Expr

  Right-hand-side of the alternative.

• fvarDecls : List LocalDecl

  Alternative pattern variables.

• patterns : List Pattern

  Alternative patterns.

• cnstrs : List (Expr × Expr)

  Pending constraints lhs ≋ rhs that need to be solved before the alternative is considered acceptable. We generate them when processing inaccessible patterns. Note that lhs and rhs often have different types. After we perform additional case analysis, their types become definitionally equal.

• notAltIdxs : Array Nat

  Indices of previous alternatives that this alternative expects a not-that-proofs. (When producing a splitter, and in the future also for source-level overlap hypotheses.)

@[implicit_reducible]

instance Lean.Meta.Match.instInhabitedAlt : Inhabited Alt

def Lean.Meta.Match.instInhabitedAlt.default : Alt

def Lean.Meta.Match.Alt.toMessageData (alt : Alt) : MetaM MessageData

def Lean.Meta.Match.Alt.applyFVarSubst (s : FVarSubst) (alt : Alt) : Alt

def Lean.Meta.Match.Alt.replaceFVarId (fvarId : FVarId) (v : Expr) (alt : Alt) : Alt

def Lean.Meta.Match.Alt.isLocalDecl (fvarId : FVarId) (alt : Alt) : Bool

Return true if fvarId is one of the alternative pattern variables

inductive Lean.Meta.Match.Example : Type

• var : FVarId → Example
• underscore : Example
• ctor : Name → List Example → Example
• val : Expr → Example
• arrayLit : List Example → Example

partial def Lean.Meta.Match.Example.replaceFVarId (fvarId : FVarId) (ex : Example) : Example → Example

partial def Lean.Meta.Match.Example.applyFVarSubst (s : FVarSubst) : Example → Example

partial def Lean.Meta.Match.Example.varsToUnderscore : Example → Example

partial def Lean.Meta.Match.Example.toMessageData : Example → MessageData

def Lean.Meta.Match.examplesToMessageData (cex : List Example) : MessageData

structure Lean.Meta.Match.Problem : Type

• mvarId : MVarId
• vars : List Expr
• alts : List Alt
• examples : List Example

def Lean.Meta.Match.instInhabitedProblem.default : Problem

@[implicit_reducible]

instance Lean.Meta.Match.instInhabitedProblem : Inhabited Problem

def Lean.Meta.Match.withGoalOf {α : Type} (p : Problem) (x : MetaM α) : MetaM α

def Lean.Meta.Match.Problem.toMessageData (p : Problem) : MetaM MessageData

@[reducible, inline]

abbrev Lean.Meta.Match.CounterExample : Type

def Lean.Meta.Match.counterExampleToMessageData (cex : CounterExample) : MessageData

def Lean.Meta.Match.counterExamplesToMessageData (cexs : List CounterExample) : MessageData

structure Lean.Meta.Match.MatcherResult : Type

• matcher : Expr
• counterExamples : List CounterExample
• unusedAltIdxs : List Nat
• addMatcher : MetaM Unit

partial def Lean.Meta.Match.toPattern (e : Expr) : MetaM Pattern

Convert a expression occurring as the argument of a match motive application back into a Pattern For example, we can use this method to convert x::y::xs at

...
(motive : List Nat → Sort u_1) (xs : List Nat) (h_1 : (x y : Nat) → (xs : List Nat) → motive (x :: y :: xs))
...

into a pattern object

Match congruence equational theorem names helper declarations and functions

def Lean.Meta.Match.congrEqnThmSuffixBase : String

def Lean.Meta.Match.congrEqnThmSuffixBasePrefix : String

def Lean.Meta.Match.congrEqn1ThmSuffix : String

def Lean.Meta.Match.isCongrEqnReservedNameSuffix (s : String) : Bool

Returns true if s is of the form congr_eq_<idx>