def Lean.MVarId.congrPre (mvarId : MVarId) : MetaM (Option MVarId)

Preprocessor before applying congruence theorem. Tries to close new goals using Eq.refl, HEq.refl, and assumption. It also tries to apply heq_of_eq.

def Lean.MVarId.congr? (mvarId : MVarId) : MetaM (Option (List MVarId))

Try to apply a simp congruence theorem.

def Lean.MVarId.hcongr? (mvarId : MVarId) : MetaM (Option (List MVarId))

Try to apply a hcongr congruence theorem, and then tries to close resulting goals using Eq.refl, HEq.refl, and assumption.

def Lean.MVarId.congrImplies? (mvarId : MVarId) : MetaM (Option (List MVarId))

Try to apply implies_congr.

def Lean.MVarId.congrCore (mvarId : MVarId) : MetaM (List MVarId)

Given a goal of the form ⊢ f as = f bs, ⊢ (p → q) = (p' → q'), or ⊢ HEq (f as) (f bs), try to apply congruence. It takes proof irrelevance into account, and the fact that Decidable p is a subsingleton.

def Lean.MVarId.congrN (mvarId : MVarId) (depth : Nat := 1000000) (closePre closePost : Bool := true) : MetaM (List MVarId)

Given a goal of the form ⊢ f as = f bs, ⊢ (p → q) = (p' → q'), or ⊢ HEq (f as) (f bs), try to apply congruence. It takes proof irrelevance into account, and the fact that Decidable p is a subsingleton.

• Applies congr recursively up to depth depth.
• If closePre := true, it will attempt to close new goals using Eq.refl, HEq.refl, and assumption with reducible transparency.
• If closePost := true, it will try again on goals on which congr failed to make progress with default transparency.

def Lean.MVarId.congrN.post (closePost : Bool := true) (mvarId : MVarId) : StateRefT' IO.RealWorld (Array MVarId) MetaM Unit

def Lean.MVarId.congrN.go (closePre closePost : Bool := true) (n : Nat) (mvarId : MVarId) : StateRefT' IO.RealWorld (Array MVarId) MetaM Unit