`kernelreassocExpr`🔗

Definition

Reassociates the kernels in the type of pf using the registered handlers, using kernelReassocHandler as the default.

Returns the proof of the lemma along with a list of fresh level metavariables.

def

kernelreassocExpr (pf : Lean.Expr) :
  Lean.MetaM (Lean.Expr × Array Lean.LMVarId)
kernelreassocExpr (pf : Lean.Expr) :
  Lean.MetaM
    (Lean.Expr × Array Lean.LMVarId)

Code

def kernelreassocExpr (pf : Expr) : MetaM (Expr × Array LMVarId) := do
  forallTelescopeReducing (← inferType pf) fun xs _ => do
    let pf := mkAppN pf xs
    let handlers ← kernelreassocImplRef.get
    let (pf, levels) ← handlers.firstM (fun h => h pf) <|> do
      throwError "`kernel_reassoc` can only be used on terms about equality of s-finite kernels."
    return (← mkLambdaFVars xs pf, levels)

Actions: Source · Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

Dependency graph

Nothing to draw. Its statement rests on no other declaration in this project, and names nothing from a package left unaudited — so the graph is this declaration alone. That is the answer, not a missing picture.

Audit surface: 0 project declarations, 63 external constants

✓ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.

kernelreassocExpr🔗

`kernelreassocExpr`🔗