Documentation
Init
.
Data
.
List
.
Nat
.
Prod
Search
return to top
source
Imports
Init.BinderPredicates
Init.NotationExtra
Init.Data.List.Lemmas
Init.Data.Nat.Lemmas
Imported by
List
.
prod_eq_zero_iff_exists_zero_nat
List
.
prod_pos_iff_forall_pos_nat
List
.
prod_replicate_nat
List
.
prod_append_nat
List
.
prod_reverse_nat
List
.
prod_eq_foldl_nat
source
theorem
List
.
prod_eq_zero_iff_exists_zero_nat
{
l
:
List
Nat
}
:
l
.
prod
=
0
↔
∃
(
x
:
Nat
)
,
x
∈
l
∧
x
=
0
source
theorem
List
.
prod_pos_iff_forall_pos_nat
{
l
:
List
Nat
}
:
0
<
l
.
prod
↔
∀ (
x
:
Nat
),
x
∈
l
→
0
<
x
source
@[simp]
theorem
List
.
prod_replicate_nat
{
n
a
:
Nat
}
:
(
replicate
n
a
)
.
prod
=
a
^
n
source
theorem
List
.
prod_append_nat
{
l₁
l₂
:
List
Nat
}
:
(
l₁
++
l₂
).
prod
=
l₁
.
prod
*
l₂
.
prod
source
theorem
List
.
prod_reverse_nat
(
xs
:
List
Nat
)
:
xs
.
reverse
.
prod
=
xs
.
prod
source
theorem
List
.
prod_eq_foldl_nat
{
xs
:
List
Nat
}
:
xs
.
prod
=
foldl
(fun (
x1
x2
:
Nat
) =>
x1
*
x2
)
1
xs