English
If l is a finite set (as a Finset), then the list of its elements, lists(l.val), is nodup.
Русский
Если l — конечный множитель, представленный как Finset, то список элементов l.val содержит без повторов.
LaTeX
$$$\\text{lists}(l.{\\rm val}).\\\\text{Nodup}$$$
Lean4
@[simp]
theorem lists_nodup_finset (l : Finset α) : (lists (l.val)).Nodup :=
by
have h_nodup : l.val.Nodup := l.nodup
rw [← Finset.coe_toList l, Multiset.coe_nodup] at h_nodup
rw [← Finset.coe_toList l]
exact nodup_permutations l.val.toList (h_nodup)