Theorems · Theorem · combinatorics
Multiset.fold_dedup_idem
∀ {α : Type u_1} (op : α → α → α) [hc : Std.Commutative op] [ha : Std.Associative op] [inst : DecidableEq α]
[hi : Std.IdempotentOp op] (s : Multiset α) (b : α), Multiset.fold op b s.dedup = Multiset.fold op b s- Defined in
- Mathlib.Data.Multiset.Fold
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Multiset.consproof · cited by 313
- Multiset.induction_onproof · cited by 109
- Multiset.eraseproof · cited by 93
- Multiset.dedupstatement and proof · cited by 59
- Multiset.foldstatement and proof · cited by 38
- Multiset.cons_eraseproof · cited by 25
- Multiset.fold_cons_leftproof · cited by 14
- Multiset.fold.congr_simpproof · cited by 9
- Multiset.dedup_cons_of_memproof · cited by 4
- Multiset.dedup_cons_of_notMemproof · cited by 4
Cited by4
Results whose statement or proof uses this declaration.
- Multiset.inf_dedupproof · cited by 3
- Multiset.sup_dedupproof · cited by 3
- List.foldr_sup_eq_sup_toFinsetproof · cited by 1
- List.foldr_inf_eq_inf_toFinsetproof · cited by 0