Documentation
Init
.
Data
.
List
.
Int
.
Sum
Search
return to top
source
Imports
Init.Omega
Init.Data.List.Basic
Init.Data.List.MinMax
Init.Data.Int.DivMod.Basic
Init.Data.Int.DivMod.Lemmas
Imported by
List
.
sum_replicate_int
List
.
sum_append_int
List
.
sum_reverse_int
List
.
min_mul_length_le_sum_int
List
.
mul_length_le_sum_of_min?_eq_some_int
List
.
min_le_sum_div_length_int
List
.
le_sum_div_length_of_min?_eq_some_int
List
.
sum_le_max_mul_length_int
List
.
sum_le_max_mul_length_of_max?_eq_some_int
List
.
sum_div_length_le_max_int
List
.
sum_div_length_le_max_of_max?_eq_some_int
source
@[simp]
theorem
List
.
sum_replicate_int
{
n
:
Nat
}
{
a
:
Int
}
:
(
replicate
n
a
)
.
sum
=
↑
n
*
a
source
theorem
List
.
sum_append_int
{
l₁
l₂
:
List
Int
}
:
(
l₁
++
l₂
).
sum
=
l₁
.
sum
+
l₂
.
sum
source
theorem
List
.
sum_reverse_int
(
xs
:
List
Int
)
:
xs
.
reverse
.
sum
=
xs
.
sum
source
theorem
List
.
min_mul_length_le_sum_int
{
xs
:
List
Int
}
(
h
:
xs
≠
[
]
)
:
xs
.
min
h
*
↑
xs
.
length
≤
xs
.
sum
source
theorem
List
.
mul_length_le_sum_of_min?_eq_some_int
{
x
:
Int
}
{
xs
:
List
Int
}
(
h
:
xs
.
min?
=
some
x
)
:
x
*
↑
xs
.
length
≤
xs
.
sum
source
theorem
List
.
min_le_sum_div_length_int
{
xs
:
List
Int
}
(
h
:
xs
≠
[
]
)
:
xs
.
min
h
≤
xs
.
sum
/
↑
xs
.
length
source
theorem
List
.
le_sum_div_length_of_min?_eq_some_int
{
x
:
Int
}
{
xs
:
List
Int
}
(
h
:
xs
.
min?
=
some
x
)
:
x
≤
xs
.
sum
/
↑
xs
.
length
source
theorem
List
.
sum_le_max_mul_length_int
{
xs
:
List
Int
}
(
h
:
xs
≠
[
]
)
:
xs
.
sum
≤
xs
.
max
h
*
↑
xs
.
length
source
theorem
List
.
sum_le_max_mul_length_of_max?_eq_some_int
{
x
:
Int
}
{
xs
:
List
Int
}
(
h
:
xs
.
max?
=
some
x
)
:
xs
.
sum
≤
x
*
↑
xs
.
length
source
theorem
List
.
sum_div_length_le_max_int
{
xs
:
List
Int
}
(
h
:
xs
≠
[
]
)
:
xs
.
sum
/
↑
xs
.
length
≤
xs
.
max
h
source
theorem
List
.
sum_div_length_le_max_of_max?_eq_some_int
{
x
:
Int
}
{
xs
:
List
Int
}
(
h
:
xs
.
max?
=
some
x
)
:
xs
.
sum
/
↑
xs
.
length
≤
x