Lean4
/-- Expands binders into nested combinators.
For example, the familiar exists is given by:
`expand_binders% (p => Exists p) x y : Nat, x < y`
which expands to the same expression as
`∃ x y : Nat, x < y`
-/
@[term_parser 1000]
public meta def «termExpand_binders%(_=>_)_,_» : Lean.ParserDescr✝ :=
ParserDescr.node✝ `Mathlib.Notation3.«termExpand_binders%(_=>_)_,_» 1022
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen
(ParserDescr.binary✝ `andthen (ParserDescr.symbol✝ "expand_binders% ") (ParserDescr.symbol✝ "("))
(ParserDescr.const✝ `ident))
(ParserDescr.symbol✝ " => "))
(ParserDescr.cat✝ `term 0))
(ParserDescr.symbol✝ ")"))
Batteries.ExtendedBinder.extBinders)
(ParserDescr.symbol✝ ", "))
(ParserDescr.cat✝ `term 0))