theorem
Finset.sum_ordered
{α : Type u_1}
{β : Type u_2}
[AddCommMonoid β]
(J : Finset α)
(m : α → β)
:
The n first elements in J.ordered
.
Equations
- J.finsetLT n = Finset.map J.ordered (Finset.filter (fun (j : Fin J.card) => j < n) Finset.univ)