Documentation
Init
.
Data
.
Array
.
FinRange
Search
return to top
source
Imports
Init.Data.Array.OfFn
Init.Data.List.FinRange
Imported by
Array
.
finRange
Array
.
size_finRange
Array
.
getElem_finRange
Array
.
finRange_zero
Array
.
finRange_succ
Array
.
finRange_succ_last
Array
.
finRange_reverse
source
def
Array
.
finRange
(
n
:
Nat
)
:
Array
(
Fin
n
)
finRange
n
is the array of all elements of
Fin
n
in order.
Equations
Array.finRange
n
=
Array.ofFn
fun (
i
:
Fin
n
) =>
i
Instances For
source
@[simp]
theorem
Array
.
size_finRange
(
n
:
Nat
)
:
(
Array.finRange
n
)
.
size
=
n
source
@[simp]
theorem
Array
.
getElem_finRange
{
n
:
Nat
}
(
i
:
Nat
)
(
h
:
i
<
(
Array.finRange
n
)
.
size
)
:
(
Array.finRange
n
)
[
i
]
=
Fin.cast
⋯
⟨
i
,
h
⟩
source
@[simp]
theorem
Array
.
finRange_zero
:
Array.finRange
0
=
#[
]
source
theorem
Array
.
finRange_succ
(
n
:
Nat
)
:
Array.finRange
(
n
+
1
)
=
#[
0
]
++
map
Fin.succ
(
Array.finRange
n
)
source
theorem
Array
.
finRange_succ_last
(
n
:
Nat
)
:
Array.finRange
(
n
+
1
)
=
map
Fin.castSucc
(
Array.finRange
n
)
++
#[
Fin.last
n
]
source
theorem
Array
.
finRange_reverse
(
n
:
Nat
)
:
(
Array.finRange
n
)
.
reverse
=
map
Fin.rev
(
Array.finRange
n
)