Documentation
PrimParser
.
Base
Search
return to top
source
Imports
Init
Mathlib.Data.Vector.Basic
Mathlib.Order.Fin.Basic
Imported by
NonEmptyList
NonEmptyList
.
mk
NonEmptyList
.
toList
«term_::₁_»
source
@[reducible, inline]
abbrev
NonEmptyList
(
α
:
Type
u_1)
:
Type
u_1
Equations
NonEmptyList
α
=
{
l
:
List
α
//
l
≠
[
]
}
Instances For
source
@[reducible, inline]
abbrev
NonEmptyList
.
mk
{
α
:
Type
}
(
x
:
α
)
(
xs
:
List
α
)
:
NonEmptyList
α
Equations
x
::₁
xs
=
⟨
x
::
xs
,
⋯
⟩
Instances For
source
@[reducible, inline]
abbrev
NonEmptyList
.
toList
{
α
:
Type
}
:
NonEmptyList
α
→
List
α
Equations
x✝
.
toList
=
↑
x✝
Instances For
source
def
«term_::₁_»
:
Lean.TrailingParserDescr
Equations
«term_::₁_»
=
Lean.ParserDescr.trailingNode
`«term_::₁_»
67
68
(
Lean.ParserDescr.binary
`andthen
(
Lean.ParserDescr.symbol
" ::₁ "
)
(
Lean.ParserDescr.cat
`term
67
)
)
Instances For